
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Unnikrishnan, P. Shankar, Y.V. Venkatesh, "Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images," IEEE Transactions on Software Engineering, vol. 14, no. 5, pp. 659665, May, 1988.  
BibTex  x  
@article{ 10.1109/32.6143, author = {A. Unnikrishnan and P. Shankar and Y.V. Venkatesh}, title = {Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images}, journal ={IEEE Transactions on Software Engineering}, volume = {14}, number = {5}, issn = {00985589}, year = {1988}, pages = {659665}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.6143}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images IS  5 SN  00985589 SP659 EP665 EPD  659665 A1  A. Unnikrishnan, A1  P. Shankar, A1  Y.V. Venkatesh, PY  1988 KW  Euler number; geometric properties; binary images; linear quadtree; threaded linear hierarchical quadtree; TLHQT; adjacencies; structure; adjacency links; labeling connected components; perimeter; quadtree environment; computational geometry; computerised picture processing; data structures VL  14 JA  IEEE Transactions on Software Engineering ER   
A modification of the linear quadtree, the threaded linear hierarchical quadtree (TLHQT), is proposed for the computation of geometric properties of binary images. Since most of the algorithms used in connection with computation of geometric properties require frequent exploration of adjacencies, a structure that keeps permanently in memory some adjacency links is introduced. Some results obtained by using the TLHQT for labeling connected components and for evaluating the perimeter and Euler's number in a quadtree environment are presented. The performance of the TLHQT is discussed.
[1] A. Klinger and C. R. Dyer, "Experiments in picture representation using regular decomposition,"Comput. Graphics Image Processing, vol. 5, no. 1, pp. 68105, Mar. 1976.
[2] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187260, 1984.
[3] I. Gargantini, "An Effective Way to Represent Quadtrees,"CACM, Dec. 1982, pp. 905910.
[4] H. Samet, "Neighbouring finding techniques for images represented by quadtrees,"Comput. Graphics Image Processing, vol. 18, no. 1, pp. 3757, Jan. 1982.
[5] G. M. Hunter and K. Steiglitz, "Operations on images using quadtrees,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI1, no. 2, pp. 145153, Apr. 1979.
[6] A. Unnikrishnan, Y. V. Venkatesh, and P. Shankar, "Connected component labelling using quadtreesA bottomup approach,"Comput. J., vol. 30, no. 2, pp. 176182, Feb. 1987.
[7] H. Samet, "Connected component labeling using quadtrees,"J. ACM, vol. 28, pp. 487501, July 1981.
[8] H. Samet, "Computing perimeters of regions in images represented by quadtrees,"IEEE Trans. Pattern Anal. Machine Intell., vol. 3, no. 6, pp. 683687, Nov. 1981.
[9] C. R. Dyer, "Computing the Euler number of an image from its quadtree," Comput. Graphics Image Processing, vol. 13, no. 3, pp. 270 276, July 1981.
[10] A. Unnikrishnan, Y. V. Venkatesh, and P. Shankar, "Distribution of black nodes at various levels in a linear quadtree,"Pattern Recognition Lett., vol. 6, pp. 341342, Dec. 1987.
[11] A. Unnikrishnan and Y. V. Venkatesh, "An algorithm to convert a raster scanned image to linear hierarchical quadtrees," Dep. Elec. Eng., Indian Inst. Sci., Bangalore, India, Tech. Rep., May 1985.
[12] A. Unnikrishnan, P. Shankar, and Y. V. Venkatesh, "An algorithm to convert from rasters to threaded linear hierarchical quadtrees," Dep. Elec. Eng., Indian Inst. Sci., Bangalore, India, Tech. Rep., July 1985.
[13] L. Jones and S.S. Iyengar, "Space and time efficient virtual quadtrees,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI6, no. 2, pp. 244247, Mar. 1984.
[14] E. Kawaguchi and T. Endo, "On a method of binary picture representation and its application to data compression,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMII, no. 1, pp. 2735, Jan. 1980.
[15] M. A. Oliver and N. E. Wiseman, "Operations on quadtree encoded images,"Comput. J., vol. 26, no. 1, pp. 8392, 1983.
[16] H. Samet and M. Tamminen, "Computing geometric properties of images represented by linear quadtrees,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI7, no. 2, pp. 229239, Mar. 1985.
[17] D. J. Abel, "A Btree structure for large quadtrees," Comput. Vision, Graphics, Image Processing, vol. 27, no. 1, pp. 1931, July 1984.
[18] H. Samet, "An algorithm for converting rasters to quadtrees,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI3, no. 1, pp. 93 95, Jan. 1981.
[19] C.A. Shaffer and H. Samet, "Optimal Quadtree Construction Algorithms,"Computer Vision, Graphics, and Image Processing, Mar. 1987, pp. 402419.
[20] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: AddisonWesley, 1973.
[21] R. E. Tarjan, "Efficiency of a good but non linear set union algorithm,"J. ACM, vol. 22, pp. 215225, 1975.