Efficient Parallel Connected Component Labeling With a Coarse-to-Fine Strategy

@article{Chen2017EfficientPC,
  title={Efficient Parallel Connected Component Labeling With a Coarse-to-Fine Strategy},
  author={Jun Fen Chen and Keisuke Nonaka and Hiroshi Sankoh and Ryosuke Watanabe and Sabirin Houari and Sei Naito},
  journal={IEEE Access},
  year={2017},
  volume={6},
  pages={55731-55740}
}
This paper proposes a new parallel approach to solve connected components on a 2-D binary image. The following strategies are employed to accelerate neighborhood exploration after dividing an input image into independent blocks: 1) in the local labeling stage, a coarse-labeling algorithm, including row-column connection and unification, is applied first to reduce the complexity of an initialized local label map; a refinement algorithm is then introduced to merge separated sub-regions from a… CONTINUE READING
20
Twitter Mentions

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • Experimental results show that our method outperforms the other approaches between 29% and 80% on average.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 42 REFERENCES

Connected component labeling of binary images on a mesh connected massively parallel processor

  • Computer Vision, Graphics, and Image Processing
  • 1989
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

YACCLAB - Yet Another Connected Components Labeling Benchmark

  • 2016 23rd International Conference on Pattern Recognition (ICPR)
  • 2016
VIEW 2 EXCERPTS

A Line-Based Connected Component Labeling Algorithm Using GPUs

  • 2015 Third International Symposium on Computing and Networking (CANDAR)
  • 2015
VIEW 3 EXCERPTS

Similar Papers

Loading similar papers…