18 May 2013 Low-rank decomposition-based anomaly detection
Author Affiliations +
With high spectral resolution hyperspectral imaging is capable of uncovering many subtle signal sources which cannot be known a priori or visually inspected. Such signal sources generally appear as anomalies in the data. Due to high correlation among spectral bands and sparsity of anomalies, a hyperspectral image can be e decomposed into two subspaces: a background subspace specified by a matrix with low rank dimensionality and an anomaly subspace specified by a sparse matrix with high rank dimensionality. This paper develops an approach to finding such low-high rank decomposition to identify anomaly subspace. Its idea is to formulate a convex constrained optimization problem that minimizes the nuclear norm of the background subspace and little ι1 norm of the anomaly subspace subject to a decomposition of data space into background and anomaly subspaces. By virtue of such a background-anomaly decomposition the commonly used RX detector can be implemented in the sense that anomalies can be separated in the anomaly subspace specified by a sparse matrix. Experimental results demonstrate that the background-anomaly subspace decomposition can actually improve and enhance RXD performance.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shih-Yu Chen, Shih-Yu Chen, Shiming Yang, Shiming Yang, Konstantinos Kalpakis, Konstantinos Kalpakis, Chein-I Chang, Chein-I Chang, "Low-rank decomposition-based anomaly detection", Proc. SPIE 8743, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIX, 87430N (18 May 2013); doi: 10.1117/12.2015652; https://doi.org/10.1117/12.2015652

Back to Top