由于不同的照明条件、复杂的大气环境等因素,相同端元的光谱特征在图像的不同位置呈现出可见的差异,这种现象被称为端元的光谱变异性。在相当大的场景中,端元的变异性可能很大,但在适度的局部同质区内,变异性往往很小。扰动线性混合模型...由于不同的照明条件、复杂的大气环境等因素,相同端元的光谱特征在图像的不同位置呈现出可见的差异,这种现象被称为端元的光谱变异性。在相当大的场景中,端元的变异性可能很大,但在适度的局部同质区内,变异性往往很小。扰动线性混合模型(Perturbed Linear Mixing Model,PLMM)在解混的过程中可以减轻端元变异性造成的不利影响,但是对缩放效应造成的变异性的处理能力较弱。为此,本文改进了扰动线性混合模型,引入了尺度因子以处理缩放效应造成的变异性,并结合超像素分割算法划分局部同质区,然后设计出基于局部同质区共享端元变异性的解混算法(Shared Endmember Variability in Unmixing,SEVU)。与扰动线性混合模型,扩展线性混合模型(Extended Linear Mixing Model,ELMM)等算法相比,所提SEVU算法在合成数据集上平均端元光谱角距离(mean Spectral Angle Distance,mSAD)和丰度均方根误差(abundance Root Mean Square Error,aRMSE)最优,分别为0.0855和0.0562;在Jasper Ridge和Cuprite真实数据集上mSAD是最优的,分别为0.0603和0.1003。在合成数据集和两个实测数据集上的实验结果验证了SEVU算法的有效性。展开更多
A new algorithm for decomposition of mixed pixels based on orthogonal bases of data space is proposed in this paper. It is a simplex-based method which extracts endmembers sequentially using computations of largest si...A new algorithm for decomposition of mixed pixels based on orthogonal bases of data space is proposed in this paper. It is a simplex-based method which extracts endmembers sequentially using computations of largest simplex volumes. At each searching step of this extraction algorithm, searching for the simplex with the largest volume is equivalent to searching for a new orthogonal basis which has the largest norm. The new endmember corresponds to the new basis with the largest norm. This algorithm runs very fast and can also avoid the dilemma in traditional simplex-based endmember extraction algorithms, such as N-FINDR, that it generally produces different sets of final endmembers if different initial conditions are used. Moreover, with this set of orthogonal bases, the proposed algorithm can also determine the proper number of endmembers and finish the unmixing of the original images which the traditional simplex-based algorithms cannot do by themselves. Experimental results of both artificial simulated images and practical remote sensing images demonstrate the algorithm proposed in this paper is a fast and accurate algorithm for the decomposition of mixed pixels.展开更多
基金National Natural Science Foundation of China （No.40971217） Geographic Spatial Information Engineering Key Laboratory of the State Bureau of Surveying and mapping （No.200915）
文摘由于不同的照明条件、复杂的大气环境等因素,相同端元的光谱特征在图像的不同位置呈现出可见的差异,这种现象被称为端元的光谱变异性。在相当大的场景中,端元的变异性可能很大,但在适度的局部同质区内,变异性往往很小。扰动线性混合模型(Perturbed Linear Mixing Model,PLMM)在解混的过程中可以减轻端元变异性造成的不利影响,但是对缩放效应造成的变异性的处理能力较弱。为此,本文改进了扰动线性混合模型,引入了尺度因子以处理缩放效应造成的变异性,并结合超像素分割算法划分局部同质区,然后设计出基于局部同质区共享端元变异性的解混算法(Shared Endmember Variability in Unmixing,SEVU)。与扰动线性混合模型,扩展线性混合模型(Extended Linear Mixing Model,ELMM)等算法相比,所提SEVU算法在合成数据集上平均端元光谱角距离(mean Spectral Angle Distance,mSAD)和丰度均方根误差(abundance Root Mean Square Error,aRMSE)最优,分别为0.0855和0.0562;在Jasper Ridge和Cuprite真实数据集上mSAD是最优的,分别为0.0603和0.1003。在合成数据集和两个实测数据集上的实验结果验证了SEVU算法的有效性。
基金Supported in part by the National Natural Science Foundation of China (Grant No. 60672116)the National High-Tech Research & Development Program of China (Grant No. 2009AA12Z115)the Shanghai Leading Academic Discipline Project (Grant No. B112)
文摘A new algorithm for decomposition of mixed pixels based on orthogonal bases of data space is proposed in this paper. It is a simplex-based method which extracts endmembers sequentially using computations of largest simplex volumes. At each searching step of this extraction algorithm, searching for the simplex with the largest volume is equivalent to searching for a new orthogonal basis which has the largest norm. The new endmember corresponds to the new basis with the largest norm. This algorithm runs very fast and can also avoid the dilemma in traditional simplex-based endmember extraction algorithms, such as N-FINDR, that it generally produces different sets of final endmembers if different initial conditions are used. Moreover, with this set of orthogonal bases, the proposed algorithm can also determine the proper number of endmembers and finish the unmixing of the original images which the traditional simplex-based algorithms cannot do by themselves. Experimental results of both artificial simulated images and practical remote sensing images demonstrate the algorithm proposed in this paper is a fast and accurate algorithm for the decomposition of mixed pixels.
