Description: 2D Fourier变换在光衍射方面的应用一例,对孔函数直接应用FFT2,得到衍射结果;以及FDTD方面的两个不成熟的程序-2D Fourier Transform-ray diffraction case of the application of direct application Kong FFT2 function, be diffraction; FDTD and the two immature procedures Platform: |
Size: 2934 |
Author:彭怀敏 |
Hits:
Description: 一个二维Fourier变换的程序 适用于256*256的点阵,用于应付一般的数字图像处理需要-a two-dimensional Fourier transform procedures apply to the 256* 256 dot matrix, used to meet the general needs of digital image processing Platform: |
Size: 7168 |
Author:李子刚 |
Hits:
Description: This document introduces the techniques of fast Fourier transform and gives a source code in C for computing 2D FFT on image data. Platform: |
Size: 30720 |
Author:冰城 |
Hits:
Description: 程序代码说明
P0301:数字图像矩阵数据的显示及其傅立叶变换
P0302:二维离散余弦变换的图像压缩
P0303:采用灰度变换的方法增强图像的对比度
P0304:直方图均匀化
P0305:模拟图像受高斯白噪声和椒盐噪声的影响
P0306:采用二维中值滤波函数medfilt2对受椒盐噪声干扰的图像滤波
P0307:采用MATLAB中的函数filter2对受噪声干扰的图像进行均值滤波
P0308:图像的自适应魏纳滤波
P0309:运用5种不同的梯度增强法进行图像锐化
P0310:图像的高通滤波和掩模处理
P0311:利用巴特沃斯(Butterworth)低通滤波器对受噪声干扰的图像进行平滑处理
P0312:利用巴特沃斯(Butterworth)高通滤波器对图像进行锐化处理
-code P0301 : Digital image data matrix display and Fourier Transform P0302 : Two-dimensional discrete cosine transform image compression P0303 : Gray used a new method to enhance the contrast of the image P0304 : histogram equalization P0305 : Simulation images by white Gaussian noise and Impulse noise impact P0306 : 2D median filtering function medfilt2 right by the Salt and Pepper image noise filtering P0307 : MATLAB filter2 the function of noise interference by the image filtering P0308 : Image Adaptive Filter Weiner P0309 : use five different gradient Enhancement Act for image sharpening P0310 : Images of the high-pass filtering and mask handling P0311 : use Butterworth (Butterworth) low-pass filter to noise interference by the image smoothing P 0312 : Butterworth (Butterworth) high-pa Platform: |
Size: 11264 |
Author:Jimmy Yen |
Hits:
Description: 二维情况下实现快速傅立叶变换,利用一维情况下的FFT实现-under 2D of the fast Fourier transform, using a dimension of the FFT Platform: |
Size: 2048 |
Author:江边漫步 |
Hits:
Description: 由上述实验过程的图像变化可知,经过傅立叶变换和反变换及DCT离散余弦变换和反变换后,图像都发生了很大的变化,首先是经过2-D傅立叶变换后,图像数据频域出现高频数据集中,低频数据在四周的现象,然后再经过2-D傅立叶变换反变换后,图像再次恢复原始图。而2-D离散余弦变换对图像的影响也是如此。-From the above experiment, we can see the image change, after Fourier transform and inverse transform and DCT discrete cosine transform and inverse transform, the images have changed a lot, first of all, is a 2-D Fourier transform, the image data emergence of high-frequency frequency-domain data, low-frequency data in the four weeks of the phenomenon, and then after a 2-D Fourier transform inverse transform, the image again to restore the original map. And 2-D discrete cosine transform on the impact of images is also true. Platform: |
Size: 475136 |
Author: |
Hits:
Description: This document contains information about frequency domain processing. details about 1-d,2-d fourier transform,inverse fourier transform,image enhancement techniques. contains some sample code and output also Platform: |
Size: 2570240 |
Author:deeps |
Hits:
Description: 本实验要求开发一个2-D FFT程序包,使其可以应用于后续的几个实验。这个程序需要完成的功能是用因子(-1)^(x+y)乘以输入图像以实现滤波的中心变换,并还要求用一个实矩阵乘以一个复数矩阵通过调用两个图像的乘法程序来实现对应元素的相乘,同时计算反傅立叶变换,得到的结果乘以(-1)^(x+y)并取其实部最后计算频谱。实验中用到傅立叶变换的基本公式,通过实验我们可以更加深刻的理解频域滤波的基础。-The experiment calls for the development of a 2-D FFT package so that it can be applied to a number of follow-up experiment. This process needs to be done is to factor the function (-1) ^ (x+ y) multiplied by the input image to achieve the center of filter change, and also requires a real matrix multiplied by a complex matrix by calling the two images of the multiplication process to achieve multiplication of the corresponding elements, calculating the anti-Fourier transform at the same time, the result multiplied by (-1) ^ (x+ y) and check the final calculation of the Department of the spectrum in fact. Fourier transform experiment used the basic formula, we can experiment more profound understanding of the basis of frequency domain filtering. Platform: |
Size: 142336 |
Author:jhm |
Hits:
Description: 二维快速傅里叶变换及其逆变换,用于图像处理等领域-two dimensional fast fourier transform and its inverse fast fourier transform Platform: |
Size: 196608 |
Author:zhang bo |
Hits:
Description: 关于DFT的文章,应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate
high-performance hardware-software partitioned implementations
of the discrete Fourier transform (DFT). The partitioning
strategy is a heuristic based on the DFT’s divide-and-conquer
algorithmic structure and fine tuned by the feedback-driven
exploration of candidate designs. We have integrated this approach
in the Spiral linear-transform code-generation framework
to support push-button automatic implementation. We present
evaluations of hardware-software DFT implementations running
on the embedded PowerPC processor and the reconfigurable
fabric of the Xilinx Virtex-II Pro FPGA.
In our experiments, the 1D and 2D DFT’s FPGA-accelerated
libraries exhibit between 2 and 7.5 times higher performance
(operations per second) and up to 2.5 times better energy
efficiency (operations per Joule) than the software-only version. Platform: |
Size: 235520 |
Author:李然 |
Hits:
Description: 2D傅立叶变换,上课的小作业,包含报告和源码-2D Fourier transform, the small school assignments, reports and source code that contains Platform: |
Size: 952320 |
Author:lai |
Hits:
Description: 二维傅里叶变换,对图像进行二维傅里叶变换处理-Two-Dimensional Fast Fourier Transform
The purpose of this project is to develop a 2-D FFT program "package" that will be used
in several other projects that follow. Your implementation must have the capabilities to:
(a) Multiply the input image by (-1)x+y to center the transform for filtering.
(b) Multiply the resulting (complex) array by a real function (in the sense that the
the real coefficients multiply both the real and imaginary parts of the transforms).
Recall that multiplication of two images is done on pairs of corresponding elements.
(c) Compute the inverse Fourier transform.
(d) Multiply the result by (-1)x+y and take the real part.
(e) Compute the spectrum. Platform: |
Size: 1024 |
Author:solo |
Hits: