On the performance of polarimetric target detection algorithms

The performance of six polarimetric target detection algorithms is analyzed. The detection performance of the optimal polarimetric detector (OPD), the identity-likelihood-ratio-test (ILRT), the polarimetric whitening filter (PWF), the single-polarimetric channel detector, the span detector, and the power maximization synthesis (PMS) detector is compared. Results are presented for both probabilistic and deterministic targets in the presence of complex Gaussian clutter. The results indicate that the PWF and the ILRT typically achieve near optimal performance. The remaining detection algorithms typically yield performance that is degraded compared to the performance of the OPD, the PWF, and the ILRT     

Studies of target detection algorithms that use polarimetric radardata

Algorithms are described which make use of polarimetric radar information in the detection and discrimination of targets in a ground clutter background. The optimal polarimetric detector (OPD) is derived. This algorithm processes the complete polarization scattering matrix (PSM) and provides the best possible detection performance from polarimetric radar data. Also derived is the best linear polarimetric detector, the polarimetric matched filter (PMF), and the structure of this detector is related to simple polarimetric target types. New polarimetric target and clutter models are described and used to predict the performance of the OPD and the PME. The performance of these algorithms is compared with that of simpler detectors that use only amplitude information to detect targets. The ability to discriminate between target types by exploring differences in polarimetric properties is discussed     

Optimal polarimetric processing for enhanced target detection

The results of a study of several polarimetric target detection algorithms are summarized. The algorithms were tested using real target-in-clutter data collected by the Lincoln Laboratory 35 GHz synthetic aperture radar (SAR) sensor. Fully polarimetric measurements (HH, HV, VV) are processed into intensity imagery using adaptive and nonadaptive polarimetric whitening filters (PWFs). Then a two-parameter constant false alarm rate (CFAR) detector is run over the imagery to detect the targets. Nonadaptive PWF processed imagery is shown to provide better protection performance than either adaptive PWF processed imagery or single-polarimetric-channel HH imagery. In addition, nonadaptive PWF processed imagery is shown to be visually clearer than adaptive processed imagery     

Detection performance in K-distributed and correlatedRayleigh clutters

Performance prediction for a detection system employing noncoherent integration is carried out for a chi-square family of fluctuating targets in K-distributed clutter plus noise. The detection performance for Swerling 11 targets in the K-distributed clutter plus noise is compared with that in exponentially correlated Rayleigh clutter. The results show that the performance prediction based on N pulses integrated in clutter plus noise using the K-distributed clutter model may be approximately equivalent to that using the exponentially correlated Rayleigh-distributed clutter model     

GLRT subspace detection for range and Doppler distributed targets

A generalized likelihood ratio test (GLRT) is derived for adaptive detection of range and Doppler-distributed targets. The clutter is modeled as a spherically invariant random process (SIRP) and its texture component is range dependent (heterogeneous clutter). We suppose here that the speckle component covariance matrix is known or estimated thanks to a secondary data set. Thus, unknown parameters to be estimated are local texture values, the complex amplitudes and Doppler frequencies of all scattering centers. To do so, we use superresolution methods. The proposed detector assumes a priori knowledge on the spatial distribution of the target and has the precious property of having a constant false alarm rate (CFAR) with the assumption of a known speckle covariance matrix or by the use of frequency agility.     

Adaptive canceler and pulse compressor interactions

Performance results for the sidelobe level of a compressed pulse that has been preprocessed through an adaptive canceler are obtained. The adaptive canceler is implemented using the sampled matrix inversion algorithm. Because of finite sampling, the quiescent compressed pulse sidelobe levels are degraded due to the preprocessing of the main channel input data stream (the uncompressed pulse) through an adaptive canceler. It is shown that if N is the number of input canceler channels (main and auxiliaries) and K is the number of independent samples per channel, then K/N can be significantly greater than one in order to retain sidelobes that are close to the original quiescent sidelobe level (with no adaptive canceler). Also it is shown that the maximum level of degradation is independent of whether pulse compression occurs before or after the adaptive canceler if the uncompressed pulse is completely contained within the K samples that are used to calculate the canceler weights. This same analysis can be used to predict the canceler noise power level that is induced by having the desired signal present in the canceler weight calculation     

Convergence bounds of an SMI/Gram-Schmidt canceler in colored noise

The performance of the sampled matrix inversion (SMI) adaptive algorithm in colored noise is investigated using the Gram-Schmidt (GS) canceler as an analysis tool. Lower and upper bounds of average convergence are derived, indicating that average convergence slows as the input time samples become correlated. When the input samples are uncorrelated, the fastest SMI algorithm convergence occurs. When the input samples are correlated then the convergence bounds depend on the number of channels N, the number of samples per channels K , and the eigenvalues associated with K×K correlation matrix of the samples in a given channel. This matrix is assumed identical for all channels     

