GPU Sparse Ray-Traced Segmentation

This paper introduces a real-time region growing segmentation algorithm, designed for graphics processing units (GPUs), which labels only a fraction of the input elements. Instead of searching locally around each element for strong similarity, like state-of-the-art segmentation and pre-segmentation...

Full description

Bibliographic Details
Main Authors: Lucian Petrescu, Anca Morar, Florica Moldoveanu, Alin Moldoveanu
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
GPU
Online Access:https://ieeexplore.ieee.org/document/8718269/
id doaj-8e823fc69fc64c83b29a4755fd2f2a5f
record_format Article
spelling doaj-8e823fc69fc64c83b29a4755fd2f2a5f2021-03-29T23:27:05ZengIEEEIEEE Access2169-35362019-01-017685116852110.1109/ACCESS.2019.29177218718269GPU Sparse Ray-Traced SegmentationLucian Petrescu0Anca Morar1https://orcid.org/0000-0002-4773-6862Florica Moldoveanu2Alin Moldoveanu3https://orcid.org/0000-0002-1368-7249Department of Computer Science, Faculty of Automatic Control and Computers, Politehnica University of Bucharest, Bucharest, RomaniaDepartment of Computer Science, Faculty of Automatic Control and Computers, Politehnica University of Bucharest, Bucharest, RomaniaDepartment of Computer Science, Faculty of Automatic Control and Computers, Politehnica University of Bucharest, Bucharest, RomaniaDepartment of Computer Science, Faculty of Automatic Control and Computers, Politehnica University of Bucharest, Bucharest, RomaniaThis paper introduces a real-time region growing segmentation algorithm, designed for graphics processing units (GPUs), which labels only a fraction of the input elements. Instead of searching locally around each element for strong similarity, like state-of-the-art segmentation and pre-segmentation methods do, the proposed algorithm searches both locally and remotely, using a unique ray tracing-based search strategy, which quickly covers the segmentation search space. The presented algorithm fully exploits the parallelism of the GPUs, sparsely segmenting high-resolution images (4K) in real-time on low range laptops and other mobile devices, approximately 5× times faster than the state-of-the-art simple linear iterative clustering (SLIC). While this paper demonstrates the results with images, the algorithm is trivially modifiable to work with input sets of any dimension. In contrast to the state-of-the-art real-time GPU methods, this algorithm doesn't require additional merging steps, as pre-segmentation methods do, and it produces complete segmentation. Additionally, post-segmentation optional stages for complete labeling and region merging on the GPU are also provided, although they are not always necessary.https://ieeexplore.ieee.org/document/8718269/GPUimage segmentationparallel processingray tracing search strategysparse segmentation
collection DOAJ
language English
format Article
sources DOAJ
author Lucian Petrescu
Anca Morar
Florica Moldoveanu
Alin Moldoveanu
spellingShingle Lucian Petrescu
Anca Morar
Florica Moldoveanu
Alin Moldoveanu
GPU Sparse Ray-Traced Segmentation
IEEE Access
GPU
image segmentation
parallel processing
ray tracing search strategy
sparse segmentation
author_facet Lucian Petrescu
Anca Morar
Florica Moldoveanu
Alin Moldoveanu
author_sort Lucian Petrescu
title GPU Sparse Ray-Traced Segmentation
title_short GPU Sparse Ray-Traced Segmentation
title_full GPU Sparse Ray-Traced Segmentation
title_fullStr GPU Sparse Ray-Traced Segmentation
title_full_unstemmed GPU Sparse Ray-Traced Segmentation
title_sort gpu sparse ray-traced segmentation
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description This paper introduces a real-time region growing segmentation algorithm, designed for graphics processing units (GPUs), which labels only a fraction of the input elements. Instead of searching locally around each element for strong similarity, like state-of-the-art segmentation and pre-segmentation methods do, the proposed algorithm searches both locally and remotely, using a unique ray tracing-based search strategy, which quickly covers the segmentation search space. The presented algorithm fully exploits the parallelism of the GPUs, sparsely segmenting high-resolution images (4K) in real-time on low range laptops and other mobile devices, approximately 5× times faster than the state-of-the-art simple linear iterative clustering (SLIC). While this paper demonstrates the results with images, the algorithm is trivially modifiable to work with input sets of any dimension. In contrast to the state-of-the-art real-time GPU methods, this algorithm doesn't require additional merging steps, as pre-segmentation methods do, and it produces complete segmentation. Additionally, post-segmentation optional stages for complete labeling and region merging on the GPU are also provided, although they are not always necessary.
topic GPU
image segmentation
parallel processing
ray tracing search strategy
sparse segmentation
url https://ieeexplore.ieee.org/document/8718269/
work_keys_str_mv AT lucianpetrescu gpusparseraytracedsegmentation
AT ancamorar gpusparseraytracedsegmentation
AT floricamoldoveanu gpusparseraytracedsegmentation
AT alinmoldoveanu gpusparseraytracedsegmentation
_version_ 1724189444032954368