Greed is Good: Algorithmic Results for Sparse Approximation

DOI10.1109/TIT.2004.834793zbMATH Open1288.94019WikidataQ59750826 ScholiaQ59750826MaRDI QIDQ3547716FDOQ3547716

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Algorithms for simultaneous sparse approximation. I: Greedy pursuit
Greedy approximation
The exact recovery of sparse signals via orthogonal matching pursuit
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)

Cited In (only showing first 100 items - show all)

``Grouping strategies and thresholding for high dimensional linear models: discussion
Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
PROMP: a sparse recovery approach to lattice-valued signals
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
Frame permutation quantization
Error estimates for orthogonal matching pursuit and random dictionaries
A simple test to check the optimality of a sparse signal approximation
Optimization over finite frame varieties and structured dictionary design
Sparse conjugate directions pursuit with application to fixed-size kernel models
Geometric separation by single-pass alternating thresholding
Stability and robustness of weak orthogonal matching pursuits
Directional Haar wavelet frames on triangles
Nonconvex sorted \(\ell_1\) minimization for sparse approximation
One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
Independent Component Analysis and Blind Signal Separation
Highly sparse representations from dictionaries are unique and independent of the sparseness measure
Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
Enhancing sparsity of Hermite polynomial expansions by iterative rotations
Source localization using a sparse representation framework to achieve superresolution
Compressive sensing of analog signals using discrete prolate spheroidal sequences
Nonlinear least squares in \(\mathbb R^{N}\)
Analysis of basis pursuit via capacity sets
On some deterministic dictionaries supporting sparsity
Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
New cyclic sparsity measures for deconvolution based on convex relaxation
Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
Sparse recovery via differential inclusions
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
Optimization methods for synthetic aperture radar imaging
Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
Sparse reconstruction with multiple Walsh matrices
Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
Deterministic construction of sparse binary matrices via incremental integer optimization
Orthogonal matching pursuit under the restricted isometry property
A new sparse recovery method for the inverse acoustic scattering problem
Sparse dual frames and dual Gabor functions of minimal time and frequency supports
Morphological Diversity and Sparsity in Blind Source Separation
Fast overcomplete dictionary construction with probabilistic guarantees
Fast thresholding algorithms with feedbacks for sparse signal recovery
Solving basis pursuit: heuristic optimality check and solver comparison
Signal recovery under mutual incoherence property and oracle inequalities
Lattices from equiangular tight frames
Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
A sparse recovery method for DOA estimation based on the sample covariance vectors
Rodeo: Sparse, greedy nonparametric regression
Gradient-based method with active set strategy for \(\ell _1\) optimization
Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R
A modified greedy analysis pursuit algorithm for the cosparse analysis model
Sparse signal recovery using a new class of random matrices
A sharp RIP condition for orthogonal matching pursuit
Greedy approach to sparse multi-path channel estimation using sensing dictionary
Average Performance of the Sparsest Approximation Using a General Dictionary
Compressed sensing for quaternionic signals
Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
Globally sparse and locally dense signal recovery for compressed sensing
Sparse approximate solution of partial differential equations
Modeling of electric disturbance signals using damped sinusoids via atomic decompositions and its applications
Greedy subspace pursuit for joint sparse recovery
A remark on joint sparse recovery with OMP algorithm under restricted isometry property
Signal recovery under cumulative coherence
On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
A theoretical study of compressed solving for advection-diffusion-reaction problems
A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
A swapping-based refinement of orthogonal matching pursuit strategies
Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Secure estimation based Kalman filter for cyber-physical systems against sensor attacks
A tight bound of hard thresholding
When do stepwise algorithms meet subset selection criteria?
New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
Frames for compressed sensing using coherence
Fixed-size confidence regions in high-dimensional sparse linear regression models
Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
GPU accelerated greedy algorithms for compressed sensing
Variational approximation for heteroscedastic linear models and matching pursuit algorithms
Average performance of the approximation in a dictionary using an \(\ell _0\) objective
Resolution analysis of imaging with \(\ell_1\) optimization
Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data
Multi-view low-rank dictionary learning for image classification
Book Review: A mathematical introduction to compressive sensing
A Greedy Algorithm for Sparse Precision Matrix Approximation
Column subset selection via sparse approximation of SVD
Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
Sparse solutions to underdetermined Kronecker product systems
Theoretical guarantees for graph sparse coding
Orthogonal rank-one matrix pursuit for low rank matrix completion
An alternating direction and projection algorithm for structure-enforced matrix factorization
Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
Inverse point source location with the Helmholtz equation on a bounded domain
Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
Measurement matrix design for CS-MIMO radar using multi-objective optimization
The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
Sparse approximation over the cube
On reconstructing functions from binary measurements
On the sparsity of Lasso minimizers in sparse data recovery
Sparse signals recovery from noisy measurements by orthogonal matching pursuit
Equiangular tight frames and unistochastic matrices

This page was built for publication: Greed is Good: Algorithmic Results for Sparse Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547716)