利用c 原生头文件完成JPEG全流程编码

骄傲一下，经过一个多月的努力，终于完成jpeg的全套编码。经验证此程序可以把摄像头yuv信号转为JPG图片。现在的程序还不完美，只能对长和宽尺寸是16倍数的信号转码。而且转码速度太慢，一帧1280×720的图片要2秒多。此程序只能对yuv420p编码。

此程序有很多重复的代码，主要是为了清晰好查错，如三分量的提取，处理等阶段可以用一个函数形式来完成，减少代码量。

说实话此程序没有实用价值，因为压缩时间太长，不可能用于摄像头的信号转换，查网络说是浮点运算太多，要用数学的方法把浮点运算转为乘法和加法的运算，所以不想再折腾了，转而去学ffmpeg。想借用它的库函数完成摄像头的信号压缩转码。目标是搞一个高速摄像头。

写了这么多博文主要是为了留存，以后想再搞又可以用上。还有把学习的思路也备份一下。

9cfc435483224fc08c19dfa9a05ca322.jpeg

下面是全套程序：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>   //如果直接读文件到数组，也可不用此头文件
#include <math.h>
#define PI 3.1415926#define  pic_width   656
#define  pic_heigth  480#define filename  "/home/wjs/Pictures/sample.yuv"
#define file_out  "/home/wjs/Pictures/wz.jpg"           //输出文件目录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  //           1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,};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//      1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,};//-------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); //必须要读，写//---------------------------------------------------------------------------------unsigned char yfl[pic_heigth * pic_width] = {};unsigned char ufl[pic_heigth * pic_width / 4 ] = {};unsigned char  vfl[pic_heigth * pic_width / 4 ] = {};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-63for (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-63for (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;//---------Y 排序----------------------------------   //第一个MCU y01 y02 y10 y11 u01 v01int yw[pic_heigth*pic_width/64]={};int wn=0;for(int y=0;y<pic_heigth/8;y=y+2){for(int x=0;x<pic_width/8;x=x+2){for(int b=0;b<2;b++){for(int a=0;a<2;a++){yw[wn]=(y+b)*pic_width/8+x+a;wn++;}}}}//---------MCU---------------------------------for (int a = 0; a < pic_width * pic_heigth / 256; a++) {    //MCU=4Y+1U+1Vfor (int b = 0; b < 4; b++) {unsigned char y1[8][8] = {};memcpy(y1, &(y64[yw[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;FILE *fz = fopen(file_out, "w+b");fwrite(jp, k, 1, fz);fclose(fz);puts("编码over");return 0;
}

 

 

 

 

 

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

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

相关文章

SQL进阶3

SQL进阶3

二、多表连结 1、什么叫联结 下面&#xff0c;我们举个例子来说明&#xff1a; 学校的安排的课程信息&#xff0c;我们平时都会为主要人员负责的对应课程信息创建表格&#xff0c;让其更好地检索得到对应数据信息。学生可以查到自己本身的课程信息&#xff0c;而老师也可以查…
阅读更多...
Vue-19、Vue监测数据的原理_对象

Vue-19、Vue监测数据的原理_对象

1、数据代理 <!DOCTYPE html> <html lang"en"> <head><meta charset"UTF-8"><title>vue监测数据改变的的原理</title><script type"text/javascript" src"https://cdn.jsdelivr.net/npm/vue2/dist…
阅读更多...
Spark---累加器和广播变量

Spark---累加器和广播变量

文章目录 1.累加器实现原理2.自定义累加器3.广播变量 1.累加器实现原理 累加器用来把 Executor 端变量信息聚合到 Driver 端。在 Driver 程序中定义的变量&#xff0c;在Executor 端的每个 Task 都会得到这个变量的一份新的副本&#xff0c;每个 task 更新这些副本的值后&…
阅读更多...
浅谈敏捷开发的思维

浅谈敏捷开发的思维

