Ways to sparse representation: An overview
From MaRDI portal
Publication:2267103
Recommendations
- A regularized sparse representation method
- Sparse representations and approximation theory
- Sparse representation, modeling and learning in visual recognition. Theory, algorithms and applications
- Preface: Sparse representations with applications in imaging science, data analysis and beyond
- On the Minimal Overcompleteness Allowing Universal Sparse Representation
- Sparse and redundant representations. From theory to applications in signal and image processing.
- A selective overview of sparse sufficient dimension reduction
- Sparse Representation With Kernels
Cites work
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A generalized uncertainty principle and sparse representation in pairs of bases
- A new approach to variable selection in least squares problems
- An EM algorithm for wavelet-based image restoration
- An affine scaling methodology for best basis selection
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- De-noising by soft-thresholding
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Fast matching pursuit with a multiscale dictionary of Gaussian chirps
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy Basis Pursuit
- Iterative thresholding for sparse approximations
- Iteratively solving linear inverse problems under general convex constraints
- Least angle regression. (With discussion)
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse representations in unions of bases
- Stable recovery of sparse overcomplete representations in the presence of noise
- The problem of sparse image coding
- Tree-Based Pursuit: Algorithm and Properties
- Uncertainty principles and ideal atomic decomposition
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(8)- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- A regularized sparse representation method
- Independent Component Analysis and Blind Signal Separation
- Tensor least angle regression for sparse representations of multidimensional signals
- Robust latent nonnegative matrix factorization with automatic sparse reconstruction for unsupervised feature extraction
- Large-scale hyperspectral image compression via sparse representations based on online learning
- Discrete chirp-Fourier transform and its application to chirp rate estimation
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging
This page was built for publication: Ways to sparse representation: An overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267103)