A Coarse to Fine Minutiae-Based Latent Palmprint Matching

	A Coarse to Fine Minutiae-Based Latent Palmprint Matching
	Liu, Eryun 1,2; Jain, Anil K.1,3; Tian, Jie 2,4
发表期刊	IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
	2013-10-01
卷号	35 期号:10 页码:2307-2322
文章类型	Article
摘要	With the availability of live-scan palmprint technology, high resolution palmprint recognition has started to receive significant attention in forensics and law enforcement. In forensic applications, latent palmprints provide critical evidence as it is estimated that about 30 percent of the latents recovered at crime scenes are those of palms. Most of the available high-resolution palmprint matching algorithms essentially follow the minutiae-based fingerprint matching strategy. Considering the large number of minutiae (about 1,000 minutiae in a full palmprint compared to about 100 minutiae in a rolled fingerprint) and large area of foreground region in full palmprints, novel strategies need to be developed for efficient and robust latent palmprint matching. In this paper, a coarse to fine matching strategy based on minutiae clustering and minutiae match propagation is designed specifically for palmprint matching. To deal with the large number of minutiae, a local feature-based minutiae clustering algorithm is designed to cluster minutiae into several groups such that minutiae belonging to the same group have similar local characteristics. The coarse matching is then performed within each cluster to establish initial minutiae correspondences between two palmprints. Starting with each initial correspondence, a minutiae match propagation algorithm searches for mated minutiae in the full palmprint. The proposed palmprint matching algorithm has been evaluated on a latent-to-full palmprint database consisting of 446 latents and 12,489 background full prints. The matching results show a rank-1 identification accuracy of 79.4 percent, which is significantly higher than the 60.8 percent identification accuracy of a state-of-the-art latent palmprint matching algorithm on the same latent database. The average computation time of our algorithm for a single latent-to-full match is about 141 ms for genuine match and 50 ms for impostor match, on a Windows XP desktop system with 2.2-GHz CPU and 1.00-GB RAM. The computation time of our algorithm is an order of magnitude faster than a previously published state-of-the-art-algorithm.
关键词	Palmprint Latent Palmprint Matching Minutiae Clustering Minutia Descriptor Match Propagation
WOS标题词	Science & Technology ; Technology
关键词[WOS]	PROPAGATION ; SIMILARITY
收录类别	SCI
语种	英语
WOS研究方向	Computer Science ; Engineering
WOS类目	Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS记录号	WOS:000323175200001
引用统计	被引频次：62[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.ia.ac.cn/handle/173211/4067
专题	中国科学院分子影像重点实验室
通讯作者	Tian, Jie
作者单位	1.Michigan State Univ, Dept Comp Sci & Engn, E Lansing, MI 48824 USA 2.Xidian Univ, Sch Life Sci & Technol, Xian 710126, Shaanxi, Peoples R China 3.Korea Univ, Dept Brain & Cognit Engn, Seoul, South Korea 4.Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
通讯作者单位	中国科学院自动化研究所
推荐引用方式 GB/T 7714	Liu, Eryun,Jain, Anil K.,Tian, Jie. A Coarse to Fine Minutiae-Based Latent Palmprint Matching[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,2013,35(10):2307-2322.
APA	Liu, Eryun,Jain, Anil K.,&Tian, Jie.(2013).A Coarse to Fine Minutiae-Based Latent Palmprint Matching.IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,35(10),2307-2322.
MLA	Liu, Eryun,et al."A Coarse to Fine Minutiae-Based Latent Palmprint Matching".IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 35.10(2013):2307-2322.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
2013_TPAMI_A Coarse （4127KB）	期刊论文	作者接受稿	开放获取	CC BY-NC-SA	浏览下载