c JPEG编码,但有错误

#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <linux/videodev2.h>  //v4l2 头文件
#include <string.h>
#include <sys/mman.h>
#include <linux/fb.h>
#include <math.h>
#define PI 3.1415926#define  pic_width   80
#define  pic_heigth  48#define filename  "/home/wjs/Pictures/sample.yuv"
#define file_out  "/home/wjs/Pictures/"           //输出文件目录static unsigned char o_bit[900000] = {};
static int to = 0;int  main(void) {//-------JPEG通用量化表--------------------------------unsigned char lhb0[0x45] = {0xff, 0xdb, 0, 0x43, 0,16, 11, 10, 16, 24, 40, 51, 61,12, 12, 14, 19, 26, 58, 60, 55,14, 13, 16, 24, 40, 57, 69, 56,14, 17, 22, 29, 51, 87, 80, 62,18, 22, 37, 56, 68, 109, 103, 77,24, 35, 55, 64, 81, 104, 113, 92,49, 64, 78, 87, 103, 121, 120, 101,72, 92, 95, 98, 112, 100, 103, 99};unsigned char lhb1[0x45] = {0xff, 0xdb, 0, 0x43, 1,17, 18, 24, 47, 99, 99, 99, 99,     //17,18,24,4718, 21, 26, 66, 99, 99, 99, 99,     //18,21,26,66,24, 26, 56, 99, 99, 99, 99, 99,      //24,26,5647, 66, 99, 99, 99, 99, 99, 99,      //47,66,99, 99, 99, 99, 99, 99, 99, 99,99, 99, 99, 99, 99, 99, 99, 99,99, 99, 99, 99, 99, 99, 99, 99,99, 99, 99, 99, 99, 99, 99, 99};//-------JPEG通用霍夫曼表------------------------------unsigned char hfm0[] = {0xff, 0xc4, 0, 0x1f, 0, 0, 1, 5, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0,1, 2, 3, 4, 5, 6, 7, 8, 9, 0xa, 0xb};unsigned char hfm1[] = { 255, 196, 0, 181, 16, 0, 2, 1, 3, 3, 2, 4, 3, 5, 5, 4, 4, 0, 0, 1, 125, 1, 2, 3, 0, 4, 17,5, 18, 33, 49, 65, 6, 19, 81, 97, 7, 34, 113, 20, 50, 129, 145, 161, 8, 35, 66, 177, 193, 21, 82, 209, 240,36, 51, 98, 114, 130, 9, 10, 22, 23, 24, 25, 26, 37, 38, 39, 40, 41, 42, 52, 53, 54, 55, 56, 57, 58, 67, 68, 69,70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101, 102, 103, 104, 105, 106, 115, 116, 117, 118,119, 120, 121, 122, 131, 132, 133, 134, 135, 136, 137, 138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162,163, 164, 165, 166, 167, 168, 169, 170, 178, 179, 180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198,199, 200, 201, 202, 210, 211, 212, 213, 214, 215, 216, 217, 218, 225, 226, 227, 228, 229, 230, 231, 232, 233,234, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250};unsigned char hfm2[] = { 255, 196, 0, 31, 1, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0,0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};unsigned char hfm3[] = {255, 196, 0, 181, 17, 0, 2, 1, 2, 4, 4, 3, 4, 7, 5, 4, 4, 0, 1, 2,119, 0, 1, 2, 3, 17, 4, 5, 33, 49, 6, 18, 65, 81, 7, 97, 113, 19, 34, 50, 129, 8, 20, 66, 145, 161, 177,193, 9, 35, 51, 82, 240, 21, 98, 114, 209, 10, 22, 36, 52, 225, 37, 241, 23, 24, 25, 26, 38, 39, 40, 41,42, 53, 54, 55, 56, 57, 58, 67, 68, 69, 70, 71, 72, 73, 74, 83, 84, 85, 86, 87, 88, 89, 90, 99, 100, 101,102, 103, 104, 105, 106, 115, 116, 117, 118, 119, 120, 121, 122, 130, 131, 132, 133, 134, 135, 136, 137,138, 146, 147, 148, 149, 150, 151, 152, 153, 154, 162, 163, 164, 165, 166, 167, 168, 169, 170, 178, 179,180, 181, 182, 183, 184, 185, 186, 194, 195, 196, 197, 198, 199, 200, 201, 202, 210, 211, 212, 213, 214,215, 216, 217, 218, 226, 227, 228, 229, 230, 231, 232, 233, 234, 242, 243, 244, 245, 246, 247, 248, 249,250};//------ali--------------------------------------int ali(int i, int out[2]) {      //out[1]=len  out[0]=intint o = -1;    //如果输出负数无意义char len = -1; //如果输出负数无意义if (i == 0) {len = 0;o = 0;}if (i == -1) {len = 1;o = 0;}if (i == 1) {len = 1;o = 1;}if ((i >= 2) && (i <= 32767)) {     //二进制位数0-16位for (int a = 0; a < 16; a++) {if ((i >= pow(2, a)) && (i < pow(2, (a + 1)))) {len = a + 1;o = i;}}}if ((i >= -32767) && (i <= -2)) {for (int a = 0; a < 16; a++) {if ((i <= -pow(2, a)) && (i > -pow(2, (a + 1)))) {len = a + 1;o = i + pow(2, (a + 1)) - 1;}}}out[1] = len;out[0] = o;return 0;}//-------------Y_DC--------------------------------int hfm_ydc(unsigned char  i, int out[2]) { //out[1]=len  out[0]=intif (i == 0) {out[1] = 2;out[0] = 0b00;}if (i == 1) {out[1] = 3;out[0] = 0b010;}if (i == 2) {out[1] = 3;out[0] = 0b011;}if (i == 3) {out[1] = 3;out[0] = 0b100;}if (i == 4) {out[1] = 3;out[0] = 0b101;}if (i == 5) {out[1] = 3;out[0] = 0b110;}if (i == 6) {out[1] = 4;out[0] = 0b1110;}if (i == 7) {out[1] = 5;out[0] = 0b11110;}if (i == 8) {out[1] = 6;out[0] = 0b111110;}if (i == 9) {out[1] = 7;out[0] = 0b1111110;}if (i == 10) {out[1] = 8;out[0] = 0b11111110;}if (i == 11) {out[1] = 9;out[0] = 0b111111110;}return 0;}//-------------UV_DC-----------------------------------int hfm_uvdc(unsigned char i, int out[2]) { //out[1]=len  out[0]=intif (i == 0) {out[1] = 2;out[0] = 0;}if (i == 1) {out[1] = 2;out[0] = 0b01;}if (i == 2) {out[1] = 2;out[0] = 0b10;}if (i == 3) {out[1] = 3;out[0] = 0b110;}if (i == 4) {out[1] = 4;out[0] = 0b1110;}if (i == 5) {out[1] = 5;out[0] = 0b11110;}if (i == 6) {out[1] = 6;out[0] = 0b111110;}if (i == 7) {out[1] = 7;out[0] = 0b1111110;}if (i == 8) {out[1] = 8;out[0] = 0b11111110;}if (i == 9) {out[1] = 9;out[0] = 0b111111110;}if (i == 10) {out[1] = 10;out[0] = 0b1111111110;}if (i == 11) {out[1] = 11;out[0] = 0b11111111110;}return 0;}//---------霍夫曼编码Y_AC-----------------------------------int hfm_yac(unsigned char i_0, unsigned char i_len, unsigned int out[2]) {//	unsigned char i_0=0xf;                      //out[1]=len  out[0]=int//	unsigned char i_len=0xa;unsigned int len;unsigned int o;unsigned char zj = i_0 * 16 + i_len; //合成一个字节unsigned char ws[16] = {};memcpy(ws, &hfm1[5], 16);unsigned char zh[162] = {};memcpy(zh, &hfm1[21], 162);int cx_ws, cx_b;unsigned char hfm[17][0x7d] = {};int t = 0;for (int a = 0; a < 16; a++) {     //把要编码的162个数按位数分为16个数组,二位一组....16位一组if (ws[a] == 0) {continue;}for (int b = 0; b < ws[a]; b++) {hfm[a + 1][b] = zh[t];t++;}}for (int a = 0; a < 16; a++) {       //查询输入数的位数和在所在组的顺序,组内顺序从0开始if (ws[a] == 0) {continue;}for (int b = 0; b < ws[a]; b++) {if (	hfm[a + 1][b] == zj) {cx_ws = a + 1;     //得到输入数二进制位数,根据此数到相依位数的数组查询cx_b = b;          //输入数在按位数分组的数组中所在的位置,从0开始break;}}}int o_js = 0;     //每一组的第一个数的值if (cx_ws == 2) {o_js = 0b00;}if (cx_ws == 3) {o_js = 0b100;}if (cx_ws == 4) {o_js = 0b1010;}if (cx_ws == 5) {o_js = 0b11010;}if (cx_ws == 6) {o_js = 0b111010;}if (cx_ws == 7) {o_js = 0b1111000;}if (cx_ws == 8) {o_js = 0b11111000;}if (cx_ws == 9) {o_js = 0b111110110;}if (cx_ws == 10) {o_js = 0b1111110110;}if (cx_ws == 11) {o_js = 0b11111110110;}if (cx_ws == 12) {o_js = 0b111111110100;}if (cx_ws == 15) {o_js = 0b111111111000000;}if (cx_ws == 16) {o_js = 0b1111111110000010;}len = cx_ws;o = o_js + cx_b;out[1] = len;out[0] = o;return 0;}//---------UV_AC---------------------------------int hfm_uvac(unsigned char i_0, unsigned char i_len, unsigned int out[2]) {//	unsigned char i_0=0xf;                         //out[1]=len  out[0]=int//	unsigned char i_len=0xa;unsigned int len;unsigned int o;unsigned char zj = i_0 * 16 + i_len; //合成一个字节unsigned char ws[16] = {};memcpy(ws, &hfm3[5], 16);unsigned  char zh[162] = {};memcpy(zh, &hfm3[21], 162);int cx_ws, cx_b;unsigned char hfm[17][0x7d] = {};int t = 0;for (int a = 0; a < 16; a++) {     //把要编码的162个数按位数分为16个数组,二位一组....16位一组if (ws[a] == 0) {continue;}for (int b = 0; b < ws[a]; b++) {hfm[a + 1][b] = zh[t];t++;}}for (int a = 0; a < 16; a++) {       //查询输入数的位数和在所在组的顺序,组内顺序从0开始if (ws[a] == 0) {continue;}for (int b = 0; b < ws[a]; b++) {if (	hfm[a + 1][b] == zj) {cx_ws = a + 1;     //得到输入数二进制位数,根据此数到相依位数的数组查询cx_b = b;          //输入数在按位数分组的数组中所在的位置,从0开始break;}}}int o_js = 0;     //每一组的第一个数的值if (cx_ws == 2) {o_js = 0b00;}if (cx_ws == 3) {o_js = 0b100;}if (cx_ws == 4) {o_js = 0b1010;}if (cx_ws == 5) {o_js = 0b11000;}if (cx_ws == 6) {o_js = 0b111000;}if (cx_ws == 7) {o_js = 0b1111000;}if (cx_ws == 8) {o_js = 0b11110110;}if (cx_ws == 9) {o_js = 0b111110100;}if (cx_ws == 10) {o_js = 0b1111110110;}if (cx_ws == 11) {o_js = 0b11111110110;}if (cx_ws == 12) {o_js = 0b111111110100;}if (cx_ws == 14) {o_js = 0b11111111100000;}if (cx_ws == 15) {o_js = 0b111111111000010;}if (cx_ws == 16) {o_js = 0b1111111110001000;}len = cx_ws;o = o_js + cx_b;out[1] = len;out[0] = o;return 0;}//-----------FDCT()函数------------------------------------int fdct( unsigned char i[8][8], int o[8][8] ) {  //i 为输入   o 为参数传入的输出转换后的数据double s;double au;double av;for (int u = 0; u < 8; u++) {for (int v = 0; v < 8; v++) {for (int y = 0; y < 8; y++) {for (int x = 0; x < 8; x++) {s = s + (1.0 / 4) * (i[y][x] - 128) * cos((2 * y + 1) * u * PI / 16) * cos((2 * x + 1) * v * PI / 16);}}if (u == 0) {au = 1.0 / sqrt(2);} else {au = 1.0;}if (v == 0) {av = 1.0 / sqrt(2);} else {av = 1.0;}s = s * au * av;   //-30.1856int s1 = round(s * 100); //-3019s = s1 / 100.0;    //-30.19o[u][v] = s;       //double 转为char 类型s = 0;}}return 0;}
//-----------规范RLC格式---------------------int zl(int len, int (*i)[2], int (*o)[2]) {int t = 0;                      //如果中间有一次超过15个0,o的下标要加一,因为增加了(15,0)for (int a = 0; a < len; a++) {if ((a < len) && (i[a][1] >= 16) && (i[a][0] != 0)) {o[a + t][0] = 0;o[a + t][1] = 15;o[a + 1 + t][0] = i[a][0];o[a + 1 + t][1] = i[a][1] - 15;t++;}if ((a < len) && (i[a][1] < 16)) {memcpy(&(o[a + t][0]), &(i[a][0]), 8); //一行为单位复制}if ((a == len) && (i[a][0] == 0)) {o[a + t][0] = 0;o[a + t][1] = 0;break;}}return len + t;}//-----------去0-----------------------------int q0(int i[64], int (*o)[2]) {int t = 0;         //输出数组序号int z = 0;         //计算连续的0o[0][1] = 0;o[0][0] = i[0];t = 1;for (int a = 1; a < 64; a++) {                               //  aif ((i[a] == 0) && (i[a + 1] == 0) && ((a + 1) < 63)) { //000001z++;}                                                        // aif ((i[a] == 0) && (i[a + 1] == 0) && ((a + 1) == 63)) { //0000结束z++;             //本次的0o[t][0] = 0;o[t][1] = z + 1; //加a+1的0break;           //判断完成}                                               //  aif ((i[a] == 0) && (i[a + 1] != 0)) {           //000100z++;                  //加上本次的一个0o[t][0] = i[a + 1];o[t][1] = z;z = 0;           //清0,计算下次的连续0t++;a = a + 1;}if ((i[a] != 0) && (a == 0)) { //第一个数非0o[t][0] = i[a];o[t][1] = 0;t++;}if ((a > 0) && (i[a] != 0) && (i[a - 1] != 0)) { //防止第3种重复读取,这种是读取连续的非0o[t][0] = i[a];o[t][1] = 0;t++;}}return t + 1;}//--------Z 排序--------------------------------int zz(int (*i)[8], int o[64]) {int zb[64] = {0, 1, 8, 16, 9, 2, 3, 10, 17, 24, 32, 25, 18, 11, 4, 5, 12, 19, 26, 33, 40, 48, 41, 34, 27, 20, 13, 6,7, 14, 21, 28, 35, 42, 49, 56, 57, 50, 43, 36, 29, 22, 15, 23, 30, 37, 44, 51, 58, 59, 52, 45, 38, 31, 39, 46, 53, 60, 61, 54, 47,55, 62, 63};int *p = (int *)i;for (int a = 0; a < 64; a++) {o[a] = p[zb[a]];}return 0;}
// -----量化函数---------------int lh(int (*i)[8], unsigned char (*lhb)[8], int (*o)[8]) {             //?for (int a = 0; a < 8; a++) {for (int b = 0; b < 8; b++) {o[a][b] = round((i[a][b]) / (lhb[a][b]));}}return 0;}//---------编码start-------------------------------------//---------读量化表-------------------------------char lh00[64] = {};                 //提取量化表char lh10[64] = {};memcpy(lh00, &lhb0[5], 64); //使用自定义量化表memcpy(lh10, &lhb1[5], 64);//-----------读yuv ----------------------------------------------------------------FILE *f = fopen(filename, "rb");  //如用mmap 必须以读写方式打开文件if (f == NULL) {puts("filename error");exit(-1);}fseek(f, 0, SEEK_END);int len_file = ftell(f);fseek(f, 0, SEEK_SET);int fd = fileno(f);unsigned char *mp = mmap(NULL, len_file, PROT_READ, MAP_SHARED, fd, 0); //必须要读,写//480-32unsigned char yfl[pic_heigth * pic_width] = {};unsigned char ufl[pic_heigth * pic_width ] = {};unsigned char  vfl[pic_heigth * pic_width ] = {};for (int a = 0; a < pic_heigth * pic_width; a++) {yfl[a] = mp[a];}for (int a = 0; a < pic_heigth * pic_width / 4; a++) {ufl[a] = mp[a + pic_heigth * pic_width];}for (int a = 0; a < pic_heigth * pic_width / 4; a++) {vfl[a] = mp[a + pic_heigth * pic_width * 5 / 4];}//-------Y 分割8×8----------------------------int yp = 0;              //输出数组序号unsigned char y64[pic_width * pic_heigth / 64][64] = {};   //输出数组for (int y = 0; y < pic_heigth; y = y + 8) { //提取左上角点的垂直数据for (int x = 0; x < pic_width; x = x + 8) { //提取左上角点的水平数据int n = 0;           //每一个数组下标取值 0-15for (int a = 0; a < 8; a++) {for (int b = 0; b < 8; b++) {y64[yp][n] = yfl[pic_width * (a + y) + (b + x)];n++;}}yp++;}}//-------U分割8×8----------------------------int up = 0;              //输出数组序号unsigned char u64[pic_width * pic_heigth /256][64] = {}; //输出数组for (int y = 0; y < pic_heigth/2; y = y + 8) { //提取左上角点的垂直数据for (int x = 0; x < pic_width/2; x = x + 8) { //提取左上角点的水平数据int n = 0;           //每一个数组下标取值 0-15for (int a = 0; a < 8; a=a+1) {for (int b = 0; b < 8; b=b+1) {u64[up][n] = ufl[(pic_width/2) * (a + y) + (b + x)];n++;}}up++;}}//-------V分割8×8----------------------------int vp = 0;              //输出数组序号unsigned char v64[pic_width * pic_heigth /256][64] = {}; //输出数组for (int y = 0; y < pic_heigth/2 ; y = y + 8) { //提取左上角点的垂直数据for (int x = 0; x < pic_width/2 ; x = x + 8) { //提取左上角点的水平数据int n = 0;           //每一个数组下标取值 0-15for (int a = 0; a < 8; a=a+1) {for (int b = 0; b < 8; b=b+1) {v64[vp][n] = vfl[(pic_width/2) * (a + y) + (b + x)];n++;}}vp++;}}//------Y处理函数---------------------------------int yy(int ysc, unsigned char lh0[8][8],unsigned char y[8][8]) {int y_fdct[8][8] = {};fdct(y, y_fdct);int y_lh[8][8] = {};lh(y_fdct, lh0, y_lh);int y_z[64] = {};zz(y_lh, y_z);int y_0[64][2] = {};int len_y_0 = q0(y_z, y_0);int y_zl[64][2] = {};int len_y_zl = zl(len_y_0, y_0, y_zl);//--------Y-DC----------------------------------int ydc[2] = {};       //ydc[1]=len  ydc[0]=intint q = y_zl[0][0] - ysc; //DC 差值ali(q, ydc);           //处理Y_DCint ydc_hfm[2] = {};   //ydc_hfm[1]=lenhfm_ydc(ydc[1], ydc_hfm);int ls = (ydc_hfm[0] << ydc[1]) | ydc[0]; //组合成一intfor (int a = (ydc[1] + ydc_hfm[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}//-------Y-AC-------------------------------for (int a = 1; a < len_y_zl; a++) {int yac[2] = {};ali(y_zl[a][0], yac);              //取AC 值unsigned int yac_h[2] = {};hfm_yac(y_zl[a][1], yac[1], yac_h); //0的个数+系数位数int ls = (yac_h[0] << yac[1]) | yac[0];for (int a = (yac[1] + yac_h[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}}return y_zl[0][0];                     //返回本次的Y_DC值}unsigned char (*lh0)[8] = (unsigned char (*)[8])lh00;unsigned char (*lh1)[8] = (unsigned char (*)[8])lh10;    //UV 量化表转成8×8//------UV处理函数---------------------------------int uu(int usc, unsigned char lh1[8][8],unsigned char u[8][8]) {int u_fdct[8][8] = {};fdct(u, u_fdct);int u_lh[8][8] = {};lh(u_fdct, lh1, u_lh);int u_z[64] = {};zz(u_lh, u_z);int u_0[64][2] = {};int len_u_0 = q0(u_z, u_0);int u_zl[64][2] = {};int len_u_zl = zl(len_u_0, u_0, u_zl);//--------UV-DC----------------------------------int udc[2] = {};       //ydc[1]=len  ydc[0]=intint q = u_zl[0][0] - usc; //DC 差值ali(q, udc);           //处理Y_DCint udc_hfm[2] = {};   //ydc_hfm[1]=lenhfm_uvdc(udc[1], udc_hfm);int ls = (udc_hfm[0] << udc[1]) | udc[0]; //组合成一intfor (int a = (udc[1] + udc_hfm[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}//-------UV-AC-------------------------------for (int a = 1; a < len_u_zl; a++) {int uac[2] = {};ali(u_zl[a][0], uac);              //取AC 值unsigned int uac_h[2] = {};hfm_uvac(u_zl[a][1], uac[1], uac_h); //0的个数+系数位数int ls = (uac_h[0] << uac[1]) | uac[0];for (int a = (uac[1] + uac_h[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}}return u_zl[0][0];                     //返回本次的Y_DC值}int vv(int vsc, unsigned char lh1[8][8],unsigned char v[8][8]) {int v_fdct[8][8] = {};fdct(v, v_fdct);int v_lh[8][8] = {};lh(v_fdct, lh1, v_lh);int v_z[64] = {};zz(v_lh, v_z);int v_0[64][2] = {};int len_v_0 = q0(v_z, v_0);int v_zl[64][2] = {};int len_v_zl = zl(len_v_0, v_0, v_zl);//--------UV-DC----------------------------------int vdc[2] = {};       //ydc[1]=len  ydc[0]=intint q = v_zl[0][0] - vsc; //DC 差值ali(q, vdc);           //处理Y_DCint vdc_hfm[2] = {};   //ydc_hfm[1]=lenhfm_uvdc(vdc[1], vdc_hfm);int ls = (vdc_hfm[0] << vdc[1]) | vdc[0]; //组合成一intfor (int a = (vdc[1] + vdc_hfm[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}//-------UV-AC-------------------------------for (int a = 1; a < len_v_zl; a++) {int vac[2] = {};ali(v_zl[a][0], vac);              //取AC 值unsigned int vac_h[2] = {};hfm_uvac(v_zl[a][1], vac[1], vac_h); //0的个数+系数位数int ls = (vac_h[0] << vac[1]) | vac[0];for (int a = (vac[1] + vac_h[1]); a > 0; a--) {o_bit[to] = (ls & (int)pow(2, (a - 1))) >> (a - 1); //取ls 每一位数to++;}}return v_zl[0][0];                     //返回本次的Y_DC值}
//----------------------------------------------------------------int udiff = 0;int vdiff = 0;int ydiff = 0;for (int a = 0; a < pic_width * pic_heigth /256; a++) {for(int b=0;b<4;b++){unsigned char y1[8][8] = {};memcpy(y1, &(y64[a*4+b][0]), 64);ydiff = yy(ydiff,lh0, y1);}unsigned char u1[8][8] = {};memcpy(u1, &(u64[a][0]), 64);	udiff = uu(udiff,lh1, u1);unsigned char v1[8][8] = {};memcpy(v1, &(v64[a][0]), 64);vdiff = vv(vdiff,lh1, v1);}//-------生成jpeg文件-----------------------------unsigned char h1 = pic_heigth / 256;unsigned char h2 = pic_heigth % 256;unsigned char l1 = pic_width / 256;unsigned char l2 = pic_width % 256;unsigned char zhen[] = {255, 192, 0, 17, 8, h1, h2, l1, l2, 3, 1, 0x22, 0, 2, 0x11, 1, 3, 0x11, 1 }; //帧头unsigned char sos[] = {255, 218, 0, 12, 3, 1, 0, 2, 17, 3, 17, 0, 63, 0 };   //比特流开始unsigned char jp[900000] = {};jp[0] = 0xff;                    //jpeg开始jp[1] = 0xd8;int k = 2;memcpy(&jp[k], lhb0, (2 + 0x43));   //量化表k = k + 2 + 0x43;memcpy(&jp[k], lhb1, (2 + 0x43));k = k + 2 + 0x43;memcpy(&jp[k], zhen, (2 + 0x11));   //帧全局k = k + 2 + 0x11;memcpy(&jp[k], hfm0, (2 + 0x1f));   //霍夫曼表k = k + 2 + 0x1f;memcpy(&jp[k], hfm1, (2 + 0xb5));k = k + 2 + 0xb5;memcpy(&jp[k], hfm2, (2 + 0x1f));k = k + 2 + 0x1f;memcpy(&jp[k], hfm3, (2 + 0xb5));k = k + 2 + 0xb5;memcpy(&jp[k], sos, (2 + 0xc));      //比特流开始k = k + 2 + 0xc;for (int a = 0; a < 8 - (to % 8); a++) {o_bit[to + a] = 1;        //比特流凑成8的倍数,不够补1}to = to + 8 - to % 8;for (int a = 0; a < to; a = a + 8) { //比特流转成字节unsigned char zz = o_bit[a] * 128 + o_bit[a + 1] * 64 + o_bit[a + 2] * 32 + o_bit[a + 3] * 16 + o_bit[a + 4] * 8 + o_bit[a + 5] * 4 + o_bit[a + 6] * 2 + o_bit[a + 7];if (zz == 0xff) {jp[k] = zz;jp[k = k + 1] = 0;      //0xff 后面跟0} else {jp[k] = zz;}k = k + 1;}jp[k = k + 1] = 0xff;          //jpeg 结束jp[k = k + 1] = 0xd9;chdir(file_out);FILE *fz = fopen("zz.jpeg", "w+b");fwrite(jp, k, 1, fz);fclose(fz);puts("over");
//---------------------------------------------------return 0;
}

