International Journal of Navigation and Observation

Volume 2008 (2008), Article ID 325279, 12 pages

http://dx.doi.org/10.1155/2008/325279

## CLEAN Technique for Polarimetric ISAR

^{1}Department of Information Engineering, University of Pisa, via Caruso 16, 56122 Pisa, Italy^{2}Defence Science & Technology Organisation, Edinburgh, SA 5111, Australia^{3}School of Electrical & Electronic Engineering, University of Adelaide, SA 5005, Adelaide, Australia

Received 19 February 2008; Accepted 3 June 2008

Academic Editor: M. Greco

Copyright © 2008 M. Martorella et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Inverse synthetic aperture radar (ISAR) images are often used for classifying and recognising targets. To reduce the amount of data processed by the classifier, scattering centres are extracted from the ISAR image and used for classifying and recognising targets. This paper addresses the problem of estimating the position and the scattering vector of target scattering centres from polarimetric ISAR images. The proposed technique is obtained by extending the CLEAN technique, which was introduced in radar imaging for extracting scattering centres from single-polarisation ISAR images. The effectiveness of the proposed algorithm, namely, the Polarimetric CLEAN (Pol-CLEAN) is tested on simulated and real data.

#### 1. Introduction

The CLEAN algorithm was introduced in radio astronomy to reduce sidelobe-induced artefacts. In [1], the authors use the CLEAN technique to alleviate two types of artefacts introduced by the point spread function (PSF) sidelobes in real aperture radar images. Such a technique iteratively estimates the PSF of the brightest scatterer and removes it from the formed image. The CLEAN technique was applied later to inverse synthetic aperture radar (ISAR) imaging with interesting results [2]. Recently, fully polarimetric radars have been largely used for synthetic aperture radar (SAR) application [3, 4] as well as, although less extensively, for ISAR applications [5]. The advantage of fully polarimetric data is due to the fact that scattering mechanisms and target properties can be identified by measuring scattering matrices [6–9]. Inverse synthetic aperture radar (ISAR) images prove useful when used for classifying and recognising targets [10, 11]. Nevertheless, the image data size is often too large to implement real time classifiers. For this reason, algorithms such as the CLEAN technique can be employed for reducing the data size significantly without losing useful information. The problem of reducing the amount of data without losing useful information is even more critical when dealing with polarimetric ISAR images, since the data size is three to four times larger. An algorithm for scattering centre extraction from polarimetric SAR (PolSAR) images was proposed in [12]. In [12], the signal model was strongly based on the SAR geometry, which is known a priori. In the ISAR case, the non-cooperativity of the target does not allow using any such knowledge. So a parametric model is introduced to account for unknown target motions. Therefore, the problem of estimating the model parameters and the scattering centre extraction problem must be solved jointly. Moreover, in typical ISAR scenarios, only the received radar echo is presumed to be available (no ancillary data is used). In this paper, a polarimetric CLEAN (Pol-CLEAN) technique is proposed by extending the CLEAN technique in [2] in order to extract target features such as the position of the scattering centres and their scattering matrix. It is worth pointing out that the novelty of the proposed Pol-CLEAN technique, with respect to the CLEAN technique, lies on the extension to polarimetric ISAR images and on a new method for estimating the scattering centre point spread function.

The signal model is introduced in Section 2 whereas the Pol-CLEAN technique is detailed in Section 3. The effectiveness of the proposed algorithm is tested on simulated and real data and presented in Section 4.

#### 2. Signal Model

The polarimetric matrix of the received signal, in
free space conditions, can be written in a time-frequency domain by extending
the signal model defined in [13] where is expressed by means of a polarimetric
matrix,
represents a rectangular window in the
time-frequency domain is the carrier frequency, *B* is the
transmitted signal bandwidth, is the observation time, is the
spatial domain where the scattering matrix is defined, and is the polarimetric matrix containing the
noise. With reference to Figure 1, **z** is the vector that locates a
generic scatterer, is the modulus of vector ,
which locates the focusing point and the unit vector of . The function is equal
to 1 for otherwise.

