Optimal speckle reduction in polarimetric SAR imagery

Speckle is a major cause of degradation in synthetic aperture radar (SAR) imagery. With the availability of fully polarimetric SAR data, it is possible to use the three complex elements (HH, HV, VV) of the polarimetric scattering matrix to reduce speckle. The optimal method for combining the elements of the scattering matrix to minimize image speckle is derived, and the solution is shown to be a polarimetric whitening filter (PWF). A simulation of spatially correlated, K-distributed, fully polarimetric clutter is then used to compare the PWF with other, suboptimal speckle-reduction methods. Target detection performance of the PWF, span, and single-channel |HH|² detectors is compared with that of the optimal polarimetric detector (OPD). A novel, constant-false-alarm-rate (CFAR) detector (the adaptive PWF) is as a simple alternative to the OPD for detecting targets in clutter. This algorithm estimates the polarization covariance of the clutter, uses the covariance to construct the minimum-speckle image, and then tests for the presence of a target. An exact theoretical analysis of the adaptive PWF is presented; the algorithm is shown to have detection performance comparable with that of the OPD     

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     

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     

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     

Detection in Laplace Noise

The discrete time detection of a known constant signal in white stationary Laplace noise is considered. Exact expressions describing the performance of both the Neyman-Pearson optimal detector and the suboptimal linear detector are presented. Also, graphs of the receiver operating characteristics are given. The actual performance of the Neyman-Pearson optimal detector is compared to that predicted by a Gaussian approximation to the distribution of the test statistic.     

Performance of a Two-Sample Mann-Whitney Nonparametric Detector in a Radar Application

The detection of signals in an unknown, typically non-Gaussian noise environment, while attempting to maintain a constant false-alarm rate, is a common problem in radar and sonar. The raw receiver data is commonly processed initially by a bank of frequency filters. The further processing of the outputs from the filter bank by a two-sample Mann-Whitney detector is considered. When the noise statistics in all filters are identical, the Mann-Whitney detector is distribution free, i. e., the false-alarm probability may be prescribed in advance regardless of the precise form of the noise statistics. The primary purpose of this paper is to demonstrate the potential advantage of nonparametric detectors over conventional detectors. The signal detection performance of the Mann-Whitney detector is compared to that of an ordinary linear envelope detector plus integrator in the presence of Gaussian and several hypothetical forms of non-Gaussian noise. This comparison is made for both uniform and nonuniform distributions of noise power across the filter bank. Besides providing a much more constant false-alarm rate than the conventional detector, the Mann-Whitney detector's signal detection performance is found also to be much less sensitive to the form of the noise statistics. In one case, its detection sensitivity is found to be 11 dB better than that of the conventional detector. Even when the noise power density is made moderately nonuniform across the filter bank, the detection performance of the Mann-Whitney detector is found not to be significantly affected.     

On detection using filter banks and higher order statistics

We suggest a method, based on the use of filter bank and higher order statistics (cumulants), for detection of transient signals. The method first uses a bandpass filter bank, which separates the spectrum of the observed signal into narrow frequency bands. Each subfilter of the filter bank is then followed by a cumulant estimator, and thereby suppressing colored noise. By selecting those subfilters that have large output energies, the filter bank can approximate the behavior of a matched filter. Moreover, no a priori information about the waveform of the signal is needed. The performance of the detector is evaluated by using a simulated signal as well as a measured signal. The presented detector is compared with the optimal matched filter detector.     

Hough transform for long chirp detection

The online detection of a very long and weak chirp signal is studied. The signal has an extremely slowly decreasing frequency, and is corrupted by white Gaussian noise and possibly also by powerful tones. By exploring and comparing candidate methods, it is found that the Hough transform (HT) detector appears to be most suitable given constraints on computational load and detectability. The analytical and the simulational performance of the HT detector are obtained and compared with the analytical performance of the generalized likelihood ratio test (GLRT), which is assumed to be optimal. Applying a suitable threshold for the HT can increase speed dramatically while preserving performance. We have found that both dithering (taking varied frequency shifts for fast Fourier transforms (FFTs)) and increasing the FFT length can reduce the minimum detectable frequency slope with nearly no additional computation     

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     