生成的图片始终有错位,已排除了8×8分割等,感觉在Z排序之前都没问题。始终找不到原因。现在的办法是再完成jpeg的解码,对比数据看能发现问题不。下图是错位的显示,原始yuv图片是显示纯红色条,编码生成的jpeg是下图这样,换了几个看图软件都是一样的,问题出在生成的jpeg文件。看错误的图片已生成成了红条,但又多出了一个白条和一个黑条,不知道是哪个环节出错了。

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/609610.shtml

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

MySQL之数据的导入、导出远程备份

目录 一. navicat的导入、导出 1.1 导入 1.2 导出 二. mysqldump命令导入、导出 2.1 导出 2.2 导入 三. LOAD DATA INFILE 命令导入、导出 3.1 设置 3.2 导出 3.3 导入 3.4 查看secure_file_priv设置 四. 远程备份 4.1 导出 4.2 导入 五. 思维导图 一. navicat的导入、导…

podman configure insecure certificate registry【podman 设置非安全镜像仓库】

预备条件 docker registry仓库私搭并配置证书centos 7.9 部署 harbor 镜像仓库实践harbor 部署入门指南Podman 部署私有镜像仓库 设置 $ vim /etc/hosts 192.168.23.47 registry.ghostwritten.com$ vim /etc/containers/registries.conf ... [[registry]] location "r…

7.2 1D PARALLEL CONVOLUTION—A BASIC ALGORITHM

正如我们在第7.1节中提到的&#xff0c;所有输出&#xff08;P&#xff09;元素的计算可以在卷积中并行完成。这使得卷积成为并行计算的理想问题。根据我们在矩阵-矩阵乘法方面的经验&#xff0c;我们可以快速编写一个简单的并行卷积内核。为了简单起见&#xff0c;我们将从1D卷…

【liunx】线程池+单例模式+STL,智能指针和线程安全+其他常见的各种锁+读者写者问题

线程池单例模式STL,智能指针和线程安全其他常见的各种锁读者写者问题 1.线程池2.线程安全的单例模式3.STL,智能指针和线程安全4.其他常见的各种锁4.读者写者问题 喜欢的点赞&#xff0c;收藏&#xff0c;关注一下把&#xff01; 1.线程池 目前我们学了挂起等待锁、条件变量、信…

【排序算法】一、排序概念和直接插入排序(C/C++)

「前言」文章内容是排序算法之直接插入排序的讲解。&#xff08;所有文章已经分类好&#xff0c;放心食用&#xff09; 「归属专栏」排序算法 「主页链接」个人主页 「笔者」枫叶先生(fy) 目录 一、排序概念的介绍二、直接插入排序2.1 原理2.2 代码实现&#xff08;C/C&#xf…

