Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
From MaRDI portal
Publication:1029548
DOI10.1007/s10208-007-9005-xzbMath1165.94314arXivmath/0604429OpenAlexW2163985430MaRDI QIDQ1029548
Publication date: 13 July 2009
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0604429
thresholdinggreedy algorithmsorthogonal matching pursuit (OMP)reconstruction of sparse multivariate trigonometric polynomials
Convex programming (90C25) Linear programming (90C05) Random matrices (algebraic aspects) (15B52) Sampling theory in information and communication theory (94A20) Trigonometric polynomials, inequalities, extremal problems (42A05)
Related Items
Improved sparse Fourier approximation results: Faster implementations and stronger guarantees, Sparse high-dimensional FFT based on rank-1 lattice sampling, Reconstruction of sparse Legendre and Gegenbauer expansions, Random sampling of sparse trigonometric polynomials, Sparse approximate solution of fitting surface to scattered points by MLASSO model, Robust sparse phase retrieval made easy, Waveform design and high-resolution imaging of cognitive radar based on compressive sensing, High-dimensional sparse FFT based on sampling along multiple rank-1 lattices, Parameter estimation for nonincreasing exponential sums by Prony-like methods, Remote sensing via \(\ell_1\)-minimization, Robust visual tracking with structured sparse representation appearance model, Deterministic sampling of sparse trigonometric polynomials, Three deterministic constructions of compressed sensing matrices with low coherence, Sparsity and incoherence in orthogonal matching pursuit, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, Sparse approximation of fitting surface by elastic net, Meshless Hermite-HDMR finite difference method for high-dimensional Dirichlet problems, Sparsity in time-frequency representations, Sparse approximate solution of partial differential equations, Combinatorial sublinear-time Fourier algorithms, Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection, Sliding-MOMP based channel estimation scheme for ISDB-T systems, Extending linear relaxation for non-square matrices and soft constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability against condition number and sampling of multivariate trigonometric random polynomials
- Random sampling of sparse trigonometric polynomials
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
- Combinatorics of random processes and sections of convex bodies
- On the conditioning of random subdictionaries
- On the stability of the basis pursuit in the presence of noise
- A simple proof of the restricted isometry property for random matrices
- Frame expansions with erasures: an approach through the non-commutative operator theory
- Weak convergence and empirical processes. With applications to statistics
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- Probability Inequalities for the Sum of Independent Random Variables
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Near-optimal sparse fourier representations via sampling
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Atomic Decomposition by Basis Pursuit
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Random Sampling of Multivariate Trigonometric Polynomials
- Randomized Interpolation and Approximation of Sparse Polynomials
- Best Constants in Kahane-Khintchine Inequalities for Complex Steinhaus Functions
- Matching pursuits with time-frequency dictionaries
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
