参与有分 !!!! 寻找小波变换算法的代码 在SOHU用“图形图象”或“IMAGE PROCESSING”搜一下,很多的,我试过。 解决方案 » 免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货 http://duz.home.chinaren.com/math/Dwt.zip 谢谢 mathe() .但是,提供的下载地址,缺少头文件:dctdll.h //wt1:对数组a进行4系数离散小波变换//wtstep指向daub4;//匆忙中可能有不少笔误,请包涵 void wt1(float a[],unsigned long n,int isign,void(*wtstep)(float[],unsigned long,int)){unsigned long nn;if(n<4)return;if(isign>=0){for(nn=n;nn>=4;NN>>=1)(*wtstep)(a,nn,isign);}else{for(nn=4;nn<=n;nn<<=1)(*wtstep)(a,nn,isign);}}#define c0 0.4829629131445341#define c1 0.8365163037378079#define c0 0.2241438680420134#define c0 -0.1294095225512604void daub4(float a[],unsigned long n,int isign){float *wksp;unsigned long nh,nh1,i,j;if(n<4)return;wksp=new int[n+1];nh1=(nh=n>>1)+1;if(isign>=0){for(i=1,j=1;j<=n-3;j+=2,i++){wksp[i]=c0*a[j]+c1*a[j+1]+c2*a[j+2]+c3*a[j+3];wksp[i+nh]=c3*a[j]-c2*a[j+1]+c1*a[j+2]-c0*a[j+3];}wksp[i]=c0*a[n-1]+c1*a[n]+c2*a[1]+c3*a[2];wksp[i+nh]=c3*a[n-1]-c2*a[n]+c1*a[1]-c0*a[2];}else{wksp[1]=c2*a[nh]+c1*a[n]+c0*a[1]+c3*a[nh1];wksp[2]=c3*a[nh]-c0*a[n]+c1*a[1]-c2*a[nh1];for(i=1,j=3;i<nh;i++){wksp[j++]=c2*a[i]+c1*a[i+nh]+c0*a[i+1]+c3*a[i+nh1];wksp[j++]=c3*a[i]-c0*a[i+nh]+c1*a[i+1]-c2*a[i+nh1];}}for(i=1;i<=n;i++)a[i]=wksp[i];delete wksp[];} 我的毕业论文做过,不过我只做了24位的处理,在client端变化压缩也可反反变化,在server端反变化,给你 给你了[email protected] [email protected] 现在两个都发了 求助 对话框激活问题 如何把一个exe文件放入资源中,在程序运行后在释放出来? 对链表的写文件操作 在IOCP服務器中如何判斷客戶端掉線? 有关于 DSN 问题,急呀,帮帮忙~~~ 哪里有《深入浅出MFC》的源代码? 求教:怎样获知某个音频文件已经播放完毕? ASP+COM做成的共享软件有发展的空间吗?请讨论... 如何调用WORD的宏? 如何在对话框中加入视图文档结构 如何制作任意形状的图形按钮
但是,提供的下载地址,缺少头文件:dctdll.h
//wtstep指向daub4;
//匆忙中可能有不少笔误,请包涵
void wt1(float a[],unsigned long n,int isign,void(*wtstep)(float[],unsigned long,int)){unsigned long nn;
if(n<4)return;
if(isign>=0){for(nn=n;nn>=4;NN>>=1)(*wtstep)(a,nn,isign);}
else{for(nn=4;nn<=n;nn<<=1)(*wtstep)(a,nn,isign);}
}#define c0 0.4829629131445341
#define c1 0.8365163037378079
#define c0 0.2241438680420134
#define c0 -0.1294095225512604void daub4(float a[],unsigned long n,int isign){
float *wksp;
unsigned long nh,nh1,i,j;if(n<4)return;
wksp=new int[n+1];
nh1=(nh=n>>1)+1;
if(isign>=0){
for(i=1,j=1;j<=n-3;j+=2,i++){
wksp[i]=c0*a[j]+c1*a[j+1]+c2*a[j+2]+c3*a[j+3];
wksp[i+nh]=c3*a[j]-c2*a[j+1]+c1*a[j+2]-c0*a[j+3];
}
wksp[i]=c0*a[n-1]+c1*a[n]+c2*a[1]+c3*a[2];
wksp[i+nh]=c3*a[n-1]-c2*a[n]+c1*a[1]-c0*a[2];
}
else{
wksp[1]=c2*a[nh]+c1*a[n]+c0*a[1]+c3*a[nh1];
wksp[2]=c3*a[nh]-c0*a[n]+c1*a[1]-c2*a[nh1];
for(i=1,j=3;i<nh;i++){
wksp[j++]=c2*a[i]+c1*a[i+nh]+c0*a[i+1]+c3*a[i+nh1];
wksp[j++]=c3*a[i]-c0*a[i+nh]+c1*a[i+1]-c2*a[i+nh1];
}
}
for(i=1;i<=n;i++)a[i]=wksp[i];
delete wksp[];
}