期刊
PATTERN RECOGNITION
卷 42, 期 9, 页码 1977-1987出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2008.10.013
关键词
Labeling algorithm; Label equivalence; Connected component; Linear-time algorithm; Pattern recognition
资金
- TOYOAKI Scholarship foundation, Japan
Labeling of connected components in a binary image is one of the most fundamental operations in pattern recognition: labeling is required whenever a computer needs to recognize objects (connected components) in a binary image. This paper presents a fast two-scan algorithm for labeling of connected components in binary images. We propose an efficient procedure for assigning provisional labels to object pixels and checking label equivalence. Our algorithm is very simple in principle, easy to implement, and suitable for hardware and parallel implementation. We show the correctness of our algorithm, analyze its complexity, and compare it with other labeling algorithms. Experimental results demonstrated that our algorithm is superior to conventional labeling algorithms. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据