基于粒子群优化的高光谱影像端元提取算法

回顾了粒子群算法的基本原理,分析了端元提取算法的两种技术途径。利用粒子群优化的原理,结合凸面几何学理论和线性光谱混合模型,设计了一种粒子群优化端元提取算法,并设计了算法的快速实现方法。该算法不需要假设影像中存在纯像元,同时保持了端元光谱的形状。利用模拟数据和AVIRIS影像对该算法、SGA算法和NMF算法进行实验对比分析,实验结果证明该算法的端元提取精度优于其他二者。     

一种高光谱遥感影像端元自动提取方法

针对人工样本选择和端元提取存在的不确定性和工作量大等缺点,提出一种集成非监督分类、纯净像元指数计算、线性光谱混合模型和凸面单形体理论的自动端元提取算法,能够有效地提取端元用于高光谱遥感影像分类和混合像元分解。利用北京昌平地区的OMIS高光谱遥感数据进行了验证,结果表明算法可行有效,自动化程度较高,作为训练样本进行分类能够获得较高精度,优于常规方法。     

基于正则化方法的遥感图像混合像元分解

由于传感器的分辨率的限制,在低空间分辨率遥感图像中存在着大量的混合像元.混合像元所表示的并不是单一地面物体类别的光谱反射值,而是多种类别的反射光谱的组合.混合像元的混合模型可以分为线性混合模型和非线性混合模型.线性混合模型是最常用的一种解混合方法,对于线性混合模型的求解算法进行了研究,根据最小二乘原理,提出了基于正则化方法的线性混合模型求解算法,对实际遥感TM图像进行了解混合运算,求得了端元丰度图像和伪彩色合成图像.     

基于异常探测的高光谱端元提取方法研究

端元提取是高光谱影像分析重要且具有挑战性的任务,是解决高光谱图像混合像元分解关键的步骤。现行的高光谱端元提取算法在端元提取过程中,异常像元同时加入到端元数组中,如何有效区分异常与端元,成为高光谱遥感端元提取的瓶颈,也是提高高光谱图像混合像元分解精度的关键因素。提出一种基于异常探测的高光谱端元提取方法,首先利用RX算法对原始影像进行异常探测,根据异常探测的结果剔除一定数量的像元,将剔除的像元用原始图像均值向量替代,再对影像进行正交子空间投影(OSP)提取端元。实验表明,该方法能够有效区分异常与端元,抑制异常像元参与端元提取,同时处理后的图像端元提取的结果受异常处理的影响很小,证明了去除异常信息后提取端元的可行性。     

一种端元可变的混合像元分解方法

混合像元线性分解是高光谱影像处理的常用方法，它使用相同的端元矩阵对像元进行分解，其结果是分解精度不高。为此提出了一种端元可变的混合像元分解方法，在确定端元矩阵时，首先考察混合像元与端元的光谱相似性，结合地物空间分布特点，实现了可变端元的混合像元分解。试验结果表明，该分解方法分解精度优于传统线性模型，符合实际情况。     

基于拉格朗日的高光谱解混算法研究*

针对混合像元分解误差问题,提出一种基于拉格朗日算法的高光谱解混算法。通过变分增广拉格朗日算法提取出部分端元,由于端元组中存在相似端元影响解混精度,利用基于梯度的光谱信息散度算法进行光谱区分,除去相似端元。通过对得到的端元进行排序,依次增加端元进行光谱解混,将满足条件的端元增加进端元组,最终得到优选端元。该方法不仅有效去除了相似端元的干扰,而且不需要不断搜索端元的组合,根据每个端元对于混合像元的重要性做出相应次数的非限制性最小二乘法计算,得到更精确高光谱端元的子集,该方法对高光谱混合像元解混的效率以及可靠性均有所提高。     

一种自动获取端元的RMS误差迭代改进算法

