Advertisement

Polygon Decomposition Based on the Straight Line Skeleton

  • Mirela TĂnase
  • Remco C. Veltkamp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2616)

Abstract

We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. Decompositions based on skeletons have been previously proposed in computer vision. Our method is the first one, however, based on the straight line skeleton. Compared to the medial axis, the straight line skeleton has a few advantages: it contains only straight segments and has a lower combinatorial complexity. The skeletal nodes and the way they are generated are the basis for our decomposition, which has two stages that result in a hierarchical decomposition into overlapping parts. First, a number of visually striking parts are identified, then their boundaries are successively simplified, by locally removing detail. Our method runs in time O((n + r 2 2) log2 n), after the skeleton construction, where r 2 is the number of reflex edge annihilations. The decomposition is invariant to rigid motions and uniform scalings. We present results indicating that it provides natural decompositions for a variety of shapes. This makes it attractive for shape based matching in content-based image retrieval, for example.

Keywords

Medial Axis Steiner Point Simple Polygon Split Event Hierarchical Decomposition 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hoffman, D., Richards, W.: Parts of Recognition. Cognition 18 (1984) 65–96CrossRefGoogle Scholar
  2. [2]
    Blum, H.: A Transformation for Extracting New Descriptors of Shape. Symposium Models for Speech and Visual Form ed: W. Wathen-Dunn MITP ress (1967) 362–381Google Scholar
  3. [3]
    Brady, M., Asada, H.: Smoothed Local Symmetries and their Implementation. The International Journal of Robotics Research 3(3) (1984) 36–61CrossRefGoogle Scholar
  4. [4]
    Aichholzer, O., Aurenhammer, F.: Straight Skeletons for General Polygonal Figures in the Plane. In: Proc. 2nd International Computing and Combinatorics Conference COCOON’ 96. Lecture Notes in Computer Science, Vol. 1090. Springer-Verlag (1996) 117–126Google Scholar
  5. [5]
    Ogniewicz, R. L., Kubler, O.: Hierarchic Voronoi Skeletons. Pattern Recognition 28(3) (1995) 343–359CrossRefGoogle Scholar
  6. [6]
    Simmons, M., Séquin, C. H.: 2D Shape Decomposition and the Automatic Generation of Hierarchical Representations. International Journal of Shape Modeling 4 (1998) 63–78zbMATHCrossRefGoogle Scholar
  7. [7]
    Siddiqi, K., Kimia, B.: Parts of Visual Form: Computational Aspects. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(3) (1995) 239–251CrossRefGoogle Scholar
  8. [8]
    Kimia, B.B., Tannenbaum, A. R., Zucker, S. W.: Shapes, Shocks, and Deformations I: The Components of Two-Dimensional Shape and the Reaction-Diffusion Space. International Journal of Computer Vision 15(3) (1995) 189–224CrossRefGoogle Scholar
  9. [9]
    Siddiqi, K., Shokoufandeh, A., Dickinson, S. J., Zucker, S.W. Shock Graphs and Shape Matching. International Journal of Computer Vision 35(1) (1999) 13–32CrossRefGoogle Scholar
  10. [10]
    Latecki, L. J., Lakämper, R.: Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution. Computer Vision and Image Understanding 73(3) (1999) 441–454CrossRefGoogle Scholar
  11. [11]
    Keil, J. M.: Polygon Decomposition In: J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B. V. North-Holland, Amsterdam, 1999 491–518Google Scholar
  12. [12]
    Eppstein, D., Erickson, J.: Raising Roofs, Crashing Cycles, and playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete and Computational Geometry 22(4) (1999) 569–592zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    Chin, F., Snoeyink, J., Wang, C.-A.: Finding theMedial Axis of a Simple Polygon in Linear Time. Discrete Computational Geometry 21(3) (1999) 405–420zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Cheng, S.-W., Vigneron, A: Motorcycle Graphs and Straight Skeletons. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms 156–165 2002Google Scholar
  15. [15]
    Goodrich, M. T., Tamassia, R.: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. Journal of Algorithms 23(1) (1997) 51–73.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    Felkel, P., Obdržálek, Š.: Straight Skeleton Implementation. In: Proc. of Spring Conference on Computer Graphics, Budmerice, Slovakia 1998 210–218Google Scholar
  17. [17]
    The Computational Geometry Algorithms Library. http://www.cgal.org/ 263
  18. [19]
    Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. The Canadian Cartographer 10(2) (1973) 112–122Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mirela TĂnase
    • 1
  • Remco C. Veltkamp
    • 1
  1. 1.Institute of Information and Computing Sciences Utrecht UniversityUtrechtThe Netherlands

Personalised recommendations