A comparison of two adaptive detection schemes

Two schemes for adaptive detection are compared: Kelly's generalized likelihood ratio test (GLRT) and the mean level adaptive detector (MLAD). Detection performance, P_D, is predicted for the two schemes under the assumptions that the input noises are zero-mean complex Gaussian random variables that are temporally independent but spatially correlated; and the amplitude of the desired signal is Rayleigh distributed. P_D is computed as a function of the false alarm probability, the number of input channels, the number of independent samples per channel, and the matched filtered output signal-to-noise (S/N) power ratio. In this analysis the GLRT is shown to have better detection performance than the MLAD. The difference in detection performance increases as one uses fewer input samples. However, the required number of samples necessary to have only a 3 dB detection loss for both detection schemes is approximately the same. This is significant since for the present, the MLAD is considerably less complex to implement than the GLRT     

Modified Generalized Sign Test Processor for 2-D Radar

The modified generalized sign test processor is a nonparametric, adaptive detector for 2-D search radars. The detector ranks a sample under test with its neighboring samples and integrates (on a pulse-to-pulse basis) the ranks with a two-pole filter. A target is declared when the integrated output exceeds two thresholds. The first threshold is fixed and yields a 10-6 probability of false alarm when the neighboring samples are independent and identically distributed. The second threshold is adaptive and maintains a low false-alarm rate when the integrated neighboring samples are correlated and when there are nonhomogeneities, such as extraneous targets, in the neighboring cells. Using Monte Carlo techniques, probability of false-alarm results, probability of detection curves, and angular accuracy curves have been generated for this detector. The detector was built and PPI photographs are used to indicate the detector's performance when the radar is operated over land clutter.     

Detection in correlated Gaussian plus impulsive noise

A detector which is designed to operate in a correlated Gaussian-plus-impulsive-noise environment is presented. The detector whitens the data robustly and then uses a two-sided threshold test to determine the presence of impulsive samples. The impulsive samples are discarded, and the remaining samples are used to detect the presence or absence of a signal using a matched filter. An approximate analysis is presented, and simulations are used to demonstrate the effectiveness of this approach     

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     

A noncoherent adaptive detection technique

An adaptive detection technique suitable for both stationary and nonstationary noise environments based upon a generalized likelihood ratio test (GLRT) formulation is presented. The detector, which is statistically equivalent to a special form of the Wilks's lambda test, noncoherently combines the information contained in a pulse train of arbitrary length for decision-making purposes. The probability density function of the test under the noise only hypothesis is shown to be central χ². Under the signal plus noise hypothesis, an exact statistical characterization of the test cannot be obtained, and, therefore, a Chernoff bound is derived. Results in terms of the probability of detection versus signal-to-noise ratio (SNR) obtained from Monte Carlo simulation, the Chernoff bound, and the optimal matched filter case are examined. The performance of the noncoherent detector is shown to be a function of the covariance matrix estimate and the number of data samples     

Parametric Rao Test for Multichannel Adaptive Signal Detection

The parametric Rao test for a multichannel adaptive signal detection problem is derived by modeling the disturbance signal as a multichannel autoregressive (AR) process. Interestingly, the parametric Rao test takes a form identical to that of the recently introduced parametric adaptive matched filter (PAMF) detector for space-time adaptive processing (STAP) in airborne surveillance radar systems and other similar applications. The equivalence offers new insights into the performance and implementation of the PAMF detector. Specifically, the Rao/PAMF detector is asymptotically (for large samples) a parametric generalized likelihood ratio test (GLRT), due to an asymptotic equivalence between the Rao test and the GLRT. The asymptotic distribution of the Rao test statistic is obtained in closed form, which follows an exponential distribution under the null hypothesis H ₀ and, respectively, a noncentral Chi-squared distribution with two degrees of freedom under the alternative hypothesis H ₁. The noncentrality parameter of the noncentral Chi-squared distribution is determined by the output signal-to-interference-plus-noise ratio (SINR) of a temporal whitening filter. Since the asymptotic distribution under H ₀ is independent of the unknown parameters, the Rao/PAMF asymptotically achieves constant false alarm rate (CFAR). Numerical results show that these results are accurate in predicting the performance of the parametric Rao/PAMF detector even with moderate data support.     

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     

