图像沃尔什变换.rar

  • PUDN用户
    了解作者
  • Visual C++
    开发工具
  • 4KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 57
    下载次数
  • 2005-09-01 15:33
    上传日期
此程序可实现图像的沃尔什变换(WALSH)。
图像沃尔什变换.rar
  • 图像沃尔什变换
  • 图像沃尔什变换.doc
    24KB
  • www.pudn.com.txt
    218B
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/622b2f7bff7f9c46a68c58ea/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/622b2f7bff7f9c46a68c58ea/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#22270;&#20687;&#27779;&#23572;&#20160;&#21464;&#25442;<span class="ff2">(vc++)</span></div><div class="t m0 x1 h4 y3 ff2 fs0 fc0 sc0 ls0 ws0">#define EXTRA_NAME "@walshtransform."</div><div class="t m0 x1 h4 y4 ff2 fs0 fc0 sc0 ls0 ws0">#include "loadbmp.h"</div><div class="t m0 x1 h4 y5 ff2 fs0 fc0 sc0 ls0 ws0">#define Point(x,y) lpPoints[(x)+(y)*nW<span class="_ _0"></span>idth]</div><div class="t m0 x1 h4 y6 ff2 fs0 fc0 sc0 ls0 ws0">void W<span class="_ _1"></span>ALh(double *f, double *W<span class="_ _2"></span>, int power)</div><div class="t m0 x1 h4 y7 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x2 h4 y8 ff2 fs0 fc0 sc0 ls0 ws0">int count;</div><div class="t m0 x2 h4 y9 ff2 fs0 fc0 sc0 ls0 ws0">int i,j,k,bfsize,p;</div><div class="t m0 x2 h4 ya ff2 fs0 fc0 sc0 ls0 ws0">double *X1,*X2,*X;</div><div class="t m0 x2 h4 yb ff2 fs0 fc0 sc0 ls0 ws0">count=1&lt;&lt;power;</div><div class="t m0 x2 h4 yc ff2 fs0 fc0 sc0 ls0 ws0">X1=(double *)malloc(sizeof(double)*count);</div><div class="t m0 x2 h4 yd ff2 fs0 fc0 sc0 ls0 ws0">X2=(double *)malloc(sizeof(double)*count);</div><div class="t m0 x2 h4 ye ff2 fs0 fc0 sc0 ls0 ws0">memcpy(X1,f,sizeof(double)*count);</div><div class="t m0 x2 h4 yf ff2 fs0 fc0 sc0 ls0 ws0">for(k=0;k&lt;power;k++)</div><div class="t m0 x2 h4 y10 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x3 h4 y11 ff2 fs0 fc0 sc0 ls0 ws0">for(j=0;j&lt;1&lt;&lt;k;j++)</div><div class="t m0 x3 h4 y12 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x4 h4 y13 ff2 fs0 fc0 sc0 ls0 ws0">bfsize=1&lt;&lt;(power-k);</div><div class="t m0 x4 h4 y14 ff2 fs0 fc0 sc0 ls0 ws0">for(i=0;i&lt;bfsize/2;i++)</div><div class="t m0 x4 h4 y15 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x5 h4 y16 ff2 fs0 fc0 sc0 ls0 ws0">p=j*bfsize;</div><div class="t m0 x5 h4 y17 ff2 fs0 fc0 sc0 ls0 ws0">X2[i+p]=X1[i+p]+X1[i+p+bfsize/2];</div><div class="t m0 x5 h4 y18 ff2 fs0 fc0 sc0 ls0 ws0">X2[i+p+bfsize/2]=X1[i+p]-X1[i+p+bfsize/2];</div><div class="t m0 x4 h4 y19 ff2 fs0 fc0 sc0 ls0 ws0">}</div><div class="t m0 x3 h4 y1a ff2 fs0 fc0 sc0 ls0 ws0">}</div><div class="t m0 x3 h4 y1b ff2 fs0 fc0 sc0 ls0 ws0">X=X1;</div><div class="t m0 x3 h4 y1c ff2 fs0 fc0 sc0 ls0 ws0">X1=X2;</div><div class="t m0 x3 h4 y1d ff2 fs0 fc0 sc0 ls0 ws0">X2=X;</div><div class="t m0 x2 h4 y1e ff2 fs0 fc0 sc0 ls0 ws0">}</div><div class="t m0 x2 h4 y1f ff2 fs0 fc0 sc0 ls0 ws0">for(j=0;j&lt;count;j++)</div><div class="t m0 x2 h4 y20 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x3 h4 y21 ff2 fs0 fc0 sc0 ls0 ws0">p=0;</div><div class="t m0 x3 h4 y22 ff2 fs0 fc0 sc0 ls0 ws0">for(i=0;i&lt;power;i++)</div><div class="t m0 x3 h4 y23 ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x4 h4 y24 ff2 fs0 fc0 sc0 ls0 ws0">if (j&amp;(1&lt;&lt;i)) p+=1&lt;&lt;(power-i-1);</div><div class="t m0 x3 h4 y25 ff2 fs0 fc0 sc0 ls0 ws0">}</div><div class="t m0 x3 h4 y26 ff2 fs0 fc0 sc0 ls0 ws0">W[j]=X1[p]/count;</div><div class="t m0 x2 h4 y27 ff2 fs0 fc0 sc0 ls0 ws0">}</div><div class="t m0 x2 h4 y28 ff2 fs0 fc0 sc0 ls0 ws0">free(X1);</div></div></div><div class="pi" data-data='{"ctm":[1.611850,0.000000,0.000000,1.611850,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