Name
Abstract | ||
|---|---|---|
This paper presents a run-and label-equivalence-based one-and-a-half-scan algorithm for labeling connected components in a binary image. Major differences between our algorithm and conventional label-equivalence-based algorithms are: (1) all conventional label-equivalence-based algorithms scan all pixels in the given image at least twice, whereas our algorithm scans background pixels once and object pixels twice; (2) all conventional label-equivalence-based algorithms assign a provisional label to each object pixel in the first scan and relabel the pixel in the later scan(s), whereas our algorithm assigns a provisional label to each run in the first scan, and after resolving label equivalences between runs, by using the recorded run data, it assigns each object pixel a final label directly. That is, in our algorithm, relabeling of object pixels is not necessary any more. Experimental results demonstrated that our algorithm is highly efficient on images with many long runs and/or a small number of object pixels. Moreover, our algorithm is directly applicable to run-length-encoded images, and we can obtain contours of connected components efficiently. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0218001410008032 | INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
Labeling algorithm, connected component, label equivalence, run-length encoding, raster scan | Computer vision,Pattern recognition,Computer science,Binary image,Algorithm,Run-length encoding,Raster scan,Random walker algorithm,Artificial intelligence,Connected component,Pixel,Connected-component labeling | Journal |
Volume | Issue | ISSN |
24 | 4 | 0218-0014 |
Citations | PageRank | References |
8 | 0.52 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lifeng He | 1 | 441 | 40.97 |
| Yuyan Chao | 2 | 315 | 24.07 |
| Kenji Suzuki | 3 | 505 | 38.99 |