Target detection with synthetic aperture radar

Target detection with synthetic aperture radar (SAR) is considered. We derive generalized likelihood ratio (GLR) detection algorithms that may be used with SAR images that are obtained with coherent subtraction or have Gaussian distributions. We analytically compare the performance of (1) a single pixel detector, (2) a detector using complete knowledge of the target signature information and known orientation information, (3) a detector using incomplete knowledge of the target signature information and known orientation information (4) a detector using unknown target signature information and known orientation information, and (5) a detector using unknown target signature information and unknown orientation information     

Numerical Results on the Convergence of Relative Efficiencies

This paper considers the detection of a known constant signal in an additive non-Gaussian noise under the assumptions of discrete time and statistically independent noise samples. The objective is to determine how large sample size must be before the easily computed asymptotic relative efficiency becomes a valid measure of performance. The exact small-sample error probabilities are calculated for a Neyman-Pearson optimal nonlinear detector consisting of a zeromemory nonlinearity followed by summation and threshold comparison. "Large-tailed" noise having a double exponential distribution is used as an example. The exact distribution of the test statistics for a linear detector and for the Neyman-Pearson optimal detector are calculated. Then the relative efficiency of the Neyman-Pearson optimal detector, as compared to a linear detector, is computed in order to study the rate of approach of the relative efficiency to its asymptotic value.     

Importance sampling for characterizing STAP detectors

This paper describes the development of adaptive importance sampling (IS) techniques for estimating false alarm probabilities of detectors that use space-time adaptive processing (STAP) algorithms. Fast simulation using IS methods has been notably successful in the study of conventional constant false alarm rate (CFAR) radar detectors, and in several other applications. The principal objectives here are to examine the viability of using these methods for STAP detectors, develop them into powerful analysis and design algorithms and, in the long term, use them for synthesizing novel detection structures. The adaptive matched filter (AMF) detector has been analyzed successfully using fast simulation. Of two biasing methods considered, one is implemented and shown to yield good results. The important problem of detector threshold determination is also addressed, with matching outcome. As an illustration of the power of these methods, two variants of the square-law AMF detector that are thought to be robust under heterogeneous clutter conditions have also been successfully investigated. These are the envelope-law and geometric-mean STAP detectors. Their CFAR property is established and performance evaluated. It turns out the variants have detection performances better than those of the AMF detector for training data contaminated by interferers. In summary, the work reported here paves the way for development of advanced estimation techniques that can facilitate design of powerful and robust detection algorithms     

Structures for radar detection in compound Gaussian clutter

The problem of coherent radar target detection in a background of non-Gaussian clutter modeled by a compound Gaussian distribution is studied here. We show how the likelihood ratio may be recast into an estimator-correlator form that shows that an essential feature of the optimal detector is to compute an optimum estimate of the reciprocal of the unknown random local power level. We then proceed to show that the optimal detector may be recast into yet another form, namely a matched filter compared with a data-dependent threshold. With these reformulations of the optimal detector, the problem of obtaining suboptimal detectors may be systematically studied by either approximating the likelihood ratio directly, utilizing a suboptimal estimate in the estimator-correlator structure or utilizing a suboptimal function to model the data-dependent threshold in the matched filter interpretation. Each of these approaches is studied to obtain suboptimal detectors. The results indicate that for processing small numbers of pulses, a suboptimal detector that utilizes information about the nature of the non-Gaussian clutter can be implemented to obtain quasi-optimal performance. As the number of pulses to be processed increases, a suboptimal detector that does not require information about the specific nature of the non-Gaussian clutter may be implemented to obtain quasi-optimal performance     

Waveform Design for Multistatic Radar Detection

