Connected Component Labeling Using Quadtrees

Journal of the ACM (JACM)

Volumn 28, Issue 3, 1981, Pages 487-501

  Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

connecuvity; pattern recognition; quadtree; unage processing

Indexed keywords

PATTERN RECOGNITION SYSTEMS;

IMAGE PROCESSING;

EID: 0019587751     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322261.322267     Document Type: Article

References (18)

1. Alexandridis, N, and Klinger, A Picture decomposition, tree data structures, and identifying directional symmetries as node combinations Comput. Graph Image Proc 8 (1976), 43–77.
2. Dyer, C R Computing the Euler number of an image from its quadtree. Comput, Graph Image Proc 13 (1980), 270–276.
3. Dyer, C R, Rosenfeld, A, and Samet, H Region representation: Boundary codes from quadtrees. Commun ACM 23, 3 (March 1980), 171–179.
4. Horowitz S L, and Pavlidis, T Picture segmentation by a tree traversal algorithm. J ACM 23, 2 (April 1976), 368–388.
5. Hunter, G M Efficient computation and data structures for graphics. Ph.D. Diss., Dep. of Electrical Engineering and Computer Science, Princeton Univ., Princeton, N.J., 1978.
6. Hunter, G M, and Steiglitz, K Operations on images using quadtrees. IEEE Trans. Pattern Anal. Machine Intell PAM1-I, 2 (April 1979), 145–153.
7. Hunter, G M, and Steiglitz, K Linear transformation of pictures represented by quadtrees. Comput Graph Image Proc 10 (1979), 289–296.
8. Klinger, A, and Dyer, C R Experiments in picture representation using regular decomposition Comput Graph. Image Proc. 5 (1976), 68–105.
9. Knuth, D E, The Art of Computer Programming, Vol I Fundamental Algorithms, 2nd ed Addison- Wesley, Reading, Mass, 1973, pp 353–355, 360, 572.
10. Minsky, M, and Papert, S. Perceptrons—An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass 1969.
11. Naur, P, Ed Revised report on the algorithm language ALGOL 60, Commun ACM 3, 5 (May 1960), 299–314.
12. Riseman, E M, and Arbib, M A Computational techniques in the visual segmentation of static scenes Comput Graph. Image Proc 6 (1977), 221–276.
13. Rosenfeld, A Connectivity in digital pictures J ACM 17, I (Jan. 1970), 146–160.
14. Rosenfeld, A, and Kak, A C Digital Picture Processing Academic Press, New York, 1976, Sec 8 1
15. Samet, H Region representation Quadtrees from boundary codes. Commun. ACM 23, 3 (March 1980), 163–170.
16. Tanimoto, S L Pictorial feature distortion in a pyramid. Comput Graph. Image Proc 5 (1976), 333–352.
17. Tanimoto, S L, and Pavlidis, T A hierarchical data structure for picture processing Comput Graph Image Proc 4(1975), 104–119.
18. Tarjan, RE On the efficiency of a good but not linear set union algorithm Tech. Rep 72-148, Computer Science Dep., Cornell Univ., Ithaca, New York, November 1972.