Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 10, Issue 4, 1988, Pages 579-586

  Samet, Hanan ^a   Tamminen, Mark Ku ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b AALTO UNIVERSITY   (Finland)

Author keywords

computer graphics; Computer aided design; connected component labeling. DF expressions; hierarchical data structures; image processing; linear quadtress; octrees; quadtrees

Indexed keywords

COMPUTER AIDED DESIGN; DATA PROCESSING - DATA STRUCTURES; IMAGE PROCESSING; MATHEMATICAL TECHNIQUES - TREES;

HIERARCHICAL DATA STRUCTURES; LINEAR BINTREES;

COMPUTER GRAPHICS;

EID: 0024053187     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.3918     Document Type: Article

References (21)

1. C. R. Dyer, “Computing the Euler number of an image from its quadtree”, Comput. Graphics Image Processing, vol. 13, pp. 270–276, July 1980.
2. I. Gargantini, “An effective way to represent quadtrees”, Commun. ACM, vol. 25, pp. 905–910, Dec. 1982.
3. G. M. Hunter, “Efficient computation and data structures for graphics”, Ph.D. dissertation, Dep. Elec. Eng. Comput. Sci., Princeton Univ., Princeton, NJ, 1978.
4. C. L. Jackins, and S. L. Tanimoto, “Octtrees and their use in representing three-dimensional objects”, Comput. Graphics Image Processing, vol. 14, pp. 249–270, Nov. 1980.
5. C. L. Jackins, and S. L. Tanimoto, “Quadtrees, Octtrees, and K-trees-A generalized approach to recursive decomposition of Euclidean space”, IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 533–539, Sept. 1983.
6. E. Kawaguchi and T. Endo, “On the method of binary picture representation and its application to data compression”, IEEE Trans. Pattern Anal. Machine Intell, vol. PAMI-2, pp. 27–35, Jan. 1980.
7. A. Klinger, “Patterns and search statistics”, in Optimizing Methods in Statistics, J. S. Rustagi, Ed. New York: Academic, 1971, pp. 303-337.
8. R. Lumina, “A new three-dimensional connected components algorithm”, Comput. Vision, Graphics, Image Processing, vol. 23, pp. 207–217, Aug. 1983.
9. D. Meagher, “Geometric modeling using octree encoding”, Comput. Graphics Image Processing, vol. 19, pp. 129–147, June 1982.
10. M. Minsky and S. Papert, Perceptrons: An Introduction to Computational Geometry. Cambridge, MA: M.I.T. Press, 1969.
11. A. Rosenfeld and J. L. Pfaltz, “Sequential operations in digital image processing”, J. ACM, vol. 13, pp. 471–494, Oct. 1966.
12. H. Samet, “Connected component labeling using quadtrees”, J. ACM, vol. 28, pp. 487–501, July 1981.
13. H. Samet, “The quadtree and related hierarchical data structures”, ACM Comput. Surveys, vol. 16, pp. 187–260, June 1984.
14. H. Samet, “A topdown quadtree traversal algorithm”, IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, Jan. 1985; also, Univ. Maryland, College Park, Comput. Sci. TR-1237.
15. H. Samet and M. Tamminen, “Computing geometric properties of images represented by linear quadtrees”, IEEE Trans. Pattern Anal. Machine Intell, vol. PAMI-7, Mar. 1985.
16. H. Samet and M. Tamminen, “An improved approach to connected component labeling of images”, in Proc. CVPR86 Conf., Miami Beach, FL, June 1986, pp. 312-318.
17. M. Tamminen, “Component on quad- and octtrees”, Commun. ACM, vol. 27, pp. 248–249, Mar. 1984.
18. M. Tamminen and H. Samet, “Effective octree conversion by connectivity labeling”, in Proc. SIGGRAPH '84 Conf., Minneapolis, MN, July 1984, pp. 43-51.
19. R. E. Tarjan, “Efficiency of a good but not linear set union algorithm”, J. ACM, vol. 22, pp. 215–225, Apr. 1975.
20. R. E. Tarjan and J. van Leeuwen, “Worst-case analysis of set union algorithms”, J. ACM, vol. 31, pp. 245–281, Apr. 1984.
21. M. Yau and S. N. Srihari, “A hierarchical data structure for multidimensional digital images”, Commun. ACM, vol. 26, pp. 504–515, July 1983.