On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Linear equations (linear algebraic aspects) (15A06) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Information storage and retrieval of data (68P20) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
The authors study the problem of dictionary design for sparse representations. It is proved that the uniqueness of such factorization will be useful to generalise the K-means. The algorithm developed has been validated by numerical experiments. It is also mentioned that the work can be extended for future investigation in the area.
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- On Sparse Representations in Arbitrary Redundant Bases
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Sparse representations in unions of bases
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A generalized uncertainty principle and sparse representation in pairs of bases
- Adaptive greedy approximations
- An affine scaling methodology for best basis selection
- Atomic decomposition by basis pursuit
- Dictionary Learning Algorithms for Sparse Representation
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 724718 (Why is no real title available?)
- scientific article; zbMATH DE number 802858 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Image decomposition via the combination of sparse representations and a variational approach
- Matching pursuits with time-frequency dictionaries
- Multi-frame compression: theory and design.
- On Sparse Representations in Arbitrary Redundant Bases
- On the stability of the basis pursuit in the presence of noise
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Orthogonal least squares methods and their application to non-linear system identification
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Sparse representations in unions of bases
- Stable recovery of sparse overcomplete representations in the presence of noise
- The curvelet transform for image denoising
- Uncertainty principles and ideal atomic decomposition
- Nonlinear least squares in \(\mathbb R^{N}\)
- A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models
- Example-based single document image super-resolution: a global MAP approach with outlier rejection
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- Lower bounds for sparse coding
- A hierarchical approach for sparse source blind signal separation problem
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Identifiability of complete dictionary learning
- (L_r,L_r,1)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- A tale of two bases: local-nonlocal regularization on image patches with convolution framelets
- Cardinality minimization, constraints, and regularization: a survey
- Multi-parameter approaches in image processing
- An over complete deep learning method for inverse problems
- Optimal non-linear models for sparsity and sampling
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
This page was built for publication: On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497239)
