Please use this identifier to cite or link to this item:
|Title:||New region expansion for quadtrees|
|Authors:||Ang, Chuan-Heng |
Shaffer, Clifford A.
|Citation:||Ang, Chuan-Heng, Samet, Hanan, Shaffer, Clifford A. (1990-07). New region expansion for quadtrees. IEEE Transactions on Pattern Analysis and Machine Intelligence 12 (7) : 682-686. ScholarBank@NUS Repository. 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.|
|Source Title:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 24, 2018
WEB OF SCIENCETM
checked on Sep 17, 2018
checked on Jun 1, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.