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)- A new computational method for the sparsest solutions to systems of linear equations
- ``Grouping strategies and thresholding for high dimensional linear models: discussion
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- 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
- Compressive Sensing
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Sparse Bayesian imaging of solar flares
- Multi-layer sparse coding: the holistic way
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
- Tensor sparse representation via Einstein product
- Estimation of \(l_0\) norm penalized models: a statistical treatment
- Variational texture synthesis with sparsity and spectrum constraints
- PROMP: a sparse recovery approach to lattice-valued signals
- Correlations of random classifiers on large data sets
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Search for sparse solutions of super-large systems with a tensor structure
- Angular scattering function estimation using deep neural networks
- Hierarchical compressed sensing
- Robust and resource-efficient identification of two hidden layer neural networks
- Model selection for high-dimensional linear regression with dependent observations
- Globally sparse and locally dense signal recovery for compressed sensing
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- \(\mathrm{L_1RIP}\)-based robust compressed sensing
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Fast sparse reconstruction: Greedy inverse scale space flows
- Sparse representations and approximation theory
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Some greedy algorithms for sparse polynomial chaos expansions
- Sparse approximate solution of partial differential equations
- Simultaneous image fusion and demosaicing via compressive sensing
- Modeling of electric disturbance signals using damped sinusoids via atomic decompositions and its applications
- Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Limited-complexity controller tuning: a set membership data-driven approach
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- Frame permutation quantization
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- A note on the complexity of \(L _{p }\) minimization
- Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
- Error estimates for orthogonal matching pursuit and random dictionaries
- A note on the hardness of sparse approximation
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Greedy subspace pursuit for joint sparse recovery
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- 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
- Iterative thresholding for sparse approximations
- 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 Lebesgue-type inequalities for greedy approximation
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Greedy expansions in Hilbert spaces
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
- Ways to sparse representation: An overview
- Geometric separation by single-pass alternating thresholding
- Directional Haar wavelet frames on triangles
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Stability and robustness of weak orthogonal matching pursuits
- Signal recovery under cumulative coherence
- Phase transitions for greedy sparse approximation algorithms
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Convolutional neural networks analyzed via convolutional sparse coding
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- Greedy solution of ill-posed problems: error bounds and exact inversion
- A swapping-based refinement of orthogonal matching pursuit strategies
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
- Identifying the source term in the potential equation with weighted sparsity regularization
- Secure estimation based Kalman filter for cyber-physical systems against sensor attacks
- DCACO: an algorithm for designing incoherent redundant matrices
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Boosting with structural sparsity: a differential inclusion approach
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
- Independent Component Analysis and Blind Signal Separation
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
- On the existence of equiangular tight frames
- A generalized class of hard thresholding algorithms for sparse signal recovery
- Detection of spatially sparse damage using impulse response sensitivity and LASSO regularization
- A component Lasso
- Sparse approximation based on a random overcomplete basis
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Spectral compressive sensing
- A tight bound of hard thresholding
- A sketch-and-select Arnoldi process
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)
