On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
DOI10.1016/J.LAA.2005.06.035zbMATH Open1096.68042OpenAlexW2155981690MaRDI QIDQ2497239FDOQ2497239
Authors: Michal Aharon, Michael Elad, Alfred M. Bruckstein 
Publication date: 4 August 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.06.035
Recommendations
- 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
Information storage and retrieval of data (68P20) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Linear equations (linear algebraic aspects) (15A06) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- $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
- 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
Cited In (15)
- Cardinality minimization, constraints, and regularization: a survey
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- Lower bounds for sparse coding
- A tale of two bases: local-nonlocal regularization on image patches with convolution framelets
- Multi-parameter approaches in image processing
- Nonlinear least squares in \(\mathbb R^{N}\)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Optimal non-linear models for sparsity and sampling
- A hierarchical approach for sparse source blind signal separation problem
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Identifiability of complete dictionary learning
- 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
Uses Software
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)
