论文标题
高光谱数据中的光谱变异性不混合:全面评论
Spectral Variability in Hyperspectral Data Unmixing: A Comprehensive Review
论文作者
论文摘要
高光谱图像中包含的材料的光谱特征,也称为末日(EM),可能会受到通常在图像中发生的大气,照明或环境条件的变化的显着影响。传统的频谱解及(SU)算法忽略了末端成员的光谱变异性,这在整个Unmixing过程中传播了严重的失误错误,并损害了其结果的质量。因此,最近已致力于减轻SU中光谱变异性的影响。这导致了算法的发展,这些算法结合了不同的策略,使EM可以在高光谱图像中变化,例如,使用的光谱特征集已知,已知的先验,贝叶斯,参数或本地EM模型。这些方法中的每一种都有不同的特征和潜在的动机。本文介绍了全面的文献综述,将解决此问题的经典和最新方法构成背景。我们详细评估了光谱变异性及其在图像光谱中的影响。此外,我们提出了一种新的分类法,该分类法根据从业人员的角度根据必要的监督和所需的计算成本来组织现有作品。我们还审查了基于观察到的高光谱图像以及用于库增强和还原的算法,用于构建光谱库(许多SU技术所需的)方法。最后,我们以一些讨论和该领域可能未来的方向进行了一些讨论和概述。
The spectral signatures of the materials contained in hyperspectral images, also called endmembers (EM), can be significantly affected by variations in atmospheric, illumination or environmental conditions typically occurring within an image. Traditional spectral unmixing (SU) algorithms neglect the spectral variability of the endmembers, what propagates significant mismodeling errors throughout the whole unmixing process and compromises the quality of its results. Therefore, large efforts have been recently dedicated to mitigate the effects of spectral variability in SU. This resulted in the development of algorithms that incorporate different strategies to allow the EMs to vary within a hyperspectral image, using, for instance, sets of spectral signatures known a priori, Bayesian, parametric, or local EM models. Each of these approaches has different characteristics and underlying motivations. This paper presents a comprehensive literature review contextualizing both classic and recent approaches to solve this problem. We give a detailed evaluation of the sources of spectral variability and their effect in image spectra. Furthermore, we propose a new taxonomy that organizes existing works according to a practitioner's point of view, based on the necessary amount of supervision and on the computational cost they require. We also review methods used to construct spectral libraries (which are required by many SU techniques) based on the observed hyperspectral image, as well as algorithms for library augmentation and reduction. Finally, we conclude the paper with some discussions and an outline of possible future directions for the field.