Geometric properties of the union of maximal neighborhoods
- 1 February 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 11 (2) , 214-217
- https://doi.org/10.1109/34.16718
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A vectorizer and feature extractor for document recognitionComputer Vision, Graphics, and Image Processing, 1986
- Computation of geometric properties from the medial axis transform in (O(nlogn) timeComputer Vision, Graphics, and Image Processing, 1986
- A Width-Independent Fast Thinning AlgorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- An approach to figure decomposition using width informationComputer Vision, Graphics, and Image Processing, 1984
- A Tutorial on Quadtree ResearchPublished by Springer Nature ,1984
- Shape description using weighted symmetric axis featuresPattern Recognition, 1978