The Multiscale Competitive Code via Sparse Representation for Palmprint Verification

被引:66
作者
Zuo, Wangmeng [1 ]
Lin, Zhouchen [2 ]
Guo, Zhenhua [3 ]
Zhang, David [3 ]
机构
[1] Harbin Inst Technol, Harbin 150001, Peoples R China
[2] Microsoft Res Asia, Beijing 100190, Peoples R China
[3] Hong Kong Polytech Univ, Kowloon, Peoples R China
来源
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2010年
基金
中国国家自然科学基金;
关键词
IDENTIFICATION; ALGORITHM; SCHEME;
D O I
10.1109/CVPR.2010.5539909
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Palm lines are the most important features for palmprint recognition. They are best considered as typical multiscale features, where the principal lines can be represented at a larger scale while the wrinkles at a smaller scale. Motivated by the success of coding-based palmprint recognition methods, this paper investigates a compact representation of multiscale palm line orientation features, and proposes a novel method called the sparse multiscale competitive code (SMCC). The SMCC method first defines a filter bank of second derivatives of Gaussians with different orientations and scales, and then uses the l(1)-norm sparse coding to obtain a robust estimation of the multiscale orientation field. Finally, a generalized competitive code is used to encode the dominant orientation. Experimental results show that the SMCC achieves higher verification accuracy than state-of-the-art palmprint recognition methods, yet uses a smaller template size than other multiscale methods.
引用
收藏
页码:2265 / 2272
页数:8
相关论文
共 31 条
[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]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[3]  
Cands E., 2005, COMMUN PURE APPL MAT, V59
[4]  
Cands E.J., 2005, l1-Magic: Recovery of Sparse Signals via Convex Programming
[5]  
Chu RF, 2007, LECT NOTES COMPUT SC, V4844, P22
[6]  
Garg R., 2009, INT C MACH LEARN 200
[7]   Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm [J].
Gorodnitsky, IF ;
Rao, BD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (03) :600-616
[8]   Palmprint verification using binary orientation co-occurrence vector [J].
Guo, Zhenhua ;
Zhang, David ;
Zhang, Lei ;
Zuo, Wangmeng .
PATTERN RECOGNITION LETTERS, 2009, 30 (13) :1219-1227
[9]   What size test set gives good error rate estimates? [J].
Guyon, I ;
Makhoul, J ;
Schwartz, R ;
Vapnik, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (01) :52-64
[10]  
Han Y., 2008, ICPR 2008