Skeleton Graph Matching Based on Critical Points Using Path Similarity
- 1.5k Downloads
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.
KeywordsSkeleton skeleton graph graph matching shape recognition path similarity
Unable to display preview. Download preview PDF.
- 3.Bai, X., Latecki, L.J., Liu, W.Y.: Skeleton pruning by contour partitioning with discrete curve evolution. IEEE Trans. PAMI 29, 449–462 (2007)Google Scholar
- 5.Siddiqi, K., Shkoufandeh, A., Dickinson, S., Zucker, S.: Shock graphs and shape matching. In: ICCV, pp. 222–229 (1998)Google Scholar
- 6.Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing their shock graphs. IEEE Trans. PAMI 26, 550–571 (2004)Google Scholar
- 7.Liu, T., Geiger, D.: Approximate tree matching and shape similarity. In: ICCV, pp. 456–462 (1999)Google Scholar
- 8.Geiger, D., Liu, T., Kohn, R.: Representation and self-similarity of shapes. IEEE Trans. PAMI 25, 86–99 (2003)Google Scholar
- 10.Aslan, C., Tari, S.: An axis based representation for recognition. In: ICCV, pp. 1339–1346 (2005)Google Scholar
- 11.Bai, X., Latecki, L.J.: Path similarity skeleton graph matching. IEEE Trans. PAMI 30, 1282–1292 (2008)Google Scholar
- 12.Ling, H., Jacobs, D.W.: Shape classification using inner-distance. IEEE Trans. PAMI 29, 286–299 (2007)Google Scholar