Sonar Array Detection of Gaussian Signals in Gaussian Noise of Unknown Power

A statistical test is postulated for detecting, with an M-element hydrophone array, a Gaussian signal in spatially independent Gaussian noise of unknown power. The test is an extension of the uniformly-most-powerful (UMP) unbiased test for a two-element array. The output signal-to-noise ratio of the test is calculated and, for a large number of independent space-time samples, is shown to be no better than a mean-level detector (MLD). Receiver operating characteristic curves (ROC) for the MLD are computed and compared to the ROC curves for the optimum (Bayes) parametric detector. The input signal-to-noise power ratios required to provide a detection probability of 0.5 differ by less than 0.2 dB for a fifty-element array with wide variation in false-alarm probability and time-bandwidth product. This result suggests that both the extended bivariate UMP unbiased test and the MLD perform close to the unknown UMP unbiased test for independence of a multivariate Gaussian distribution.     

Adaptive array transient sidelobe levels and remedies

The transient sidelobe level of a sidelobe canceler (SLC) is a function of the external noise environment, the number of adaptive auxiliary antennas, the adaptive algorithm used, auxiliary antenna gain margins, and the number of samples used to calculate the adaptive weights. An analytical result for the adaptive sidelobe level is formulated for the case when the adaptive algorithm is the open-loop, sampled matrix inversion (SMI) algorithm. The result is independent of whether concurrent or nonconcurrent data processing is used in the SMI algorithm's implementation. It is shown that the transient sidelobe level is eigenvalue dependent and increases proportionally to the gain margin of the auxiliary antenna elements with respect to the quiescent main antenna sidelobe level. Techniques that reduce this transient sidelobe level are discussed, and it is theoretically shown that injection independent noise into the auxiliary channels significantly reduces the transient sidelobe level. It is demonstrated that using this same technique reduces the SMI noise power residue settling time     

A variably trimmed mean CFAR radar detector

A variably trimmed mean (VTM) constant false alarm rate (CFAR) detector in which the threshold is determined by processing a linear combination of a group of ordered samples in each window is introduced. Unlike the trimmed mean detector, the number of ordered samples that require further processing is allowed to vary according to a data-dependent rule. It is demonstrated that the VTM detector exhibits performance characteristics that are independent of the total (stationary) noise power. Simulated performance results are presented for regions of clutter power transitions and for multiple target environments to illustrate the possible improvement over the order-statistic detector that can be obtained by using a VTM detector     

Suppression of Weibull-Distributed Clutters Using a Cell-Averaging LOG/CFAR Receiver

The parameters of the Weibull distribution and the threshold level for an adaptive CFAR detector are determined by calculating the mean value and the mean-squared value of the input signal voltage before it passes through a logarithmic amplifier. By using this threshold level an adaptive method for suppressing various VVeibull-distributed clutters is proposed.     

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     

Coherent detection in Laplace noise

The discrete-time detection of a time-varying, additive signal in independent Laplace noise is considered. Previous efforts in this area have been restricted to the constant signal, and identically distributed noise case. Theoretical (closed form) expressions for the false alarm and detection probabilities are developed for both the Neyman-Pearson optimal detector and the classical matched filter detector. Comparisons between the two detectors are made which illustrate the effects of signal-to-noise power ratio and sample size for certain false alarm and detection probability constraints. In view of the fact that the optimal Laplace detector is not UMP, we also investigate the effect of signal amplitude mismatch     

Filtering of moving targets using SBIR sequential frames

