Sciweavers

Share
ACCV
2009
Springer

Skeleton Graph Matching Based on Critical Points Using Path Similarity

9 years 9 months ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical points (junction points and end points) on skeleton graphs by comparing the geodesic paths between end points and junction points of the skeleton. Our method is motivated by the fact that junction points can carry information about the global structure of an object while paths between junction points and end points can represent specific geometric information of local parts. Our method yields the promising accuracy rates on two shape datasets in the presence of articulations, stretching, boundary deformations, part occlusion and rotation. Key words: Skeleton, skeleton graph, graph matching, shape recognition, path similarity
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where ACCV
Authors Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
Comments (0)
books