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)

Multi-layer sparse coding: the holistic way
Correlations of random classifiers on large data sets
Search for sparse solutions of super-large systems with a tensor structure
Angular scattering function estimation using deep neural networks
Hierarchical compressed sensing
Model selection for high-dimensional linear regression with dependent observations
Robust and resource-efficient identification of two hidden layer neural networks
Title not available (Why is that?)
Limited-complexity controller tuning: a set membership data-driven approach
An automatic and parameter-free information-based method for sparse representation in wavelet bases
A performance guarantee for orthogonal matching pursuit using mutual coherence
Running time analysis of the (1+1)-EA for robust linear optimization
Analysis of the self projected matching pursuit algorithm
On collaborative compressive sensing systems: the framework, design, and algorithm
Greedy expansions in Hilbert spaces
Boosting with structural sparsity: a differential inclusion approach
Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
A generalized class of hard thresholding algorithms for sparse signal recovery
A component Lasso
Sparse set membership identification of nonlinear functions and application to fault detection
A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
Alternating direction method of multipliers for solving dictionary learning models
Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
Stochastic greedy algorithms for multiple measurement vectors
On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs
Stable restoration and separation of approximately sparse signals
A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization
Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization
Beyond coherence: Recovering structured time-frequency representations
Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
A multiple measurement vector approach to synthetic aperture radar imaging
Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
An efficient algorithm for learning dictionary under coherence constraint
An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation
Improving the incoherence of a learned dictionary via rank shrinkage
Evaluating visual properties via robust HodgeRank
Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
Adaptive multi-penalty regularization based on a generalized Lasso path
Image deblurring with coupled dictionary learning
A survey on compressive sensing: classical results and recent advancements
Efficiency of orthogonal super greedy algorithm under the restricted isometry property
Sparse signal recovery via ECME thresholding pursuits
Super-resolution for doubly-dispersive channel estimation
Iterative positive thresholding algorithm for non-negative sparse optimization
A review on restoration of seismic wavefields based on regularization and compressive sensing
A smoothing method for sparse optimization over convex sets
A forward-backward greedy approach for sparse multiscale learning
Subspace learning by \(\ell^0\)-induced sparsity
Feature selection by canonical correlation search in high-dimensional multiresponse models with complex group structures
Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
Sparse Bayesian imaging of solar flares
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)