A new region expansion for quadtrees
- 1 July 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12 (7) , 682-686
- https://doi.org/10.1109/34.56221
Abstract
A one-pass algorithm that performs region expansion in images represented by quadtrees is presented. The algorithm changes to black those white pixels within a specified distance of any black mode in the image. The algorithm yields a significant improvement over previous approaches by reducing both the number of black nodes that must be considered for expansion and the number of nodes that must be inserted as a result of the expansion. The reductions are achieved by introducing the concepts of a merging cluster and a vertex set. Empirical tests show that the execution time of this algorithm generally decreases as the radius of expansion increases, whereas in previous approaches the execution time generally increased with the radius of expansion.Keywords
This publication has 5 references indexed in Scilit:
- Algorithm to expand regions represented by linear quadtreesImage and Vision Computing, 1988
- Dilation algorithm for a linear quadtreeImage and Vision Computing, 1987
- A data structure and algorithm based on a linear key for a rectangle retrieval problemComputer Vision, Graphics, and Image Processing, 1983
- An effective way to represent quadtreesCommunications of the ACM, 1982
- PATTERNS AND SEARCH STATISTICS**Research sponsored by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under Grant No. AFOSR 70-1915 and the National Science Foundation under Grant No. NSF-GK-4827. The United States Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copywright notation herein.Published by Elsevier ,1971