On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them

DOI10.1016/j.laa.2005.06.035zbMath1096.68042OpenAlexW2155981690MaRDI QIDQ2497239

Michal Aharon, Michael Elad, Alfred Marcel 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

zbMATH Keywords

vector quantizationsparse representationK-meansmatching pursuit

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Information storage and retrieval of data (68P20) Linear equations (linear algebraic aspects) (15A06)

Related Items

Example-based single document image super-resolution: a global MAP approach with outlier rejection, A hierarchical approach for sparse source blind signal separation problem, Unnamed Item, $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials, Unnamed Item, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, Optimal non-linear models for sparsity and sampling, A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models, Lower Bounds for Sparse Coding, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Nonlinear least squares in \(\mathbb R^{N}\), A Tale of Two Bases: Local-Nonlocal Regularization on Image Patches with Convolution Framelets, Identifiability of Complete Dictionary Learning

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the stability of the basis pursuit in the presence of noise
• Grassmannian frames with applications to coding and communication
• Multi-frame compression: theory and design.
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
• Atomic Decomposition by Basis Pursuit
• An affine scaling methodology for best basis selection
• The curvelet transform for image denoising
• Image decomposition via the combination of sparse representations and a variational approach
• On Sparse Representations in Arbitrary Redundant Bases
• Stable recovery of sparse overcomplete representations in the presence of noise
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Orthogonal least squares methods and their application to non-linear system identification
• Dictionary Learning Algorithms for Sparse Representation
• Uncertainty principles and ideal atomic decomposition
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A generalized uncertainty principle and sparse representation in pairs of bases
• Matching pursuits with time-frequency dictionaries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Adaptive greedy approximations