Competitive code-based fast palmprint identification using a set of cover trees

Feng Yue, Wangmeng Zuo, Dapeng Zhang, Kuanquan Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)


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,
Original languageEnglish
Article number067204
JournalOptical Engineering
Issue number6
Publication statusPublished - 12 Oct 2009


  • Competitive code
  • Cover tree
  • Metric
  • Palmprint identification

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics
  • Engineering(all)

Cite this