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
Asymptotic properties of Lasso+mLS and Lasso+Ridge in sparse high-dimensional linear regression
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
Greedy subspace pursuit for joint sparse recovery
A remark on joint sparse recovery with OMP algorithm under restricted isometry property
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

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)