Parallel real-time virtual dimensionality estimation for hyperspectral images

One of the most important tasks in hyperspectral imaging is the estimation of the number of endmembers in a scene, where the endmembers are the most spectrally pure components. The high dimensionality of hyperspectral data makes this calculation computationally expensive. In this paper, we present s...

Full description

Saved in:
Bibliographic Details
Published in:Journal of real-time image processing 2018-04, Vol.14 (4), p.753-761
Main Authors: Torti, Emanuele, Fontanella, Alessandro, Plaza, Antonio
Format: Article
Language:English
Subjects:
Algorithms
Computer Graphics
Computer Science
Eigenvalues
Field programmable gate arrays
Graphics processing units
Hyperspectral imaging
Image Processing and Computer Vision
Linear algebra
Microprocessors
Multimedia Information Systems
Original Research Paper
Pattern Recognition
Real time
Signal,Image and Speech Processing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One of the most important tasks in hyperspectral imaging is the estimation of the number of endmembers in a scene, where the endmembers are the most spectrally pure components. The high dimensionality of hyperspectral data makes this calculation computationally expensive. In this paper, we present several new real-time implementations of the well-known Harsanyi–Farrand–Chang method for virtual dimensionality estimation. The proposed solutions exploit multi-core processors and graphic processing units for achieving real-time performance of this algorithm, together with better performance than other works in the literature. Our experimental results are obtained using both synthetic and real images. The obtained processing times show that the proposed implementations outperform other hardware-based solutions.
ISSN:1861-8200
1861-8219
DOI:10.1007/s11554-017-0703-6