Before proceeding, it is convenient to use a different notation, as detailed in [7], and exploit the characteristic of isotropic media that are encountered in ISAR applications. Therefore, the polarimetric data that represents the received signal can be written according to Pauli's decomposition as follows: where and where the dependence on is omitted for notation simplicity. The polarimetric unit vector is defined as follows: where represents the physical rotation of the scatterer about the radar line of sight (LoS), , and are the scatterer phases in the three polarimetric channels, and is a scatterer internal degree of freedom, which ranges in the interval . It must be pointed out that the angle is rotation invariant and therefore it is decoupled from . An interpretation of the internal degree of freedom is given in Figure 2.

It is worth noting that such a representation is meant to highlight the physical properties of the scattering mechanism induced by a given scatterer. Therefore, by defining the unit vector , it is possible to define a specific polarisation that resonates with a scatterer with given physical properties. It must also be pointed out that the same decomposition applies for the target scattering matrix. Therefore, the scattering vector obtained from the scattering matrix is .

##### 2.1. Signal Separation

The Range-Doppler technique is based on an
approximation that allows considering a rectangular support for the received
signal in the Fourier domain. Such an approximation also leads to the
separation of the domain in two independent one-dimensional domains: a time and
a frequency component. Therefore, the received signal, relative to a single
point-like scatterer, can be written in terms of the product of a time and a
frequency component as follows: where where the product represents the complex amplitude in the *i*th
Pauli channel, is the Doppler frequency, is the chirp rate, and is the time delay associated with the
scattering centre. It is worth pointing out that the parameter is related to the signal model, which accounts
for a quadratic radial motion, that is, it includes Doppler acceleration.
Therefore, it should not be confused with the transmitted signal chirp rate if
any is employed.

#### 3. Pol-CLEAN

The Pol-CLEAN technique is derived from the CLEAN technique proposed in [2]. Specifically, the Pol-CLEAN works iteratively by

(1)locating the brightest scattering centre in the polarimetric ISAR image and therefore by finding its coordinates in the delay-Doppler image plane ,(2)extracting its polarimetric vector , and(3)removing it from the ISAR image in order to extract the next brightest scattering centre. In order to eliminate a scattering centre from an ISAR image, the scattering centre point spread function (PSF) must be estimated and subtracted from the ISAR image. Let and be the received signal in the three Pauli channels. After motion compensation, three ISAR images, namely, and are obtained by means of a 2D Fourier Transform. The brightest scattering centre (dominant scatterer) is found within the three images. The range and cross-range indexes and and the Pauli's channel , which corresponds to the polarimetric channel that contains the brightest scattering centre, are extracted by means of (7) with and where and are the number of range and cross-range bins. The estimation of the PSF is performed by minimising the image energy after scattering centre removal. In order to find an efficient solution of the nonlinear optimisation problem stated in (7), the received signal separation is exploited.

##### 3.1. Time Component

By referring to (5), and are the parameters to be estimated. The constant can be neglected, because it does not affect the shape of the PSF. The signal , which is an -dimensional row vector, is Fourier transformed to obtain a cross-range profile. A cost function is defined by means of the energy remaining in the range bin after scattering centre deletion. In order to treat the optimisation problem in a real domain, the scattering centre deletion is performed by considering the absolute value of the range profile. Such an operation can be performed in a single channel and then applied to the remaining channels by adjusting the corresponding parameter. It must be pointed out that only the magnitude of must be estimated at this stage whereas the phase component is estimated separately and directly from the image. In summary, the following optimisation problem can be stated: where is the energy of a Doppler section in the th Pauli channel, with and the Fourier Transform of . The estimates and are then used in the remaining Pauli channels for estimating the complex amplitudes (with ). The latter estimation problem is transformed into an optimisation problem as follows: where is the energy of a Doppler section in the th Pauli channel with .

##### 3.2. Frequency Component

A similar procedure is followed to estimate the
frequency component of the PSF. The signal component in (6) is an *M*-dimensional
column vector. After selecting a Doppler bin and range compressing via the
Fourier Transform, a section of the *i*th channel ISAR image can be obtained. Then, the delay is jointly estimated with the magnitude (in the th Pauli channel) as follows: where is the energy of a delay section in the th Pauli channel, with and the inverse fourier transform of .

