基于二次散射非线性混合模型的矿物填图方法

传统的遥感地质填图方法较少考虑到一个像元中多种地物共生存在的情况,因此所填图件难以反映矿物的分布特征。针对线性混合模型解混精度不高的问题,使用二次散射非线性混合模型对高光谱数据进行光谱解混,并在此基础上,提出了k(k≥2)类地物的填图规则。采用美国内华达州Cuprite地区AVIRIS数据进行填图实验,将其结果与Clark等的填图结果进行对比。实验结果表明:与线性模型的矿物填图相比,基于二次散射非线性混合模型所填图件更加接近矿物的真实分布;使用k(k≥2)类矿物填图规则的填图结果细节丰富,与Clark等人的填图结果吻合度高。     

利用线性混合模型进行高光谱混合图像分解

简述了混合像元及线性模型的基本理论,介绍了线性光谱模型进行分解的步骤,以具体实例实现应用线性混合模型对高光谱混合影像的分解。     

线性混合光谱模型高光谱压缩感知

高光谱压缩感知(HCS)对于解决机载或星载高光谱数据的存储与实时传输具有重要意义。目前,线性混合模型(LMM)已被成功应用于HCS;然而,由于光照条件、地形变化以及大气作用等的影响,所获取的地物光谱会发生扰动,从而限制了HCS重建质量的提高。在LMM基础上,通过引入光谱修正项来修正光谱扰动,提出了光谱扰动修正的LMM (SPC_LMM);在此基础上,进一步提出了基于SPC_LMM的HCS (HCS_SPC_LMM)方法。该方法在采样端仅对原始高光谱图像进行光谱维压缩采样,基于压缩采样数据,将SPC_LMM应用HCS的重建,利用交替方向乘子法(ADMM)分别估计SPC_LMM中各分量的最优值,以获得最优的高光谱图像重建质量。实验结果表明,HCS_SPC_LMM能够获得优于其他典型HCS方法的重建质量。     

线性和非线性光谱混合模型模拟土壤、植被混合光谱的效果分析

论述模拟混合光谱形成的几种主要光谱混合模型,并用实验数据对线性模型和一种非线性模型的模拟效果进行比较.结果表明在实验区域中非线性模型模拟的效果并不比线性模型好,但因为非线性模型考虑了土壤、植被光谱之间的相互作用,其模拟的效果通常不会比线性模型差.     

UFCLS线性光谱混合分析法在遥感图像分类识别中的效果分析

用非监督全约束最小二乘法对线性光谱混合模型进行了反演,通过获得各像元组分的面积比图像来达到对各像元分类的目的。将非监督全约束最小二乘法的分类结果与有限光谱混合分析法的分类结果进行对比,结果表明,无论从分类效果还是计算时间上看,前者都优于后者。     

利用核方法进行高光谱遥感图像线性解混

为了提高高光谱遥感图像混合像元分解的精度,提出基于核方法的高光谱线性解混。采用核化正交子空间投影（orthogonal subspace projection,OSP）算子、最小二乘正交子空间投影（least squares OSP,LSOSP）算子、非负约束最小二乘（nonnegative constrained least-squares,NCLS）算子和全约束最小二乘（fully constrained least-squares,FCLS）算子等方法分别构建核正交子空间投影（Kernel OSP,KOSP）、核最小二乘正交子空间投影（Kernel LSOSP,KLSOSP）、核非负约束最小二乘（Kernel NCLS,KNCLS）和核全约束最小二乘（Kernel FCLS,KFCLS）高光谱图像混合像元解混模型。对CUPRITE矿区AVIRIS数据进行KLSOSP、KNCLS和KFCLS与LSOSP、NCLS和FCLS丰度反演对比实验,结果表明,对于混合像元广泛存在的高光谱遥感图像来说,基于核方法的KLSOSP,KNCLS和KFCLS的解混精度优于LSOSP,NCLS和FCLS;附加约束条件有利于提高丰度反演的精度。     

基于PCA的高光谱遥感图像分类

