Concise Papers Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images

IEEE Transactions on Software Engineering

Volumn 14, Issue 5, 1988, Pages 659-665

  Unnikrishnan, A ^a   Shankar, Priti ^a   Venkatesh, Y V ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Binary images; geometric properties; hierarchical quadtree; linear quadtree; quadtree

Indexed keywords

EID: 33749370895     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.6143     Document Type: Article

References (21)

1. A. Klinger and C. R. Dyer, “Experiments in picture representation using regular decomposition,” Comput. Graphics Image Processing, vol. 5, no. 1, pp. 68-105, Mar. 1976.
2. H. Samet, “The quadtrees and related hierarchical data structures,” ACM Comput. Surveys, vol. 16, no. 2, pp. 187-260, June 1984.
3. I. Gargantini, “An effective way to represent quadtrees,” Commun. ACM, vol. 25, no. 12, pp. 905-910, Dec. 1983.
4. H. Samet, “Neighbouring finding techniques for images represented by quadtrees,” Comput. Graphics Image Processing, vol. 18, no. 1, pp. 37-57, Jan. 1982.
5. G. M. Hunter and K. Steiglitz, “Operations on images using quadtrees,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, no. 2, pp. 145-153, Apr. 1979.
6. A. Unnikrishnan, Y. V. Venkatesh, and P. Shankar, “Connected component labelling using quadtrees-A bottom-up approach,” Comput. J., vol. 30, no. 2, pp. 176-182, Feb. 1987.
7. H. Samet, “Connected component labelling using quadtrees,” J. ACM, vol. 28, no. 3, pp. 487-501, July 1981.
8. “Computing perimeters of regions in images represented by quadtrees,” IEEE Trans. Pattern Anal. Machine Intell., vol. 3, no. 6, pp. 683-687, 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. 341-342, 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. PAMI-6, no. 2, pp. 244-247, 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. PAMI-1, no. 1, pp. 27-35, Jan. 1980.
15. M. A. Oliver and N. E. Wiseman, “Operations on quadtree encoded images,” Comput. J., vol. 26, no. 1, pp. 83-92, 1983.
16. H. Samet and M. Tamminen, “Computing geometric properties of images represented by linear quadtrees,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 2, pp. 229-239, Mar. 1985.
17. D. J. Abel, “A B-tree structure for large quadtrees,” Comput. Vision, Graphics, Image Processing, vol. 27, no. 1, pp. 19-31, July 1984.
18. H. Samet, “An algorithm for converting rasters to quadtrees,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, no. 1, pp. 93-95,Jan. 1981.
19. C. A. Shaffer apd H. Samet, “Optimal quadtree construction algorithms,” Comput. Vision, Graphics, Image Processing, pp. 402-419, Mar. 1987.
20. D. E: Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, 2nd ed. Reading, MA: Addison-Wesley, 1975.
21. R. E. Tarjan, “Efficiency of a good but not linear set union algorithm,” J. ACM, vol. 22, no. 2, pp. 215-225, Apr. 1975.