Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34930
Title: Competitive code–based fast palmprint identification using a set of cover trees
Authors: Yue, F
Zuo, W
Zhang, D 
Wang, K
Issue Date: 2009
Publisher: SPIE-International Society for Optical Engineering
Source: Optical engineering, 2009, v. 48, no. 6, p. '067204-'067204 How to cite?
Journal: Optical engineering 
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.
URI: http://hdl.handle.net/10397/34930
ISSN: 0091-3286 (print)
DOI: 10.1117/1.3156846
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
Citations as of Jul 19, 2017

Page view(s)

27
Last Week
0
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.