The remaining two complex amplitudes are separately
estimated by solving two separate one-dimensional optimisation
problems: where is the energy of a delay section in the *i*th
Pauli channel with .

##### 3.3. Scattering Centre PSF

The scattering centre PSF in the *i*th Pauli
channel is obtained by calculating the two dimensional Fourier Transform of the
product of the time and frequency components multiplied by the phase extracted
from the ISAR image, as analytically detailed in The scattering vector relative to the considered scattering centre
is therefore available by calculating the three scattering centre PSF centred
in .
Then, at the generic *k*th iteration, the scattering centre must be
eliminated from the ISAR image via (13) in order to extract the following
brightest scatterer: The algorithm stops when the
energy of the signal component in the ISAR image at the *k*th iteration is
lower than a given threshold, .
Such a threshold is typically set to 5% of the initial energy, that is, the
total energy of the polarimetric ISAR image before any component removal. In
mathematical detail, the preset threshold depends on the energy content and on
the SNR of the initial ISAR image, as detailed in (14) where , with .
It is worth pointing out that a coefficient is used in order to account for the energy of
the signal component (noiseless image). Moreover, the SNR can be estimated in
the image domain by selecting image areas where no target is present. It must
also be noted that the energy of the signal component of the ISAR image at each
iteration has to be compared to the energy threshold in (14). Therefore, the
iterations stop when .

#### 4. Results

The algorithm performance is tested both by using simulated and real data. The simulation test highlights the algorithm effectiveness when extracting ideal point-like scatterers, whereas the real data test shows an example of the output when the Pol-CLEAN is applied to “real-world” data.

##### 4.1. Simulation

The analysis of simulated data aims at testing the Pol-CLEAN effectiveness when the target is composed of a number of ideal point-like scatterers with different polarimetric properties. Two separate tests are run. The first concerns a six-point target with scatterers placed at a distance of 5 resolution cells from each other. The second experiment is proposed to test the Pol-CLEAN robustness when the point-like scatterers distance drops down to one resolution cell.

###### 4.1.1. Six-Point Target

An -band radar and a six-point target are considered for the generation of the received signal. Each point is located at a distance of 5 resolution cells from the others (as shown in Figure 3). The scattering matrices relative to each point are shown in Table 1, whereas the main radar parameters are shown in Table 2.

The simulation is repeated by changing the zero padding in order to test the algorithm robustness with respect to the image oversampling. Specifically, zero padding factor (ZPF) of 1, 2, 4, and 8 are considered (note that ZPF = 1 means “no zero padding”). Gaussian noise has been added to the raw data in order to have an SNR = −10 dB (in the data domain).

The estimated scattering vectors are decomposed according to (2) and (3) (only parameters and are shown). The estimated type of scattering () matches the true values as well as the estimated orientation angle (), as shown in Table 3, where the mean value of the couple of parameters (, ), obtained by generating 25 noise realisations, is shown. It is worth noting that the estimated mean values are weakly affected by the ZPF whereas the standard deviation decreases when the zero padding increases, as shown in Figure 4, where the root mean square error (RMSE) of and is plotted as a function of the ZPF.

The original ISAR images and the ISAR images after the first and the last scattering centre elimination are shown in Figures 5, 6, and 7 for the three Pauli channels, respectively. All ISAR images are obtained by using ZPF = 8. It is worth noting that the first component removal only affects the first Pauli channel (HH+VV) since the extracted scatterer has zero-components in the other two Pauli channels (VV-HH and 2HV) It can be pointed out that, after the last elimination, the scatterer's contribution is significantly suppressed.

###### 4.1.2. Robustness Analysis with Respect to Scatterer's Distance

