By Topic

Parallel High Dimensional Self Organizing Maps Using CUDA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Felipe C. Moraes ; Centro de Cienc. Computacionais(C3), Univ. Fed. de Rio Grande, Rio Grande, Brazil ; Silvia C. Botelho ; Nelson Duarte Filho ; Joel Felipe O. Gaya

A common neural network used for complex data clustering is the Self Organizing Maps(SOM). This algorithm have a expensive training step, that occur mainly on high dimensional applications like image clustering. This makes impossible for some of these applications to be run in real time or even in a feasible time. On this paper we explore the use of GPUs with the NVIDIA CUDA language to decrease computational cost of SOM. We propose a three steps implementation able to reduce the computational complexity of the algorithm under SIMD paradigm and also making a good use of GPU's resources. At the end we were able to get a peak speed-up of 44 times against a C CPU implementation, fact that concludes about SOM's data parallelism.

Published in:

Robotics Symposium and Latin American Robotics Symposium (SBR-LARS), 2012 Brazilian

Date of Conference:

16-19 Oct. 2012