《3D Ear Shape Matching Using Joint αEntropy》.pdfVIP

Sun XP, Li SH, Han F et al. 3D ear shape matching using joint α-entropy. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 30(3): 565–577 May 2015. DOI 10.1007/s11390-015-1546-x 3D Ear Shape Matching Using Joint α-Entropy Xiao-Peng Sun 1,2 (š ¡+ ), Senior Member, CCF, Member, ACM, Si-Hui Li 1 (o g), Student Member, CCF 1 ¸ ¶ ), and Xiao-Peng Wei 3,4 (Ÿ + ) Feng Han ( 1Institute of Computer Systems, School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China 2Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China 3School of Mechanical and Engineering, Dalian University of Technology, Dalian 116024, China 4Key Laboratory of Advanced Design and Intelligent Computing, Dalian University, Dalian 116622, China E-mail: {xpsun2008, lshcgvr, cadcg2008}@; xpwei@ Received December 7, 2014; revised March 30, 2015. Abstract In this article, we investigate the use of joint α-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the joint α-entropy. First, we extract a sufficient number of key points from the 3D ear point cloud, and fit the neighborhood of each key point to a single-value quadric surface on product parameter regions. Second, we define the local shape feature vector of each key point as the sampling depth set on the parametric node of the quadric surface. Third, for every pair of gallery ear and probe ear, we construct the minimum spanning tree (MST) on their matched key points. Finally, we minimize the total edge weight of MST to estimate its joint α-entropy — the smaller the entropy is, the more similar the ear pair is. We present several examples to demonstrate the advantages of our algorithm, including low time complexity