An algorithm performance loss is expected when the distance between the scatterers reduces. With the present experiment, the algorithm robustness with respect to the interference caused by the vicinity of other scatterers is tested. Specifically, two scatterers close to each other are considered in order to create such an interference. The scatterers chosen are 1 and 4 (from the previous experiment) and their scattering matrices are shown in Table 1. Gaussian noise is added to the generated data in order to obtain a SNR = −10 dB (in the data domain). Both the vicinity along the range and cross-range coordinate is tested. In particular, the scatterer's distance is varied within one to five range cells, first along the range direction and then along the cross-range direction. Figure 8 shows the results in terms of estimation error for the parameters and against the distance in range (as in the number of range resolution cells), whereas Figure 9 shows the similar results against the distance in cross-range (as in number of cross-range resolution cells). The results are shown in terms of the RMSE and they are obtained by using a ZPF = 8.

As predicted, the performance of the algorithm decreases when the distance between scatterers reduces. It can also be pointed out that the same conclusions are reached when considering range and cross-range directions. This effect is mainly due to two reasons.

(1)Scatterers interfere with each other because of their sidelobes. Although it would be tempting to use a window in order to reduce the sidelobe level, the inconvenient effect of widening the main lobe would negatively affect the performance when the distance is equal to one resolution cell.(2)The cancellation of the scatterer under test is a nonlinear operation that affects the estimated scattering matrix of the nearest scatterers.

##### 4.2. Real Data

The analysis of real data provides a clear example of the results achievable when using the Pol-CLEAN. Since no accurate target model is available, a direct error analysis is not viable for this kind of experiment. Nevertheless, the results are visually readable by comparing the extracted scatterers with the Pol-ISAR image.

###### 4.2.1. Data Set Description

The data used for this test is collected during a real turn-table experiment. The data is obtained from the GTRI publicly releasable data set. The experiment is run by using a stepped-frequency fully polarimetric radar system arranged on a tower and looking down to a turn-table. The illuminated target is a T72 tank. The data file contains 79 radar sweeps for a fixed elevation angle (). After each radar sweep, the turn table is rotated by . Therefore, a total azimuth angle variation of is spanned about the central azimuth angle (). The central frequency is equal to GHz whereas the number of transmitted frequencies is equal to 221, equally spaced by 3 MHz. The resultant bandwidth is equal to 660 MHz and both the nominal range and cross-range resolutions are equal to 0.3048 m.

The radar-target geometry is depicted in Figure 10, whereas the target is shown in Figure 11. The radar parameters are shown in Table 4.

###### 4.2.2. Real Data Results

The image cross-range section cut across the scattering centre peak (in blue) and the estimated cross-range section of the scattering centre PSF (in red) are shown, for all polarimetric channels, in Figures 12, 13, and 14. Moreover, the cross-range section after the scattering centre removal is shown in green colour. It is worth noting that the estimated PSF cross-range section is estimated quite accurately, and therefore the scattering centre is removed from the image. The range section of the same scattering centre, as well as the range section of the estimated PSF, is shown in Figures 15, 16, and 17. It can be noted that the results along the range direction are similar to those along the cross-range direction. Figures 18, 19, 21, 22, 24 and 25 show the ISAR image before and after the cancellation of the first scatterer, for all three polarimetric channel. Figures 20, 23, 26 how the ISAR images after the cancellation of the last scatterer. By setting the energy threshold defined in (14) to , a number of 43 scatterers are extracted. The RGB ISAR image of the target is also shown in Figure 27. The colored dots represent the scattering centres extracted by means of the Pol-CLEAN. The colour of each dot represents the polarimetric signature of the extracted scattering centre in the Pauli basis. It should be noted that the colour of the extracted dot is very close to the colour of the underlying ISAR image, especially in the case of bright scatterers. Weaker extracted scatterers do not match perfectly the colour of the underlying ISAR image. This can be explained by considering that

(1)weaker scatterers are partially masked by stronger scatterer's sidelobes (it can be read as an interference problem);(2)even after stronger scatterers are removed, some residuals remain that affect the extraction of weaker scatterers and therefore lead to larger estimation errors.

Nevertheless, classifiers would weight bright scatterers more than weak scatterers and therefore such an effect would not affect the classification performances significantly.

#### 5. Conclusions

