Greed is Good: Algorithmic Results for Sparse Approximation
From MaRDI portal
Publication:3547716
DOI10.1109/TIT.2004.834793zbMATH Open1288.94019WikidataQ59750826 ScholiaQ59750826MaRDI QIDQ3547716FDOQ3547716
Authors: Joel A. Tropp
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 ℓ 1 minimization
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
- Compressive Sensing
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Nomonotone spectral gradient method for sparse recovery
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- Variational texture synthesis with sparsity and spectrum constraints
- \(\mathrm{L_1RIP}\)-based robust compressed sensing
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sparse representations and approximation theory
- Some greedy algorithms for sparse polynomial chaos expansions
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Simultaneous image fusion and demosaicing via compressive sensing
- Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling
- A note on the complexity of \(L _{p }\) minimization
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- On Lebesgue-type inequalities for greedy approximation
- Iterative thresholding for sparse approximations
- Ways to sparse representation: An overview
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Convolutional neural networks analyzed via convolutional sparse coding
- Phase transitions for greedy sparse approximation algorithms
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On the existence of equiangular tight frames
- Spectral compressive sensing
- Theory and applications of compressed sensing
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Robustness of orthogonal matching pursuit under restricted isometry property
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Smooth sparse coding via marginal regression for learning sparse representations
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Proximity algorithms for the L1/TV image denoising model
- Two are better than one: fundamental parameters of frame coherence
- Compressed sensing and dynamic mode decomposition
- A class of deterministic sensing matrices and their application in harmonic detection
- Compressed sensing with coherent and redundant dictionaries
- Deterministic convolutional compressed sensing matrices
- Matrix sparsification and the sparse null space problem
- Restricted isometries for partial random circulant matrices
- Microlocal analysis of the geometric separation problem
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- Optimal non-linear models for sparsity and sampling
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)