Linux的网络设置

一.查看网络配置 1.查看网络接口信息 - ifconfig ① 直接使用 ifconfig 命令 默认显示活动的网卡 解析&#xff1a; ② ifconfig 具体网卡名称 只显示具体的网卡的信息 ③ ifconfig -a 显示所有的网卡 ④ ifconfig 网卡名称 down 关闭网卡 ifdown 关闭网卡 …

2024年01月微软更新Bug 已解决 !Explorer.EXE 提示:Windows无法访问指定设备、路径或文件。你可能没有适当的权限访问该项目。

前倾概要 近期大量出现如上图问题&#xff0c;杀毒&#xff0c;系统急救箱都没反应&#xff0c;罪魁祸首就是微软更新&#xff01; 点击什么都是&#xff1a;Windows无法访问指定设备、路径或文件。你可能没有适当的权限访问该项目。 但软件使用正常&#xff0c;还能通过建立…

【产品应用】一体化伺服电机在管道检测机器人中的应用

一体化伺服电机在管道检测机器人的应用正日益受到关注。管道检测机器人是一种能够在管道内部进行检测和维护的智能化设备&#xff0c;它可以检测管道的内部结构、泄漏、腐蚀等问题&#xff0c;以确保管道的安全和稳定运行。而一体化伺服电机作为机器人的动力源&#xff0c;对于…

