论文信息 - Linear time algorithm for finding a picture's connected components

Linear time algorithm for finding a picture's connected components

Abstract An algorithm that identifies the connnected components of a thresholded digitized picture is presented. The time complexity of the algorithm is linear in the number of runs of object pixels in the picture.

Peter Thanisch | A. Robin | B. V. McNally

[1] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .

[2] R. K. Lutz,et al. An Algorithm for the Real Time Analysis of Digitised Images , 1980, Comput. J..

[3] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[4] Hanan Samet,et al. Connected Component Labeling Using Quadtrees , 1981, JACM.