DCT算法可以说是有损压缩的第一步,多用在视频压缩方面。它将二维转化为一维数据,并且将能量聚集到左上角。关于DCT,有很多快速算法,我个人认为,我这个算法还是比较快速的。下面是我的代码:
#include<stdio.h>
#include <math.h>
#include<string.h>
#include<stdlib.h>
#define PI 3.1415926
double *C=NULL;
double *temp_2D=NULL;
#define N 256
void fdct_2D(double *f,int deg_row,int deg_col);
void fidct_2D(double *F,int deg_row,int deg_col);
void init2D_Param(int rows,int cols);
void fdct_1D_no_param(double *f,int deg);
void initDCTParam(int deg);
void dct_forward(double *f,int deg);
void dct_backward(double *f,int deg);
void fidct_1D_no_param(double *F,int deg);
void initIDCTParam(int deg);
void idct_backward(double *F,int deg);
void idct_forward(double *F,int deg);
void fbitrev(double *f,int deg);
int bitrev(int bi,int deg);
void swap(double *a,double *b);
int GetTwoIndex(int num);
void fdct_2D(double *f,int deg_row,int deg_col)
{
int rows,cols,i_row,i_col;
double two_div_sqrtcolrow;
rows=1<<deg_row;
cols=1<<deg_col;
init2D_Param(rows,cols);
two_div_sqrtcolrow=2.0/(sqrt((double)(rows*cols)));
for(i_row=0;i_row<rows;i_row++)
{
fdct_1D_no_param(f+i_row*cols,deg_col);
}
for(i_col=0;i_col<cols;i_col++)
{
for(i_row=0;i_row<rows;i_row++)
{
temp_2D[i_row]=f[i_row*cols+i_col];
}
fdct_1D_no_param(temp_2D,deg_row);
for(i_row=0;i_row<rows;i_row++)
{
f[i_row*cols+i_col]=temp_2D[i_row]*two_div_sqrtcolrow;
}
}
}
void fidct_2D(double *F,int deg_row,int deg_col)
{
int rows,cols,i_row,i_col;
double sqrtcolrow_div_two;
rows=1<<deg_row;
cols=1<<deg_col;
init2D_Param(rows,cols);
sqrtcolrow_div_two=(sqrt((double)(rows*cols)))/2.0;
for(i_row=0;i_row<rows;i_row++)
{
fidct_1D_no_param(F+i_row*cols,deg_col);
}
for(i_col=0;i_col<cols;i_col++)
{
for(i_row=0;i_row<rows;i_row++)
{
temp_2D[i_row]=F[i_row*cols+i_col];
}
fidct_1D_no_param(temp_2D,deg_row);
for(i_row=0;i_row<rows;i_row++)
{
F[i_row*cols+i_col]=temp_2D[i_row]*sqrtcolrow_div_two;
}
<