Segmentation of Shapes⋆

  • Jayant Shah
Conference paper
Part of the Lecture Notes in Computer Science 2106 book series (LNCS, volume 2106)


An algorithm for segmenting 2D shapes into parts is described. The segmentation is constructed from the local symmetry axes of the shape. The local symmetry axes are determined by analyzing the local symmetries of the level curves of a function which is the solution of an elliptic PDE. The segmentation has the structure of a directed graph. The shapes need not be presmoothed and the algorithm may be applied to a complexscen e consisting of many objects.


Local Symmetry Medial Axis Curve Evolution Level Curve Terminal Point 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Mumford and J. Shah, Optimal approximations by piecewise smooth functions and associated variational problems, Comm. Pure Appl. Math, XLII, 1989, 577–684.MathSciNetCrossRefGoogle Scholar
  2. 2.
    K. Siddiqi, A. Shokoufandeh, S. Dickinson and S. Zucker, Shock graphs and shape matching, Intl. J. Computer Vision, 35(1), 1999, 13–32.CrossRefGoogle Scholar
  3. 3.
    S. Tari, J. Shah and H. Pien, Extraction of shape skeletons from grayscale images, Computer Vision and Image Understanding, 66, 1997, 133–146.CrossRefGoogle Scholar
  4. 4.
    S. Tari and J. Shah, Local symmetries of shapes in arbitrary dimension, Sixth Intl. Conf. Computer Vision, 1998.Google Scholar
  5. 5.
    S.C. Zhu, Stochastic jump-difusion process for computing medial axes in markov random fields, IEEE Trans. Pattern Analysis and Machine Intelligence, 21(11), 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jayant Shah
    • 1
  1. 1.Mathematics DepartmentNortheastern UniversityBoston

Personalised recommendations