Methods for hierarchical analysis of concavities

Presents an iterative parallel procedure for computing concavity trees of a digital shape in a multi-resolution structure. The pattern is, at all resolution levels, covered by an almost convex polygon, closely fitting the pattern itself. When the polygons have been created, a hierarchical structure is built, which points out the relations among the concavities at different resolution levels. Also some properties characterizing the added regions are computed. On the highest resolution level, a meta-concavity tree is built up. This tree can be used to analyse and hierarchically rank the shape concavities.<<ETX>>

[1]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[2]  Steven L. Tanimoto,et al.  A pyramidal approach to parallel processing , 1983, ISCA '83.

[3]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[4]  Gabriella Sanniti di Baja,et al.  Parallel smoothing and decomposition of digital shapes using a multiresolution structure , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[5]  Jim Piper,et al.  Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..

[6]  Gunilla Borgefors,et al.  Parallel distance transforms on pyramid machines: Theory and implementation , 1990, Signal Process..

[7]  M. MANOHAR,et al.  Connected component labeling of binary images on a mesh connected massively parallel processor , 1989, Comput. Vis. Graph. Image Process..