Novel architectures for real-time matching in hyperspectral images

• Published in: 2011 3rd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS) pp. 1 - 4
• Main Authors: Horstrand, P., Lopez, S., Callico, G. M., Lopez, J. F., Sarmiento, R.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2011
• Subjects: Algorithm design and analysis; Computer architecture; Cross Correlation; Field programmable gate arrays; FPGA; Hardware; Hyperspectral imaging; Pipelines; real time; Spectral Angle
• DOI: 10.1109/WHISPERS.2011.6080921
• ISBN: 9781457722028; 145772202X
• ISSN: 2158-6268

Hyperspectral images are nowadays used in multiple fields, such as medical diagnosis, assessment of food quality, or environmental monitoring, just to name some. Due to their inherent nature, a great number of these applications require the implementation of a real time hyperspectral image processing system. However, most of the research effort so far has been concentrated on the development of mathematical algorithms to process these images, rather than in the implementation of them into a piece of hardware able to face with real time requirements. In this paper, the architectural design and hardware implementation of two hyperspectral matching algorithms (spectral angle and cross correlation) onto a Virtex-5 FPGA device are presented. In this sense, the goal of this work is not only to reduce image processing times by mapping these algorithms onto a programmable hardware platform, but also to provide a comparison between them in different terms, such as area occupation and throughput, than the ones normally used in the hyperspectral literature. The results demonstrate the achievement of speed-up factors of almost 600 times when compared with pure software implementations, as well as the higher hardware efficiency of the spectral angle with respect to the cross correlation algorithm. In addition, the benefits of adopting a pipelined architectural approach for the implementation of both algorithms are also proved, leading to a reduction in the time required for processing one hyperspectral cube of more than one order of magnitude with respect to state-of-the-art FPGA implementations.