什么是敏捷 Agile&#xff08;敏捷&#xff09;来源于敏捷宣言&#xff0c;宣言明确指出&#xff0c;“敏捷”&#xff1a; 不是一种方法论也不是开发软件的具体方法更不是一个框架或者过程 “敏捷”是一套价值观&#xff08;理念&#xff09;和原则&#xff0c;帮助团队在软…
阅读更多...
PPO 跑CartPole-v1

PPO 跑CartPole-v1

gym-0.26.2 cartPole-v1 参考动手学强化学习书中的代码,并做了一些修改 代码 import gym import torch import torch.nn as nn import torch.nn.functional as F import numpy as np import matplotlib.pyplot as plt from tqdm import tqdmclass PolicyNet(nn.Module):def __…
阅读更多...
HTML--JavaScript--语法基础

HTML--JavaScript--语法基础

变量与常量 这个基本上没啥问题 变量命名规则&#xff1a; 变量由字母、数字、下划线、$组成&#xff0c;且变量第一个字符不能为数字 变量不能是系统关键字和保留字 语法&#xff1a; var 变量名 值&#xff1b;所有Javacript变量都由var声明 定义赋值字符串&#xff1a; …
阅读更多...
GaussDB(DWS)查询优化技术大揭秘

GaussDB(DWS)查询优化技术大揭秘

GaussDB(DWS)查询优化技术大揭秘 大数据时代&#xff0c;数据量呈爆发式增长&#xff0c;经常面临百亿、千亿数据查询场景&#xff0c;当数据仓库数据量较大、SQL语句执行效率低时&#xff0c;数据仓库性能会受到影响。本文将深入讲解在GaussDB(DWS)中如何进行表结构设计&#…
阅读更多...
【Web】websocket应用的是哪个协议

【Web】websocket应用的是哪个协议

&#x1f34e;个人博客&#xff1a;个人主页 &#x1f3c6;个人专栏&#xff1a;Web ⛳️ 功不唐捐&#xff0c;玉汝于成 前言 在当今互联网时代&#xff0c;实时性和即时通讯成为网络应用日益重要的一部分。WebSocket 协议作为一种创新性的通信协议&#xff0c;极大地改善了…
阅读更多...
C语言——编译和链接

C语言——编译和链接

&#xff08;图片由AI生成&#xff09; 0.前言 C语言是最受欢迎的编程语言之一&#xff0c;以其接近硬件的能力和高效性而闻名。理解C语言的编译和链接过程对于深入了解其运行原理至关重要。本文将详细介绍C语言的翻译环境和运行环境&#xff0c;重点关注编译和链接的各个阶段…
阅读更多...
Architecture Lab：预备知识2【汇编call/leave/ret指令、CS:APP练习4.4】

Architecture Lab：预备知识2【汇编call/leave/ret指令、CS:APP练习4.4】

chap4的练习4.4&#xff08;page.255&#xff09;让用Y86-64实现rsum&#xff08;递归求数组元素之和&#xff09;&#xff0c;提示为&#xff1a;先得到x86-64汇编代码&#xff0c;然后转换成Y86-64的 这是rsum的c实现&#xff1a; long rsum(long *start, long count) {if …
阅读更多...
【面试合集】说说微信小程序的发布流程？

【面试合集】说说微信小程序的发布流程？

面试官&#xff1a;说说微信小程序的发布流程&#xff1f; 一、背景 在中大型的公司里&#xff0c;人员的分工非常仔细&#xff0c;一般会有不同岗位角色的员工同时参与同一个小程序项目。为此&#xff0c;小程序平台设计了不同的权限管理使得项目管理者可以更加高效管理整个团…
阅读更多...
微软推出付费版Copilot

微软推出付费版Copilot

关注卢松松&#xff0c;会经常给你分享一些我的经验和观点。 微软已经超越苹果&#xff0c;成了全球市值最高的公司&#xff0c;其他公司都因为AI大裁员&#xff0c;而微软正好相反&#xff0c;当然这个原因很简单&#xff1a;就是微软强制把AI全面接入到系统里来了。而Copilot…
阅读更多...
Mac系统下，保姆级Jenkins自动化部署Android

