source code for wavelet transform algorithm

Ridge_WindowFT窗口傅立叶变换的脊 CohenDist Cohen类时频分布-Ridge_WindowFT window Fourier Transform ridge CohenDist Cohe n type time-frequency distribution

基于混沌加密的离散小波变换域数字图像水印算法的研究的期刊论文-DWT Based on Chaotic Encryption Algorithm for Digital Image Watermarking domain of research journal articles

ICA算法The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.-ICA algorithm:The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.

二进小波，非极大值抑制，模极大值的边缘检测程序-Dyadic wavelet, non-maxima suppression, modulus maxima of the edge detection procedure

利用小波变换进行边缘提取的MATLAB程序-Using Wavelet Transform for Edge Detection of MATLAB procedures

vc++实现mallat算法,对小波变换的二维离散变换作了一些工作!值的一看!-vc achieve Mallat algorithm, the wavelet transform two-dimensional discrete transform made some work! Value of a view!

小波图像编码与JPEG图像编码的比较研究-wavelet image coding and encoding of JPEG images Comparative Study

白光的单缝衍射-white single-slit diffraction

Example of Wavelet compression programm.

关于二维小波变换的程序 [精华] 说明：此算法重在概念，速度并不是很快。因为FOR循环的缘故。此程序从循环矩阵的观点出发，把圆周卷积和快速幅里叶变换建立了联系。实现了分解和无失真重构。它只做了一层分解，即将256x256图形分解成为64x64的四个图形，避免了使用WKEEP()的困惑。主要思想为用小波滤波器族构造正交阵W,变换写为B=W*A*W ,反变换为：A=W *A*W,这与所有正交变换无异。W为循环正交矩阵，因此可用FFT实现快速运算，难点就在重构矩阵上。若用矩阵概念明确，一个共扼转置可以搞顶。但FFT的使用必须找到与分解序列的关系。-on Wavelet Transform procedures [best] Note : This algorithm important concept is not speed quickly. Because FOR cycle nowadays. This program cycle from the point of view of Matrix, circular convolution and fast Fourier transform is established links. To achieve the decomposition and reconstruction without distortion. It only had one decomposition, 256x256 graphics will be 64x64 decomposition of the four graphics, avoiding the use of WKEEP () confusion. The main idea of using wavelet filter generator orthogonal array W, write to transform B = W* A* W, anti-Transform : A = W* A* W, which is orthogonal transformation all the same. W cycle orthogonal matrix, can be used to achieve rapid FFT computation, on the dif