In this paper three-dimensional (3-D) finite-impulse response (FIR) filters are proposed for moving target detection and tracking from multiframe space-based infrared (SBIR) data. An optimal, in the l_p sense, 3-D FIR filter design technique is proposed which is suitable for the above application. This technique is the first 3-D FIR design of its kind presented in the open literature. Directional, matched, and adaptive 3-D filtering techniques are proposed. Prior to the filtering, clutter mean estimation and mean subtraction are required. Real time implementation of directional and/or matched filters for processing maneuvering targets is discussed and filter design methods are proposed. Finally, performance comparisons of the proposed and other available 3-D FIR and infinite-impulse response (IIR) filters, on real SBIR data, are presented in which the advantages of the proposed 3-D filters are shown     

Multiframe detector/tracker: optimal performance

We develop the optimal Bayes multiframe detector/tracker for rigid extended targets that move randomly in clutter. The performance of this optimal algorithm provides a bound on the performance of any other suboptimal detector/tracker. We determine by Monte Carlo simulations the optimal performance under a variety of scenarios including spatially correlated Gaussian clutter and non-Gaussian (K and Weibull) clutter. We show that, for similar tracking performance, the optimal Bayes tracker can achieve peak signal-to-noise ratio gains possibly larger than 10 dB over the commonly used combination of a spatial matched filter (spatial correlator) and a linearized Kalman-Bucy tracker. Simulations using real clutter data with a simulated target suggest similar performance gains when the clutter model parameters are unknown and estimated from the measurements     

Weak Signal Detection in Non-Gaussian Noise of Unknown Level

An adaptive threshold detector to test for the presence of a weak signal in additive non-Gaussian noise of unknown level is discussed. The detector consists of a locally optimum detector, a noise level estimator, and a decision device. The detection threshold is made adaptive according to the information provided by the noise level estimator in order to keep a fixed false-alarm probability. Asymptotic performance characteristics are obtained indicating relationships among the basic system parameters such as the reference noise sample size and the underlying noise statistics. It is shown that, as the reference noise sample size is made sufficiently large, the adaptive threshold detector attains the performance of a corresponding locally optimum detector for detecting the weak signal were the noise level known.     

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     

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.     

Theory of partially adaptive radar

This work extends the recently introduced cross-spectral metric for subspace selection and dimensionality reduction to partially adaptive space-time sensor array processing. A general methodology is developed for the analysis of reduced-dimension detection tests with known and unknown covariance. It is demonstrated that the cross-spectral metric results in a low-dimensional detector which provides nearly optimal performance when the noise covariance is known. It is also shown that this metric allows the dimensionality of the detector to be reduced below the dimension of the noise subspace eigenstructure without significant loss. This attribute provides robustness in the subspace selection process to achieve reduced-dimensional target detection. Finally, it is demonstrated that the cross-spectral subspace reduced-dimension detector can outperform the full-dimension detector when the noise covariance is unknown, closely approximating the performance of the matched filter.     

基于新息异常检测的改进抗差自适应卡尔曼滤波算法

在工程应用中,量测异常及量测噪声统计特性的时变是引起标准卡尔曼滤波振荡甚至发散的主要原因。经典抗差Sage-Husa自适应滤波方案,对量测中的孤立型异常有所抵抗,并可在线估计量测噪声统计特性改善滤波效果,但当连续型异常值出现时,其滤波效果不佳。针对现有抗差Sage-Husa自适应滤波方案的不足,提出了新的改进滤波方法。在改进算法中,当检测到量测异常时采用模值更大的先验预测方差阵代替原算法中的后验估计方差阵,在估计量测噪声方差时起到放大作用,以降低异常量测权重,提高滤波精度;采用IGG方案构造了新的权函数,可在抑制异常影响的同时调节估计方差阵,以免连续异常时新息持续置零引起的滤波发散;采用标准卡尔曼滤波新息辅助异常检测的双重检测策略,避免了因量测噪声方差阵的调节引起检测阈值变化而导致的漏检率增高。仿真实验表明,与常规抗差自适应滤波算法相比,该方案可更加有效地抑制量测异常值的影响。