A new region expansion for quadtrees
Ang, C.-H.
Samet, H.
Shaffer, C.A.
Dept. of Comput. Sci., Nat. Univ. of Singapore ;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jul 1990
Volume: 12,
Issue: 7
On page(s): 682-686
ISSN: 0162-8828
References Cited: 12
CODEN: ITPIDJ
INSPEC Accession Number: 3735409
Digital Object Identifier: 10.1109/34.56221
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
