Maximized subspace model for hyperspectral anomaly detection

An important application in remote sensing using hyperspectral imaging system is the detection of anomalies in a large background in real-time. A basic anomaly detector for hyperspectral imagery that performs reasonaly well is the RX detector. In practice, the subspace RX (SSRX) detector which deletes the clutter subspace has been known to perform better than the RX detector. In this paper an anomaly detector that can do better than the SSRX detector without having to delete the clutter subspace is developed. The anomaly detector partials out the effect of the clutter subspace by predicting the background using a linear combination of the clutter subspace. The Mahalanobis distance of the resulting residual is defined as the anomaly detector. The coefficients of the linear combination are chosen to maximize a criterion based on squared correlation. The experimental results are obtained by implementing the anomaly detector as a global anomaly detector in unsupervised mode with background statistics computed from hyperspectral data cubes with wavelengths in the visible and near-infrared range. The results show that the anomaly detector has a better performance than the SSRX detector. In conclusion, the anomaly detector that is based on partialling out can achieve better performance than the conventional anomaly detectors.     

高光谱图像目标检测研究进展

目标检测是高光谱遥感领域一个重要研究方向,其在矿物勘探和国防侦查等领域都有着广泛的应用。简明、系统地介绍了高光谱图像目标检测中的一些关键算法及其在实际应用中存在的问题,并对未来发展方向进行了展望。     

Kernel-based regularized-angle spectral matching for target detection in hyperspectral imagery

Target detection is one of the most important applications of hyperspectral imagery in the field of both civilian and military. In this letter, we firstly propose a new spectral matching method for target detection in hyperspectral imagery, which utilizes a pre-whitening procedure and defines a regularized spectral angle between the spectra of the test sample and the targets. The regularized spectral angle, which possesses explicit geometric sense in multidimensional spectral vector space, indicates a measure to make the target detection more effective. Furthermore Kernel realization of the Angle-Regularized Spectral Matching (KAR-SM, based on kernel mapping) improves detection even more. To demonstrate the detection performance of the proposed method and its kernel version, experiments are conducted on real hyperspectral images. The experimental tests show that the proposed detector outperforms the conventional spectral matched filter and its kernel version.     

Persymmetric adaptive subspace detectors for range-spread targets

This paper investigates the problem of adaptive detection of a range-spread target in colored Gaussian disturbance. The range-spread target is described by a multi-rank subspace model, which lies in a subspace but with unknown coordinates. The disturbance, usually including clutter and thermal noise, has an unknown covariance matrix. Under the above assumption, we design the Rao and generalized likelihood ratio test (GLRT) detectors by the two-step procedure, which incorporates persymmetric structure of received data. The two detectors are shown to coincide with each other. Remarkably, the proposed detector ensures constant false alarm rate property. Experimental results conducted by both simulation and real data verify that the proposed detector outperforms the existing counterparts in training-limited scenarios.     

Kernel nearest-farthest subspace classifier for face recognition

Multimedia Tools and Applications - In this paper, a novel classifier named Kernel Nearest-Farthest Subspace (KNFS) classifier is proposed for face recognition. Inspired by the kernel-based...     

基于背景字典构造的稀疏表示高光谱目标检测

针对现有基于稀疏表示的目标检测算法采用同心双窗口构建背景字典的过程中,目标像元将会对背景字典产生干扰的问题,提出基于背景字典构造的稀疏表示高光谱目标检测算法.该算法将高光谱图像分解成低秩背景和稀疏目标,引入目标字典作为稀疏目标的先验信息,更好地分离目标和背景,构建纯净背景字典.通过在4个公开高光谱图像数据集上仿真分析,...     

Adaptive subspace detection of range-distributed target in compound-Gaussian clutter

This paper deals with high-resolution radar (HRR) adaptive detection of range-distributed target embedded in compound-Gaussian clutter which is modeled as a spherically invariant random process (SIRP). Using multiple dominant scattering (MDS) model of range-distributed target, we justify that range-distributed target can be modeled as a subspace random signal. The unknown deterministic parameters are replaced by their ML estimates and then the nonadaptive detector is proposed. A closed-form expression for the probability of false alarm of the nonadaptive detector is derived and it ensures CFAR property with respect to the unknown statistics of the clutter texture component. Moreover, an adaptive detector is obtained relying on a two-step GLRT-based design procedure. Performances of these proposed detectors are assessed through Monte Carlo simulations and are shown to have better detection performance compared with existing similar detector.     