高光谱遥感图像的出现进一步提升遥感图像分类的准确性,但高光谱遥感图像的数据量大,处理高光谱遥感图像复杂度高、效率低。为解决这一问题,将主成分分析算法作为遥感图像分类的预处理技术。分析主成分分析算法的原理,利用主成分分析算法提取高光谱图像的主要波段图像。通过实验验证得出结论:高光谱遥感图像的主波段图像包含分类所需的大部分信息,利用少数的主波段图像即可达到70%以上的分类正确率。实验结果表明,在保证分类正确率的前提下,PCA算法可有效地减少图像分类处理的数据量,提高图像的处理效率。     

差分搜索的多线性高光谱图像解混研究

针对高光谱图像解混精度不高和全约束非线性解混耗时长的问题,该文提出了一种基于差分搜索的多线性高光谱图像解混算法。首先,引入多线性混合模型建立全约束解混目标函数,将多线性解混问题转化为最优化问题;再利用差分搜索算法的[0,1]搜索域与"和为1"边界控制机制满足丰度约束条件,从而简化全约束解混目标函数;最后,对简化后的目标函数进行迭代优化求解,进而实现多线性高光谱图像解混。实验结果表明:该算法在保证解混精度的同时减少了全约束非线性解混时间,能够取得较好的解混效果。     

高光谱遥感图像的监督分类

图像分类是高光谱遥感图像分析与应用的重要手段。总结了目前用于高光谱图像监督分类的主要方法,包括最小距离法、最大似然法、神经元网络法和支持向量机法,分析了上述方法的特点,并探讨了高光谱遥感图像分类方法的发展趋势。     

高光谱遥感影像混合像元分解研究进展

受高光谱成像仪低空间分辨率及复杂地物的影响,高光谱遥感图像存在大量混合像元。为提高地表分类精度以及满足亚像元级目标探测的需求,混合像元分解技术一直是高光谱遥感研究热点之一。本文主要对高光谱混合像元分解技术中的核心问题:端元数目估计、端元提取算法、丰度估计算法进行综述,系统地分析了各种典型算法的原理及优缺点,进一步阐述研究过程中建立高精度遥感混合反演模型与遥感产品业务化中的混合像元分解技术难题,同时针对今后混合像元分解技术发展方向,指出在继续引入新型算法理论方法基础上,结合用户应用需求,推进高光谱混合像元分解算法业务化应用,为高光谱遥感工程化应用提供支持。     

UL-Isomap based nonlinear dimensionality reduction for hyperspectral imagery classification

The paper proposes an upgraded landmark-Isometric mapping (UL-Isomap) method to solve the two problems of landmark selection and computational complexity in dimensionality reduction using landmark Isometric mapping (LIsomap) for hyperspectral imagery (HSI) classification. First, the vector quantization method is introduced to select proper landmarks for HSI data. The approach considers the variations in local density of pixels in the spectral space. It locates the unique landmarks representing the geometric structures of HSI data. Then, random projections are used to reduce the bands of HSI data. After that, the new method incorporates the Recursive Lanczos Bisection (RLB) algorithm to construct the fast approximate k-nearest neighbor graph. The RLB algorithm accompanied with random projections improves the speed of neighbor searching in UL-Isomap. After constructing the geodesic distance graph between landmarks and all pixels, the method uses a fast randomized low-rank approximate method to speed up the eigenvalue decomposition of the inner-product matrix in multidimensional scaling. Manifold coordinates of landmarks are then computed. Manifold coordinates of non-landmarks are computed through the pseudo inverse transformation of landmark coordinates. Five experiments on two different HSI datasets are run to test the new UL-Isomap method. Experimental results show that UL-Isomap surpasses LIsomap, both in the overall classification accuracy (OCA) and in computational speed, with a speed over 5 times faster. Moreover, the UL-Isomap method, when compared against the Isometric mapping (Isomap) method, obtains only slightly lower OCAs.     

Adaptive MAP sub-pixel mapping model based on regularization curve for multiple shifted hyperspectral imagery

