Learning oriented dictionary for sparse image representation

A novel oriented dictionary is proposed for sparse image representation. The scheme of dictionary learning combines the double sparsity model and the zero-tree structure in the wavelet domain. The dictionary atoms are constructed by grouping the wavelet bases in all high-frequency subbands of the same orientation across different scales. This scheme overcomes the limit on the input signal dimension as well as the over-fitting problem. We demonstrate the potential of the proposed dictionary for M-term approximation of fingerprint images.

[1]  M. Lustig,et al.  Multi-Scale Dictionary Learning Using Wavelets , 2011, IEEE Journal of Selected Topics in Signal Processing.

[2]  Michael Elad,et al.  Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation , 2010, IEEE Transactions on Signal Processing.

[3]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[4]  S. Shankar Sastry,et al.  Generalized principal component analysis (GPCA) , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[6]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[7]  Zhifeng Zhang,et al.  Adaptive time-frequency decompositions , 1994 .

[8]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[9]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[10]  Jerome M. Shapiro Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..