Journal
COMPUTER VISION AND IMAGE UNDERSTANDING
Volume 89, Issue 1, Pages 1-23Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/S1077-3142(02)00030-9
Keywords
labeling; connected component; linear time; sequential local operation; one-dimensional table; raster scan order
Ask authors/readers for more resources
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proportional to the number of pixels in connected components in an image. By comparative evaluations, it has been shown that the efficiency of the proposed algorithm is superior to those of the conventional algorithms. (C) 2003 Elsevier Science (USA). All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available