Trainlets: Dictionary Learning in High Dimensions

被引:73
作者
Sulam, Jeremias [1 ]
Ophir, Boaz [1 ]
Zibulevsky, Michael [1 ]
Elad, Michael [1 ]
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
基金
欧洲研究理事会;
关键词
Double-sparsity; K-SVD; dictionary learning; cropped wavelet; on-line learning; trainlets; contourlets; K-SVD; SPARSE; TRANSFORM;
D O I
10.1109/TSP.2016.2540599
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sparse representation has shown to be a very powerful model for real world signals, and has enabled the development of applications with notable performance. Combined with the ability to learn a dictionary from signal examples, sparsity-inspired algorithms are often achieving state-of-the-art results in a wide variety of tasks. These methods have traditionally been restricted to small dimensions mainly due to the computational constraints that the dictionary learning problem entails. In the context of image processing, this implies handling small image patches. In this work we show how to efficiently handle bigger dimensions and go beyond the small patches in sparsity-based signal and image processing methods. We build our approach based on a new cropped Wavelet decomposition, which enables a multi-scale analysis with virtually no border effects. We then employ this as the base dictionary within a double sparsity model to enable the training of adaptive dictionaries. To cope with the increase of training data, while at the same time improving the training performance, we present an Online Sparse Dictionary Learning (OSDL) algorithm to train this model effectively, enabling it to handle millions of examples. This work shows that dictionary learning can be up-scaled to tackle a new level of signal dimensions, obtaining large adaptable atoms that we call Trainlets.
引用
收藏
页码:3180 / 3193
页数:14
相关论文
共 50 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
    Aharon, Michal
    Elad, Michael
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2008, 1 (03) : 228 - 247
  • [3] Almeida MSC, 2013, IEEE IMAGE PROC, P582, DOI 10.1109/ICIP.2013.6738120
  • [4] [Anonymous], WAVELET TOUR SIGNAL
  • [5] [Anonymous], 1998, Online Algorithms and Stochastic Approximations
  • [6] Benoit L., 2011, 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), P2913, DOI 10.1109/CVPR.2011.5995636
  • [7] Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance
    Blumensath, Thomas
    Davies, Mike E.
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2010, 4 (02) : 298 - 309
  • [8] Iterative Thresholding for Sparse Approximations
    Blumensath, Thomas
    Davies, Mike E.
    [J]. JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2008, 14 (5-6) : 629 - 654
  • [9] From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
    Bruckstein, Alfred M.
    Donoho, David L.
    Elad, Michael
    [J]. SIAM REVIEW, 2009, 51 (01) : 34 - 81
  • [10] Compression of facial images using the K-SVD algorithm
    Bryt, Ori
    Elad, Michael
    [J]. JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2008, 19 (04) : 270 - 282