Dictionary Learning Algorithms for Sparse Representation
From MaRDI portal
Publication:4408943
DOI10.1162/089976603762552951zbMath1047.68101OpenAlexW2142940228WikidataQ42422516 ScholiaQ42422516MaRDI QIDQ4408943
Kenneth Kreutz-Delgado, Joseph Murray, Bhaskar D. Rao, Te-Won Lee, Terrence J. Sejnowski, Kjersti Engan
Publication date: 2003
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2944020
Related Items
Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data, Low-Rank and Sparse Dictionary Learning, Compressed sensing image restoration based on data-driven multi-scale tight frame, A fast patch-dictionary method for whole image recovery, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, A hierarchical approach for sparse source blind signal separation problem, Sparsity Constrained Estimation in Image Processing and Computer Vision, Mean shift based log-gabor wavelet image coding, Tomographic image reconstruction using training images, Unnamed Item, Analysis of Sparse Representation and Blind Source Separation, Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising, An alternating direction and projection algorithm for structure-enforced matrix factorization, Dictionary Learning for Two-Dimensional Kendall Shapes, Global Optimality in Separable Dictionary Learning with Applications to the Analysis of Diffusion MRI, Model order reduction using sparse coding exemplified for the lid-driven cavity, The decimation scheme for symmetric matrix factorization, A new fast multiphase image segmentation algorithm based on nonconvex regularizer, A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators, Improving the Incoherence of a Learned Dictionary via Rank Shrinkage, Alternating Proximal Regularized Dictionary Learning, Musical audio analysis using sparse representations, Sparsity Promoting Hybrid Solvers for Hierarchical Bayesian Inverse Problems, Efficient histogram dictionary learning for text/image modeling and classification, Kernel sparse representation for time series classification, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Data-driven tight frame construction and image denoising, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning, Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization, Dictionary Learning for L1-Exact Sparse Coding, Learning big (image) data via coresets for dictionaries, Unnamed Item, Sparse Approximation of Overdetermined Systems for Image Retrieval Application, Efficient dictionary learning with sparseness-enforcing projections, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, K-hyperline clustering learning for sparse component analysis, Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals, Compressed dictionary learning, KFCE: a dictionary generation algorithm for sparse representation, Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP, Optimal dictionary for least squares representation, A Tale of Two Bases: Local-Nonlocal Regularization on Image Patches with Convolution Framelets
Cites Work
- Pattern recognition as a quest for minimum entropy
- Independent component analysis, a new concept?
- Blind Source Separation by Sparse Decomposition in a Signal Dictionary
- An affine scaling methodology for best basis selection
- A Variational Method for Learning Sparse and Overcomplete Representations
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- De-noising by soft-thresholding
- The statistics of natural images
- Nonlinear neurons in the low-noise limit: a factorial code maximizes information transfer
- Matching pursuits with time-frequency dictionaries
- Entropy-based algorithms for best basis selection
