Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.neucom.2013.03.028 | Neurocomputing |
Keywords | Field | DocType |
proposed method attempt,original dictionary,input signal,salient signal structure,global sparsity constraint,new method,entire signal set,proposed algorithm,various signal,current method,sparse representation,signal reconstruction | Convergence (routing),Sparse PCA,Coefficient matrix,Pattern recognition,K-SVD,Computer science,Neural coding,Sparse approximation,Artificial intelligence,SIMPLE algorithm,Signal reconstruction,Machine learning | Journal |
Volume | ISSN | Citations |
119, | 0925-2312 | 7 |
PageRank | References | Authors |
0.41 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deyu Meng | 1 | 2025 | 105.31 |
| Qian Zhao | 2 | 303 | 20.84 |
| Yee Leung | 3 | 2081 | 96.44 |
| Zongben Xu | 4 | 3203 | 198.88 |