Noise estimation for hyperspectral subspace identification on FPGAs

The Journal of Supercomputing - We present a reliable and efficient FPGA implementation of a procedure for the computation of the noise estimation matrix, a key stage for subspace identification of...     

A real-time unsupervised background extraction-based target detection method for hyperspectral imagery

Target detection is an important technique in hyperspectral image analysis. The high dimensionality of hyperspectral data provides the possibility of deeply mining the information hiding in spectra, and many targets that cannot be visualized by inspection can be detected. But this also brings some problems such as unknown background interferences at the same time. In this way, extracting and taking advantage of the background information in the region of interest becomes a task of great significance. In this paper, we present an unsupervised background extraction-based target detection method, which is called UBETD for short. The proposed UBETD takes advantage of the method of endmember extraction in hyperspectral unmixing, another important technique that can extract representative material signatures from the images. These endmembers represent most of the image information, so they can be reasonably seen as the combination of targets and background signatures. Since the background information is known, algorithm like target-constrained interference-minimized filter could then be introduced to detect the targets while inhibiting the interferences. To meet the rapidly rising demand of real-time processing capabilities, the proposed algorithm is further simplified in computation and implemented on a FPGA board. Experiments with synthetic and real hyperspectral images have been conducted comparing with constrained energy minimization, adaptive coherence/cosine estimator and adaptive matched filter to evaluate the detection and computational performance of our proposed method. The results indicate that UBETD and its hardware implementation RT-UBETD can achieve better performance and are particularly prominent in inhibiting interferences in the background. On the other hand, the hardware implementation of RT-UBETD can complete the target detection processing in far less time than the data acquisition time of hyperspectral sensor like HyMap, which confirms strict real-time processing capability of the proposed system.     

A real-time CFAR thresholding method for target detection in hyperspectral images

In order to support immediate decision-making in critical circumstances such as military reconnaissance and disaster rescue, real-time onboard implementation of target detection is greatly desired. In this paper, a real-time thresholding method (RT-THRES) is proposed to obtain the constant false alarm rate (CFAR) thresholds for target detection in real-time circumstances. RT-THRES utilizes Gaussian mixture model (GMM) to track and fit the distribution of the target detector’s outputs. GMM is an extension to Gaussian probability density function, which could approximate any distribution smoothly. In this method, GMM is utilized to model the detector’s output, and then the detection threshold is calculated to achieve a CFAR detection. The conventional GMM’s parameter estimation by Expectation-Maximization (EM) requires all data samples in the dataset to be involved during the procedure and the the parameters would be re-estimated when new data samples available. Thus, GMM is difficult to be applied in real-time processing when newly observed data samples coming progressively. To improve GMM’s application availability in time-critical circumstance, an optimization strategy is proposed by introducing the Incremental GMM (IGMM) which allows GMM’s parameter to be estimated online incrementally. Experiments on real hyperspectral image and synthetic dataset suggest that RT-THRES can track and model the detection outputs’ distribution accurately which ensures the accuracy of the calculation of CFAR thresholds. Moreover, by applying the optimization strategy the computational consumption of RT-THRES maintains relatively low.

     

FPGA implementation of collaborative representation algorithm for real-time hyperspectral target detection

Hyperspectral image contains various wavelength channels and the corresponding imagery processing requires a computation platform with high performance. Target and anomaly detection on hyperspectral image has been concerned because of its practicality in many real-time detection fields while wider applicability is limited by the computing condition and low processing speed. The field programmable gate arrays (FPGAs) offer the possibility of on-board hyperspectral data processing with high speed, low-power consumption, reconfigurability and radiation tolerance. In this paper, we develop a novel FPGA-based technique for efficient real-time target detection algorithm in hyperspectral images. The collaborative representation is an efficient target detection (CRD) algorithm in hyperspectral imagery, which is directly based on the concept that the target pixels can be approximately represented by its spectral signatures, while the other cannot. To achieve high processing speed on FPGAs platform, the CRD algorithm reduces the dimensionality of hyperspectral image first. The Sherman–Morrison formula is utilized to calculate the matrix inversion to reduce the complexity of overall CRD algorithm. The achieved results demonstrate that the proposed system may obtains shorter processing time of the CRD algorithm than that on 3.40 GHz CPU.     

A reconfigurable multi-mode implementation of hyperspectral target detection algorithms

Hyperspectral images obtained by imaging spectrometer contain a large data amount that requires techniques such as target detection for information extraction. The proposed multi-mode FPGA implementation combines matrix correlation and inversion matrix computations by using the Sherman-Morrison method to achieve real-time operation. The implementation supports Constrained Energy Minimization (CEM), Adjusted Spectral Matched Filter (ASMF) and modified Adaptive Cosine Estimator (ACE) detectors. The detection performance of the algorithms is evaluated using standard detection metrics. The proposed implementation has been realized on Zynq family SoCs and verified against the MATLAB reference software. The detection results for different fixed-point data types and target detection algorithms are reported. Finally, the proposed implementation is compared with state-of-the-art designs in terms of both throughput and resource utilization.     

Adaptive detectors in the Krylov subspace

The validity of the application of the Krylov subspace techniques in adaptive filtering and detection is investigated. A new verification of the equivalence of two well-known methods in the Krylov subspace, namely the multistage Wiener filters （MWF） and the auxiliary-vector filtering （AVF）, is given in this paper. The MWF and AVF are incorporated into two well-known detectors, namely, the adaptive matched filter （AMF） and Kelly＇s generalized likelihood ratio test （CLRT） including their diagonally loaded versions, which form new detectors. Compared to the conventional AMF, CLRT, and their diagonally loaded versions as well as the reduced-rank AMF and GLRT, the probabilities of detection （PDs） of the new detectors are improved especially when the sample support is low. More importantly, the new detectors are robust of the rank selection of the clutter subspace compared to the reduced-rank AMF and GLRT. These new detectors all possess asymptotic constant false alarm rate （CFAR） property.     

结合超像元和子空间投影支持向量机的高光谱图像分类

目的 高光谱图像包含了丰富的空间、光谱和辐射信息,能够用于精细的地物分类,但是要达到较高的分类精度,需要解决高维数据与有限样本之间存在矛盾的问题,并且降低因噪声和混合像元引起的同物异谱的影响。为有效解决上述问题,提出结合超像元和子空间投影支持向量机的高光谱图像分类方法。方法 首先采用简单线性迭代聚类算法将高光谱图像分割成许多无重叠的同质性区域,将每一个区域作为一个超像元,以超像元作为图像分类的最小单元,利用子空间投影算法对超像元构成的图像进行降维处理,在低维特征空间中执行支持向量机分类。本文高光谱图像空谱综合分类模型,对几何特征空间下的超像元分割与光谱特征空间下的子空间投影支持向量机（SVMsub）,采用分割后进行特征融合的处理方式,将像元级别转换为面向对象的超像元级别,实现高光谱图像空谱综合分类。结果 在AVIRIS（airbone visible/infrared imaging spectrometer）获取的Indian Pines数据和Reflective ROSIS（optics system spectrographic imaging system）传感器获取的University of Pavia数据实验中,子空间投影算法比对应的非子空间投影算法的分类精度高,特别是在样本数较少的情况下,分类效果提升明显;利用马尔可夫随机场或超像元融合空间信息的算法比对应的没有融合空间信息的算法的分类精度高;在两组数据均使用少于1%的训练样本情况下,同时融合了超像元和子空间投影的支持向量机算法在两组实验中分类精度均为最高,整体分类精度高出其他相关算法4%左右。结论 利用超像元处理可以有效融合空间信息,降低同物异谱对分类结果的不利影响;采用子空间投影能够将高光谱数据变换到低维空间中,实现有限训练样本条件下的高精度分类;结合超像元和子空间投影支持向量机的算法能够得到较高的高光谱图像分类精度。     

