Fast Discrete Curvelet Transform有正反变换,各个程序里面的参数都有详细的说明.

资 源 简 介

Fast Discrete Curvelet Transform有正反变换,各个程序里面的参数都有详细的说明.

您 可 能 感 兴 趣 的

• Fast Discrete Curvelet Transform有正反变换,各个程序里面的参数都有详细的说明.
• FFTW, a collection of fast C routines to compute the Discrete Fourier Transform in one or more dime
• fast discrete cosin transform
• Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version
• 8点基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Se
• lapped transforms for images. lapped transform is a very fast algorithm to replace dct.
• fast fourior transform
• Fast Hankel Transform Algorithm
• Discrete Fourier Transform and Power Spectrum Calculates Power Spectrum from a Time Series
• oJPEG2000中DWT的MATLAB实现n the use of discrete cosine transform DCT jpeg compression Matlab source, sim