Advertisement

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.

Keywords

Feature Vector Query Image Partial Match Recursive Method Moment Invariant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    El Badawy, O., Kamel, M.: Shape retrieval using concavity trees. In: Proceedings of the International Conference on Pattern Recognition (2004)Google Scholar
  2. 2.
    Sklansky, J.: Measuring concavity on a rectangular mosaic. IEEE Transactions on Computers C-21, 1355–1364 (1972)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Batchelor, B.: Hierarchical shape description based upon convex hulls of concavities. Journal of Cybernetics 10, 205–210 (1980)CrossRefGoogle Scholar
  4. 4.
    Borgefors, G., Sanniti di Baja, G.: Methods for hierarchical analysis of concavities. In: Proceedings of the International Conference on Pattern Recognition, vol. 3, pp. 171–175 (1992)Google Scholar
  5. 5.
    Borgefors, G., Sanniti di Baja, G.: Analyzing nonconvex 2D and 3D patterns. Computer Vision and Image Understanding 63, 145–157 (1996)CrossRefGoogle Scholar
  6. 6.
    Xu, J.: Hierarchical representation of 2-D shapes using convex polygons: A morphological approach. Pattern Recognition Letters 18, 1009–1017 (1997)CrossRefGoogle Scholar
  7. 7.
    Sanfeliu, A.: Matching tree structures. In: Bunke, H., Sanfeliu, A. (eds.) Syntactic and Structural Pattern Recognition, Theory and Applications, pp. 146–178. World Scientific, Singapore (1990)Google Scholar
  8. 8.
    Torsello, A., Hancock, E.: Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Letters 24, 1089–1097 (2003)zbMATHCrossRefGoogle Scholar
  9. 9.
    Peura, M., Saltikoff, E., Syrjasuo, M.: Image analysis by means of attribute treesremote sensing applications. In: Proceedings of the International Geoscience and Remote Sensing Symposium, pp. 696–698 (1999)Google Scholar
  10. 10.
    Sitaraman, K., Ranganathan, N., Ejnioui, A.: A vlsi architecture for object recognition using tree matching. In: Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors, pp. 325–334 (2002)Google Scholar
  11. 11.
    El Badawy, O., Kamel, M.: Shape-based image retrieval applied to trademark images. International Journal of Image and Graphics 2, 375–393 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ossama El Badawy
    • 1
  • Mohamed Kamel
    • 1
  1. 1.Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design EngineeringUniversity of WaterlooWaterlooCanada

Personalised recommendations