Sub-pixel mapping is a promising technique for producing a spatial distribution map of different categories at the sub-pixel scale by using the fractional abundance image as the input. The traditional sub-pixel mapping algorithms based on single images often have uncertainty due to insufficient constraint of the sub-pixel land-cover patterns within the low-resolution pixels. To improve the sub-pixel mapping accuracy, sub-pixel mapping algorithms based on auxiliary datasets, e.g., multiple shifted images, have been designed, and the maximum a posteriori (MAP) model has been successfully applied to solve the ill-posed sub-pixel mapping problem. However, the regularization parameter is difficult to set properly. In this paper, to avoid a manually defined regularization parameter, and to utilize the complementary information, a novel adaptive MAP sub-pixel mapping model based on regularization curve, namely AMMSSM, is proposed for hyperspectral remote sensing imagery. In AMMSSM, a regularization curve which includes an L-curve or U-curve method is utilized to adaptively select the regularization parameter. In addition, to take the influence of the sub-pixel spatial information into account, three class determination strategies based on a spatial attraction model, a class determination strategy, and a winner-takes-all method are utilized to obtain the final sub-pixel mapping result. The proposed method was applied to three synthetic images and one real hyperspectral image. The experimental results confirm that the AMMSSM algorithm is an effective option for sub-pixel mapping, compared with the traditional sub-pixel mapping method based on a single image and the latest sub-pixel mapping methods based on multiple shifted images.     

采用目标端元修正的高光谱混合像元盲分解

针对非负矩阵盲信号分离(NMF)用于混合像元分解易陷入局部极小值的不足,将非监督端元提取与盲分解方法相结合,构建了一种基于目标端元修正的混合像元盲分解模型(ATGP-NMF)。ATGP-NMF模型利用非监督正交子空间投影算法(ATGP)和非负最小二乘法(NNLS)获取NMF盲分离的初始值,然后将获得初始目标端元光谱与丰度输入NMF模型,通过迭代运算不断逼近优化目标而得到最终的端元光谱和端元丰度。为了检验模型对于各类数据的有效性和适用性,将ATGP-NMF与传统NMF分别应用于模拟仿真数据、室内控制数据和真实遥感影像3类实验数据进行分析验证。结果表明,ATGP-NMF模型具有较好的适用性,在没有先验信息、先验信息很少,以及纯像元假设不存在情况下都能较好地分解混合像元,且能够更好克服局部极小问题,提高混合像元分解的精度。     

A Gaussian elimination based fast endmember extraction algorithm for hyperspectral imagery

A fast endmember-extraction algorithm based on Gaussian Elimination Method (GEM) is proposed in this paper under the fact that a pixel is an endmember if it has the maximum value in any spectral band of a hyperspectral image when based on linear mixing model. Applying Gaussian elimination is much like performing a lower triangular matrix to transform the hyperspectral image. As more endmembers have been extracted, fewer bands are needed to be involved in the Gaussian elimination process, thus greatly reducing the computing time. The experimental results with both simulated and real hyperspectral images indicate that the method proposed here is much faster than the vertex component analysis (VCA) method, and can provide a similar performance with VCA.     

The effectiveness of spectral similarity measures for the analysis of hyperspectral imagery

In geological imaging spectrometry (i.e., hyperspectral remote sensing), surface compositional information (e.g., mineralogy and subsequently chemistry) is obtained by statistical comparison (by means of spectral matching algorithms) of known field- or library spectra to unknown image spectra. Though these algorithms are readily used, little emphasis has been given to comparison of the performance of the various spectral matching algorithms. Four spectral measures are presented: three that calculate the angle (spectral angle measure, SAM), the vector distance (Euclidean distance measure, ED) or the vector cross-correlation (spectral correlation measure, SCM), between a known reference and unknown target spectrum and a fourth measure that measures the discrepancy of probability distributions between two pixel vectors (the spectral information divergence, SID). The performance of these spectral similarity measures is compared using synthetic hyperspectral and real (i.e., Airborne Visible Infrared Imaging Spectrometer, AVIRIS) hyperspectral data of a (artificial or real) hydrothermal alteration system characterised by the minerals alunite, kaolinite, montmorillonite and quartz. Two statistics are used to assess the performance of the spectral similarity measures: the probability of spectral discrimination (PSD) and the power of spectral discrimination (PWSD). The first relates to the ability of the selected set of spectral endmembers to map a target spectrum, whereas the second expresses the capability of a spectral measure to separate two classes relative to a reference class. Analysis of the synthetic data set (i.e., simulated alteration zones with crisp boundaries at 1–2 nm spectral resolution) shows that (1) the SID outperforms the classical empirical spectral matching techniques (SAM, SCM and ED), (2) that SCM (SID, SAM and ED do not) exploits the overall shape of the reflectance curve and hence its outcomes are (positively and negatively) affected by the spectral range selected, (3) SAM and ED give nearly similar results and (4) for the same reason as in (2), the SCM is also more sensitive (again in positive and negative sense) to the spectral noise added. Results from the study of AVIRIS data show that SAM yields more spectral confusion (i.e., class overlap) than SID and SCM. In turn, SID is more effective in mapping the four target minerals than SCM as it clearly outperforms SCM when the target mineral coincides with the mineral phase on the ground.     

