Low-rank & sparse matrix decomposition and support vector machine for hyperspectral anomaly detection

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to the limited resolution of hyperspectral sensors, anomalous targets expressed with subpixels are often mixed with nonhomogeneous backgrounds. This fact makes anomalies difficult to be distinguished from the surrounding background. From this perspective, we propose a novel hyperspectral anomaly detection (AD) algorithm based on low-rank & sparse matrix decomposition (LRaSMD) and support vector machine (SVM). First, based on the LRaSMD technique, the Go decomposition (GoDec) model is utilized to decompose the original image into three components: background, anomalies and noise. In this way, the robust background can be obtained. Subsequently, a clustering algorithm is employed to pick some obvious anomalies. Accordingly, we use both samples of background and anomaly to train an SVM model. The original dataset is sent into the SVM model and both anomalous components and background components can be classified. Experiments on a synthetic hyperspectral image validate the performance of the proposed method.

Cite

CITATION STYLE

APA

Song, S., Zhou, H., Zhang, Z., Yang, Y., Xiang, P., Du, J., & Zhang, J. (2020). Low-rank & sparse matrix decomposition and support vector machine for hyperspectral anomaly detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12015 LNCS, pp. 315–321). Springer. https://doi.org/10.1007/978-3-030-54407-2_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free