A regularized sparse representation method
From MaRDI portal
Recommendations
- Ways to sparse representation: An overview
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Sparse approximate reconstruction decomposed by two optimization problems
- Sparse regularization with the ℓ0 norm
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Cited in
(14)- Ways to sparse representation: An overview
- Model's sparse representation based on reduced mixed GMsFE basis methods
- A criterion for the construction of a regularization function in sparse component analysis
- A New Method Using Table to Sparse Representation in Pairs of Bases with Matching Pursuits
- An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
- Enhancing Sparsity and Resolution via Reweighted Atomic Norm Minimization
- Sparse Signal Approximation via Nonseparable Regularization
- An iteratively reweighted least squares algorithm for sparse regularization
- scientific article; zbMATH DE number 6154260 (Why is no real title available?)
- Sparse Rational Univariate Representation
- Image set face recognition via the mixed _0-norm sparse representation
- scientific article; zbMATH DE number 6404124 (Why is no real title available?)
- Graph Regularized Sparse Coding for Image Representation
- A regularization framework for robust dimensionality reduction with applications to image reconstruction and feature extraction
This page was built for publication: A regularized sparse representation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2992069)
