Hyperspectral Detection Algorithms: Use Covariances Or Subspaces?
Total Page:16
File Type:pdf, Size:1020Kb
Hyperspectral detection algorithms: Use covariances or subspaces? The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Manolakis, D. et al. “Hyperspectral detection algorithms: use covariances or subspaces?.” Imaging Spectrometry XIV. Ed. Sylvia S. Shen & Paul E. Lewis. San Diego, CA, USA: SPIE, 2009. 74570Q-8. © 2009 SPIE As Published http://dx.doi.org/10.1117/12.828397 Publisher Society of Photo-optical Instrumentation Engineers Version Final published version Citable link http://hdl.handle.net/1721.1/52735 Terms of Use Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. Hyperspectral Detection Algorithms: Use Covariances or Subspaces? D. Manolakis, R. Lockwooda, T. Cooleyb and J. Jacobsonc MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420 aSpace Vehicles Directorate Air Force Research Laboratory 29 Randolph Road, Hanscom AFB, MA 01731-3010 bSpace Vehicles Directorate Air Force Research Laboratory Kirtland AFB, 2251 Maxwell Ave, Kirtland AFB, NM, 87117 cNational Air and Space Intelligence Center, Wright-Patterson AFB, OH ABSTRACT There are two broad classes of hyperspectral detection algorithms.1, 2 Algorithms in the first class use the spectral co- variance matrix of the background clutter; in contrast, algorithms in the second class characterize the background using a subspace model. In this paper we show that, due to the nature of hyperspectral imaging data, the two families of algorithms are intimately related. The link between the two representations of the background clutter is the low-rank of the covariance matrix of natural hyperspectral backgrounds and its relation to the spectral linear mixture model. This link is developed using the method of dominant mode rejection. Finally, the effects of regularization, covariance shrinkage, and dominant mode rejection are discussed in the context of robust matched filtering algorithms. Keywords: Hyperspectral imaging, target detection, statistical modeling, background characterization. 1. INTRODUCTION The detection of materials and objects using remotely sensed spectral information has many military and civilian appli- cations. Hyperspectral imaging sensors measure the radiance for every pixel at a large number of narrow spectral bands. The obtained measurements are known as the radiance spectrum of the pixel. In the reflective part of the electromagnetic spectrum (0.4μm-2.5μm), the spectral information characterizing a material is the reflectance spectrum, defined as the ratio between reflected and incident radiation as a function of wavelength. The most widely used detection algorithms use the covariance matrix of the background data; however, there are algo- rithms that use a subspace model formed by the endmembers of a linear mixing model or the eigenvectors of the covariance matrix.3 Finding the endmembers in a data cube is a non-trivial task whose complexity exceeds that of the detection prob- lem. On the other hand, due to the high dimensionality of hyperspectral imaging data, the estimated covariance matrix may be inaccurate or numerically unstable. A practical approach to improve the quality of the estimated covariance matrix is to use covariance shrinkage or the dominant mode rejection approximation. The invertibility of the estimated matrix can be assured by using regularization. These techniques lead to the development of robust matched filter detectors which can be used in practical applications without concerts about numerical instabilities. These issues are the topic of this paper, which is organized as follows. Section 2 discusses two approaches to covariance matrix regularization: matched filter optimiza- tion and shrinkage. In Section 3 we present an approach to covariance matrix estimation and inversion using domonant mode rejection and diagonal loading. Section 4 presents an interpretation of dominant mode rejection as covariance matrix augmentation. In Section 5 we discuss the relationship between the subspaces generated by eigenvectors and endmembers. Finally, Section 6 explores the relationship between covariance and subspace based detectors. 2. COVARIANCE MATRIX REGULARIZATION Accurate estimation and numerically robust inversion of the covariance matrix is critical in hyperspectral detection appli- cations. We next present two different approaches to regularization that lead to the same diagonal loading solution. Correspondence to D.Manolakis. E-mail: [email protected], Telephone: 781-981-0524, Fax: 781-981-7271 Imaging Spectrometry XIV, edited by Sylvia S. Shen, Paul E. Lewis, Proc. of SPIE Vol. 7457, 74570Q · © 2009 SPIE · CCC code: 0277-786X/09/$18 · doi: 10.1117/12.828397 Proc. of SPIE Vol. 7457 74570Q-1 Downloaded from SPIE Digital Library on 17 Mar 2010 to 18.51.1.125. Terms of Use: http://spiedl.org/terms 2.1 The Matched Filter Approach The spectral measurements obtained by a p-band hyperspectral imaging sensor can be arranged in vector form as T x = x1 x2 ... xp (1) where T denotes matrix transpose. Let v be a p × 1 random vector from a normal distribution with mean μ and covariance matrix Σ representing the background clutter. Finally, let s0 be a p × 1 vector representing the spectral signature of the target of interest. To simplify notation, we assume that μ is removed from all spectra, that is, we deal with zero mean clutter and a “clutter-centered” target signature. The Optimum Matched Filter The optimum linear matched filter4 is a linear operator y = hT x (2) which can be determined by minimizing the output clutter power Var(y2)=hT Σh subject to a unity gain constraint in the direction of the target spectral signature T T min h Σh subject to h s0 =1 (3) h The solution to (3) is given by Σ−1s h = 0 T −1 (4) s0 Σ s0 which is the formula for the widely used matched filter. In the array processing area, where the data and filter vectors are complex, the matched filter (4) is known as the standard Capon beamformer (SCB).5 In practice, the clutter covariance matrix Σ and the target signature s0 have to be estimated from the available data. It turns out that the matched filter (4) is sensitive to signature errors and the quality of the clutter covariance matrix. Therefore, the development of matched filters that are robust to signature and clutter covariance errors is highly desirable. This problem has been traditionally dealt with using a diagonal loading approach or an eigenspace-based approach. However, in both case the selection of diagonal loading or the subspace dimension is ad-hoc.5 Quadratically Constrained Matched Filter The robustness of matched filter to covariance matrix and signature mis- match can be improved by constraining the size of hT h. This is done by solving the following optimization problem T T T min h Σh subject to h s0 =1and h h ≤ h (5) h The solution is the well-known diagonally loaded matched filter (Σ + δ I)−1s h = h 0 d T −1 (6) s0 (Σ + δhI) s0 The load level δh can be computed from h by solving a nonlinear equation. However, it is not clear what is the meaning and how to choose the parameter h. This issue is addressed next using the robust Capon beamformer approach. The Robust Matched Filter In this section, we shall use the theory of robust Capon beamformer (RCB)? to develop a robust matched filter that takes measurement errors and the spectral variability of hyperspectral target signatures into con- sideration. The robust matched filter (RMF) addresses robustness to target signature errors by introducing an uncertainty region constraint into the optimization process. To this end, assume that the only knowledge we have about the signature s is that it belongs to an uncertainty ellipsoid T −1 (s − s0) C (s − s0) ≤ 1 (7) Proc. of SPIE Vol. 7457 74570Q-2 Downloaded from SPIE Digital Library on 17 Mar 2010 to 18.51.1.125. Terms of Use: http://spiedl.org/terms where the vector s0 and the positive definite matrix C are given. In most hyperspectral target detection applications, it is difficult to get sufficient data to reliably estimate the full matrix C. Therefore, we usually set C = εI, so that (7) becomes 2 ||s − s0|| ≤ ε (8) where ε is a positive number. These ideas are illustrated in Figure 1(a). It has been shown in? that the RMF can be obtained as the solution to the following optimization problem T −1 2 min s Σ s subject to ||s − s0|| ≤ ε (9) s It turns out that the solution of (9) occurs on the boundary of the constraint set; therefore, we can reformulate (9) as a quadratic optimization problem with a quadratic equality constraint T −1 2 min s Σ s subject to ||s − s0|| = ε (10) s This problem can be efficiently solved using the method of Lagrange multipliers.6 The solution involves an estimated target signature −1 −1 sˆ = ζ(Σ + βI) s0 (11) which is subsequently used to determine the RMF by Σ−1sˆ h = β sˆT Σ−1sˆ (12) The Lagrange multiplier ζ ≥ 0 can be obtained by solving the nonlinear equation L |s˜ |2 sT (I + ζΣ)−2s = k = ε 0 0 2 (13) (1 + ζλk) k=1 where λk and s˜k are obtained from the eigen-decomposition K T T Σ = QΛQ = λkqkqk (14) k=1 and the orthogonal transformation T s˜ = Q s0 (15) The solution of (13) can be easily done using some nonlinear optimization algorithm, for example, Newton’s method. Finally, we note that the RMF (12) can be expressed in diagonal loading form as follows (Σ + ζ−1I)−1s h = 0 ζ T −1 −1 −1 −1 (16) s0 (Σ + ζ I) Σ(Σ + ζ I) s0 where ζ−1 is a loading factor? computed from (13). Figure 1(b) illustrates the validity of the optimization approach leading to the RMF.