Sparse Representations of Image via Overcomplete Dictionary Learned by Adaptive Non-orthogonal Sparsifying Transform
Contribuinte(s) |
[Unknown] |
---|---|
Data(s) |
01/01/2011
|
Resumo |
How to learn an over complete dictionary for sparse representations of image is an important topic in machine learning, sparse coding, blind source separation, etc. The so-called K-singular value decomposition (K-SVD) method [3] is powerful for this purpose, however, it is too time-consuming to apply. Recently, an adaptive orthogonal sparsifying transform (AOST) method has been developed to learn the dictionary that is faster. However, the corresponding coefficient matrix may not be as sparse as that of K-SVD. For solving this problem, in this paper, a non-orthogonal iterative match method is proposed to learn the dictionary. By using the approach of sequentially extracting columns of the stacked image blocks, the non-orthogonal atoms of the dictionary are learned adaptively, and the resultant coefficient matrix is sparser. Experiment results show that the proposed method can yield effective dictionaries and the resulting image representation is sparser than AOST. |
Identificador | |
Idioma(s) |
eng |
Publicador |
IEEE Xplore |
Relação |
http://dro.deakin.edu.au/eserv/DU:30059210/yang-sparserepresentations-2010.pdf http://dx.doi.org/10.1109/ICINIS.2010.151 |
Direitos |
2011, IEEE |
Palavras-Chave | #K-SVD #non-orthogonal sparsifying transform #overcomplete dictionary #sparse representations |
Tipo |
Conference Paper |