An efficient algorithm for learning dictionary under coherence constraint
Summary: Dictionary learning problem has become an active topic for decades. Most existing learning methods train the dictionary to adapt to a particular class of signals. But as the number of the dictionary atoms is increased to represent the signals much more sparsely, the coherence between the atoms becomes higher. According to the greedy and compressed sensing theories, this goes against the implementation of sparse coding. In this paper, a novel approach is proposed to learn the dictionary that minimizes the sparse representation error according to the training signals with the coherence taken into consideration. The coherence is constrained by making the Gram matrix of the desired dictionary approximate to an identity matrix of proper dimension. The method for handling the proposed model is mainly based on the alternating minimization procedure and, in each step, the closed-form solution is derived. A series of experiments on synthetic data and audio signals is executed to demonstrate the promising performance of the learnt incoherent dictionary and the superiority of the learning method to the existing ones.
- An incoherent dictionary learning method with border condition constrained for sparse representation
- Improving the incoherence of a learned dictionary via rank shrinkage
- Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation
- A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
- Dictionary Learning Algorithms for Sparse Representation
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
- Dictionary-based image denoising by fused-lasso atom selection
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- On Projection Matrix Optimization for Compressive Sensing Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Parametric Dictionary Design for Sparse Coding
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Dictionary evaluation and optimization for sparse coding based speech processing
- Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation
- Sparsity and nullity: paradigms for analysis dictionary learning
- An incoherent dictionary learning method with border condition constrained for sparse representation
- Learning: Wavelet-dictionaries and continuous dictionaries.
- Correlation Based Online Dictionary Learning Algorithm
- scientific article; zbMATH DE number 6129722 (Why is no real title available?)
- Learning overcomplete, low coherence dictionaries with linear inference
- A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
- Improving the incoherence of a learned dictionary via rank shrinkage
- The sample complexity of dictionary learning
This page was built for publication: An efficient algorithm for learning dictionary under coherence constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793336)
