This Article 
 Bibliographic References 
 Add to: 
Geometric properties of the union of maximal neighborhoods
February 1989 (vol. 11 no. 2)
pp. 214,215,216,217
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] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[2] H. Freeman, "Boundary encoding and processing," inPicture Processing and Psychopictorics, B. S. Lipkin and A. Rosenfeld, Eds. New York: Academic, 1970, pp. 241-266.
[3] B. G. Batchelor, "Principles of digital image processing," inAutomated Visual Inspection, B. G. Batchelor, D. A. Hill, and D. C. Hodgson, Eds. Amsterdan, The Netherlands: North-Holland, 1985, pp. 329-400.
[4] H. Samet, "A tutorial on quadtree research," inMultiresolution Image Processing and Analysis, A. Rosenfeld, Ed. Berlin: Springer-Verlag, 1984, pp. 212-223.
[5] A. Y. Wu, S. K. Bhaskar, and A. Rosenfeld, "Computation of geometric properties from the medial axis transform inO(NlogN)time,"Comput. Vision Graphics Image Processing, vol. 34, pp. 76-92, 1986.
[6] L. P. Cordella and G. Sanniti di Baja, "Properties of the MAT local maxima and their implications," Dip. Inform., Sistem., University of Naples, Internal Rep., 1988.
[7] C. Arcelli and G. Sanniti di Baja, "A width-independent fast thinning algorithm,"IEEE Trans. Pattern, Anal. Machine Intell., vol. PAMI- 7, pp. 463-474, 1985.
[8] L. P. Cordella and G. Sanniti di Baja, "Structural description of silhouettes," inProc. 3rd Scandinavian Conf. Image Analysis, Copenhagen, Denmark, 1983, pp. 73-78.
[9] C. Arcelli and G. Sanniti di Baja, "An approach to figure decomposition using width information,"Comput. Vision, Graphics, Image Processing, vol. 26, pp. 61-72, 1984.
[10] H. Blum and R. N. Nagel, "Shape description using weighted symmetric axis features,"Pattern Recognition, vol. 10, pp. 167-180, 1978.
[11] T. Pavlidis, "A vectorizer and feature extractor for document recognition,"Comput. Vision Graphics, Image Processing, vol. 35, pp. 111-127, 1986.

Index Terms:
optimisation,computational geometry,computerised picture processing,local maxima,computerised picture processing,digital images,computational geometry,maximal neighborhoods,discrete medial axis transform,Discrete transforms,Topology,Pattern analysis,Machine intelligence
"Geometric properties of the union of maximal neighborhoods," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 2, pp. 214,215,216,217, Feb. 1989, doi:10.1109/34.16718
Usage of this product signifies your acceptance of the Terms of Use.