The autocorrelation of m-sequences over nonprime finitefields

Nonbinary m-sequences (maximal length sequences) for spread-spectrum communication systems that have a two-level autocorrelation are presented. The autocorrelation function of an m -sequence over the Galois field of q elements GF(q), where q=p^k, for p a prime and k an integer greater than 1, is developed and shown to be bilevel when the elements of GF(q) are expressed as elements of a vector space over the pth roots of unity     

Adaptive polarimetric target detection with coherent radar. I.Detection against Gaussian background

The derivation of a completely adaptive polarimetric coherent scheme to detect a radar target against a Gaussian background is presented. A previously proposed Generalized Likelihood Ratio Test (GLRT) polarimetric detector is extended to the case of a general number of channels; this exploits the polarimetric characteristics of the received radar echoes to improve the detection performance. Together with the fully adaptive scheme, a model-based detector is derived that has a lower estimation loss. A complete theoretical expression is derived for the detection performance of both proposed polarimetric detectors. They are shown to have Constant False Alarm Rate (CFAR) when operating against Gaussian clutter, but to be sensitive to deviations from the Gaussian statistic. The application to recorded radar data demonstrates the performance improvement achievable in practice     

Cascaded detector for multiple high-PRF pulse Doppler radars

A postdetection design methodology for a multiple high-pulse-repetition frequency (PRF) pulse Doppler radar has been developed. The postdetection processor consists of an M out of N detector where range and target ambiguities are resolved, followed by a square-law detector which enhances the minimum signal-to-noise (S/N) power-ratio per pulse burst performance. For given probabilities of false alarm and detection, formulas are derived from which the three thresholds associated with the cascaded detector can be found. Fundamental tradeoffs between the minimum S/N required, number of ghosts, and the number of operations (NOPs) that the cascaded detector must perform are identified. It is shown that the NOPs and the number of ghosts increase and the minimum S/N required decreases as the binary M out of N detector passes more detections to the square-law detector     

Multichannel whitening of SAR imagery

The presence of speckle in synthetic aperture radar (SAR) imagery makes image interpretation more difficult and worsens the performance of algorithms designed to detect objects in the imagery. Image processing techniques to reduce speckle usually do so at the expense of spatial resolution. Multichannel whitening is one image processing technique that reduces image speckle while maintaining spatial resolution. Multichannel whitening is applied to imagery recorded during a foliage penetration experiment undertaken by MIT Lincoln Laboratory using the NASA/JPL UHF, L-, C-band fully polarimetric SAR in July 1990. In this experiment, a 50 km² forested area near Portage, Maine was imaged. Twenty-seven 8 ft trihedral corner reflectors were arrayed throughout the imaged area beneath the foliage in order to measure foliage attenuation. The detection performance for corner reflectors under foliage is compared for the raw data and whitened data, and the predictions of a product model for the degree of speckle reduction are compared with the data     

Foliage penetration experiment

This series papers describes analyses of a foliage penetration experiment undertaken by MIT Lincoln Laboratory to assess the ability of synthetic aperture radar (SAR) to detect targets under trees. Data were taken using the NASA/JPL UHF, L-, C-band fully polarimetric SAR over a forested area in Maine in July 1990. Future experiments are planned to measure the polarimetric properties of clutter and targets using the latest ultrawideband sensors with submeter resolutions and fully polarimetric data collection capabilities     

False alarm control using Doppler estimation

A technique which uses maximum-likelihood estimates (MLEs) of target Doppler and target amplitude is developed for rejecting clutter residues. Multiple estimates are made and consistency checks are applied to the estimates. Simulation results indicate that for large clutter-to-noise ratios (C/N⩾55 dB) the probability of false alarm from clutter residues is reduced from 1.0 to below 0.01     

CCRS C/X-airborne synthetic aperture radar: An Rand D tool for the ERS-1 time frame

The airborne synthetic-aperture radar (SAR) system developed for the Canada Centre for Remote Sensing (CCRS) is described. It consists of two radars, at C-band and X-band. Each radar incorporates the following features: dual-channel receivers and dual-polarized antennas; a high quality, 7-look, real-time processor; a sensitivity time control for range-dependent gain control; a motion-compensation system for antenna steering in azimuth and elevation; and baseband I and Q signal phase rotation. The system also uses a high-power transmitter with a low-power back-up. The SAR maps to either side of the aircraft, at high or low resolution, at incidence angles which in high resolution span 0° to 80°. Radar operating parameters, data products, key specifications and the motion compensation scheme used are presented. Properties of the real-time imagery are discussed and examples of C-band SAR data in the three operating modes are given     

