Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

DOI10.1007/s10208-008-9031-3zbMath1183.68739arXiv0707.4203OpenAlexW2099100030MaRDI QIDQ1029209

Publication date: 10 July 2009

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.4203

zbMATH Keywords

sparse signal recovery

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Randomized algorithms (68W20)

Related Items

Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach, Lebesgue-type inequalities in greedy approximation, Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, The time-domain integration method of digital subtraction angiography images, Average Performance of the Sparsest Approximation Using a General Dictionary, Splitting matching pursuit method for reconstructing sparse signal in compressed sensing, Improved sparse Fourier approximation results: Faster implementations and stronger guarantees, Fast Phase Retrieval from Local Correlation Measurements, A survey on compressive sensing: classical results and recent advancements, Deterministic convolutional compressed sensing matrices, Sparse high-dimensional FFT based on rank-1 lattice sampling, Deterministic construction of compressed sensing matrices with characters over finite fields, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Robust sparse phase retrieval made easy, Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain, MIMO radar imaging based on smoothed \(l_0\) norm, Effective band-limited extrapolation relying on Slepian series and \(\ell^1\) regularization, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, \(\mathrm{L_1RIP}\)-based robust compressed sensing, Heuristics for Finding Sparse Solutions of Linear Inequalities, Comparison of parametric sparse recovery methods for ISAR image formation, Iterative hard thresholding for compressed data separation, Restricted isometries for partial random circulant matrices, Unnamed Item, A simple homotopy proximal mapping algorithm for compressive sensing, Deterministic construction of compressed sensing matrices from constant dimension codes, Phase transitions for greedy sparse approximation algorithms, Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements, Improved stability conditions of BOGA for noisy block-sparse signals, Explicit constructions of RIP matrices and related problems, Sparse Approximation by Greedy Algorithms, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Compressive sensing of analog signals using discrete prolate spheroidal sequences, Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, Unnamed Item, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Sparse time-frequency representation of nonlinear and nonstationary data, Robustness of orthogonal matching pursuit under restricted isometry property, Analysis of orthogonal multi-matching pursuit under restricted isometry property, Greedy subspace pursuit for joint sparse recovery, Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing, Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing, An adaptive inverse scale space method for compressed sensing, A Tight Bound of Hard Thresholding, Data-driven time-frequency analysis, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Sparse approximate solution of partial differential equations, Combinatorial sublinear-time Fourier algorithms, Stability and instance optimality for Gaussian measurements in compressed sensing, On performance of greedy algorithms, Large-scale hyperspectral image compression via sparse representations based on online learning, Distributed compressed sensing based joint detection and tracking for multistatic radar system, Peeling decoding of LDPC codes with applications in compressed sensing, Robust detection of neural spikes using sparse coding based features, Iterative hard thresholding for compressed sensing, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), Regularized feature selection in reinforcement learning, Deterministic Construction of Compressed Sensing Matrices from Codes, Deterministic constructions of compressed sensing matrices based on codes, Solving inverse problems using data-driven models, On a simple derivation of the complementary matching pursuit, Alternating direction method of multipliers for solving dictionary learning models, Greedy approximation in convex optimization, Theory and applications of compressed sensing, Orthogonal one step greedy procedure for heteroscedastic linear models, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

Cites Work