3D Ear Shape Feature Optimal Matching Using Bipartite Graph
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 be
用户评论