Low-altitude target detection by coastline operated marine radar

Relevant to a Richian family of fluctuating targets with a composite background of sea-plus-land clutter, the performance prediction of a radar operating in near-coastal regions is elucidated by assuming noncoherent integration of the pulses. Considering the dominance of land clutter, a modified K-distributed statistic is indicated for the overall clutter envelope; and the corresponding probability of false alarm and probability of detection are deduced for fixed threshold detection (s) based on N pulses integrated in the presence of the sea-plus-land clutter and the noise. Even when the target offers a dominant scattered echo, the worst situations of the land clutter affecting the detection performance are indicated     

Identification of rational transfer function from frequencyresponse sample

A method for identifying a transfer function, H(z)=A(z)/B(z), from its frequency response values is presented. Identifying the transfer function involves determining the unknown degrees and coefficients of the polynomials A(z) and B( z), given the frequency response samples. The method for finding the parameters of the transfer function involves solving linear simultaneous equations only. An important aspect of the method is the decoupled manner in which the polynomials A(z) and B(z) are determined. The author presents two slightly different derivations of the linear equations involved, one based on the properties of divided differences and the other using Vandermonde matrices or, equivalently, Lagrange interpolation. A matrix synthesized from the given frequency response samples is shown to have a rank equal to the number of poles in the system     

Adaptive polarimetric target detection with coherent radar. II.Detection against non-Gaussian background

For pt. I see ibid., vol. 37, no. 4, pp. 1194-1206 (2001).This paper presents the derivation of a polarimetric coherent adaptive scheme to detect a radar target against a non-Gaussian background. This completes the results presented in Part I for the Gaussian background. A Texture Free-Generalized Likelihood Ratio Test (TF-GLRT) detector is derived that exploits the polarimetric characteristics of the received radar echoes to improve the detection performance. The proposed polarimetric detector is shown to have Constant False Alarm Rate (CFAR) when operating against compound-Gaussian clutter with unknown parameters. Its performance is fully characterized by both theoretical analysis and simulation. Moreover, the application to recorded radar data demonstrates the performance improvement achievable in practice     

A parallel square-root algorithm for modified extended Kalmanfilter

A parallel square-root algorithm and its systolic array implementation are proposed for performing modified extended Kalman filtering (MEKF). The proposed parallel square-root algorithm is designed based on the singular value decomposition (SVD) and the Faddeev algorithm, and a very large scale integration (VLSI) systolic array architecture is developed for its implementation. Compared to other square root Kalman filtering algorithms, the proposed method is more numerically stable. The VLSI architecture described has good parallel and pipelining characteristics in applying to the MEKF and achieves higher efficiency. For n-dimensional state vector estimations, the proposed architecture consists of O(2n²) processing elements and uses O ((s+17)n) time-steps for a complete iteration at each instant, in contrast to the complexity of O((s+6) n³) time-steps for a sequential implementation, where s≈log n     

Tracking multitarget in cluttered environment

A method for multitarget tracking and initiating tracking in a cluttered environment is proposed. The algorithm uses a sliding window of length uT (T is the sampling time) to keep the measurement sequence at time k. Instead of solving a large problem, the entire set of targets and measurements is divided into several clusters so that a number of smaller problems are solved independently. When a set of measurements is received, a new set of data-association hypotheses is formed for all the measurements lying in the validation gates within each cluster from time K-u+1 to K. The probability of each track history is computed, and, choosing the largest of these histories, the target measurement is updated with an adaptive state estimator. A covariance-matching technique is used to improve the accuracy of the adaptive state estimator. In several examples, the algorithm successfully tracks targets over a wide range of conditions     

Effects of polarization and resolution on SAR ATR

Lincoln Laboratory is investigating the detection and classification of stationary ground targets using high resolution, fully polarimetric, synthetic aperture radar (SAR) imagery. A study is summarized in which data collected by the Lincoln Laboratory 33 GHz SAR were used to perform a comprehensive comparison of automatic target recognition (ATR) performance for several polarization/resolution combinations. The Lincoln Laboratory baseline ATR algorithm suite was used, and was optimized for each polarization/resolution case. Both the HH polarization alone and the optimal combination of HH, HV, and VV were evaluated; the resolutions evaluated were 1 ft/spl times/1 ft and 1 m/spl times/1 m. The data set used for this study contained approximately 74 km/sup 2/ of clutter (56 km/sup 2/ of mixed clutter plus 18 km/sup 2/ of highly cultural clutter) and 136 tactical target images (divided equally between tanks and howitzers).