Small target extraction based on independent component analysis for hyperspectral imagery

A small target detection approach based on independent component analysis for hyperspectral data is put forward. In this algorithm, firstly the fast independent component analysis(FICA) is used to collect target information hided in high-dimensional data and projects them into low-dimensional space. Secondly, the feature images are selected with kurtosis. At last, small targets are extracted with histogram image segmentation which has been labeled by skewness.     

Small target extraction based on independent component analysis for hyperspectral imagery

IntroductionFeature extraction or transformation is a key stepfor target detection in hyperspectral imagery. Thepurpose is to transform the high-dimensional imageinto low-dimensional image series so that the differ-ences between the targets and the backgr…     

一种基于PPI的高光谱数据矿物信息自动提取方法

本文通过分析PPI算法后续处理存在的问题,引入最大距离法(MD)实现基于PPI的端元自动分类,并将获得的未知端元在波谱库中遍历以匹配最佳地类,最终完成基于PPI端元的矿物信息的自动提取。实验采用美国内华达州Cuprite地区的机载AVIRIS和我国东天山地区的星载Hyperion高光谱遥感数据,利用IDL编程实现矿物信息的自动提取,通过对实验结果的比较分析,验证了本文方法的有效性和实用性。     

加权概率原型分析的高光谱影像波段选择

高光谱遥感影像波段众多、相关性强,导致其实际分类应用计算量大且存在明显的"维数灾难"问题。本文提出加权概率原型分析方法来研究高光谱影像的波段选择问题。该方法考虑波段间的差异性,引入综合差异性度量指标来构造权重矩阵以改进传统原型分析模型;考虑稀疏系数的狄利克雷分布和高光谱成像过程的量子特性,引入贝叶斯框架理论来构建波段选择的优化模型。加权概率原型分析方法采用迭代优化的策略,利用交替方向乘积方法来依次求解两个凸优化子问题来得到局部最优的稀疏系数矩阵并实现波段子集的最优估计。基于两个公开的高光谱数据集,对比4种主流的波段选择方法(SpaBS、SNMF、ISSC、SSR)来验证提出方法的可靠性。实验结果表明,加权概率原型分析方法的总体分类精度高于其他4种方法,能够得到更好的分类结果图。本文提出的加权概率原型分析模型能够选择合适的波段子集来满足高光谱影像的高精度分类需求。     

高光谱遥感影像多级联森林深度网络分类算法

高光谱遥感技术在环境监测、应急保障、精细地物提取等方面有着广泛的应用,随着高分五号高光谱数据的正式发布,高光谱遥感技术将发挥更重要的作用。遥感影像分类作为高光谱遥感影像信息处理的重要部分,已成为当前研究重点。本文针对传统多级联森林深度学习中模型复杂、无法利用基分类器差异信息、对类间差异较小的样本无法正确区分等不足,提出了一种改进的多级联森林深度学习模型,在模型框架中,分别采用了随机森林和旋转森林作为基分类器,并引入逻辑回归分类器作为判别器用于训练层扩展。相较于传统的深度神经网络,改进的多级联森林深度网络超参数较少且能够自适应确定训练层,更方便进行模型优化。实验采用了高分五号数据集及两个公开的高光谱数据集(Indian Pines数据集及Pavia University数据集)进行精度评定,同时选择了传统分类器支持向量机、深度置信网等模型作为对比分析。实验结果表明,改进的多级联森林深度学习模型能有效地进行高光谱遥感影像分类,且较传统的分类方法精度有所提升。