A run-based algorithm for identifying connected components in binary images

We present a run-based algorithm for identifying connected components in binary images. We define affecting scope of a run and use an array whose size is equal to width of the image to store runs' labels in a row. The label's storing scope in the array is the run's affecting scope. By...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Software Engineering and Service Sciences pp. 137 - 141
Main Author Li Rong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2010
Subjects
Algorithm design and analysis
Arrays
binary image
Clustering algorithms
connected component
Joining processes
Labeling
Pixel
run-based algorithm
Online AccessGet full text
ISBN1424460549
9781424460540
ISSN2327-0586
DOI10.1109/ICSESS.2010.5552378

Cover

More Information
Summary:We present a run-based algorithm for identifying connected components in binary images. We define affecting scope of a run and use an array whose size is equal to width of the image to store runs' labels in a row. The label's storing scope in the array is the run's affecting scope. By checking values in the array we can know whether the current run connects with any upper-row neighbor runs. We also define updating principles to maintain the array. The algorithm only needs to scan image one pass and need not maintain an equivalent table, so its speed is fast and it is very simple. It can identify 4-connectivity and 8-connectivity connected components in binary images. Experiment results show that the algorithm is effective.
ISBN:1424460549
9781424460540
ISSN:2327-0586
DOI:10.1109/ICSESS.2010.5552378