This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Region Expansion for Quadtrees
July 1990 (vol. 12 no. 7)
pp. 682-686

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.

[1] D. J. Abel and J. L. Smith "A data structure and algorithm based on a linear key for a rectangle retrieval problem'"Comput. vision, Graphics, Image Processing, vol. 24, no. 1. pp. 1-13, Oct. 1983.
[2] C. H. Ang, "Analysis and applications of hierarchical data structures," Ph.D. dissertation, Dep. Comput. Sci., Univ. Maryland, College Park, Tech. Rep. TR-2255, June 1989.
[3] I. Gargantini, "An Effective Way to Represent Quadtrees,"CACM, Dec. 1982, pp. 905-910.
[4] G.M. Hunter, "Efficient Computation and Data Structures for Graphics," doctoral dissertation, Princeton Univ., Princeton, N.J., 1978.
[5] A. Klinger, "Patterns and search statistics," inOptimizing Methods in Statistics, J. S. Rustagi, Ed. New York: Academic, 1971, pp. 303-337.
[6] D. C. Mason, "Dilation algorithm for a linear quadtree,"Image Vision Comput., vol. 5, no. 1, pp. 11-20, Feb. 1987.
[7] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[8] H. Samet,The Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990.
[9] H. Samet,Applications of Spatial Data Structures, Addison-Wesley, Reading, Mass., 1989.
[10] H. Samet, A. Rosenfeld, C. A. Shaffer, R. C. Nelson, and Y. G. Huang, "Application of hierarchical data structures to geographical information systems, Phase III," Dep. Comput. Sci., Univ. Maryland, College Park, Tech. Rep. TR-1457, Nov. 1984.
[11] C. A. Shaffer and H. Samet, "An algorithm to expand regions represented by linear quadtrees,"Image Vision Comput., vol. 6, no. 3, pp. 162-168, Aug. 1988.
[12] C. A. Shaffer, H. Samet, and R. C. Nelson, "QUILT: A geographic information system based on quadtrees," Dep. Comput. Sci., Univ. Maryland, College Park, Tech. Rep. TR-1885, July 1987.

Index Terms:
pattern recognition; region expansion; quadtrees; one-pass algorithm; white pixels; black mode; black nodes; merging cluster; vertex set; pattern recognition; picture processing; trees (mathematics)
Citation:
C.H. Ang, H. Samet, C.A. Shaffer, "A New Region Expansion for Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 682-686, July 1990, doi:10.1109/34.56221
Usage of this product signifies your acceptance of the Terms of Use.