Mac系统下，保姆级Jenkins自动化部署Android

一、Jenkins自动化部署 1、安装jenkins 官网&#xff1a;macOS Installers for Jenkins LTS 选择macOS brew install jenkins-lts 安装最新: brew install jenkins-lts 启动jenkins服务: brew services start jenkins-lts 重启jenkins服务: brew services restart jenkin…
阅读更多...
web开发学习笔记（2.js）

web开发学习笔记（2.js）

1.引入 2.js的两种引入方式 3.输出语句 4.全等运算符 5.定义函数 6.数组 7.数组属性 8.字符串对象的对应方法 9.自定义对象 10.json对象 11.bom属性 12.window属性 13.定时刷新时间 14.跳转网址 15.DOM文档对象模型 16.获取DOM对象&#xff0c;根据DOM对象来操作网页 如下图…
阅读更多...
基于杂交PSO算法的风光储微网日前优化调度(MATLAB实现)

基于杂交PSO算法的风光储微网日前优化调度(MATLAB实现)

微网中包含&#xff1a;风电、光伏、储能、微型燃气轮机&#xff0c;以最小化电网购电成本、光伏风机的维护成本、蓄电池充放电维护成本、燃气轮机运行成本及污染气体治理成本为目标&#xff0c;综合考虑&#xff1a;功率平衡约束、燃气轮机爬坡约束、电网交换功率约束、储能装…
阅读更多...
【GCC】6 接收端实现：周期构造RTCP反馈包

【GCC】6 接收端实现：周期构造RTCP反馈包

基于m98代码。GCC涉及的代码，可能位于：webrtc/modules/remote_bitrate_estimator webrtc/modules/congestion_controller webrtc/modules/rtp_rtcp/source/rtcp_packet/transport_feedback.cc webrtc 之 RemoteEstimatorProxy 对 remote_bitrate_estimator 的 RemoteEstimato…
阅读更多...
Vue 富文本实现内容项目倒序

Vue 富文本实现内容项目倒序

应用场景&#xff1a; 比如写计划和待办事项&#xff0c;内容少还好&#xff0c;内容多了最新的内容就放在下面了&#xff0c;每次打开要滚动到最后才能看到&#xff0c;这时可以使用倒序把最新的排在最前面。 倒序前&#xff1a; 倒序后&#xff1a; 倒序代码&#xff1a; …
阅读更多...
设计模式⑥ ：访问数据结构

设计模式⑥ ：访问数据结构

文章目录 一、前言二、Visitor 模式1. 介绍2. 应用3. 总结 三、Chain of Responsibility 模式1. 介绍2. 应用3. 总结 参考内容 一、前言 有时候不想动脑子&#xff0c;就懒得看源码又不像浪费时间所以会看看书&#xff0c;但是又记不住&#xff0c;所以决定开始写"抄书&q…
阅读更多...
ElasticSearch概述+SpringBoot 集成ES

ElasticSearch概述+SpringBoot 集成ES

ES概述 开源的、高扩展的、分布式全文检索引擎【站内搜索】 解决问题 1.搜索词是一个整体时&#xff0c;不能拆分&#xff08;mysql整体连续&#xff09; 2.效率会低&#xff0c;不会用到索引&#xff08;mysql索引失效&#xff09; 解决方式 进行数据的存储&#xff08;只存储…
阅读更多...
【51单片机系列】继电器使用

【51单片机系列】继电器使用

文章来源&#xff1a;《零起点学Proteus单片机仿真技术》。 本文是关于继电器使用相关内容。 继电器广泛应用在工业控制中&#xff0c;通过继电器对其他大电流的电器进行控制。 继电器控制原理图如下。继电器部分包括控制线圈和3个引脚&#xff0c;A引脚接电源&#xff0c;B引…
阅读更多...
推荐文章
最新文章

Copyright @ 2022~2023