The Community for Technology Leaders
Green Image
Issue No. 07 - July (2011 vol. 22)
ISSN: 1045-9219
pp: 1135-1141
Jukka Antikainen , University of Eastern Finland, Joensuu
Jiří Havel , Brno University of Technology, Brno
Radovan Jošth , Brno University of Technology, Brno
Adam Herout , Brno University of Technology, Brno
Pavel Zemčík , Brno University of Technology, Brno
Markku Hauta-Kasari , University of Eastern Finland, Joensuu
This article presents an optimized algorithm for Nonnegative Tensor Factorization (NTF), implemented in the CUDA (Compute Uniform Device Architecture) framework, that runs on contemporary graphics processors and exploits their massive parallelism. The NTF implementation is primarily targeted for analysis of high-dimensional spectral images, including dimensionality reduction, feature extraction, and other tasks related to spectral imaging; however, the algorithm and its implementation are not limited to spectral imaging. The speedups measured on real spectral images are around 60-100{\times} compared to a traditional C implementation compiled with an optimizing compiler. Since common problems in the field of spectral imaging may take hours on a state-of-the-art CPU, the speedup achieved using a graphics card is attractive. The implementation is publicly available in the form of a dynamically linked library, including an interface to MATLAB, and thus may be of help to researchers and engineers using NTF on large problems.
Nonnegative tensor factorization, spectral analysis, GPU.

M. Hauta-Kasari, P. Zemčík, R. Jošth, J. Havel, A. Herout and J. Antikainen, "Nonnegative Tensor Factorization Accelerated Using GPGPU," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1135-1141, 2010.
85 ms
(Ver 3.3 (11022016))