Learning dictionary from signals under global sparsity constraint
MetadataShow full item record
A new method is proposed in this paper to learn overcomplete dictionary from signals. Differing from the current methods that enforce uniform sparsity constraint on the coefficients of each input signal, the proposed method attempts to impose global sparsity constraint on the coefficient matrix of the entire signal set. This enables the proposed method to fittingly assign the atoms of the dictionary to represent various signals and optimally adapt to the complicated structures underlying the entire signal set. By virtue of the sparse coding and sparse PCA techniques, a simple algorithm is designed for the implementation of the method. The efficiency and the convergence of the proposed algorithm are also theoretically analyzed. Based on the experimental results implemented on a series of signal and image data sets, the capability of the proposed method is substantiated in original dictionary recovering, signal reconstructing and salient signal structure revealing. © 2013 Elsevier B.V.
Showing items related by title, author, creator and subject.
Zhang, Xinguang; Ling, B.; Lun, D.; Cao, J.; Dai, Q. (2017)© 2016, Springer Science+Business Media New York.Discrete fractional Fourier transform (DFrFT) is a powerful signal processing tool. This paper proposes a method for DFrFT-based image retrieval via Fisher discriminant and ...
Shang, K.; Huang, Z.; Liu, Wan-Quan; Li, Z. (2018)© 2017 Elsevier Inc. For many practical face recognition problems, such as law enforcement, e-passport, ID card identification, and video surveillance, there is usually only a single sample per person enrolled for training, ...
Liu, J.; Liu, Wan-Quan; Li, Q.; Ma, S.; Chen, G. (2016)The K-SVD algorithm is a powerful tool in finding an adaptive dictionary for a set of signals via using the sparse representation optimization and constrained singular value decomposition. In this paper, we first review ...