A Shape-Matching Technique Using Skeletal Graphs
Main Article Content
Abstract
A novel shape-matching algorithm using skeletal graphs in this paper. The topology of skeletal graphs is captured and compared at the node level. Such graph representation allows preservation of the skeletal graph’s coherence without scarifying the flexibility of matching similar portions of graphs across different levels. Using appropriate sampling resolution, the proposed approach is able to achieve a high recognition rate, and at the same time, significantly reduce space and time complexity of matching. This approach is tested against the Directed Acyclic Graph (DAG) method on noisy graphs and occluded or cluttered scenes. The results show that this approach is an effective and efficient technique for shape recognition.
Keywords: Skeletal graph, graph matching, shape recognition, shock graph
Corresponding author: E-mail: khnualsa@kmitl.ac.th
Article Details
Copyright Agreement Statement
The corresponding author has to submit Copyright Agreement form after the article is accepted for publication in order to warrant that this contribution is original and that he/she has full power to make this grant. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors.
The author(s) grant Current Applied Science and Technology a non-exclusive, irrevocable, royalty-free license to publish, reproduce, distribute, and archive the article in print and electronic form with effect if and when the article is accepted for publication. In the event that the article is withdrawn prior to acceptance or is declined, this agreement shall have no effect, and no party shall be bound by it.
The author(s) retain copyright of this article, including but not limited to the right to reproduce and distribute the article, to include it in a thesis or book, and to post it on an institutional or personal repository, provided that the original publication in Current Applied Science and Technology is properly cited.
References
[2] T.B. Sebastian, P.N. Klein and B. B. Kimia. Recognition of Shapes by Editing Shock Graphs. ICCV, pages 755-762, 2001.
[3] T.B. Sebastian, P.N. Klein and B. B. Kimia. Alignment based recognition of shape outlines. IWVF, pages 606-618, 2001.
[4] S. Belogie and J. Malik. Matching with shape contexts. CBAIVL, 2000.
[5] S.C. Zhu and A.L. Yuile. FORMS: A flexible object recognition and modeling system. IJCV, 20(3), 1996.
[6] H. Blum. A Transformation for Extracting New Descriptors of shape, pages 362-380, MIT Press, 1967.
[7] http://www.cs.toronto.edu/~dmac/download.html
[8] http://www.cs.ucf.edu/~nual/proof.doc
[9] F. Harary. Graph Theory, Addison-Wesley, Reading, Massachusetts, page 35, 1969.