Presents a morphological shape segmentation algorithm that decomposes a 2D binary shape into a collection of restricted convex polygons. The algorithm is simple and the decomposition is always unique. The components produced have well-defined mathematical characterizations and they seem to be in good agreement with the nature structures of the given shape.<>
Morphological decomposition of 2-D binary shapes into conditionally maximal convex polygons
Proceedings of 1st International Conference on Image Processing ; 2 ; 96-100 vol.2
1994-01-01
467041 byte
Conference paper
Electronic Resource
English
Morphological Decomposition of 2-D Binary Shapes into Conditionally Maximal Convex Polygons
British Library Conference Proceedings | 1994
|Morphological Decomposition of 2-D Binary Shapes into Modestly Overlapped Disk Components
British Library Conference Proceedings | 2005
|British Library Online Contents | 2007
|Interpolants within Convex Polygons: Wachspress' Shape Functions
Online Contents | 2003
|