搜索资源列表
2d dft
- This is a toolbox for 2D DFT
FFT(DFTrealarray)twodimension
- 多维傅里叶变换，二维DFT快速算法，共分五部--三：二维实序2D-DFT列行列算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 3: two-dimensional real column ordinal ranks of 2D-DFT algorithm for
efficient_registration
- 利用傅里叶变换，在频域上对两幅图像配准，是一种比较配准的新方法，但是对弹性配准的效果不是很好 需要进一步的研究。-Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsamp
paper04
- Presently FFT usage in GPS receivers has been a topic of extensive study and many improved FFT-based acquisition methods with averaging correlation technique also have emerged. Although averaging arithmetic can reduce the instant processing p
paper03
- Presently FFT usage in GPS receivers has been a topic of extensive study and many improved FFT-based acquisition methods with averaging correlation technique also have emerged. Although averaging arithmetic can reduce the instant processing p
matlab_image_processing
- mathlab for image processing 2D, DFT, FFT etc.
Synthetic2DFault
- 利用傅立叶反变换自动生成随机分形面，可生成各向同性或各向异性的。-Generating the 2D fractal surfaces using inverse DFT method
GeneratingFPGA-AcceleratedDFTLibraries
- 关于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
MainCode
- matlab code that make an image with capability of rotataing, shifting, .. and compute 2-d DFT.
DFTin2D
- code in visual c++ environment for dft in 2d,
Wavelets
- 1 Haar Wavelets 1.1 The Haar transform 1.2 Conservation and compaction of energy 1.3 Haar wavelets 1.4 Multiresolution analysis 1.5 Compression of audio signals 1.6 Removing noise from audio signals 1.7 Notes and references 2 Daub ech
example-DFT-2D
- example of use DFT 2D in a gray image by matlab
FourierTransform2D_Ni
- mpi编程方法，分布式编程，16个CPU进行二维DFT运算，对图像进行处理-We are going to use 16 CPUs in the jinx cluster to performe the 2d DFT using distributed computing
用所选项目新建的文件夹
- 二维的离散傅立叶变换，写的比较简单，没有给出demo(Two-dimensional discrete Fourier transform, writing is relatively simple, did not give demo)
huffman coding
- 利用霍夫曼编码进行图像压缩处理，此程序为霍夫曼编码的示例(The performance of a Huffman code is a function of the entropy of the signal distribution and therefore can be highly dependent in the transform domain in which the code is applied. For example, JPEG partitions an image