Skip to Main content Skip to Navigation
Conference papers

How to speed Connected Component Labeling up with SIMD RLE algorithms

Abstract : The research in Connected Component Labeling, although old, is still very active and several efficient algorithms for CPUs and GPUs have emerged during the last years and are always improving the performance. This article introduces a new SIMD run-based algorithm for CCL. We show how RLE compression can be SIMDized and used to accelerate scalar run-based CCL algorithms. A benchmark done on Intel, AMD and ARM processors shows that this new algorithm outperforms the State-of-the-Art by an average factor of ×1.7 on AVX2 machines and ×1.9 on Intel Xeon Skylake with AVX512.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Lionel Lacassagne Connect in order to contact the contributor
Submitted on : Thursday, February 27, 2020 - 1:26:52 PM
Last modification on : Sunday, June 26, 2022 - 2:47:32 AM
Long-term archiving on: : Thursday, May 28, 2020 - 3:28:21 PM


Files produced by the author(s)


  • HAL Id : hal-02492824, version 1


Florian Lemaitre, Arthur Hennequin, Lionel Lacassagne. How to speed Connected Component Labeling up with SIMD RLE algorithms. Workshop on Programming Models for SIMD/Vector Processing (WPMVP@PPoPP), Feb 2020, San Diego, Californie, United States. ⟨hal-02492824⟩



Record views


Files downloads