期刊
COMPUTER VISION AND IMAGE UNDERSTANDING
卷 89, 期 1, 页码 1-23出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/S1077-3142(02)00030-9
关键词
labeling; connected component; linear time; sequential local operation; one-dimensional table; raster scan order
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据