Description: 该程序实现了对一幅图象进行Walsh变换。首先定义了一个imagewnd类, 该类可用于位图的创建、显示；WALh函数为快速沃尔什-哈达玛变换，f为时域值,F为变换域值,power为2的幂数，Walsh1函数为二维变换；在该函数中取出了一幅位图的所有像素，用来进行变换.具体算法过于专业，我就不细说了。-the realization of an image Walsh transform. First imagewnd definition of a category, such can be used for the bitmap is created, displayed; WALh function for the rapid Walsh-Hadamard transform, too-valued f, F value of the transform domain, power and the power to two the number Walsh1 function of two-dimensional transform; function in the removal of a bitmap of all pixels, used for transformation. specific algorithm is too professional, I will not elaborate on this. Platform: |
Size: 103110 |
Author:none |
Hits:
Description: 对二维图像进行沃尔什变换,之后用图像的四分之一进行沃尔什反变换来复原图像，并比较误差-Two-dimensional images of the Walsh transform, followed by a quarter of the image to the anti-Walsh transform to recover images, and compare the error Platform: |
Size: 1024 |
Author:房子 |
Hits:
Description: The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x) -The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x
Example:
x=[1 2 1 1]
W=FWHT(x) Platform: |
Size: 2048 |
Author:ry |
Hits:
Description: fwt,fwt2分别是一维、二维快速沃尔什变换函数,采用蝶形快速算法编写，要比利用矩阵相乘得到变换结果的离散沃尔什变换快很多-fwt, fwt2 are one-dimensional, two-dimensional fast Walsh transform function, the use of butterfly Fast Algorithm for the preparation of, than the use of transformation matrices to be the result of the discrete Walsh transform much faster Platform: |
Size: 2048 |
Author:tianjieyu |
Hits:
Description: 用于数字信号处理和图像处理的二维walsh变换-For digital signal processing and image processing of two-dimensional transform walsh-walsh Platform: |
Size: 1024 |
Author:zx |
Hits:
Description: 一、 计算图象的频谱函数
设计图象120*30/256*256；选用Matlab函数直接调用实现。
二、根据计算证明傅立叶变换的性质
1， 共轭对称性:
F(u,v)=F*(-u,-v) ;
三、图象的频域滤波
1， 设计一个指数低通滤波器，对两图象（f1(x,y)为30*30/256*256的图象；f2(x,y)=p3-02图象）进行低通滤波，观察分析空域图象和频谱分布的变化。
四、图象变换比较
利用现有的离散傅立叶变换、离散余弦变换、Walsh-Hadamard变换对同一图象实施变换，比较三种变换所得到的频谱。(1. The spectral function of the computed image
Design image: 120*30/256* 256; Use Matlab function to call the implementation directly.
The properties of Fourier transform are proved by calculation
1. Conjugate symmetry:
F (u, v) = F * (- u, v);
3. Frequency domain filtering of images
1. Design an exponential low-pass filter with two images (f1 (x,y) as 30*30/256* 256. F2 (x,y)=p3-02 image) to conduct low pass filtering to observe the change of spatial image and spectral distribution.
4. Comparison of image transformation
Using the existing discrete Fourier transform, discrete cosine transform and Walsh-Hadamard transform to transform the same image, compare the spectrum obtained by three kinds of transformations.) Platform: |
Size: 185344 |
Author:LIMBO2K
|
Hits:
Search - Walsh-Hadamard Transform