端元提取是混合像元分解算法中的关键技术之一,端元的质量直接影响分解结果的精度。本文对基于均方根(RMS)误差分析迭代提取端元的算法进行了改进,提出在端元选择时,增加像元纯净指数(PPI)、光谱矢量距离以及RMS误差值作为约束条件。利用南京地区2002年TM遥感影像作为试验数据,用本文提出的方法提取各组分丰度图,结合V-I-S模型以及研究区的实际情况,分析所提取的各组分丰度空间分布合理性,参考同期IKONOS影像解译结果,对改进前后的分解算法进行精度比较。试验结果表明:基于改进法得到的各组分结果精度较好,其与实测值的回归曲线在相关系数、斜率以及截距方面均得到了较明显的改善,但对于光谱非线性混合现象较严重的地物仍存在一定局限性。     

Normalized Cut与分水岭变换在高光谱影像混合像元端元提取中的应用

现有的遥感影像端元提取方法主要是从光谱特征角度提出,而结合空间信息的端元提取方法是近些年遥感影像混合像元分解的研究热点,为此使用图论的图像分割Normalized Cut与分水岭变换方法提出了一种改进的空间预处理模型用于高光谱遥感影像混合像元的端元提取。该方法在混合像元端元提取过程中不仅利用遥感影像的光谱信息而且引入了像元的空间位置信息,实验结果表明本文提出的端元提取方法与现有的方法相比提高了遥感影像的混合像元分解精度。     

高光谱图像非线性解混方法的研究进展

由于空间分辨率的限制,高光谱遥感图像中存在大量混合像元,对混合像元的解混是实现地物精确分类和识别的前提。与传统的线性解混方法相比,非线性解混方法在寻找组成混合像元的端元以及每个端元的丰度时具有较高的精度。分析了光谱非线性混合的原理,总结了近年来提出的非线性解混算法,重点对双线性模型、神经网络、基于核函数的非线性解混算法以及基于流形学习的非线性解混算法进行了介绍和分析。最后总结了混合像元非线性解混未来发展的趋势。     

基于线性光谱混合模型(LSMM)的两种不同端元值选取方法应用与评价——以广州市为例

通过分别采用纯像元指数(PPI)和手动选取端元这两种不同的方法获得了2003年广州市区的植被、水体和不透水层3种端元,然后利用线性波谱分离法得到各个端元的丰度图像和均方根误差图像,从而获得广州市老八区不透水层的分量图。另外,还对比分析了基于线性光谱混合模型（LSMM）两种终端单元的选取方法的优缺点,并从定性的角度对所得结果进行精度评价。结果显示:基于线性光谱混合模型（LSMM）的方法获得广州市老八区不透水层的分量图是可行而有效的;手动选取端元的方法比纯像元指数（PPI）能够得到更高精度的分量图。     

基于光谱信息散度与光谱角匹配的高光谱解混算法

针对采用线性逆卷积(LD)算法进行端元初选过程中,端元子集中存在相似端元光谱,影响解混精度的问题,提出了一种基于光谱信息散度(SID)与光谱角匹配(SAM)算法的端元子集优选光谱解混算法。通过在端元进行二次选择时,采用以光谱信息散度和光谱角(SID-SA)混合法准则作为最相似端元选择的判据,去除相似端元,降低相似端元对解混精度的影响。实验结果表明,基于SID与SAM的高光谱解混算法将重构影像的均方根误差(RMSE)降低到0.0104,该方法比传统方法提高了端元的选择精度,减少了丰度估计误差,误差分布更加均匀。     

A quantitative and comparative analysis of different preprocessing implementations of DPSO: a robust endmember extraction algorithm

