QQ客服 官方微博 反馈留言

	A fingerprint matching algorithm using probabilistic graphical model
	Fan, Dong-Jin ; Feng, Ju-Fu
	2009
英文摘要	A novel fingerprint matching algorithm based on the probabilistic graphical model is proposed in this paper. First, minutiae in query fingerprint are viewed as random variables with the minutiae in template print as the realizations. According to the random variables, a 2-tree model is built by selecting two signal points from the query set. Second, the model is converted into a Junction Tree, and the potentials of the tree nodes are defined according to the intrinsic characters of fingerprint. After that, Junction Tree (J.T.) algorithm is performed to obtain the correspondence of the two sets of minutiae. To deal with many-to-one corresponding problem caused by the outliers, we repeat the process by exchanging two sets. Finally, the similarity of the two fingerprints are evaluated using the number of common matching pairs and the maximal posteriori probability generated by the J.T. algorithm. Experiments performed on databases of FVC2004 achieve the perfect performance. ?2009 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/ICIP.2009.5414168
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/411248]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Fan, Dong-Jin,Feng, Ju-Fu. A fingerprint matching algorithm using probabilistic graphical model. 2009-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。