Welcome![Sign In][Sign Up]
Location:
Search - 2D DFT

Search list

[JSP/Java2d dft

Description: This is a toolbox for 2D DFT
Platform: | Size: 1703 | Author: wiscforum@gmail.com | Hits:

[Mathimatics-Numerical algorithmsFFTdemo

Description: 基2FFT,包括一个DFT-2-d FFT, including a DFT program
Platform: | Size: 28672 | Author: xqz | Hits:

[Graph programefficient_registration

Description: 利用傅里叶变换,在频域上对两幅图像配准,是一种比较配准的新方法,但是对弹性配准的效果不是很好 需要进一步的研究。-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 upsampling by a matrix-multiply DFT (discrete FT) to dramatically reduce computation time and memory without sacrificing accuracy
Platform: | Size: 5120 | Author: wangwei | Hits:

[AlgorithmFFT(DFTrealarray)twodimension

Description: 多维傅里叶变换,二维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
Platform: | Size: 3072 | Author: jet ju | Hits:

[GPS developpaper04

Description: 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 points of FFT/IFFT, their noise performance is not promising. In this paper a novel compress-sampling algorithm for FFT-base GPS signal acquisition method is proposed. It not only diminishes the size of FFT/IFFT core but also enhances the noise immunity of receiver with its “redundancy” structure. Simulation results of Matlab testify that the computational complexity of the novel algorithm has been efficiently suppressed to only 0.93 over the 2D search method in time domain. At the same time the lower amplitude threshold obtained from the novel method gets a lower false alarm probability comparing with the direct DFT algorithm with no compression. The noise immunity is enhanced-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 points of FFT/IFFT, their noise performance is not promising. In this paper a novel compress-sampling algorithm for FFT-base GPS signal acquisition method is proposed. It not only diminishes the size of FFT/IFFT core but also enhances the noise immunity of receiver with its “redundancy” structure. Simulation results of Matlab testify that the computational complexity of the novel algorithm has been efficiently suppressed to only 0.93 over the 2D search method in time domain. At the same time the lower amplitude threshold obtained from the novel method gets a lower false alarm probability comparing with the direct DFT algorithm with no compression. The noise immunity is enhanced
Platform: | Size: 254976 | Author: zohreh | Hits:

[GPS developpaper03

Description: 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 points of FFT/IFFT, their noise performance is not promising. In this paper a novel compress-sampling algorithm for FFT-base GPS signal acquisition method is proposed. It not only diminishes the size of FFT/IFFT core but also enhances the noise immunity of receiver with its “redundancy” structure. Simulation results of Matlab testify that the computational complexity of the novel algorithm has been efficiently suppressed to only 0.93 over the 2D search method in time domain. At the same time the lower amplitude threshold obtained from the novel method gets a lower false alarm probability comparing with the direct DFT algorithm with no compression. The noise immunity is enhanced-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 points of FFT/IFFT, their noise performance is not promising. In this paper a novel compress-sampling algorithm for FFT-base GPS signal acquisition method is proposed. It not only diminishes the size of FFT/IFFT core but also enhances the noise immunity of receiver with its “redundancy” structure. Simulation results of Matlab testify that the computational complexity of the novel algorithm has been efficiently suppressed to only 0.93 over the 2D search method in time domain. At the same time the lower amplitude threshold obtained from the novel method gets a lower false alarm probability comparing with the direct DFT algorithm with no compression. The noise immunity is enhanced
Platform: | Size: 87040 | Author: zohreh | Hits:

[Software Engineeringmatlab_image_processing

Description: mathlab for image processing 2D, DFT, FFT etc.
Platform: | Size: 25600 | Author: Canggih Adiyasa | Hits:

[matlabSynthetic2DFault

Description: 利用傅立叶反变换自动生成随机分形面,可生成各向同性或各向异性的。-Generating the 2D fractal surfaces using inverse DFT method
Platform: | Size: 1024 | Author: 毕丽思 | Hits:

[Software EngineeringGeneratingFPGA-AcceleratedDFTLibraries

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:

[matlabMainCode

Description: matlab code that make an image with capability of rotataing, shifting, .. and compute 2-d DFT.
Platform: | Size: 1024 | Author: ali | Hits:

[Special EffectsDFTin2D

Description: code in visual c++ environment for dft in 2d,
Platform: | Size: 1024 | Author: amann | Hits:

[WaveletWavelets

Description: 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 echies wavelets 2.1 The Daub4 wavelets 2.2 Conservation and compaction of energy 2.3 Other Daubechies wavelets 2.4 Compression of audio signals 2.5 Quantization, entropy, and compression 2.6 Denoising audio signals 2.7 Two-dimensional wavelet transforms 2.8 Compression of images 2.9 Fingerprint compression 2.10 Denoising images 2.11 Some topics in image processing 2.12 Notes and references 3 Frequency analysis 3.1 Discrete Fourier analysis 3.2 Definition of the DFT and its properties 3.3 Frequency description of wavelet analysis 3.4 Correlation and feature detection 3.5 Object detection in 2D images 3.6 Creating scaling signals and wavelets 3.7 Notes and references
Platform: | Size: 4108288 | Author: Rakesh | Hits:

[matlabexample-DFT-2D

Description: example of use DFT 2D in a gray image by matlab
Platform: | Size: 10240 | Author: freezer | Hits:

[Driver DevelopFourierTransform2D_Ni

Description: mpi编程方法,分布式编程,16个CPU进行二维DFT运算,对图像进行处理-We are going to use 16 CPUs in the jinx cluster to performe the 2d DFT using distributed computing
Platform: | Size: 1715200 | Author: 徐青木 | Hits:

[Other用所选项目新建的文件夹

Description: 二维的离散傅立叶变换,写的比较简单,没有给出demo(Two-dimensional discrete Fourier transform, writing is relatively simple, did not give demo)
Platform: | Size: 4096 | Author: tony2014 | Hits:

[Special Effectshuffman coding

Description: 利用霍夫曼编码进行图像压缩处理,此程序为霍夫曼编码的示例(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 into blocks of 8x8 pixels and then transforms these with a 2D Discrete Cosine Transform (DCT), similar to a DFT.)
Platform: | Size: 3072 | Author: Jessicapu | Hits:

[Special Effectswidget

Description: 实现了二维离散傅里叶变换和haar小波变换,附了一些冈萨雷斯教材的图片,做了一个GUI,一些参数可调。对图像处理的初学者应该有所帮助。(The two-dimensional discrete Fourier transform and Haar wavelet transform are realized, and some pictures of Gonzales textbook are attached, and a GUI is made, and some parameters are adjustable. It should be helpful for the beginner of image processing.)
Platform: | Size: 1989632 | Author: 风小麟 | Hits:

CodeBus www.codebus.net