Scattering centre extraction from polarimetric ISAR images can be achieved by extending the CLEAN technique, which was designed to perform scattering centre extraction from single polarization ISAR images. The extension of the CLEAN technique, namely, the Pol-CLEAN technique has been first proposed in this paper and then tested on simulated and real data. The results have shown that the Pol-CLEAN technique is able to extract scattering centres from noisy ISAR images and estimate their locations and polarisation vectors. A table with essential information is then obtained that contains only the positions and polarimetric vectors of the extracted scatterers, which can be used as a feature set for automated target classification and recognition.

#### Acknowledgments

The authors would like to thank The Sensor ATR Technology Division of the US Air Force Research Laboratory (AFRL) for releasing real data and the Australian Defence Science and Technology Organisation (DSTO) for partially funding this work. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency, the United States Air Force, the Department of Defense, or the US Government.

#### References

- J. Tsao and B. D. Steinberg, “Reduction of sidelobe and speckle artifacts in microwave imaging: the CLEAN technique,”
*IEEE Transactions on Antennas and Propagation*, vol. 36, no. 4, pp. 543–556, 1988. View at Publisher · View at Google Scholar - Y. Sun and P. Lin, “An improved method of ISAR image processing,” in
*Proceedings of the 35th Midwest Symposium on Circuits and System*, vol. 2, pp. 983–986, Washington, DC, USA, August 1992. View at Publisher · View at Google Scholar - S. R. Cloude and K. P. Papathanassiou, “Polarimetric SAR interferometry,”
*IEEE Transactions on Geoscience and Remote Sensing*, vol. 36, no. 5, part 1, pp. 1551–1565, 1998. View at Publisher · View at Google Scholar - R. Touzi and F. Charbonneau, “Characterization of target symmetric scattering using polarimetric SARs,”
*IEEE Transactions on Geoscience and Remote Sensing*, vol. 40, no. 11, pp. 2507–2516, 2002. View at Publisher · View at Google Scholar - M. Martorella, J. Palmer, B. D. Bates, F. Berizzi, and B. Haywood, “Polarimetric hot spot processing for ISAR image autofocusing,” in
*Proceedings of the IET International Conference on Radar Systems (RADAR '07)*, Edimburgh, UK, October 2007. - W. L. Cameron, N. N. Youssef, and L. K. Leung, “Simulated polarimetric signatures of primitive geometrical shapes,”
*IEEE Transactions on Geoscience and Remote Sensing*, vol. 34, no. 3, pp. 793–803, 1996. View at Publisher · View at Google Scholar - S. R. Cloude and E. Pottier, “A review of target decomposition theorems in radar polarimetry,”
*IEEE Transactions on Geoscience and Remote Sensing*, vol. 34, no. 2, pp. 498–518, 1996. View at Publisher · View at Google Scholar - J. R. Huynen, “Measurement of the target scattering matrix,”
*Proceedings of IEEE*, vol. 53, no. 8, pp. 936–946, 1965. View at Publisher · View at Google Scholar - E. Krogager, “New decomposition of the radar target scattering matrix,”
*Electronics Letters*, vol. 26, no. 18, pp. 1525–1527, 1990. View at Publisher · View at Google Scholar - T. Cooke, M. Martorella, B. Haywood, and D. Gibbins, “Use of 3D ship scatterer models from ISAR image sequences for target recognition,”
*Digital Signal Processing*, vol. 16, no. 5, pp. 523–532, 2006. View at Publisher · View at Google Scholar - K.-T. Kim, D.-K. Seo, and H.-T. Kim, “Efficient classification of ISAR images,”
*IEEE Transactions on Antennas and Propagation*, vol. 53, no. 5, pp. 1611–1621, 2005. View at Publisher · View at Google Scholar - L. Vignaud, “Robust polarimetric scatterers extraction for SAR ATR,” in
*Proceedings of the RTO-SET Symposium on Target Identification and Recognition Using RF Systems*, Oslo, Norway, October 2004. - M. Martorella, F. Berizzi, and B. Haywood, “Contrast maximisation based technique for 2-D ISAR autofocusing,”
*IEE Proceedings: Radar, Sonar and Navigation*, vol. 152, no. 4, pp. 253–262, 2005. View at Publisher · View at Google Scholar