Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.patcog.2008.10.013 | Pattern Recognition |
Keywords | Field | DocType |
fundamental operation,parallel implementation,label equivalence,pattern recognition,efficient procedure,binary image,provisional label,connected component,fast two-scan algorithm | Sequence labeling,Algorithm complexity,Pattern recognition,Correctness,Binary image,Algorithm,Equivalence (measure theory),Connected component,Artificial intelligence,Pixel,Connected-component labeling,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 9 | Pattern Recognition |
Citations | PageRank | References |
99 | 4.58 | 32 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lifeng He | 1 | 441 | 40.97 |
| Yuyan Chao | 2 | 315 | 24.07 |
| Kenji Suzuki | 3 | 207 | 10.29 |
| Kesheng Wu | 4 | 1231 | 108.30 |