A randomized subspace-based robust principal component analysis (RSRPCA) method for anomaly detection in hyperspectral imagery (HSI) is proposed. The RSRPCA combines advantages of randomized column subspace and robust principal component analysis (RPCA). It assumes that the background has low-rank properties, and the anomalies are sparse and do not lie in the column subspace of the background. First, RSRPCA implements random sampling to sketch the original HSI dataset from columns and to construct a randomized column subspace of the background. Structured random projections are also adopted to sketch the HSI dataset from rows. Sketching from columns and rows could greatly reduce the computational requirements of RSRPCA. Second, the RSRPCA adopts the columnwise RPCA (CWRPCA) to eliminate negative effects of sampled anomaly pixels and that purifies the previous randomized column subspace by removing sampled anomaly columns. The CWRPCA decomposes the submatrix of the HSI data into a low-rank matrix (i.e., background component), a noisy matrix (i.e., noise component), and a sparse anomaly matrix (i.e., anomaly component) with only a small proportion of nonzero columns. The algorithm of inexact augmented Lagrange multiplier is utilized to optimize the CWRPCA problem and estimate the sparse matrix. Nonzero columns of the sparse anomaly matrix point to sampled anomaly columns in the submatrix. Third, all the pixels are projected onto the complemental subspace of the purified randomized column subspace of the background and the anomaly pixels in the original HSI data are finally exactly located. Several experiments on three real hyperspectral images are carefully designed to investigate the detection performance of RSRPCA, and the results are compared with four state-of-the-art methods. Experimental results show that the proposed RSRPCA outperforms four comparison methods both in detection performance and in computational time.
This article proposes a symmetric sparse representation (SSR) method to extract pure endmembers from hyperspectral imagery (HSI). The SSR combines the features of the linear unmixing model and the sparse subspace clustering model of endmembers, and it assumes that the desired endmembers and all the HSI pixel points can be sparsely represented by each other. It formulates the endmember extraction problem into a famous program of archetypal analysis, and accordingly, extracting pure endmembers can be transformed as finding the archetypes in the minimal convex hull containing all the HSI pixel points. The vector quantization scheme is adopted to help in carefully choosing the initial pure endmembers, and the archetypal analysis program is solved using the simple projected gradient algorithm. Seven state-of-the-art methods are implemented to make comparisons with the SSR on both synthetic and real hyperspectral images. Experimental results show that the SSR outperforms all the seven methods in spectral angle distance and root-mean-square error, and it can be a good alternative choice for extracting pure endmembers from HSI data.
A low-rank and sparse matrix decomposition (LRaSMD) detector has been proposed to detect anomalies in hyperspectral imagery (HSI). The detector assumes background images are low-rank while anomalies are gross errors that are sparsely distributed throughout the image scene. By solving a constrained convex optimization problem, the LRaSMD detector separates the anomalies from the background. This protects the background model from corruption. An anomaly value for each pixel is calculated using the Euclidean distance, and anomalies are determined by thresholding the anomaly value. Four groups of experiments on three widely used HSI datasets are designed to completely analyze the performances of the new detector. Experimental results show that the LRaSMD detector outperforms the global Reed-Xiaoli (GRX), the orthogonal subspace projection-GRX, and the cluster-based detectors. Moreover, the results show that LRaSMD achieves equal or better detection performance than the local support vector data description detector within a shorter computational time.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.