A General Approach to Connected-Component Labeling for Arbitrary Image Representations

Journal of the ACM (JACM)

Volumn 39, Issue 2, 1992, Pages 253-280

  Dillencourt, Michael B ^a   Samet, Hanan ^b   Tamminen, Markku ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

IMAGE REPRESENTATION; UNION-FIND ALGORITHM;

IMAGE CODING;

EID: 0026844063     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/128749.128750     Document Type: Article

References (20)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. DILLENCOURT, M. B., AND SAMET, H. Extracting region boundaries from maps stored as linear quadtrees. In Proceedings of the 3rd International Conference on Spatial Data Handling (Sydney, Australia, Aug.) 1988, pages 65-77.
3. GABOW, H. N. AND TARJAN, R. E. A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30. 2 (Apr. 1985), 209-221.
4. HARALICK. R. M. Some neighborhood operations. In M. Onoe, K. Preston, and A. Rosenfeld, eds. Real Time/Parallel Computing Image Analysis. Plenum Press, New York, 1981, pp. 11-35.
5. HOPCROFT, J., AND TARJAN, R. Efficient algorithms for graph manipulation. Commun. ACM 16. 6 (June 1973), 372-378.
6. LUMIA, R. A new three-dimensional connected components algorithm. Comput. Graph., Vision, Image Proc. 23, 2 (Aug. 1983), 207-217.
7. LUMIA, R., SHAPIRO, L., AND ZUNIGA, O. A new connected components algorithm for virtual memory computers. Comput. Graph., Vision, and Image Proc. 22, 2 (May 1983), 287-300.
8. PARK, C. M., AND ROSENFELD, A. Connectivity and genus in three dimensions. Computer Science Technical Report TR-156. Univ. Maryland, College Park, Md., May 1971.
9. ROSENFELD, A., AND KAK, A. C. Digital Picture Processing. Academic Press, Orlando, Fla., second edition, 1982.
10. ROSENFELD, A., AND PFALTZ, J. L. Sequential operations in digital picture processing. J. ACM 13, 4 (Oct. 1966), 471-494.
11. SAMET, H. Connected component labeling using quadtrees. J. ACM 28, 3 (July 1981) 487-501.
12. SAMET, H. The quadtree and related hierarchical data structures. ACM Comput. Surv. 16, 2 (June 1984), 187-260.
13. SAMET, FI. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, Mass., 1990.
14. SAMET, H., AND TAMMINEN, M. A general approach to connected component labeling of images. Computer Science Technical Report TR-1649. Univ. Maryland, College Park, Md., Aug. 1986.
15. SAMET, H., AND TAMMINEN, M. An improved approach to connected component labeling of images. In Proceedings of Computer Vision and Pattern Recognition 86 (Miami Beach, Fla., June) 1986, pp. 312-318.
16. SAMET, H., AND TAMMINEN, M. Efficient component labeling of images of arbitrary dimension represented by linear bintrees. IEEE Trans. Pattern Analysis and Machine Int. 10, 4 (July 1988), 579-586.
17. SCHWARTZ, J. T., SHARIR, M., AND SIEGEL, A. An efficient algorithm for finding connected components in a binary image. Robotics Research Technical Report 38. New York Univ. New York, Feb. 1985 (Revised July, 1985).
18. SHAFFER, C. A., SAMET, H., AND NELSON, R. C. QUILT: A geographical information system based on quadtrees. Int. J. Geograph. Inf. Syst. 4, 2 (April-June 1990), 103-131.
19. TARJAN, R. E. Efficiency of a good but not linear set union algorithm. J ACM 22, 2 (Apr 1975), 215-225.
20. TARJAN, R. E., AND VAN LEEUWEN, J. Worst-case analysis of set union algorithms. J. ACM, 31, 2 (Apr. 1984), 245-281.