Linear time algorithm for finding a picture's connected components

摘要

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.