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
- Sparse solutions to underdetermined Kronecker product systems
- When do stepwise algorithms meet subset selection criteria?
- A tight bound of hard thresholding
- Generalized greedy alternatives
- Theoretical guarantees for graph sparse coding
- Secure estimation based Kalman filter for cyber-physical systems against sensor attacks
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Column subset selection via sparse approximation of SVD
- A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
- Book Review: A mathematical introduction to compressive sensing
- On the sparsity of Lasso minimizers in sparse data recovery
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Inverse point source location with the Helmholtz equation on a bounded domain
- Measurement matrix design for CS-MIMO radar using multi-objective optimization
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Sparsity and incoherence in orthogonal matching pursuit
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Distributed compressed sensing based joint detection and tracking for multistatic radar system
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- GPU accelerated greedy algorithms for compressed sensing
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Variational approximation for heteroscedastic linear models and matching pursuit algorithms
- Signal recovery under cumulative coherence
- A swapping-based refinement of orthogonal matching pursuit strategies
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective
- An offline/online procedure for dual norm calculations of parameterized functionals: empirical quadrature and empirical test spaces
- 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
- Sparse approximation over the cube
- \(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Two new lower bounds for the spark of a matrix
- Sparse approximate solution of partial differential equations
- On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
- Fixed-size confidence regions in high-dimensional sparse linear regression models
- Equiangular tight frames that contain regular simplices
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
- Resolution analysis of imaging with \(\ell_1\) optimization
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)
