Multipath Sparse Coding Using Hierarchical Matching Pursuit

被引:116
作者
Bo, Liefeng
Ren, Xiaofeng
Fox, Dieter
机构
来源
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2013年
关键词
ALGORITHM;
D O I
10.1109/CVPR.2013.91
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Complex real-world signals, such as images, contain discriminative structures that differ in many aspects including scale, invariance, and data channel. While progress in deep learning shows the importance of learning features through multiple layers, it is equally important to learn features through multiple paths. We propose Multipath Hierarchical Matching Pursuit (M-HMP), a novel feature learning architecture that combines a collection of hierarchical sparse features for image classification to capture multiple aspects of discriminative structures. Our building blocks are MI-KSVD, a codebook learning algorithm that balances the reconstruction error and the mutual incoherence of the codebook, and batch orthogonal matching pursuit (OMP); we apply them recursively at varying layers and scales. The result is a highly discriminative image representation that leads to large improvements to the state-of-the-art on many standard benchmarks, e. g., Caltech-101, Caltech-256, MIT-Scenes, Oxford-IIIT Pet and Caltech-UCSD Bird-200.
引用
收藏
页码:660 / 667
页数:8
相关论文
共 34 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2011, ICCV
[3]  
[Anonymous], 2011, ICCV
[4]  
[Anonymous], 2012, CVPR
[5]  
[Anonymous], 2012, ICML
[6]  
[Anonymous], 2010, CVPR
[7]  
[Anonymous], 2011, BMVC
[8]  
[Anonymous], 2011, NIPS
[9]  
[Anonymous], 2010, CVPR
[10]  
[Anonymous], 2009, ICML