The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Shape Retrieval and Classification Based on Geodesic Paths in Skeleton Graphs
|
|
Author(s): Xiang Bai (Huazhong University of Science and Technology, P.R. China), Chunyuan Li (Huazhong University of Science and Technology, P.R. China), Xingwei Yang (Temple University, USA)and Longin Jan Latecki (Temple University, USA)
Copyright: 2013
Pages: 26
Source title:
Graph-Based Methods in Computer Vision: Developments and Applications
Source Author(s)/Editor(s): Xiao Bai (Beihang University, China), Jian Cheng (Chinese Academy of Sciences, China)and Edwin Hancock (University of York, UK)
DOI: 10.4018/978-1-4666-1891-6.ch010
Purchase
|
Abstract
Skeleton- is well-known to be superior to contour-based representation when shapes have large nonlinear variability, especially articulation. However, approaches to shape similarity based on skeletons suffer from the instability of skeletons, and matching of skeleton graphs is still an open problem. To deal with this problem for shape retrieval, the authors first propose to match skeleton graphs by comparing the geodesic paths between skeleton endpoints. In contrast to typical tree or graph matching methods, they do not explicitly consider the topological graph structure. Their approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures, while the paths between their end nodes still remain similar. The proposed comparison of geodesic paths between endpoints of skeleton graphs yields correct matching results in such cases. The experimental results demonstrate that the method is able to produce correct results in the presence of articulations, stretching, and contour deformations. The authors also utilize the geodesic skeleton paths for shape classification. Similar to shape retrieval, direct graph matching algorithms like graph edit distance have great difficulties with the instability of the skeleton graph structure. In contrast, the representation based on skeleton paths remains stable. Therefore, a simple Bayesian classifier is able to obtain excellent shape classification results.
Related Content
|
R. N. Ravikumar, S. Aarthi, Valisher Sapayev, Alijon Esanov.
© 2026.
32 pages.
|
|
Md Mehedi Hasan Emon, Tahsina Khan.
© 2026.
34 pages.
|
|
Zerin Tasnim, Md Mahdi Hasan Ahid, Md. Adnan Rahman, Mohammad Mofasserul Islam, Md. Nafis Fuad, Abu Bakar Abdul Hamid.
© 2026.
34 pages.
|
|
P. S. Venkateswaran, S. Jeyakumar, S. Devi Kamatchi, S. Manimaran.
© 2026.
36 pages.
|
|
Aliza, Abdullah, Muhammad Usman.
© 2026.
32 pages.
|
|
Rohit Yadav.
© 2026.
22 pages.
|
|
Salam Al E'mari, Yousef Sanjalawe, Fuad Fataftah.
© 2026.
30 pages.
|
|
|