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)- Lasso-type recovery of sparse representations for high-dimensional data
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- K-hyperline clustering learning for sparse component analysis
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective
- A swapping-based refinement of orthogonal matching pursuit strategies
- A simple test to check the optimality of a sparse signal approximation
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- KFCE: a dictionary generation algorithm for sparse representation
- Nonlinear least squares in \(\mathbb R^{N}\)
- Sparse solutions to underdetermined Kronecker product systems
- Signal recovery under cumulative coherence
- Secure estimation based Kalman filter for cyber-physical systems against sensor attacks
- Equiangular tight frames that contain regular simplices
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data
- PROMP: a sparse recovery approach to lattice-valued signals
- Multi-view low-rank dictionary learning for image classification
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Sparsity and incoherence in orthogonal matching pursuit
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)
- Median filter based compressed sensing model with application to MR image reconstruction
- Signal recovery under mutual incoherence property and oracle inequalities
- Greedy subspace pursuit for joint sparse recovery
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- 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
- Image deblurring with coupled dictionary learning
- Direct sparse deblurring
- Proximity algorithms for the L1/TV image denoising model
- Sparse signal recovery via ECME thresholding pursuits
- Limited-complexity controller tuning: a set membership data-driven approach
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- 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
- A sharp RIP condition for orthogonal matching pursuit
- Stochastic greedy algorithms for multiple measurement vectors
- Evaluating visual properties via robust HodgeRank
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property
- Super-resolution for doubly-dispersive channel estimation
- A forward-backward greedy approach for sparse multiscale learning
- Correlations of random classifiers on large data sets
- Search for sparse solutions of super-large systems with a tensor structure
- Hierarchical compressed sensing
- Angular scattering function estimation using deep neural networks
- Robust and resource-efficient identification of two hidden layer neural networks
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Generalized greedy alternatives
- Adaptive multi-penalty regularization based on a generalized Lasso path
- A smoothing method for sparse optimization over convex sets
- Subspace learning by \(\ell^0\)-induced sparsity
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Fast overcomplete dictionary construction with probabilistic guarantees
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Model selection for high-dimensional linear regression with dependent observations
- Some greedy algorithms for sparse polynomial chaos expansions
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- Matrix recipes for hard thresholding methods
- Spectral compressive sensing
- Geometric separation by single-pass alternating thresholding
- Stable restoration and separation of approximately sparse signals
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Data-driven tight frame construction and image denoising
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Ways to sparse representation: An overview
- Boosting with structural sparsity: a differential inclusion approach
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Distributed compressed sensing based joint detection and tracking for multistatic radar system
- On the differences between \(L_2\) boosting and the Lasso
- A new sparse recovery method for the inverse acoustic scattering problem
- Safe feature elimination for non-negativity constrained convex optimization
- An offline/online procedure for dual norm calculations of parameterized functionals: empirical quadrature and empirical test spaces
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix
- Sparse reconstruction with multiple Walsh matrices
- Block matching video compression based on sparse representation and dictionary learning
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
- Alternating direction method of multipliers for solving dictionary learning models
- Variational texture synthesis with sparsity and spectrum constraints
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
- A sparse recovery method for DOA estimation based on the sample covariance vectors
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Globally sparse and locally dense signal recovery for compressed sensing
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- A simple homotopy proximal mapping algorithm for compressive sensing
- A note on the hardness of sparse approximation
- A note on sparse least-squares regression
- Greedy expansions in Hilbert spaces
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
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)
