bindwt97.cpp

该程序实现各种小波提升分解

// LiftDwt.cpp: implementation of the CLiftDwt class.
//  此程序为二进制9-7小波提升格式的变换，算法中只有整数加法和移位
//  程序中了使用的小波滤波器为2000年 IEEE Image Pro. 上的一篇介绍jpeg2000无损压缩中的9-7小波滤波器，//  它其实是对cdf9-7提升格式中的几个系数直接作二进制近似的到的
//
//  程序包括以下部分： 
//
//  Dwt2D(double buffer[], int height, int width, int lv) 二维提升小波变换，buffer进行变换的数据，he//  ight,width数据的尺寸，lv小波分解的层数
//  IDwt2D(double buffer[], int height, int width, int lv) 二维提升小波反变换
//  
//  Dwt1D(double *buffer, int buflen)  一维提升小波分解 buflen 数据的长度
//  IDwt1D(double *buffer, int buflen) 
//   
//
//  数据延拓方式有两种： 周期延拓和对称延拓
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
//#include "ImgPro.h"
#include "BinDwt97.h"
#include "math.h"

#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif

//#define MAX(x,y) (x>y?x:y)
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

CBinDwt97::CBinDwt97()
{
	shift = 4;
}

CBinDwt97::~CBinDwt97()
{

}

void CBinDwt97::Dwt2D(int *buffer, int height, int width, int lv)
{
	int i,j,k;
 	int nheight,nwidth;
	int *pbuffer1,*pbuffer2;
 
	for ( k=0; k<lv; k++)
	{
       nheight=height>>k;
	   nwidth=width>>k;

	   pbuffer1 = new int [nwidth];	 
	   pbuffer2 = new int [nheight];
      
	   //行变换
	   for (i=0; i<nheight; i++)
		{
			for(j=0; j<nwidth; j++)
				*(pbuffer1+j) = *(buffer+i*width+j);
			
			Dwt1D(pbuffer1,nwidth);
			
			for(j=0; j<nwidth; j++)
				 *(buffer+i*width+j) = *(pbuffer1+j);
		}
		delete []pbuffer1;
      
		//列变换
		for(j=0; j<nwidth; j++)
		{
			for (i=0; i<nheight; i++)
				*(pbuffer2+i)= *(buffer+i*width+j);

			Dwt1D(pbuffer2,nheight);
			
			for(i=0; i<nheight; i++)
				 *(buffer+i*width+j) = *(pbuffer2+i);
		}
	
	  delete []pbuffer2;
	}

}

void CBinDwt97::IDwt2D(int *buffer, int height, int width, int lv)
{

	int i,j,k;
 	int nheight,nwidth;
	int *pbuffer1,*pbuffer2;
	  
	for (k=0; k<lv; k++)
	{
		nheight=height>>(lv-k-1);
 		nwidth=width>>(lv-k-1);
	    
		pbuffer1 = new int [nheight];	 
	    pbuffer2 = new int [nwidth];
        
		//列反变换
		for(j=0; j<nwidth; j++)
		{
 			for (i=0; i<nheight; i++)
 				*(pbuffer1+i) =  *(buffer+i*width+j);
 		
			IDwt1D(pbuffer1,nheight);
 			
			for(i=0; i<nheight; i++)
 				 *(buffer+i*width+j) = *(pbuffer1+i);
 		}
 		delete []pbuffer1;
 
        //行反变换
	
 		for (i=0; i<nheight; i++)
		{
 			for(j=0; j<nwidth; j++)
 				*(pbuffer2+j)=*(buffer+i*width+j);
 			IDwt1D(pbuffer2,nwidth);
 			for(j=0; j<nwidth; j++)
 				 *(buffer+i*width+j) = *(pbuffer2+j);
 		}
		delete []pbuffer2;
 	}
	

}