20230403读书笔记|《苏轼词集》——试问岭南应不好,此心安处是吾乡

20230403读书笔记|《苏轼词集》——试问岭南应不好&#xff0c;此心安处是吾乡 导读卷一卷二卷三 在书架里加了好几本苏轼词集&#xff0c;很多词是重复的&#xff0c;但这并不影响多读几本&#xff0c;苏轼的词豪迈大气&#xff0c;豁达爽朗&#xff0c;蛮值得一读的。有不少都…

中小型家具制造业使用制造管理MES系统应该注意什么?

随着人们生活水平变高&#xff0c;人们对家具的要求也在提高。为了应对越来越高的要求&#xff0c;企业开始寻找更有效的方法&#xff0c;其中就包括mes系统&#xff0c;那么中小型家具企业在使用mes的过程中应该注意什么呢&#xff1f; 第一&#xff0c;要考虑选择什么样的mes…

【数据结构】二叉树的链式实现

树是数据结构中非常重要的一种&#xff0c;在计算机的各方个面都有他的身影 此篇文章主要介绍二叉树的基本操作 目录 二叉树的定义&#xff1a;二叉树的创建&#xff1a;二叉树的遍历&#xff1a;前序遍历&#xff1a;中序遍历&#xff1a;后序遍历&#xff1a;层序遍历&#…

