Two linear unmixing algorithms to recognize targets using supervised classification and orthogonal rotation in airborne hyperspectral images

13Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

The goal of the paper is to detect pixels that contain targets of known spectra. The target can be present in a sub- or above pixel. Pixels without targets are classified as background pixels. Each pixel is treated via the content of its neighborhood. A pixel whose spectrum is different from its neighborhood is classified as a "suspicious point". In each suspicious point there is a mix of target(s) and background. The main objective in a supervised detection (also called "target detection") is to search for a specific given spectral material (target) in hyperspectral imaging (HSI) where the spectral signature of the target is known a priori from laboratory measurements. In addition the fractional abundance of the target is computed. To achieve this we present two linear unmixing algorithms that recognize targets with known (given) spectral signatures. The CLUN is based on automatic feature extraction from the target's spectrum. These features separate the target from the background. The ROTU algorithm is based on embedding the spectra space into a special space by random orthogonal transformation and on the statistical properties of the embedded result. Experimental results demonstrate that the targets' locations were extracted correctly and these algorithms are robust and efficient. © 2012 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Averbuch, A., & Zheludev, M. (2012). Two linear unmixing algorithms to recognize targets using supervised classification and orthogonal rotation in airborne hyperspectral images. Remote Sensing, 4(2), 532–560. https://doi.org/10.3390/rs4020532

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free