1 June 2009 Competitive code-based fast palmprint identification using a set of cover trees
Author Affiliations +
Abstract
A palmprint identification system recognizes a query palmprint image by searching for its nearest neighbor from among all the templates in a database. When applied on a large-scale identification system, it is often necessary to speed up the nearest-neighbor searching process. We use competitive code, which has very fast feature extraction and matching speed, for palmprint identification. To speed up the identification process, we extend the cover tree method and propose to use a set of cover trees to facilitate the fast and accurate nearest-neighbor searching. We can use the cover tree method because, as we show, the angular distance used in competitive code can be decomposed into a set of metrics. Using the Hong Kong PolyU palmprint database (version 2) and a large-scale palmprint database, our experimental results show that the proposed method searches for nearest neighbors faster than brute force searching.
© (2009) Society of Photo-Optical Instrumentation Engineers (SPIE)
Feng Yue, Feng Yue, Wangmeng Zuo, Wangmeng Zuo, David Zhang, David Zhang, Kuanquan Wang, Kuanquan Wang, } "Competitive code-based fast palmprint identification using a set of cover trees," Optical Engineering 48(6), 067204 (1 June 2009). https://doi.org/10.1117/1.3156846 . Submission:
JOURNAL ARTICLE
7 PAGES


SHARE
RELATED CONTENT


Back to Top