搜索资源列表
mp_fft.rar
- 利用FFT快速算法来实现二维图像基于匹配追踪算法的稀疏分解。,Fast Algorithm for the use of FFT to achieve two-dimensional image matching tracking algorithm based on sparse decomposition.
cs-code
- 一个正弦波利用DCT，FFT变换后稀疏化，然后应用压缩感知实现压缩，并有仿真图例说明重构效果。重构算法采用线性规划和OMP算法等，是一个初学CS入门的好例子。-A sine wave using DCT, FFT transform sparse, and then apply compressed sensing to achieve compression, and a legend reconstruction simulation results. Reconstruction algo
MP-FFT
- 基于FFT的MP算法（matching pursuit）匹配跟踪，实现信号的稀疏分解-FFT-based MP algorithm (matching pursuit) matching pursuit, sparse decomposition of the signals
compressed-sensing-procedure
- 基于压缩感知的图像处理，分别使用二维DCT、FFT和一维dwt变换对图像信号进行稀疏变换，然后使用正交匹配追踪算法进行重构，在进行相应的逆变换-This is a image processing procedure based on compressed sensing which respectively uses two-dimensional DCT, FFT and one-dimensional dwt transform to sparse the image signal a
CS
- 压缩感知matlab代码，使用FFT进行稀疏分解，OMP算法重建信号-Compressed sensing matlab code, the use of FFT for sparse decomposition, OMP algorithm for signal reconstruction
AAFFT
- 数字信号处理中经典的FFT算法实现，对理解信号处理帮助很大-A Fast Fourier Transform [FFT] method for frequency sparse functions. Recovers the k most energetic frequencies hidden in a bandwidth-N function in k*polylog[N] time.
picture
- 利用FFT快速运算技术来实现在二维图像领域上的稀疏分解过程。-The use of FFT techniques to achieve fast computing in the field of two-dimensional image of the sparse decomposition process.
test_m_fft
- 利用FFT实现基于MP的信号稀疏分解程序-Using FFT-based signal sparse decomposition process MP
sparse_s
- 稀疏信号的生成及cs模型稀疏阵（fft）和生成阵(PHI)的生成，及波形展示-Sparse signal generation and cs model sparse array (fft) and generate array (PHI) generation, and waveform display
FFTinMP
- 本算法是最新FFT用于稀疏分解的快速算法，其中包括了对FFTinMP的计算复杂度的改进。-The FFT algorithm is the latest fast algorithm for sparse decomposition, including the complex calculation of FFTinMP Complex degree of improvement.
FFT
- 本文给出一种时间抽取少数点 递归算法(Recursion Algorithm for Sparse Points - RASP),据此写出的多项式生成程序和直接多项式法 在计算少数点时有很高的效率。 -This paper presents a time to extract a small number of recursive algorithm accordingly write the polynomial generator and direct polynomial
Sparse-decomposition
- 实现信号的稀疏分解，基本的分解，优化为互相关，再优化为fft-Realization of signal sparse decomposition, basic decomposition, optimization of cross-correlation, optimization for FFT
Mixedthreshold_Image-Recovery
- 代码给出了基于混合门限带迭代步长的稀疏图像重构。特别地，压缩采样矩阵为抽样傅里叶变换矩阵，利用2D-FFT,大大降低了计算复杂度。-The mixedthreshold sparse image reconstruction with step is given in the package. In particular， the 2D-FFT is used to disign the sample matrix, which can reduce the computational comp
system-identification
- 采用时频聚集性较好的线性调频信号作为线性时不变系统输入激励，采用Gabor字典作为过完备原子库。在利用传统系统辨识法之前先利用稀疏分解算法将输出信号进行去噪处理，显著提高系统辨识精度。 具体包括互谱算法，信号的Gabor稀疏分解的详细代码-Space can be a time for sparse decomposition to solve the problem of huge memory needed。This approach, combined with the rapid d
sFFT-1.0-2.0.tar
- 洗漱傅里叶变换1.0 2.0 两个版本 C/A码捕获-sparse FFT
Deblur-Algorithm
- 基于稀疏表示的图像模糊复原算法，利用Alternating Method以及FFT变换分别进行稀疏编码和模糊复原，复原图像的效果很好。-An algorithm for image debluring based on sparse represetation. It takes the AM and FFT for sparse coding and debluring respectively. The result get good visualization.
sFFT-1.0-2.0.tar
- 稀疏傅里叶变换算法利用了数字信号处理，特别是高斯和多尔夫-切比雪夫滤波器的技术。与传统的解决方法不同，对于这个问题我们的算法是不迭代的。也就是说，它用一种类似绘制/流式算法的方式“一次”识别并估计k个最大系数，而并非估计“大”系数以及在提示下相减、递归。-Sparse Fast Fourier Transform (SFFT) is a class of sub-linear time algorithms for computing the discrete Fourier transfo
xishu
- 这是一个完整的稀疏分解用于图像去噪的一个压缩文件，而且是一个基于FFT变换的算法(This is a compressed file a complete sparse decomposition for image denoising, and is based on FFT transform algorithm)
SFFT
- 此程序实现了稀疏傅里叶变换全过程,包括频谱重排，窗函数滤波，算法重构(it realizes the sparse fft)
压缩感知
- 本文分别以稀疏基有离散余弦变换基（DCT）和快速傅立叶变换基（FFT）做为稀疏基，高斯随机矩阵、部分哈达玛矩阵为测量矩阵，L1范数、正交匹配追踪算法（OMP）为重建算法进行压缩感知算法实现。(In this paper, DCT and FFT are used as sparse basis, Gauss random matrix and partial Hadamard matrix are used as measurement matrix, L1 norm and OMP are u