z-logo
open-access-imgOpen Access
Fast Euclidean Cluster Extraction Using GPUs
Author(s) -
Anh Nguyen,
Abraham Monrroy,
Masato Edahiro,
Shinpei Kato
Publication year - 2020
Publication title -
journal of robotics and mechatronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.257
H-Index - 19
eISSN - 1883-8049
pISSN - 0915-3942
DOI - 10.20965/jrm.2020.p0548
Subject(s) - computer science , cuda , speedup , cluster analysis , process (computing) , graphics , general purpose computing on graphics processing units , euclidean distance , task (project management) , parallel computing , acceleration , point cloud , cloud computing , similarity (geometry) , cluster (spacecraft) , artificial intelligence , computer graphics (images) , image (mathematics) , physics , management , classical mechanics , economics , operating system , programming language
Clustering is the task of dividing an input dataset into groups of objects based on their similarity. This process is frequently required in many applications. However, it is computationally expensive when running on traditional CPUs due to the large number of connections and objects the system needs to inspect. In this paper, we investigate the use of NVIDIA graphics processing units and their programming platform CUDA in the acceleration of the Euclidean clustering (EC) process in autonomous driving systems. We propose GPU-accelerated algorithms for the EC problem on point cloud datasets, optimization strategies, and discuss implementation issues of each method. Our experiments show that our solution outperforms the CPU algorithm with speedup rates up to 87X on real-world datasets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom