Fast block-based algorithms for connected components labeling

Block-based algorithms are considered the fastest approach to label connected components in binary images. However, the existing algorithms are two-scan which would need more comparisons if they were used as one-and-a-half-scan algorithms. Here, we proposed a new mask that enables the design of a bl...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) pp. 2084 - 2088
Main Authors: Santiago, Diego J. C., Tsang Ing Ren, Cavalcanti, George D. C., Tsang Ing Jyh
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2013
Subjects:
Abstracts
blockbased
Computers
Connected components labeling
image analysis
image processing
Labeling
one-and-a-half-scan
ISSN:1520-6149
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Block-based algorithms are considered the fastest approach to label connected components in binary images. However, the existing algorithms are two-scan which would need more comparisons if they were used as one-and-a-half-scan algorithms. Here, we proposed a new mask that enables the design of a block-based one-and-a-half-scan algorithm without any extra comparison. Furthermore, three new efficient algorithms for connected components labeling are presented: a block-based two-scan, a pixel-based one-and-a-half-scan and a block-based one-and-a-half-scan. We conducted experiments using synthetic and realistic images to evaluate the performance of the proposed methods compared to the existing methods. The proposed block-based one-and-a-half-scan algorithm presents the best performance in the realistic images dataset composed of 1290 documents. Our block-based two-scan algorithm proved to be the fastest in the synthetic dataset, especially in low density images.
ISSN:1520-6149
DOI:10.1109/ICASSP.2013.6638021