27 April 2009 Accelerating hyperspectral manifold learning using graphical processing units
Author Affiliations +
Manifold learning has been widely studied in pattern recognition, image processing, and machine learning. A large number of nonlinear manifold learning methods have been proposed attempting to preserve a different geometrical property of the underlying manifold. In contrast, its application to hyperspectral images is computationally difficult due to the calculation of distances among spectral values in high-dimensional spaces. This paper compares feature extraction algorithms using isomap, Laplacian Eigenmaps, and local linear embedding in real hyperspectral images. They are implemented using massively parallel general purpose Graphical Processor Units (GPUs) to speed up computation. Their performance in classification of hyperspectral images and speed up of their computation is presented. Results using real and synthetic hyperspectral scenarios are presented. Additionally, a formulation including spatial information in these manifold learning algorithms is presented.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Santiago Velasco-Forero, Santiago Velasco-Forero, Vidya Manian, Vidya Manian, } "Accelerating hyperspectral manifold learning using graphical processing units", Proc. SPIE 7334, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XV, 73341R (27 April 2009); doi: 10.1117/12.820176; https://doi.org/10.1117/12.820176

Back to Top