void CBinDwt97::Dwt1D(int *buffer, int buflen)
{
	int i;
	int itemp;
	int data_tmp;

	int *d, *s, *p;
	p = new int [buflen+(shift<<1)];
	d = new int [(buflen>>1)+shift];
	s = new int [(buflen>>1)+shift];

/*    使用周期延拓方式	*/
/*	for (i=0; i<shift; i++){
		*(p+i) = *(buffer+buflen-shift+i);
		*(p+buflen+shift+i) = *(buffer+i);
	}
	for (i=0; i<buflen; i++) *(p+i+shift) = *(buffer+i);
/* 数据周期延拓结束  计算p1 = d1          p2 = s1 */

	/*  对称延拓 */
	for (i=0; i<shift; i++)
	{
		*(p+i) = *(buffer+shift-i);
		*(p+buflen+shift+i) = *(buffer+buflen-i-2);
	}
	for (i=0; i<buflen; i++) *(p+i+shift) = *(buffer+i);
    /*  结束  */



	for (i=0; i<(buflen>>1)+shift; i++)
	{
		itemp = i-(shift>>1);
		data_tmp = - (*(p+shift+(itemp<<1)+2) + *(p+shift+(itemp<<1)));
		*(d+i) = *(p+shift+(itemp<<1)+1) + data_tmp + (data_tmp>>1) + (data_tmp>>4) + (data_tmp >>6) + (data_tmp >>7);
	}

	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		itemp = i+1-(shift>>1);
		data_tmp = -(*(d+i+1) + *(d+i));
        *(s+i+1) = *(p+shift+(itemp<<1)) + (data_tmp >>5) +(data_tmp >>6) + (data_tmp >>8) + (data_tmp >>9) + (data_tmp >>12);
	}
   /*  d1 s1 计算结束 下计算 d2  */
	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		data_tmp = *(s+i) + *(s+i+1);
        *(p+shift+(buflen>>1)+i) = *(d+i) + (data_tmp>>1) + (data_tmp >>2) + (data_tmp >>3) + (data_tmp >>7);
	}

	/*  s2 */
    for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		data_tmp = *(p+(buflen>>1)+shift+i+1) + *(p+(buflen>>1)+shift+i);
		*(p+i+1) = *(s+i+1) + (data_tmp >>2) + (data_tmp >>3) + (data_tmp >>4) + (data_tmp >>8) + (data_tmp >>9) + (data_tmp >>12);
	}

	///  存在冗余计算
	for (i=0; i<(buflen>>1); i++)
		*(buffer+i+(buflen>>1)) = *(p+shift+(buflen>>1) + (shift>>1) +i);

	for (i=0; i<(buflen>>1); i++)
		*(buffer+i) = *(p + (shift>>1) + i);

    delete []p;
	delete []d;
	delete []s;
    
}

void CBinDwt97::IDwt1D(int *buffer, int buflen)
{
	int i;
    int *p1, *p2, *s, *d;
	int data_tmp;

	p1 = new int [(buflen>>1)+shift];
	p2 = new int [(buflen>>1)+shift];
	s  = new int [(buflen>>1)+shift];
	d  = new int [(buflen>>1)+shift];

/*    延拓方式为周期延拓     /*
	for (i=0; i<(shift>>1); i++){
		p1[i] = buffer[i+(buflen>>1)-(shift>>1)];
		p1[i+(shift>>1)+(buflen>>1)] = buffer[i];
		p2[i] = buffer[i+buflen-(shift>>1)];
		p2[i+(shift>>1)+(buflen>>1)] = buffer[i+(buflen>>1)];
	}
	for (i=0; i<(buflen>>1); i++){
		p1[i+(shift>>1)] = buffer[i];
		p2[i+(shift>>1)] = buffer[i+(buflen>>1)];
	}

/*  延拓结束 */	

	/*  对称延拓	*/
   	for (i=0; i<(shift>>1); i++)
	{
		p1[i] = buffer[(shift>>1)-i];
		p1[i+(shift>>1)+(buflen>>1)] = buffer[(buflen>>1)-i-1];
		p2[i] = buffer[(buflen>>1)+(shift>>1)-i-1];
		p2[i+(shift>>1)+(buflen>>1)] = buffer[buflen-i-2];
	}
	for (i=0; i<(buflen>>1); i++)
	{
		p1[i+(shift>>1)] = buffer[i];
		p2[i+(shift>>1)] = buffer[i+(buflen>>1)];
	}
/*   对称延拓结束  */

 
	
	/*  s1  */
	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
	   data_tmp = *(p2+i+1) + *(p2+i/*+1-1*/);
       *(s+i+1) = *(p1+i+1) - ((data_tmp >>2) + (data_tmp >>3) + (data_tmp >>4) + (data_tmp >>8) + (data_tmp >>9) + (data_tmp >>12));
	}
   /*  d1 */
	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		data_tmp = *(s+i) + *(s+i+1);
        *(d+i) = *(p2+i) - ((data_tmp>>1) + (data_tmp >>2) + (data_tmp >>3) + (data_tmp >>7));
	}

    /* p1 = s0 */
	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		data_tmp = -(*(d+i+1)+*(d+i/*+1-1*/));
		*(p1+i+1) = *(s+i+1) - ((data_tmp >>5) +(data_tmp >>6) + (data_tmp >>8) + (data_tmp >>9) + (data_tmp >>12));
	}

   /*  p2 = d0 */
	for (i=0; i<(buflen>>1)+shift-1; i++)
	{
		data_tmp = - (*(p1+i) + *(p1+i+1));
		*(p2+i) = *(d+i) - (data_tmp + (data_tmp>>1) + (data_tmp>>4) + (data_tmp >>6) + (data_tmp >>7));
	}

   for (i=0; i<(buflen>>1); i++)
   {
	   *(buffer+2*i) = *(p1+i+(shift>>1)) ;
	   *(buffer+2*i+1) = *(p2+i+(shift>>1));
   }


	delete []p1;
	delete []p2;
	delete []s;
	delete []d;
}