Academia.eduAcademia.edu

Time Reversal Target Classification from Scattered Radiation

2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing

This paper proposed the M-ary hypothesis testing algorithm for classifying radar backscatter signals from hidden targets in a rich scattering environment using time reversal. The target recognition algorithm is to be designed to distinguish measurements of the radar backscatter from an unknown object as belonging to one of a set of M classes.

TIME REVERSAL TARGET CLASSIFICATION FROM SCATTERED RADIATION Yuanwei Jin, José M.F. Moura, Yi Jiang, Dan Stancil, and Nick O’Donoughue Carnegie Mellon University Department of Electrical and Computer Engineering Pittsburgh, PA 15213 ABSTRACT This paper proposed the M-ary hypothesis testing algorithm for classifying radar backscatter signals from hidden targets in a rich scattering environment using time reversal. The target recognition algorithm is to be designed to distinguish measurements of the radar backscatter from an unknown object as belonging to one of a set of M classes. The proposed time reversal target classifier is, in essence, a correlator that calculates the cross-correlation of the normalized target signature waveforms with a data dependent quantity obtained from measurements. The algorithm requires a priori empirical statistical knowledge of the scattering channel, which is dependent of configurations of the scatterers in the environment. By incorporating time reversal, the proposed algorithm provides a significant performance improvement compared with the conventional method. Proof of concept is provided using electromagnetic data collected in a laboratory environment. Index Terms— Time Reversal, Target Classification, Mary Hypothesis Testing, Regularization 1. INTRODUCTION AND MOTIVATION One of the primary functions of modern radar systems is target classification. Based on the received backscattered energy, the radar system determines which of M pre-specified body shape or size is most consistent with the scattered field data. In this sense, target classification may be viewed as a crude form of inverse scattering. The target recognition algorithm is to be designed to distinguish measurements of the radar backscatter from an unknown object as belonging to one of a set of M classes, each corresponding to a particular target with a distinct radar signature waveform. The conventional target classification scenario assumes that there exists a direct path between the target and the radar receiver. The line of sight condition enables matched filtering processing in that the received signal is a (complex) scaled version of the target signature. However, the line of sight assumption may not be valid in many practical scenarios. In a rich scattering environment, the electromagnetic scattering mechanism is very complex due to the dispersive nature This work is funded by the Defence Advanced Research Projects Agency through the Army Research Office under grant no. W911NF-04-1-0031. 1-4244-1198-X/07/$25.00 ©2007 IEEE 317 of the extended targets as well as the surrounding medium. From an engineering science point of view, the backscattered signal, excluding the incident wave, can be characterized as the product of the target signature and the channel transfer function in frequency domain. The coupling of target response and the dispersive rich scattering environment makes it a challenging problem for target classification. Furthermore, when the target is hidden by an object that blocks the direct illumination from the radar transmitter, the radar receiver must rely on returned energies due to secondary reflections from the surrounding scatterers. Time reversal is a technique that utilizes the rich scattering to enhance target detectability and resolution [1, 2]. In general, the returned backscatter signals from the hidden targets are relatively weak. Time reversal in a rich scattering environment is expected to adapt the transmission waveform to the target response and to enhance the target signal returns. In this paper, we propose an M-ary hypothesis testing algorithm for discriminating between a finite number of targets by appropriately processing the backscattered waveforms in a rich scattering environment using time reversal. In this paper, we assume that each target is characterized by a signature waveform with a distinct resonance frequency. In the theory of scattering [3], the resonance frequency refers to the illumination region where the wavelength of the incident field is of the same order of the size of the target. Illuminating targets in the resonance region is generally considered most efficacious for target shape and size classification[4]. Such studies are of theoretical and practical importance, particularly for wideband systems where the response of the extended targets shows frequency dependency [5]. Target recognition utilizing time reversal provides significant performance advantage relative to conventional matched filter processing. Time reversal shows advantages because it (1) shortens the scattering Green function; and (2) enhances the target scattered field by resonance region matched illumination. We demonstrate our algorithm using electromagnetic data collected in a laboratory environment. 2. PROBLEM FORMULATION 2.1. Data Model We examine the target recognition problem when the target function exhibits a radar frequency dependent behavior. There SSP 2007 are well established reasons for this phenomenon, for example, multipath effects and resonance in cavities. We start with the data model in the frequency domain. Suppose that we have M targets with distinct signature f1 (ω), · · · , fm (ω). The target radar signature fm (ω) represents a frequencydependent reflectivity for the m-th target which, in general, is a complex function. Each signature fm (ω) contains a phase function and a magnitude function. Using a discrete frequency representation, we have a collection of discrete frequency samples of the signature fm (ω0 ), · · · , fm (ωQ−1 ) over a frequency range ω0 , · · · , ωQ−1 with the frequency spacing of Δω = Q−1 ωQ−1 −ω0 1 2 q=0 |fm (ωq )| as Q−1 . We further define Em = Q the total energy of the m-th radar target in the observing frequency range. We also introduce 1 fm (ωq ) f m (ωq ) = √ Em (1) Let S(ωq ) be a wideband probing signal at angular frequency ωq . Let Gc+t (ωq ) and Gc (ωq ) denote the Green’s function of the channel when both target and clutter are present, and the Green’s function of the channel when only clutter are present, respectively, we then define G(ωq ) = Gc+t (ωq ) − Gc (ωq ), ∀q (2) as the Green’s function due to the presence of the target. The l-th returned data snapshot due to the existence of the m-th target has the following frequency response Yl (ωq ) = S(ωq )fm (ωq )G(ωq ) + Vl (ωq ). (3) In the above model, G(ωq ) is the Green’s function of the medium at ωq . Vl (ωq ) is the additive complex Gaussian noise. It is assumed that Vl (ωq ) is independent of S(ωq ), fm (ωq ) and G(ωq ). Time reversal, or phase conjugation in frequency domain, shortens the multipath channel. The received timereversed signal is given by = kl Yl∗ (ωq )fm (ωq )G(ωq ) + Wl (ωq ) ∗ 2 (4) (5) where kl is the energy normalization factor kl = xl g Σl,m [Yl (ω0 ), · · · , Yl (ωQ−1 )]T = (7) T [Xl (ω0 ), · · · , Xl (ωQ−1 )] = T [G(ω0 ), · · · , G(ωQ−1 )] [kl Yl∗ (ω0 )fm (ω0 ), · · · , = = (9) kl Yl∗ (ωQ−1 )fm (ωQ−1 )]T wl vl Γm (10) T = [Wl (ω0 ), · · · , Wl (ωQ−1 )] (11) S(ωQ−1 )fm (ωQ−1 )]T , (13) T [Vl (ω0 ), · · · , Vl (ωQ−1 )] [S(ω0 )fm (ω0 ), · · · , = = (8) (12) where wl and vl are additive complex Gaussian noise vector with statistics vl ∼ ∼ 2 CN (0, σw IQ ) CN (0, σv2 IQ ). (14) (15) In this work, we assume that the noise variance for vl and wl 2 for l = 1, · · · , L are the same, i.e., σv2 = σw = σ2 . 2.2. M -ary Hypothesis Testing Next, we organize the measurement pair (yl∗ , xl ) into a data vector as follows:   ∗   ∗ ∗ Γm g + vl∗ yl = , l = 1, · · · , L. (16) zl = xl Σl,m g + wl Let z be the collection of L data snapshots z = [zT1 , · · · , zTL ]T . (17) The target detection and classification algorithm is based on a sequence of hypothesis tests in which each hypothesis corresponds to a particular radar target signature. We seek a decision rule φ(z) that takes on values in the set {1, 2, · · · , M } where φ(z) = m corresponds to selection of hypothesis Hm . For the purpose of simplicity, we further assume that the occurrence of m-th target is equally likely. For the case where g is known, such a decision rule is φ(z) = m whenever the likelihood of the m-th target exceeds the likelihood for any other hypothesis: [6] 2 kl S (ωq )|fm (ωq )| |G(ωq )| + kl fm (ωq )G(ωq )Vl∗ (ωq ) + Wl (ωq ),  yl wl which we henceforth referto as the normalized m-th radar Q−1 1 2 target signature, where Q q=0 |f m (ωq )| = 1. Xl (ωq ) = lows:   Q−1  q=0 |S(ωq )|2 Es . =  Q−1 2 Eyl q=0 |Yl (ωq )| (6) Q−1 1 2 The average transmission energy is Es = Q q=0 |S(ωq )| . We re-write Eqn. (3), (5) in a matrix-vector form as fol- 318 φ(z) = m, whenever pm (z) > max pn (z) n=m (18) where pm (·) is the probability density function if the m-th target exists. In this work, g is unknown. Thus a generalized hypothesis test is employed and g needs to be estimated from the measurements. Furthermore, a careful inspection of (3) and (5) reveals that the target signature waveform fm (ωq ) to be classified and the unknown channel Green’s function G(ωq ) are coupled, which appears in the form of a product fm (ωq )G(ωq ). Some constraints on g are necessary to distinguish fm (ωq ) from the unknown G(ωq ). To this end, we make the following modifications on the data model. First, similar to the normalized target signature waveform given in (1), we may define the following quantities: = gm Gm (ωq ) = T [Gm (ω0 ), · · · , Gm (ωQ−1 )] , Em G(ωq ), m = 1, · · · , M. (19) = S(ωq )f m (ωq )G(ωq ) + Vl (ωq ), 2 ∗ (21) 2 = kl S (ωq )|f m (ωq )| |G(ωq )| + Xl (ωq ) kl f m (ωq )G(ωq )Vl∗ (ωq ) (22) + Wl (ωq ). Thus, we will estimate gm , m = 1, · · · , M rather than g directly. Second, a regularization term on gm will be introduced. One method for recovering gm from z is to define gm gm = [Gm (ω0 ), · · · , Gm (ωQ−1 )]T , (23) the estimate of the Green’s function vector, as the solution to the nonlinear least squares problem gm = arg min 1 L L l=1 2 zl − ztl (gm )2Ω−1 + αm g2Φ−1 (24) l where x2A = xH Ax. The block diagonal matrix Ωl as a function of gm , is generally a matrix whose entries reflect the noise levels present in the measurements, zl , Ωl = diag[Ωl (0), · · · , Ωl (Q − 1)] Q−1 2 αm g2Φ−1 = (20) Thus, without changing the function values, (3) and (5) can be re-written in the following format for l = 1, · · · , L: Yl (ωq ) as the m-th target signature power to noise ratio. In fact, we can re-write the second term of (24) as follows: (31) We note that the nonlinear least squares formulation admits an interpretation in the context of optimal statistical es2 timation. Eqn. (24), with the exception of the scalar αm , is equivalent to the maximum a posteriori (MAP) estimate of g given zl assuming that zl g ∼ CN (ztl , Ωl ), (32) 2 2 ∼ CN (0, Φ), Φ = diag[φ0 , · · · , φQ−1 ]. (33) In our case, αm in (24) is introduced as a weighting factor to modify the MAP estimate according to the target signature power relative to the noise power. Note that the performance of the classifier is affected by the choice of the regularization term Φ. The statistical knowledge of the scattering environment is essential to classify the radar targets. In a dense and rich scattering environment without direct line of sight, the empirical distribution of the target channel response resembles, for example, complex Gaussian [2]. Here we assume that the empirical distribution of the scattering environment can be estimated. Let pm (z|g) be the probability density function of the mth target conditioned on g and kl , l = 1, · · · , L as follows: pm (z|g) = (25) = where q=0 |Gm (ωq )|2 = gm 2(σ2 Φ)−1 . φ2q σ 2 L    1 t exp −(zl − ztl )H Ω−1 l (zl − zl ) π|Ωl | l=1  L Q−1   1 1 exp − 2 (|Yl (ωq )|2 kl2 × 4 πσ σ q=0 l=1  Ωl (q) = σ2 kl G(ωq )f m (ωq )σ 2 ∗ ∗ kl f m (ωq )G (ωq )σ 2 kl2 |G(ωq )|2 |f m (ωq )|2 σ 2 + σ2  (26) The vector ztl as a function of gm , is defined as follows: ztl = [ztl (0)]T , · · · , [ztl (Q − 1)]T T , (27) where ztl (q) =  ∗ ∗ S ∗ (ωq )f m (ωq )G (ωq ) kl |f m (ωq )|2 |G(ωq )|2 S ∗ (ωq )  . (28) The Q × Q positive definite matrix Φ is employed to regularize the problem, where Φ = diag[φ20 , · · · , φ2Q−1 ]. (29) 2 is defined by The scalar αm 2 αm Em = 2 σ (30) 319 |f m (ωq )|2 + |S(ωq )|2 |f m (ωq )|2 )|Gm (ωq )|2 2 + 4 R{[kl Xl∗ (ωq )Yl∗ (ωq )f m (ωq )σ 2 σ +σ 2 Yl∗ (ωq )f m (ωq )S(ωq )]Gm (ωq )}   1  2 2 2 2 . (34) − 4 |Xl (ωq )| σ + |Yl (ωq )| σ σ Taking the logarithmic of (34), discarding the constant terms, and multiplying − L1 yields − L1 lnpm (z|g) Hence, the optimization problem (24) is equivalent to seeking the minimum of the sum of − L1 lnpm (z|g) and (31). A common practice of calculating the maximum a posteriori estimate of Gm (ωq ) is by taking the first derivative of the sum of − L1 lnpm (z|g) and (31). This leads to the following equivalent optimization problem of (24):   1 gm = arg min − lnpm (z|g) + gm 2(σ2 Φ)−1 .(35) m L Notice that for complex number x, ∂x∂ ∗ |x|2 = x [7]. We then calculate the maximum a posteriori estimate of Gm (ωq ) by taking the first derivative of (35) with respect to [Gm (ωq )]∗ . We obtain the following estimate: Gm (ωq ) = L ∗ f m (ωq ) L1 l=1 [Yl (ωq )S ∗ (ωq ) + kl Yl (ωq )Xl (ωq )]  . (36) L  2 2 |f m (ωq )|2 L1 l=1 |S(ωq )| + |Yl (ωq )| kl2 + φ12 q Hence, the generalized M -ary hypothesis is employed in which gj is replaced by the maximum a posteriori-type estimate gj for j = 1, · · · , M in (36) and (23) as follows: Hm : m = φ(z) = m with arg min j=1,··· ,M 1 L L l=1 zl − ztl (gj )2Ω−1 (g> ) . (37) j l The decision rule (37) to classify m-th target can be simplified as φ(z) = m when  Q−1 1 L  (kl Xl∗ (ωq )Yl∗ (ωq ) max |f j (ωq )|2  j=1,··· ,M L q=0 l=1 2 +Yl∗ (ωq )S(ωq ))| ×  L  2 2 |f j (ωq )|2 L1 l=1 |Yl (ωq )| kl2 + |S(ωq )| + φ22 q  2 (38)     2 2 L 1 2 + 1  2 (ω )| |S(ω )| + |Y (ω )| k |f j q L l=1 q l q l φ2q  To gain insight of the above decision rule, we let aj = [Aj (ω0 ), · · · , Aj (ωQ−1 )]T Aj (ωq ) = (39) |f j (ωq )|2 (40) be the collection of magnitude squared j-th normalized discrete target signature waveform and let  2 1 L    ∗ ∗ ∗ Bj,m (q) =  (kl Xl (ωq )Yl (ωq ) + Yl (ωq )S(ωq )) L  l=1    2 2 L |f j (ωq )|2 L1 l=1 |Yl (ωq )| kl2 + |S(ωq )| + φ22 q 2 (41)   L  2 2 2 1 1 2 |f j (ωq )| L l=1 |S(ωq )| + |Yl (ωq )| kl + φ2 q bj,m = T [Bj,m (ω0 ), · · · , Bj,m (ωQ−1 )] (42) be the estimate of the m-th target signature waveform given the knowledge of the j-th target signature. We can rewrite (37), (38) as follows φ(z) = m when m = arg max aj , bj,m . (43) j=1,··· ,M The decision rule (43) indicates that the classifier is, in essence, a correlator between the magnitude-squared of j-th normalized target signature waveform f j (ωq ) and the estimate of the m-th target signature waveform given the knowledge of the j-th target signature. 320 In summary, the design of the classifier consists of three steps: (1). compute the maximum a posteriori (MAP) estimate of Gj (ωq ); (2). insert the obtained estimate into the decision rule (43); (3). declare the existence of the m-th target if its decision value is the maximum among j ∈ [1, · · · , M ] decision values given by (43). 2.3. Matched Filter Classifier (MF) We consider a direct correlation classifier where the target signature waveform frequency response vector correlates with the measured backscatters. It is assumed that the propagation delay τ due to the target is an unknown parameter and is to be estimated. The estimation is carried out by searchf −f0 2π ], where Δf = Q−1 ing over a range τ ∈ [0, ∆f Q−1 . Let T T y = [y1 , · · · , yL ] be the collection of data vectors. Thus we obtain the following correlation classifier: φ(y) = m for  Q−1 1 [S(ωq )fj (ωq )e−jωq τ ]∗ max max R τ j=1,··· ,M σ 2 Efj q=0 ⎞  L  l =1  Yl (ωq ) , (44) where L = 2L, R(·) is the real part of complex numbers. Q−1 1 2 Efj = Q q=0 |S(ωq )fj (ωq )| . We notice that (44) implements a matched filer. 3. ELECTROMAGNETIC EXPERIMENTS 3.1. Frequency dependent target design We design frequency dependent targets using aluminum foam slices. Each aluminum foam slice is considered as a dipole c antenna with resonance frequency fR = 2l , where l = λ2 is the length of the foam slice. A careful choice of the aluminum slice length ensures that each target has a distinct resonance frequency. A total of 25 aluminum foam slices are glued vertically on a foam board and placed on a 25.5 cm by 25.5 cm grid. Each grid has the size of 5.1 cm by 5.1 cm. Thus, each foam board is considered as a frequency dependent target. The upper figure in Fig. 1 shows the measured (smoothed) target signature waveforms. 3.2. Electromagnetic measurement The measurement are performed in 4 − 6 GHz frequency domain in a controlled laboratory environment. Two horn antennas, one transmits and one receives, are connected to an Agilent vector network analyzer (VNA). A total of 201 frequency points are recorded. The probing signal, denoted by S(ωq ), has 2 GHz bandwidth with center frequency of 5 GHz. When measuring the backscatter returns, each target is covered completely by a white board without a clear line of sight in the view of transmitter and receiver antennas. PVC pipes are placed behind the targets to create a rich scattering Correct Classification for D Target Signature Waveform 1.2 1 Correct Decision Probability 1 Magnitude 0.8 0.6 0.4 0.2 C D G 0 −0.2 4 4.5 5 Frequency [Hz] 5.5 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 −25 6 TR MF −20 −15 −10 −5 0 5 SNR [dB] 9 x 10 Correct Classification for G 1 Correct Decision Probability PVC pipes target board TR MF 0.9 0.8 0.7 0.6 0.5 0.4 −25 −20 −15 −10 −5 0 5 SNR [dB] Fig. 1. Upper figure: target signature waveform; Lower figure: picture of the experimental setup. Fig. 2. Probability of correct classification curve for the time reversal (TR) classifier and the matched filter (MF) classifier. environment. Thus we can only rely on the backscatters reflected off the surrounding scatterers to detect the target. We first measure the frequency response with the target and the board. Then we place scatterers around the target. The difference of the consecutive measurements is fm (ωq )G(ωq ). The computer generated artificial noise is inserted into the measurement. 6. REFERENCES [1] M. Fink, “Time reversed acoustics,” Physics Today, vol. 50, no. 3, pp. 34–40, 1997. [2] J. M. F. Moura and Y. Jin, “Detection by time reversal: single antenna,” IEEE Transactions on Signal Processing, vol. 55, no. 1, pp. 187–201, January 2007. [3] J. W. Crispin and K. M. Siegel, Methods of Radar CrossSection Analysis. New York, NY: Academic Press, 1968. 4. PERFORMANCE RESULTS Fig. 2 shows the correct classification probability for target D and target G. The two targets appear to have different peak resonance frequencies and total energy. For target D, the peak frequency is at 4.8 GHz; for target G, the peak frequency is at 5.5 GHz. The time reversal classifier shows better performance than the matched filter classifier. 5. CONCLUSION AND FUTURE WORK We proposed the M-ary hypothesis testing using time reversal for classifying hidden targets immersed in a rich scattering environment. The designed classifier is affected by a regularization term which depends on the empirical distribution of the Green’s function. In this paper, we assume a Gaussian distribution of the rich scattering channel. Future work is to investigate other statistical modeling of the scattering Green’s function and its impact on hidden target classification. 321 [4] C. L. Bennett and J. P. Toomey, “Target classification with multiple frequency illumination,” IEEE Transactions on Antennas and Propagation, vol. AP-29, no. 2, pp. 352– 358, March 1981. [5] A. W. Rihaxzek and S. J. Hershkowitz, “Man-made target backscattering behavior: applicability of conventional radar resolution theory,” IEEE Transactions on Aerospace and Electronic Systems, vol. 32, no. 2, pp. 809–824, April 1996. [6] L. L. Scharf, Statistical Signal Processing: Detection, Estimation, and Time Series Analysis. Reading, MA: Addison-Wesley Publishing Company, 1991. [7] M. H. Hayes, Statistical Digital Signal Processing and Modeling. New York, NY: John Wiley & Sons, Inc., 1996.