Parallel implementation of nonlinear dimensionality reduction methods applied in object segmentation using CUDA in GPU

Abstract

ABSTRACT Manifold learning, also called nonlinear dimensionality reduc tion, affords a way to understand and visualize the structure of nonlinear hyperspectral datasets. These methods use graphs to represent the manifold topology, and use metrics like geodesic distance, allowing embedding higher dimension objects into lower dimension. However the complexities of some manifold learning algorithms are* : 7 ;, therefore they are very slow (high computational algorithms). In this paper we present a CUDA-based parallel implementation of the three most popular manifold learning algorithms like Isomap, Locally linear embedding, and Laplacian eigenmaps, using CUDA multi-thread model. The result of this dimensionality reduction was employed in segmentation using active contours as an application of these reduced hyperspectral images. The manifold learning algorithms were implemented on a 64-bit workstation equipped with a quad-core Intel® Xeon with 12 GB RAM and two NVIDIA Tesla C1060 GPU cards. Manifold learning outperforms significantly and achieve up to 26x spee dup. It also shows good scalability where varying the size of the dataset and the number of K nearest neighbors. Keywords: Manifold Learning, Nonlinear dimensionality reduction, Isomap, Locally linear embedding, Laplacian eigenmap, CUDA, GPU, Shortest Path, Graph.