Linear spectral unmixing is a very important technique in hyperspectral image analysis. It contains two main steps. First, it finds spectrally unique signatures of pure ground components (called endmembers); second, it estimates their corresponding fractional abundances in each pixel. Recently, a discrete particle swarm optimization (DPSO) algorithm was introduced to accurately extract endmembers with high optimal performance. However, because of its limited feasible solution space, DPSO necessarily needs a small amount of candidate endmembers before extraction. Consequently, how to provide a suitable candidate endmember set, which has not been analyzed yet, is a critical issue in using DPSO for unmixing problem. In this study, three representative pure pixel-based methods, pixel purity index, vertex component analysis (VCA), and N-FINDR, are quantitatively compared to provide candidate endmembers for DPSO. The experiments with synthetic and real hyperspectral images indicate that VCA is the most reliable preprocessing implementation for DPSO. Further, it can be concluded that DPSO with the proposed preprocessing implementations given in this paper is robust for endmember extraction.     

基于RM S 误差分析的高光谱图像自动端元提取算法

提出了一种基于RM S ( root mean square) 误差分析的自动端元提取算法。对图像每做一次线性解混合, 就得到一幅以均方根RMS误差表示的残余误差图像, 从中选出误差较大的像素作为新的端元开始下一次解混合, 通过多次迭代, 直到得到了要求数目的端元。该算法克服了以往端元提取方法监督特性的局限, 减少了对先验信息的依赖, 同时保留了图像中的异常。利用仿真和实验数据验证了该算法的有效性。     

Generic visual analysis for multi- and hyperspectral image data

Multi- and hyperspectral imaging and data analysis has been investigated in the last decades in the context of various fields of application like remote sensing or microscopic spectroscopy. However, recent developments in sensor technology and a growing number of application areas require a more generic view on data analysis, that clearly expands the current, domain-specific approaches. In this context, we address the problem of interactive exploration of multi- and hyperspectral data, consisting of (semi-)automatic data analysis and scientific visualization in a comprehensive fashion. In this paper, we propose an approach that enables a generic interactive exploration and easy segmentation of multi- and hyperspectral data, based on characterizing spectra of an individual dataset, the so-called endmembers. Using the concepts of existing endmember extraction algorithms, we derive a visual analysis system, where the characteristic spectra initially identified serve as input to interactively tailor a problem-specific visual analysis by means of visual exploration. An optional outlier detection improves the robustness of the endmember detection and analysis. An adequate system feedback of the costly unmixing procedure for the spectral data with respect to the current set of endmembers is ensured by a novel technique for progressive unmixing and view update which is applied at user modification. The progressive unmixing is based on an efficient prediction scheme applied to previous unmixing results. We present a detailed evaluation of our system in terms of confocal Raman microscopy, common multispectral imaging and remote sensing.     

利用稳健非负矩阵分解实现无监督高光谱解混

目的 基于非负矩阵分解的高光谱图像无监督解混算法普遍存在着目标函数对噪声敏感、在低信噪比条件下端元提取和丰度估计性能不佳的缺点。因此,提出一种基于稳健非负矩阵分解的高光谱图像混合像元分解算法。方法 首先在传统基于非负矩阵分解的解混算法基础上,对目标函数加以改进,用更加稳健的L₁范数作为重建误差项,提高算法对噪声的适应能力,得到新的无监督解混目标函数。针对新目标函数的非凸特性,利用梯度下降法对端元矩阵和丰度矩阵交替迭代求解,进而完成优化求解,得到端元和丰度估计值。结果 分别利用模拟和真实高光谱数据,对算法性能进行定性和定量分析。在模拟数据集中,将本文算法与具有代表性的5种无监督解混算法进行比较,相比于对比算法中最优者,本文算法在典型信噪比20 dB下,光谱角距离（spectral angle distance,SAD）增大了10.5%,信号重构误差（signal to reconstruction error,SRE）减小了9.3%;在真实数据集中,利用光谱库中的地物光谱特征验证本文算法端元提取质量,并利用真实地物分布定性分析丰度估计结果。结论 提出的基于稳健非负矩阵分解的高光谱无监督解混算法,在低信噪比条件下,能够获得较好的端元提取和丰度估计精度,解混效果更好。     

