Abstract
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attributed concavity trees. The matching is based both on the structure of the tree as well as on the attributes stored at each node. Moreover, the method can be implemented on parallel architectures, and it supports occluded and partial matching. To the best of our knowledge, this is the first work to detail a method for concavity tree matching. We test our method on 625 silhouettes in the context of shape-based nearest-neighbour retrieval. © Springer-Verlag 2004.
Cite
CITATION STYLE
Badawy, O. E., & Kamel, M. (2004). Matching Concavity Trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 556–564. https://doi.org/10.1007/978-3-540-27868-9_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
