HM之基于哈达玛变换的SATD计算
来源:互联网 发布:精通 d3.js 第2版 pdf 编辑:程序博客网 时间:2024/04/29 05:22
// 函数功能是计算8×8块的哈达玛变换,并计算其SAD值,m2[8][8]存放最终的变换结果
Int xCalcHADs8x8_ISlice(Pel *piOrg, Int iStrideOrg){Int k, i, j, jj;Int diff[64], m1[8][8], m2[8][8], m3[8][8], iSumHad = 0;//把8×8块像素存放在一维数组中for( k = 0; k < 64; k += 8 ){diff[k+0] = piOrg[0] ;diff[k+1] = piOrg[1] ;diff[k+2] = piOrg[2] ;diff[k+3] = piOrg[3] ;diff[k+4] = piOrg[4] ;diff[k+5] = piOrg[5] ;diff[k+6] = piOrg[6] ;diff[k+7] = piOrg[7] ;piOrg += iStrideOrg; //指针指向下一行}//horizontal 水平变换,计算V=X×H,for (j=0; j < 8; j++){jj = j << 3; //一次算8个,乘8换行m2[j][0] = diff[jj ] + diff[jj+4];m2[j][1] = diff[jj+1] + diff[jj+5];m2[j][2] = diff[jj+2] + diff[jj+6];m2[j][3] = diff[jj+3] + diff[jj+7];m2[j][4] = diff[jj ] - diff[jj+4];m2[j][5] = diff[jj+1] - diff[jj+5];m2[j][6] = diff[jj+2] - diff[jj+6];m2[j][7] = diff[jj+3] - diff[jj+7];m1[j][0] = m2[j][0] + m2[j][2];m1[j][1] = m2[j][1] + m2[j][3];m1[j][2] = m2[j][0] - m2[j][2];m1[j][3] = m2[j][1] - m2[j][3];m1[j][4] = m2[j][4] + m2[j][6];m1[j][5] = m2[j][5] + m2[j][7];m1[j][6] = m2[j][4] - m2[j][6];m1[j][7] = m2[j][5] - m2[j][7];m2[j][0] = m1[j][0] + m1[j][1];m2[j][1] = m1[j][0] - m1[j][1];m2[j][2] = m1[j][2] + m1[j][3];m2[j][3] = m1[j][2] - m1[j][3];m2[j][4] = m1[j][4] + m1[j][5];m2[j][5] = m1[j][4] - m1[j][5];m2[j][6] = m1[j][6] + m1[j][7];m2[j][7] = m1[j][6] - m1[j][7];}//vertical 垂直变换,计算H×Vfor (i=0; i < 8; i++){m3[0][i] = m2[0][i] + m2[4][i];m3[1][i] = m2[1][i] + m2[5][i];m3[2][i] = m2[2][i] + m2[6][i];m3[3][i] = m2[3][i] + m2[7][i];m3[4][i] = m2[0][i] - m2[4][i];m3[5][i] = m2[1][i] - m2[5][i];m3[6][i] = m2[2][i] - m2[6][i];m3[7][i] = m2[3][i] - m2[7][i];m1[0][i] = m3[0][i] + m3[2][i];m1[1][i] = m3[1][i] + m3[3][i];m1[2][i] = m3[0][i] - m3[2][i];m1[3][i] = m3[1][i] - m3[3][i];m1[4][i] = m3[4][i] + m3[6][i];m1[5][i] = m3[5][i] + m3[7][i];m1[6][i] = m3[4][i] - m3[6][i];m1[7][i] = m3[5][i] - m3[7][i];m2[0][i] = m1[0][i] + m1[1][i];m2[1][i] = m1[0][i] - m1[1][i];m2[2][i] = m1[2][i] + m1[3][i];m2[3][i] = m1[2][i] - m1[3][i];m2[4][i] = m1[4][i] + m1[5][i];m2[5][i] = m1[4][i] - m1[5][i];m2[6][i] = m1[6][i] + m1[7][i];m2[7][i] = m1[6][i] - m1[7][i];}for (i = 0; i < 8; i++){for (j = 0; j < 8; j++){iSumHad += abs(m2[i][j]);}}iSumHad -= abs(m2[0][0]);iSumHad =(iSumHad+2)>>2; //除以系数4,并向上取整return(iSumHad);}
0 0
- HM之基于哈达玛变换的SATD计算
- 沃尔什-哈达玛变换
- x264的哈达玛变换(hadamard)的实现和优化
- HM12.0中分数ME时的 哈达玛变换
- 压缩感知——沃尔什-哈达玛(WHT)变换与逆变换的Matlab代码实现
- 图像的正交变换---沃尔什——哈达马变换
- 特征变换(2)沃尔什-哈达玛变换
- SATD的计算及代码实现
- 利用哈达玛变换对真彩色图像进行压缩
- sad satd ssd Hadamard变换
- 哈达玛(Hadamard)矩阵
- opencv之计算图像的拉普拉斯变换
- HM编码器代码阅读(32)——帧间预测之AMVP/Merge模式(七)encodeResAndCalcRdInterCU函数:残差计算、变换量化
- 数组的常用算法(3) - 哈达玛矩阵
- HEVC之1 HM的使用
- HM/JEM划分模式的率失真代价的计算
- HM Inter/Merge模式的TMVP的计算
- SAD和SATD的区别
- iOS问题合集(不定期更新)
- hdu 5916 Harmonic Value Description 2016ACM/CCPC长春赛区现场赛F
- LightOJ1018- Brush (IV) -状态压缩,DFS
- arraycopy数组的拷贝
- 【1】 ActionBar最顶端的自定义
- HM之基于哈达玛变换的SATD计算
- 模式二:观察者模式(Observer Pattern)——实现一对多关系
- 4 Python中的异常
- 多线程问题
- crontab执行不了php的解决方法
- Android FrameWork框架原理之进程是个什么东西(从进程创建到myActivity.onCreate()的执行)
- 关于学习中小程序的小问题
- hdu 5918 Harmonic Value Description 2016ACM/CCPC长春赛区现场赛H
- LevelDB学习之路--doc/index.html