Improved sparse representation using adaptive spatial support for effective target detection in hyperspectral imagery

With increasing applications of hyperspectral imagery (HSI) in agriculture, mineralogy, military, and other fields, one of the fundamental tasks is accurate detection of the target of interest. In this article, improved sparse representation approaches using adaptive spatial support are proposed for effective target detection in HSI. For conventional sparse representation, an HSI pixel is represented as a sparse vector whose non-zero entries correspond to the weights of the selected training atoms from a structured dictionary. For improved sparse representation, spatial correlation and spectral similarity of adjacent neighbouring pixels are exploited as spatial support in this context. The size and shape of the spatial support is automatically determined using both adaptive window and adaptive neighbourhood strategies. Accordingly, a solution based on greedy pursuit algorithms is also given to solve the extended optimization problem in recovering the desired sparse representation. Comprehensive experiments on three different data sets using both visual inspection and quantitative evaluation are carried out. The results from these data sets have indicated that the proposed approaches help to generate improved results in terms of efficacy and efficiency.     

Assessment of noise reduction of hyperspectral imagery using a target detection application

This article presents an evaluation of a previously proposed noise reduction technique for hyperspectral imagery with regard to its use in remote sensing applications. Target detection from hyperspectral imagery was selected as an example for the evaluation. A hyperspectral datacube acquired using the airborne Shortwave Infrared Full Spectrum Imager (SFSI)-II with man-made targets deployed in the scene of the datacube was tested. In addition to an evaluation using the receiver operating characteristic (ROC) curve approach, we used a spectral unmixing technique to generate the fraction images of the target materials, measured the area of the targets derived from the datacube before and after applying the noise reduction technology, and then compared the derived target areas to the real targets to assess the detectability of the targets. The area ratio between a derived target and the real target was used as the criterion in the evaluation. The evaluation results show that the noise reduction technique can help to better serve remote sensing applications. The small targets that cannot be detected from the original datacube were detected after the noise reduction using the technology.     

Kernel methods for subspace identification of multivariable LPV and bilinear systems

Subspace identification methods for multivariable linear parameter-varying (LPV) and bilinear state-space systems perform computations with data matrices of which the number of rows grows exponentially with the order of the system. Even for relatively low-order systems with only a few inputs and outputs, the amount of memory required to store these data matrices exceeds the limits of what is currently available on the average desktop computer. This severely limits the applicability of the methods. In this paper, we present kernel methods for subspace identification performing computations with kernel matrices that have much smaller dimensions than the data matrices used in the original LPV and bilinear subspace identification methods. We also describe the integration of regularization in these kernel methods and show the relation with least-squares support vector machines. Regularization is an important tool to balance the bias and variance errors. We compare different regularization strategies in a simulation study.     

空域协同自编码器的高光谱异常检测

目的 自编码器作为一种无监督的特征提取算法,可以在无标签的条件下学习到样本的高阶、稠密特征。然而当训练集含噪声或异常时,会迫使自编码器学习这些异常样本的特征,导致性能下降。同时,自编码器应用于高光谱图像处理时,往往会忽略掉空域信息,进一步限制了自编码器的探测性能。针对上述问题,本文提出一种基于空域协同自编码器的高光谱异常检测算法。方法 利用块图模型优良的背景抑制能力从空域角度筛选用于自编码器训练的背景样本集。自编码器采用经预筛选的训练样本集进行网络参数更新,在提升对背景样本表达能力的同时避免异常样本对探测性能的影响。为进一步将空域信息融入探测结果,利用块图模型得到的异常响应构建权重,起到突出目标并抑制背景的作用。结果 实验在3组不同尺寸的高光谱数据集上与5种代表性的高光谱异常检测算法进行比较。本文方法在3组数据集上的AUC(area under the curve)值分别为0.990 4、0.988 8和0.997 0,均高于其他算法。同时,对比了不同的训练集选择策略,与随机选取和使用全部样本进行对比。结果表明,本文基于空域响应的样本筛选方法相较对比方法具有较明显的优势。结论 提出的基...