Multimodal Task-Driven Dictionary Learning for Image Classification

被引:128
作者
Bahrampour, Soheil [1 ,2 ]
Nasrabadi, Nasser M. [3 ,4 ]
Ray, Asok [1 ]
Jenkins, William Kenneth [1 ]
机构
[1] Penn State Univ, Dept Elect Engn, University Pk, PA 16802 USA
[2] Bosch Res & Technol Ctr, Palo Alto, CA 94304 USA
[3] US Army, Res Lab, Adelphi, MD 20783 USA
[4] W Virginia Univ, Comp Sci & Elect Engn Dept, Morgantown, WV 26506 USA
基金
美国国家科学基金会;
关键词
Dictionary learning; multimodal classification; sparse representation; feature fusion; SPARSE REPRESENTATION; ACTION RECOGNITION; K-SVD; SELECTION; MODEL;
D O I
10.1109/TIP.2015.2496275
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages of feature-level fusion based on the joint sparse representation of the multimodal inputs. In this paper, we propose a multimodal task-driven dictionary learning algorithm under the joint sparsity constraint (prior) to enforce collaborations among multiple homogeneous/heterogeneous sources of information. In this task-driven formulation, the multimodal dictionaries are learned simultaneously with their corresponding classifiers. The resulting multimodal dictionaries can generate discriminative latent features (sparse codes) from the data that are optimized for a given task such as binary or multiclass classification. Moreover, we present an extension of the proposed formulation using a mixed joint and independent sparsity prior, which facilitates more flexible fusion of the modalities at feature level. The efficacy of the proposed algorithms for multimodal classification is illustrated on four different applications-multimodal face recognition, multi-view face recognition, multi-view action recognition, and multimodal biometric recognition. It is also shown that, compared with the counterpart reconstructive-based dictionary learning algorithms, the task-driven formulations are more computationally efficient in the sense that they can be equipped with more compact dictionaries and still achieve superior performance.
引用
收藏
页码:24 / 38
页数:15
相关论文
共 72 条
  • [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] [Anonymous], 2006, Journal of the Royal Statistical Society, Series B
  • [4] [Anonymous], P 1 IEEE INT C BIOM, DOI [10.1109/BTAS.2007.4401919, DOI 10.1109/BTAS.2007.4401919]
  • [5] [Anonymous], 2013, AAAI C ART INT
  • [6] [Anonymous], 2010, PROC CVPR IEEE, DOI DOI 10.1109/CVPR.2010.5539963
  • [7] Bagnell JAndrew., 2009, Advances in neural information processing systems, P113
  • [8] Quality-based Multimodal Classification Using Tree-Structured Sparsity
    Bahrampour, Soheil
    Ray, Asok
    Nasrabadi, Nasser M.
    Jenkins, Kenneth W.
    [J]. 2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, : 4114 - 4121
  • [9] Bishop C., 2006, Pattern recognition and machine learning, P423
  • [10] The relation between the ROC curve and the CMC
    Bolle, RM
    Connell, JH
    Pankanti, S
    Ratha, NK
    Senior, AW
    [J]. FOURTH IEEE WORKSHOP ON AUTOMATIC IDENTIFICATION ADVANCED TECHNOLOGIES, PROCEEDINGS, 2005, : 15 - 20