Mendeley Word 文献引用

这里写目录标题 1. 下载Mendeley 并插入到Word1.1 下载安装1.2 在Word 中添加Mendeley 插件文献引用相关 1. 下载Mendeley 并插入到Word 1.1 下载安装 Mendeley 官网下载 1.2 在Word 中添加Mendeley 插件 打开 Mendeley&#xff0c;点击 Tools —>Install Mendeley Cite…

AWS云用户创建

问题 需要给工友创建AWS云的用户&#xff0c;这里假设使用分配给自己AWS开发者IAM账号&#xff0c;给别人创建aws IAM账号。 登录系统 打开页面&#xff1a;https://xxx.signin.aws.amazon.com/console&#xff0c;使用分配的开发者账号登录。如下图&#xff1a; 创建用户…

vue组件开发

1. 组件开发介绍 ① 组件化&#xff1a;一个页面可以拆分成一个个组件&#xff0c;每个组件有着自己独立的结构、样式、行为。 好处&#xff1a;便于维护&#xff0c;利于复用 → 提升开发效率。 组件分类&#xff1a;普通组件、根组件。② 根组件&#xff08;App.vue&#xf…

探索Redis特殊数据结构:HyperLogLog在基数统计中的应用

一、概述 Redis官方提供了多种数据类型&#xff0c;除了常见的String、Hash、List、Set、zSet之外&#xff0c;还包括Stream、Geospatial、Bitmaps、Bitfields、Probabilistic&#xff08;HyperLogLog、Bloom filter、Cuckoo filter、t-digest、Top-K、Count-min sketch、Confi…

