Search Results (5)

The airborne hyperspectral remote sensing systems (AHRSSs) acquire images with high spectral resolution, high spatial resolution, and high temporal dimension. While the AHRSS captures more detailed information from the terrain objects, the computational complexity of data processing is greatly increased. As an important application technology in the hyperspectral domain, anomaly detection (AD) processing must be real-time and high-precision in many cases, such as post-disaster rescue, military battlefield search, and natural disaster detection. In this paper, the real-time AD technology for the push-broom AHRSS is studied, the mathematical model is established, and a novel implementation framework is proposed. Firstly, the optimized kernel minimum noise fraction (OP-KMNF) transformation is employed to extract informative and discriminative features between the background and anomalies. Secondly, the Nyström method is introduced to reduce the computational complexity of OP-KMNF transformation by decomposing and extrapolating the sub-kernel matrix to estimate the eigenvector of the entire kernel matrix. Thirdly, the extracted features are transferred to hard disks for data storage. Then, taking the extracted features as input data, the background separation model-based CEM anomaly detector (BSM-CEMAD) is imported to detect anomalies. Finally, graphics processing unit (GPU) parallel computing is utilized in the Nyström-based OP-KMNF (NOP-KMNF) transformation and the BSM-CEMAD to improve the execution efficiency, and the real-time AD for the push-broom AHRSS could be realized. To test the feasibility of the implementation framework proposed in this paper, the experiment is carried out with the Airborne Multi-Modular Imaging Spectrometer (AMMIS) developed by the Shanghai Institute of Technical Physics as the data acquisition platform. The experimental results show that the proposed method outperforms many other state-of-the-art AD methods in anomalies detection and background suppression. Moreover, under the condition that the downlink data could retain most of the hyperspectral data information, the proposed method achieves real-time detection of pixel-level anomalies, with the initial delay not exceeding 1 s, the false alarm rate (FAR) less than 5%, and the true positive rate (TPR) close to 98%. Full article

A significant challenge in methods for anomaly detection (AD) in hyperspectral images (HSIs) is determining how to construct an efficient representation for anomalies and background information. Considering the high-order structures of HSIs and the estimation of anomalies and background information in AD, this article proposes a kernel minimum noise fraction transformation-based background separation model (KMNF-BSM) to separate the anomalies and background information. First, spectral-domain KMNF transformation is performed on the original hyperspectral data to fully mine the high-order correlation between spectral bands. Then, a BSM that combines the outlier removal, the iteration strategy, and the Reed–Xiaoli detector (RXD) is proposed to obtain accurate anomalous and background pixel sets based on the extracted features. Finally, the anomalous and background pixel sets are used as input for anomaly detectors to improve the background suppression and anomaly detection capabilities. Experiments on several HSIs with different spatial and spectral resolutions over different scenes are performed. The results demonstrate that the KMNF-BSM-based algorithms have better target detectability and background suppressibility than other state-of-the-art algorithms. Full article

Feature extraction, aiming to simplify and optimize data features, is a typical hyperspectral image dimensionality reduction technique. As a kernel-based method, kernel minimum noise fraction (KMNF) transformation is excellent at handling the nonlinear features within HSIs. It adopts the kernel function to ensure data linear separability by transforming the original data to a higher feature space, following which a linear analysis can be performed in this space. However, KMNF transformation has the problem of high computational complexity and low execution efficiency. It is not suitable for the processing of large-scale datasets. In terms of this problem, this paper proposes a graphics processing unit (GPU) and Nyström method-based algorithm for Fast KMNF transformation (GNKMNF). First, the Nyström method estimates the eigenvector of the entire kernel matrix in KMNF transformation by the decomposition and extrapolation of the sub-kernel matrix to reduce the computational complexity. Then, the sample size in the Nyström method is determined utilizing a proportional gradient selection strategy. Finally, GPU parallel computing is employed to further improve the execution efficiency. Experimental results show that compared with KMNF transformation, improvements of up to 1.94% and 2.04% are achieved by GNKMNF in overall classification accuracy and Kappa, respectively. Moreover, with a data size of 64 × 64 × 250, the execution efficiency of GNKMNF speeds up by about 80×. The outcome demonstrates the significant performance of GNKMNF in feature extraction and execution efficiency. Full article

Dimensionality reduction (DR) is of great significance for simplifying and optimizing hyperspectral image (HSI) features. As a widely used DR method, kernel minimum noise fraction (KMNF) transformation preserves the high-order structures of the original data perfectly. However, the conventional KMNF noise estimation (KMNF-NE) uses the local regression residual of neighbourhood pixels, which depends heavily on spatial information. Due to the limited spatial resolution, there are many mixed pixels in HSI, making KMNF-NE unreliable for noise estimation and leading to poor performance in KMNF for classification on HSIs with low spatial resolution. In order to overcome this problem, a mixed noise estimation model (MNEM) is proposed in this paper for optimized KMNF (OP-KMNF). The MNEM adopts the sequential and linear combination of the Gaussian prior denoising model, median filter, and Sobel operator to estimate noise. It retains more details and edge features, making it more suitable for noise estimation in KMNF. Experiments using several HSI datasets with different spatial and spectral resolutions are conducted. The results show that, compared with some other DR methods, the improvement of OP-KMNF in average classification accuracy is up to 4%. To improve the efficiency, the OP-KMNF was implemented on graphics processing units (GPU) and sped up by about 60× compared to the central processing unit (CPU) implementation. The outcome demonstrates the significant performance of OP-KMNF in terms of classification ability and execution efficiency. Full article

This paper presents an optimized kernel minimum noise fraction transformation (OKMNF) for feature extraction of hyperspectral imagery. The proposed approach is based on the kernel minimum noise fraction (KMNF) transformation, which is a nonlinear dimensionality reduction method. KMNF can map the original data into a higher dimensional feature space and provide a small number of quality features for classification and some other post processing. Noise estimation is an important component in KMNF. It is often estimated based on a strong relationship between adjacent pixels. However, hyperspectral images have limited spatial resolution and usually have a large number of mixed pixels, which make the spatial information less reliable for noise estimation. It is the main reason that KMNF generally shows unstable performance in feature extraction for classification. To overcome this problem, this paper exploits the use of a more accurate noise estimation method to improve KMNF. We propose two new noise estimation methods accurately. Moreover, we also propose a framework to improve noise estimation, where both spectral and spatial de-correlation are exploited. Experimental results, conducted using a variety of hyperspectral images, indicate that the proposed OKMNF is superior to some other related dimensionality reduction methods in most cases. Compared to the conventional KMNF, the proposed OKMNF benefits significant improvements in overall classification accuracy. Full article