Greed is Good: Algorithmic Results for Sparse Approximation
From MaRDI portal
Publication:3547716
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
Cited in
(only showing first 100 items - show all)- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Average Performance of the Sparsest Approximation Using a General Dictionary
- A simple test to check the optimality of a sparse signal approximation
- ``Grouping strategies and thresholding for high dimensional linear models: discussion
- Stability and robustness of weak orthogonal matching pursuits
- A sharp RIP condition for orthogonal matching pursuit
- Optimization methods for synthetic aperture radar imaging
- PROMP: a sparse recovery approach to lattice-valued signals
- Greedy approach to sparse multi-path channel estimation using sensing dictionary
- A sparse recovery method for DOA estimation based on the sample covariance vectors
- Deterministic construction of sparse binary matrices via incremental integer optimization
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Orthogonal matching pursuit under the restricted isometry property
- Optimization over finite frame varieties and structured dictionary design
- Sparse conjugate directions pursuit with application to fixed-size kernel models
- Directional Haar wavelet frames on triangles
- Nonlinear least squares in \(\mathbb R^{N}\)
- Frame permutation quantization
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Solving basis pursuit: heuristic optimality check and solver comparison
- 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
- Fast overcomplete dictionary construction with probabilistic guarantees
- Signal recovery under mutual incoherence property and oracle inequalities
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
- Rodeo: Sparse, greedy nonparametric regression
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Morphological Diversity and Sparsity in Blind Source Separation
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- A new sparse recovery method for the inverse acoustic scattering problem
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Sparse reconstruction with multiple Walsh matrices
- Sparse signal recovery using a new class of random matrices
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Compressed sensing for quaternionic signals
- Lattices from equiangular tight frames
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
- Independent Component Analysis and Blind Signal Separation
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Error estimates for orthogonal matching pursuit and random dictionaries
- Geometric separation by single-pass alternating thresholding
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Source localization using a sparse representation framework to achieve superresolution
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Theory and applications of compressed sensing
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Compressive Sensing
- Variational texture synthesis with sparsity and spectrum constraints
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Simultaneous image fusion and demosaicing via compressive sensing
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Stability Selection
- On Lebesgue-type inequalities for greedy approximation
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Direct sparse deblurring
- Robust classifier using distance-based representation with square weights
- A new computational method for the sparsest solutions to systems of linear equations
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Autoregressive process modeling via the Lasso procedure
- The geometry of off-the-grid compressed sensing
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Robustness of orthogonal matching pursuit under restricted isometry property
- Sparse representations and approximation theory
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Some greedy algorithms for sparse polynomial chaos expansions
- On the existence of equiangular tight frames
- Iterative thresholding for sparse approximations
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Lasso-type recovery of sparse representations for high-dimensional data
- Restricted isometries for partial random circulant matrices
- Convolutional neural networks analyzed via convolutional sparse coding
- On greedy algorithms for dictionaries with bounded cumulative coherence
- K-hyperline clustering learning for sparse component analysis
- Sparse microwave imaging: principles and applications
- Compressed sensing with coherent and redundant dictionaries
- Statistical significance in high-dimensional linear models
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- On performance of greedy algorithms
- Spectral compressive sensing
- Microlocal analysis of the geometric separation problem
- Matrix recipes for hard thresholding methods
- Two are better than one: fundamental parameters of frame coherence
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)
