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)- When do stepwise algorithms meet subset selection criteria?
- Theory and applications of compressed sensing
- Off-the-grid prediction and testing for linear combination of translated features
- Sparse set membership identification of nonlinear functions and application to fault detection
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Robustness of orthogonal matching pursuit under restricted isometry property
- On linguistic variables and sparse representations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- Smooth sparse coding via marginal regression for learning sparse representations
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Source localization using a sparse representation framework to achieve superresolution
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Alternating direction method of multipliers for solving dictionary learning models
- Proximity algorithms for the L1/TV image denoising model
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Tensor least angle regression for sparse representations of multidimensional signals
- Two are better than one: fundamental parameters of frame coherence
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- Nonlinear adaptive filtering using kernel-based algorithms with dictionary adaptation
- Frames for compressed sensing using coherence
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Stochastic greedy algorithms for multiple measurement vectors
- Stable restoration and separation of approximately sparse signals
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Inferring Sparse Preference Lists from Partial Information
- Weak-type estimates for the metaplectic representation restricted to the shearing and dilation subgroup of \(\mathrm{SL}(2,\mathbb{R})\)
- Fixed-size confidence regions in high-dimensional sparse linear regression models
- On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs
- 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
- On sparsity‐inducing methods in system identification and state estimation
- Compressed sensing and dynamic mode decomposition
- A class of deterministic sensing matrices and their application in harmonic detection
- Adaptive frame methods for nonlinear variational problems
- A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization
- A tree-based dictionary learning framework
- Beyond coherence: Recovering structured time-frequency representations
- A weighted difference of anisotropic and isotropic total variation for relaxed Mumford-Shah color and multiphase image segmentation
- Some results on OMP algorithm for MMV problem
- Compressed sensing with coherent and redundant dictionaries
- GPU accelerated greedy algorithms for compressed sensing
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Variational approximation for heteroscedastic linear models and matching pursuit algorithms
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- Deterministic convolutional compressed sensing matrices
- Optimization methods for synthetic aperture radar imaging
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
- Restricted isometries for partial random circulant matrices
- Optimal non-linear models for sparsity and sampling
- Learning circulant sensing kernels
- An outlier detection and recovery method based on moving least squares quasi-interpolation scheme and \(\text{ł}_0\)-minimization problem
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
- Sparse reconstruction with multiple Walsh matrices
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- Microlocal analysis of the geometric separation problem
- A multiple measurement vector approach to synthetic aperture radar imaging
- When does OMP achieve exact recovery with continuous dictionaries?
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
- Point source super-resolution via non-convex \(L_1\) based methods
- 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
- Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data
- Multi-view low-rank dictionary learning for image classification
- Resolution analysis of imaging with \(\ell_1\) optimization
- An introduction to compressed sensing
- Book Review: A mathematical introduction to compressive sensing
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Orthogonal matching pursuit under the restricted isometry property
- Column subset selection via sparse approximation of SVD
- Deterministic construction of sparse binary matrices via incremental integer optimization
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Improving the incoherence of a learned dictionary via rank shrinkage
- Evaluating visual properties via robust HodgeRank
- Piecewise sparse recovery in union of bases
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Sparse approximation is provably hard under coherent dictionaries
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Robust classifier using distance-based representation with square weights
- Data-driven tight frame construction and image denoising
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
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)
