Connected components in binary images: the detection problem
Connected components in binary images: the detection problem
A new chain-coding algorithm for binary images using run-length codes
Computer Vision, Graphics, and Image Processing
Connected component labeling of binary images on a mesh connected massively parallel processor
Computer Vision, Graphics, and Image Processing
A systolic approach for real time connected component labeling
Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Connectivity in Digital Pictures
Journal of the ACM (JACM)
Computer and Robot Vision
Digital Image Processing
Digital Picture Processing
Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
A linear-time component-labeling algorithm using contour tracing technique
Computer Vision and Image Understanding
Detecting fingerprint minutiae by run length encoding scheme
Pattern Recognition
Hybrid object labelling in digital images
Machine Vision and Applications
Optimizing two-pass connected-component labeling algorithms
Pattern Analysis & Applications
Fast connected-component labeling
Pattern Recognition
Fast connected-component labelling in three-dimensional binary images based on iterative recursion
Computer Vision and Image Understanding
A Run-Based Two-Scan Labeling Algorithm
IEEE Transactions on Image Processing
A run-based two-scan labeling algorithm
ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
An algorithm for accuracy enhancement of license plate recognition
Journal of Computer and System Sciences
Hi-index | 0.00 |
This paper presents a run-based one-scan algorithm for labeling connected components in a binary image. Our algorithm is different with conventional raster-scan label-equivalence-based algorithms in two ways: (1) to complete connected component labeling, all conventional label-equivalence-based algorithms scan a whole image two or more times, our algorithm scans a whole image only once; (2) all conventional label-equivalence-based algorithms assign each object pixel a provisional label in the first scan and rewrite it in later scans, our algorithm does not assign object pixels but runs provisional labels. In the scan, our algorithm records all run data in an image in a one-dimensional array and assigns a provisional label to each run. Any label equivalence between runs is resolved whenever it is found in the scan, where the smallest label is used as their representative label. After the scan finished, all runs that belong to a connected component will hold the same representative label. Then, using the recorded run data, each object pixel of a run is assigned the representative label corresponding to the run without rewriting the values (i.e., provisional labels) of object pixels and scanning any background pixel again. Experimental results demonstrate that our algorithm is extremely efficient on images with long runs or small number of object pixels.