We derive the optimal Neyman-Pearson (NP) detector and its performance, and then present a methodology for the design of the transmit signal for a multistatic radar receiver. The detector assumes a Swerling I extended target model as well as signal-dependent noise, i.e., clutter. It is shown that the NP detection performance does not immediately lead to an obvious signal design criterion so that as an alternative, a divergence criterion is proposed for signal design. A simple method for maximizing the divergence, termed the maximum marginal allocation algorithm, is presented and is guaranteed to find the global maximum. The overall approach is a generalization of previous work that determined the optimal detector and transmit signal for a monostatic radar.     

Asynchronous distributed detection

Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DEC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period is Poisson distributed. An optimal fusion rule is developed and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (i.e., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair-Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks     

Blind adaptive decision fusion for distributed detection

We consider the problem of decision fusion in a distributed detection system. In this system, each detector makes a binary decision based on its own observation, and then communicates its binary decision to a fusion center. The objective of the fusion center is to optimally fuse the local decisions in order to minimize the final error probability. To implement such an optimal fusion center, the performance parameters of each detector (i.e., its probabilities of false alarm and missed detection) as well as the a priori probabilities of the hypotheses must be known. However, in practical applications these statistics may be unknown or may vary with time. We develop a recursive algorithm that approximates these unknown values on-line. We then use these approximations to adapt the fusion center. Our algorithm is based on an explicit analytic relation between the unknown probabilities and the joint probabilities of the local decisions. Under the assumption that the local observations are conditionally independent, the estimates given by our algorithm are shown to be asymptotically unbiased and converge to their true values at the rate of O(1/k/sup 1/2/) in the rms error sense, where k is the number of iterations. Simulation results indicate that our algorithm is substantially more reliable than two existing (asymptotically biased) algorithms, and performs at least as well as those algorithms when they work.     

基于小生境遗传算法的分布式OS-CFAR检测系统优化与性能分析

 利用小生境遗传算法,对不同检测窗长度和检测信噪比的三传感器分布式 OS-CFAR检测系统进行了优化设计,给出了一组针对不同检测环境与融合方式的搜索结果。分析表明,对于非一致环境下分布式 OS-CFAR检测系统,小生境遗传算法是一种良好的优化算法。利用搜索结果,研究了不同融合方式下环境变化对分布式 OS-CFAR检测系统的性能影响,结果表明,“或”融合对检测环境的非一致变化具有较强的鲁棒性,而“3选2”融合和“与”融合对检测环境的变化比较敏感。     

Difference beam aided target detection in monopulse radar

The classical detection step in a monopulse radar system is based on the sum beam only,the performance of which is not optimal when target is not at the beam center. Target detection aided by the difference beam can improve the performance at this case. However, the existing difference beam aided target detectors have the problem of performance deterioration at the beam center, which has limited their application in real systems. To solve this problem, two detectors are proposed in this paper. Assuming the monopulse ratio is known, a generalized likelihood ratio test(GLRT) detector is derived, which can be used when targeting information on target direction is available. A practical dual-stage detector is proposed for the case that the monopulse ratio is unknown. Simulation results show that performances of the proposed detectors are superior to that of the classical detector.     

Optimal CFAR detection in Weibull clutter

Optimal, in the maximum likelihood sense, constant false-alarm rate (CFAR) detection for Weibull clutter statistics, is investigated. The proposed OW (optimal Weibull) estimator is proved to be an asymptotically efficient estimator of the mean power of the Weibull clutter. Theoretical analysis of the OW-CFAR detector is provided, while detection performance analysis is carried out using the Monte Carlo simulation method. The operation of the median and morphological (MEMO)-CFAR detector in Weibull clutter statistics is also explained. It performs almost optimally in uniform clutter and, simultaneously, it is robust in multitarget situations. The performance of the proposed OW-CFAR detector in uniformal Weibull clutter is used as a yardstick in the analysis of the MEMO cell-averager (CA) and ordered statistic (OS) CFAR detectors. Nonfluctuating and fluctuating (Swerling II) targets are considered in detection analysis. The performance of the detectors is also examined at clutter edges