Retrieval of subpixel Tamarix canopy cover from Landsat data along the Forgotten River using linear and nonlinear spectral mixture models

Repeatable approaches for mapping saltcedar (Tamarix spp.) at regional scales, with the ability to detect low density stands, is crucial for the species' effective control and management, as well as for an improved understanding of its current and potential future dynamics. This study had the objective of testing subpixel classification techniques based on linear and nonlinear spectral mixture models in order to identify the best possible classification technique for repeatable mapping of saltcedar canopy cover along the Forgotten River reach of the Rio Grande. The suite of methods tested were meant to represent various levels of constraints imposed in the solution as well as varying levels of classification details (species level and landscape level), sources for endmembers (space-borne multispectral image, airborne hyperspectral image and in situ spectra measurements) and mixture modes (linear and nonlinear). A multiple scattering approximation (MSA) model was proposed as a means to represent canopy (image) reflectance spectra as a nonlinear combination of subcanopy (field) reflectance spectra. The accuracy of subpixel canopy cover was assessed through a 1-m spatial-resolution hyperspectral image and field measurements. Results indicated that: 1) When saltcedar was represented by one single image spectrum (endmember), the unconstrained linear spectral unmixing with post-classification normalization produced comparable accuracy (OA = 72%) to those delivered by partially and fully constrained linear spectral unmixing (63-72%) and even by nonlinear spectral unmixing (73%). 2) The accuracy of the fully constrained linear spectral unmixing method increased (from 67% to 77%) when the classes were represented with several image spectra. 3) Saltcedar canopy reflectance showed the strongest nonlinear relationship with respect to subcanopy reflectance, as indicated through a range of estimated canopy recollision probabilities. 4) Despite the considerations of these effects on canopy reflectance, the inversion of the nonlinear spectral mixing model with subcanopy reflectance (field) measurements yielded slightly lower accuracy (73%) than the linear counterpart (77%). Implications of these results for region-wide monitoring of saltcedar invasion are also discussed.     

An endmember-based distance for content based hyperspectral image retrieval

We propose a specific content-based image retrieval (CBIR) system for hyperspectral images exploiting its rich spectral information. The CBIR image features are the endmember signatures obtained from the image data by endmember induction algorithms (EIAs). Endmembers correspond to the elementary materials in the scene, so that the pixel spectra can be decomposed into a linear combination of endmember signatures. EIA search for points in the high dimensional space of pixel spectra defining a convex polytope, often a simplex, covering the image data. This paper introduces a dissimilarity measure between hyperspectral images computed over the image induced endmembers, proving that it complies with the axioms of a distance. We provide a comparative discussion of dissimilarity functions, and quantitative evaluation of their relative performances on a large collection of synthetic hyperspectral images, and on a dataset extracted from a real hyperspectral image. Alternative dissimilarity functions considered are the Hausdorff distance and robust variations of it. We assess the CBIR performance sensitivity to changes in the distance between endmembers, the EIA employed, and some other conditions. The proposed hyperspectral image distance improves over the alternative dissimilarities in all quantitative performance measures. The visual results of the CBIR on the real image data demonstrate its usefulness for practical applications.     

非监督正交子空间投影的高光谱混合像元自动分解

利用混合像元线性分解技术处理高光谱影像，以获取研究区域中同一像元的不同组份是遥感应用的主要目的之一。近年来，研究者们发展了一种正交子空间投影技术(0SP)，用来探测感兴趣目标，进一步可以用来分解混合像元，然而应用这种方法分解混合像元的缺陷是需要有研究区域的先验信息，这就制约了它在这方面的应用。为此针对这种不足，提出一种非监督的正交子空间投影(UOSP)技术，用来自动获取影像端元光谱，同时进行混合像元分解。并用成像光谱数据(PHI)实例测试了这个方法，结果表明该方法自动获取的端元比较合理，且分解混合像元精度较高。