Mariadb和mysql数据库的区别和相同之处

目 录 一、maridb 和mysql在linux系统中广泛应用 二、MySQL数据库 三、MariaDB数据库 四、MariaDB和MySQL有哪些相同点 五、MariaDB和MySQL的不同点 一、mariadb 和mysql在linux系统中广泛应用 用linux&#xff08;包括centos和Ubuntu&#xff09;的都知道&a…

使用Trie数据结构实现搜索自动完成功能

本文旨在讨论使用 Java 的搜索自动完成的低级实现&#xff0c;将Trie在用例中使用数据结构。 这是一个示例TrieNode类&#xff1a; class TrieNode{ Map<Character,TrieNode> children; boolean isEndOfWord; TrieNode(){ children new HashMap<>(); isEndOfWor…

Unity 利用UGUI之Scrollbar制作进度条

在Unity中除了用Slider、Image做进度条&#xff0c;其实用Scrollbar也可以做进度条。 首先&#xff0c;在场景中新建一个Scrollbar组件和一个Text组件&#xff1a; 其次&#xff0c;创建模拟进度的一个脚本&#xff0c;Scrollbar_Progressbar.cs: using System.Collections; …

Linux:linux计算机和windows计算机 之间 共享资源

在前面章节已经介绍过&#xff0c;NFS用于Linux系统之间的文件共享&#xff0c;windows 并不知道 NFS &#xff0c;而是使用 CIFS (Common Internet File System) 的协议机制 来 “共享” 文件。在1991年&#xff0c;Andrew Tridgell 通过逆向工程 实现了 CIFS 协议&#xff0c…

中兴通讯5G-A场景突破成果显著,获得行业高度认可

近年来&#xff0c;中兴通讯持续发力5G-A场景&#xff0c;积极进行相关技术研发&#xff0c;为6G时代的到来铺路。2023年12月28日&#xff0c;在2024&#xff08;第二十届&#xff09;ICT行业趋势年会“ICT龙虎榜揭榜盛典”当中&#xff0c;中兴通讯获得“2023年度5G-A场景开拓…