Abstract
In this paper, we present an optimized matching algorithm based on bipartite graph for 3D ear shape key points. Comparing with the graph matching algorithm of key points, our algorithm avoid the 2D Delaunay triangulation on 3D key points, then has less accuracy error; and our complexity is lower because our matching algorithm is basing on the bipartite graph. And then we optimal the bipartite graph matching work by weighting the edge between the key points. Experiments show that, our optimal matching on bipartite graph of ear key points can get a higher matching accuracy and a better matching efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Burge M., Burger W (2000) Ear biometrics in computer vision. In: Proceedings 15th international conference on pattern recognition, vol 2, pp 822–826. doi: 10.1109/ICPR.2000.906202
Torresani L, Kolmogorov V, Rother C (2008) Feature correspondence via graph matching: models and global optimization. In Proceedings 10th European conference computer vision, pp 596–609. doi: 10.1007/978-3-540-88688-4_44
Bhowmick P, Pradhan R, Bhattacharya B (2009) Approximate matching of digital point sets using a novel angular tree. IEEE Trans Pattern Anal Mach Intell 31(5):769–782. doi: 10.1109/TPAMI.2007. 70812
Leordeanu M, Hebert M (2009) Unsupervised learning for graph matching. In: IEEE conference on computer vision and pattern recognition, pp 864–871. doi: 10.1109/CVPRW.2009.5206533
Caetano T, Caelli T, Schuurmans D, Barone D (2006) Graphical models and point pattern matching. IEEE Trans Pattern Anal Mach Intell 28(10):1646–1663. doi: 10.1109/TPAMI.2006.207
Mcauley J, Caetano T, Barbosa M (2008) Graph rigidity, cyclic belief propagation and point pattern matching. IEEE Trans Pattern Anal Mach Intell 30(11):2047–2054. doi: 10.1109/TPAMI.2008.124
Mikolajczyk K, Schmid C (2004) Scale and affine invariant interest point detectors. J Int J Comput Vis 60, 1:63–86. doi: 10.1023/B:VISI.0000027790.02288.f2
Weiss Y, Freeman W (2001) On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Trans Inf Theory 47(2):736–744. doi: 10.1109/18.910585
Mian AS, Bennamoun M, Owens R (2008) Keypoint detection and local feature matching for textured 3D face recognition. Int J Comput Vis 79(1):1–12. doi: 10.1007/s11263-007-0085-5
SasiKanth (2010) Bi-dimensional empirical mode decomposition. MATLAB central file exchange select
Acknowledgments
This work is supported in part by National Natural Science Foundation of China with projects No. 61170143 and No. 60873110.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Sun, X., Xingyue, W., Wang, G., Han, F., Wang, L. (2014). 3D Ear Shape Feature Optimal Matching Using Bipartite Graph. In: Li, S., Jin, Q., Jiang, X., Park, J. (eds) Frontier and Future Development of Information Technology in Medicine and Education. Lecture Notes in Electrical Engineering, vol 269. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-7618-0_401
Download citation
DOI: https://doi.org/10.1007/978-94-007-7618-0_401
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-7617-3
Online ISBN: 978-94-007-7618-0
eBook Packages: EngineeringEngineering (R0)