Segmentation of Shapes⋆
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.
KeywordsLocal Symmetry Medial Axis Curve Evolution Level Curve Terminal Point
Unable to display preview. Download preview PDF.
- 4.S. Tari and J. Shah, Local symmetries of shapes in arbitrary dimension, Sixth Intl. Conf. Computer Vision, 1998.Google Scholar
- 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