Journal
IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume 26, Issue 5, Pages 2179-2191Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2017.2676344
Keywords
Hyperspectral data; nonlinear unmixing; band selection; kernel methods; maximum clique problem
Funding
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico [305377/2009-4, 400566/2013-3, 141094/2012-5]
- ANR [ANR-12-BS03-003]
- CNRS Imagin Project [2015OPTIMISME]
- BNPSI ANR [ANR-13- BS-03-0006-01]
Ask authors/readers for more resources
Kernel-based nonlinear mixing models have been applied to unmix spectral information of hyperspectral images when the type of mixing occurring in the scene is too complex or unknown. Such methods, however, usually require the inversion of matrices of sizes equal to the number of spectral bands. Reducing the computational load of these methods remains a challenge in large-scale applications. This paper proposes a centralized band selection (BS) method for supervised unmixing in the reproducing kernel Hilbert space. It is based upon the coherence criterion, which sets the largest value allowed for correlations between the basis kernel functions characterizing the selected bands in the unmixing model. We show that the proposed BS approach is equivalent to solving a maximum clique problem, i.e., searching for the biggest complete subgraph in a graph. Furthermore, we devise a strategy for selecting the coherence threshold and the Gaussian kernel bandwidth using coherence bounds for linearly independent bases. Simulation results illustrate the efficiency of the proposed method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available