A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

4 Citations (Scopus)

Abstract

In this paper we present a class of detection filters based on variations of the spectral screening. Spectral screening is a technique used in reducing the multispectral / hyperspectral data to a representative subset of spectra. The subset is formed such that any two spectra in it are dissimilar and, for any spectrum in the original image cube, there is a similar spectrum in the subset. Spectral screening is performed in a sequential manner, at each step, the subset being increased with a spectrum dissimilar from all the spectra already selected. The procedure, using the spectral angle as similarity measure is employed in a variety of algorithms for linear unmixing and data compression. We modified the algorithm such that at the selection step the spectrum with the largest distance from the set is selected. While not introducing additional computational complexity, the Maximum Spectral Screening (MSS) algorithm ensures that the overlap among the representatives is minimized. MSS is further improved by choosing as first spectra the one with the largest distance to the diagonal, thus transforming the screening into a deterministic process. Second, we investigated the alternative approach where at each step the spectra with the smallest distance (but larger than a threshold value) is selected (Minimum Spectral Screening - mSS). The detection filters were obtained as the classification projector matrices based on the spectral subset. The developed algorithms were tested on HYDICE hyperspectral data using the spectral angle and the spectral information divergence. The results indicate that MSS outperforms regular spectral screening detection and mSS.

Original languageEnglish
Title of host publication2006 Conference on Computer Vision and Pattern Recognition Workshop
Volume2006
DOIs
StatePublished - 21 Dec 2006
Event2006 Conference on Computer Vision and Pattern Recognition Workshops - New York, NY, United States
Duration: 17 Jun 200622 Jun 2006

Other

Other2006 Conference on Computer Vision and Pattern Recognition Workshops
CountryUnited States
CityNew York, NY
Period17/06/0622/06/06

Fingerprint

Screening
Data compression
Set theory
Computational complexity

Cite this

Robila, S. (2006). A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery. In 2006 Conference on Computer Vision and Pattern Recognition Workshop (Vol. 2006). [1640577] https://doi.org/10.1109/CVPRW.2006.10
Robila, Stefan. / A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery. 2006 Conference on Computer Vision and Pattern Recognition Workshop. Vol. 2006 2006.
@inproceedings{60a4298525124c0e9f2809d59f4ca022,
title = "A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery",
abstract = "In this paper we present a class of detection filters based on variations of the spectral screening. Spectral screening is a technique used in reducing the multispectral / hyperspectral data to a representative subset of spectra. The subset is formed such that any two spectra in it are dissimilar and, for any spectrum in the original image cube, there is a similar spectrum in the subset. Spectral screening is performed in a sequential manner, at each step, the subset being increased with a spectrum dissimilar from all the spectra already selected. The procedure, using the spectral angle as similarity measure is employed in a variety of algorithms for linear unmixing and data compression. We modified the algorithm such that at the selection step the spectrum with the largest distance from the set is selected. While not introducing additional computational complexity, the Maximum Spectral Screening (MSS) algorithm ensures that the overlap among the representatives is minimized. MSS is further improved by choosing as first spectra the one with the largest distance to the diagonal, thus transforming the screening into a deterministic process. Second, we investigated the alternative approach where at each step the spectra with the smallest distance (but larger than a threshold value) is selected (Minimum Spectral Screening - mSS). The detection filters were obtained as the classification projector matrices based on the spectral subset. The developed algorithms were tested on HYDICE hyperspectral data using the spectral angle and the spectral information divergence. The results indicate that MSS outperforms regular spectral screening detection and mSS.",
author = "Stefan Robila",
year = "2006",
month = "12",
day = "21",
doi = "10.1109/CVPRW.2006.10",
language = "English",
isbn = "0769526462",
volume = "2006",
booktitle = "2006 Conference on Computer Vision and Pattern Recognition Workshop",

}

Robila, S 2006, A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery. in 2006 Conference on Computer Vision and Pattern Recognition Workshop. vol. 2006, 1640577, 2006 Conference on Computer Vision and Pattern Recognition Workshops, New York, NY, United States, 17/06/06. https://doi.org/10.1109/CVPRW.2006.10

A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery. / Robila, Stefan.

2006 Conference on Computer Vision and Pattern Recognition Workshop. Vol. 2006 2006. 1640577.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery

AU - Robila, Stefan

PY - 2006/12/21

Y1 - 2006/12/21

N2 - In this paper we present a class of detection filters based on variations of the spectral screening. Spectral screening is a technique used in reducing the multispectral / hyperspectral data to a representative subset of spectra. The subset is formed such that any two spectra in it are dissimilar and, for any spectrum in the original image cube, there is a similar spectrum in the subset. Spectral screening is performed in a sequential manner, at each step, the subset being increased with a spectrum dissimilar from all the spectra already selected. The procedure, using the spectral angle as similarity measure is employed in a variety of algorithms for linear unmixing and data compression. We modified the algorithm such that at the selection step the spectrum with the largest distance from the set is selected. While not introducing additional computational complexity, the Maximum Spectral Screening (MSS) algorithm ensures that the overlap among the representatives is minimized. MSS is further improved by choosing as first spectra the one with the largest distance to the diagonal, thus transforming the screening into a deterministic process. Second, we investigated the alternative approach where at each step the spectra with the smallest distance (but larger than a threshold value) is selected (Minimum Spectral Screening - mSS). The detection filters were obtained as the classification projector matrices based on the spectral subset. The developed algorithms were tested on HYDICE hyperspectral data using the spectral angle and the spectral information divergence. The results indicate that MSS outperforms regular spectral screening detection and mSS.

AB - In this paper we present a class of detection filters based on variations of the spectral screening. Spectral screening is a technique used in reducing the multispectral / hyperspectral data to a representative subset of spectra. The subset is formed such that any two spectra in it are dissimilar and, for any spectrum in the original image cube, there is a similar spectrum in the subset. Spectral screening is performed in a sequential manner, at each step, the subset being increased with a spectrum dissimilar from all the spectra already selected. The procedure, using the spectral angle as similarity measure is employed in a variety of algorithms for linear unmixing and data compression. We modified the algorithm such that at the selection step the spectrum with the largest distance from the set is selected. While not introducing additional computational complexity, the Maximum Spectral Screening (MSS) algorithm ensures that the overlap among the representatives is minimized. MSS is further improved by choosing as first spectra the one with the largest distance to the diagonal, thus transforming the screening into a deterministic process. Second, we investigated the alternative approach where at each step the spectra with the smallest distance (but larger than a threshold value) is selected (Minimum Spectral Screening - mSS). The detection filters were obtained as the classification projector matrices based on the spectral subset. The developed algorithms were tested on HYDICE hyperspectral data using the spectral angle and the spectral information divergence. The results indicate that MSS outperforms regular spectral screening detection and mSS.

UR - http://www.scopus.com/inward/record.url?scp=33845518994&partnerID=8YFLogxK

U2 - 10.1109/CVPRW.2006.10

DO - 10.1109/CVPRW.2006.10

M3 - Conference contribution

SN - 0769526462

SN - 9780769526461

VL - 2006

BT - 2006 Conference on Computer Vision and Pattern Recognition Workshop

ER -

Robila S. A class of detection filters for targets and anomalies in multispectral / hyperspectral imagery. In 2006 Conference on Computer Vision and Pattern Recognition Workshop. Vol. 2006. 2006. 1640577 https://doi.org/10.1109/CVPRW.2006.10