Geometric Properties of the Union of Maximal Neighborhoods

The problem of computing area and perimeter of a digital figure presented by its discrete medial axis transform (MAT) is addressed. The figure is seen as the union of the square-shaped maximal neighborhoods centered on the local maxima of the MAT. The contribution given by each maximal neighborhood to figure area and perimeter is computed while tracing the MAT. Multiple overlaps among the maximal neighborhoods are possible. However, due to the properties of the local maxima and their associated maximal neighborhoods a single tracing of the MAT is provided to be sufficient to obtain the desired result. Thus, the procedure requires O(N) time, where N is the number of MAT pixels. >

[1]  HARRY BLUM,et al.  Shape description using weighted symmetric axis features , 1978, Pattern Recognit..

[2]  Gabriella Sanniti di Baja,et al.  A Width-Independent Fast Thinning Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Theo Pavlidis,et al.  A vectorizer and feature extractor for document recognition , 1986 .

[4]  Hanan Samet,et al.  A Tutorial on Quadtree Research , 1984 .

[5]  Gabriella Sanniti di Baja,et al.  An approach to figure decomposition using width information , 1983, Comput. Vis. Graph. Image Process..

[6]  Azriel Rosenfeld,et al.  Computation of geometric properties from the medial axis transform in (O(nlogn) time , 1986, Comput. Vis. Graph. Image Process..