Matrix analysis
A Theory for Multiresolution Signal Decomposition: The Wavelet Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ten lectures on wavelets
Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Hybrid representations for audiophonic signal encoding
Signal Processing - Image and Video Coding beyond Standards
Dictionary learning algorithms for sparse representation
Neural Computation
Efficient Coding of Time-Relative Structure Using Spikes
Neural Computation
Learning Overcomplete Representations
Neural Computation
Digital Signal Processing
Method of optimal directions for frame design
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
SIAM Journal on Numerical Analysis
Surrogate maximization/minimization algorithms and extensions
Machine Learning
Dictionary learning for L1-exact sparse coding
ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
IEEE Transactions on Signal Processing
On the use of a priori information for sparse signal approximations
IEEE Transactions on Signal Processing
Sparse solutions to linear inverse problems with multiple measurement vectors
IEEE Transactions on Signal Processing
A generalized uncertainty principle and sparse representation in pairs of bases
IEEE Transactions on Information Theory
Sparse representations in unions of bases
IEEE Transactions on Information Theory
Majorization–Minimization Algorithms for Wavelet-Based Image Restoration
IEEE Transactions on Image Processing
Parametric dictionary design for sparse coding
IEEE Transactions on Signal Processing
Compressive sensing of streams of pulses
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Adaptive compressed sensing of speech signal based on data-driven dictionary
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Learning sparse representation using iterative subspace identification
IEEE Transactions on Signal Processing
Recursive least squares dictionary learning algorithm
IEEE Transactions on Signal Processing
Dictionary learning for sparse representations: a Pareto curve root finding approach
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Dictionary learning based sparse coefficients for audio classification with max and average pooling
Digital Signal Processing
Dictionary learning based impulse noise removal via L1-L1 minimization
Signal Processing
Online dictionary learning algorithm with periodic updates and its application to image denoising
Expert Systems with Applications: An International Journal
| Hi-index | 35.69 |
In order to find sparse approximations of signals, an appropriate generative model for the signal class has to be known. If the model is unknown, it can be adapted using a set of training samples. This paper presents a novel method for dictionary learning and extends the learning problem by introducing different constraints on the dictionary. The convergence of the proposed method to a fixed point is guaranteed, unless the accumulation points form a continuum. This holds for different sparsity measures. The majorization method is an optimization method that substitutes the original objective function with a surrogate function that is updated in each optimization step. This method has been used successfully in sparse approximation and statistical estimation [e.g., expectation-maximization (EM)] problems. This paper shows that the majorization method can be used for the dictionary learning problem too. The proposed method is compared with other methods on both synthetic and real data and different constraints on the dictionary are compared. Simulations show the advantages of the proposed method over other currently available dictionary learning methods not only in terms of average performance but also in terms of computation time.