Distributed CFAR detection in homogeneous and nonhomogeneousbackgrounds

The performance of distributed constant false alarm rate (CFAR) detection with data fusion both in homogeneous and nonhomogeneous Gaussian backgrounds is analyzed. The ordered statistics (OS) CFAR detectors are employed as local detectors. With a Swerling type I target model, in the homogeneous background, the global probability of detection for a given fixed global probability of false alarm is maximized by optimizing both the threshold multipliers and the order numbers of the local OS-CFAR detectors. In the nonhomogeneous background with multiple targets or clutter edges, the performance of the detection system is analyzed and its performance is compared with the performance of the distributed cell-averaging (CA) CFAR detection system     

Analysis of CFAR processors in homogeneous background

Five different constant false alarm rate (CFAR) radar processing schemes are considered and their performances analyzed in homogeneous and nonhomogeneous backgrounds, the latter specifically being the multiple target environment and regions of clutter transitions. The average detection threshold for each of the CFAR schemes was computed to measure and compare the detection performance in homogeneous noise background. The exponential noise model was used for clear and clutter backgrounds to get closed-form expressions. The processor types compared are: the cell-averaging CFAR, the `greatest of' CFAR, the `smallest of' CFAR, the ordered-statistics CFAR, and a modified ordered-statistics processor called the trimmed-mean CFAR     

Matched subspace CFAR detection of hovering helicopters

A constant false alarm rate (CFAR) strategy for detecting a Gaussian distributed random signal against correlated non-Gaussian clutter is developed. The proposed algorithm is based on Scharf's matched subspace detector (MSD) and has the CFAR property with respect to the clutter amplitude probability density function (apdf), provided that the clutter distribution belongs to the compound-Gaussian family and the clutter covariance matrix is known to within a scale factor. Analytical expressions of false alarm and detection probabilities are derived. An application to the problem of detecting hovering helicopters against vegetated ground clutter is reported     

OS-CFAR theory for multiple targets and nonuniform clutter

The performance of a cell averaging constant false-alarm rate (CA-CFAR) detector degrades rapidly in nonideal conditions caused by multiple targets and nonuniform clutter. The ordered-statistic CFAR (OS-CFAR) is an alternative to the CA-CFAR. The OS-CFAR trades a small loss in detection performance relative to the CA-CFAR in ideal conditions for much less performance degradation in nonideal conditions. A formula is given for the detection probability of the OS-CFAR when there are multiple Swerling I targets in the CFAR window, and a formula is given for the probability of false alarm in nonuniform Raleigh clutter     

非高斯杂波下自适应雷达目标检测新方法

在球不变随机向量(SIRV)非高斯杂波背景下,研究了多脉冲相参雷达目标的自适应检测问题。假设杂波具有相同的协方差矩阵结构和可能相关的纹理分量,提出了新的协方差矩阵估计器,并获得了相应的自适应归一化匹配滤波器(ANMF)。理论分析表明,在估计杂波分组大小与实际情况匹配时,所获得的ANMF对杂波功率水平和协方差矩阵结构均具有恒虚警率(CFAR)特性。仿真结果表明:当估计的杂波分组大小失配时,所获得的ANMF具有近似CFAR特性,并进一步分析了不同参数变化对所提检测器性能的影响。与已有的ANMF相比,所获得的ANMF具有更好的检测性能,且迭代次数更小,其相对于已知杂波协方差矩阵的最优归一化匹配滤波器(NMF)的检测损失也更小,具有很好的实际应用前景。     

Asymptotically optimum radar detection in compound-Gaussian clutter

An asymptotically optimum receiver designed for detecting coherent pulse trains in compound-Gaussian clutter is introduced and assessed. The proposed receiver assumes knowledge of the structure of the clutter covariance matrix, but does not require that of its amplitude probability density function (apdf). Performance is analytically evaluated, showing that the loss, as measured with respect to the corresponding optimum structure, is kept within a few dBs even for a relatively small number of integrated pulses and that it largely outperforms the matched-filter detector under all instances of practical interest. Interestingly, the proposed detector achieves constant false alarm rate (CFAR), regardless of the clutter envelope distribution and, consequently, its power     

Clutter Map CFAR Analysis

An analysis of the probability of target detection for a clutter map CFAR using digital exponential filtering has been performed. General performance equations are derived. The probability of detection versus signal-to-noise ratio is plotted for a false alarm probability of 1.E-06 for several weight values. The CFAR loss is plotted for a detection probability of 0.9 and false alarm probabilities of 1.E-06 and 1.E-08.     

Analysis of some modified ordered statistic CFAR: OSGO and OSSOCFAR

It is necessary for automatic detection radars to be adaptive to variations in background clutter in order to maintain a constant false alarm rate (CFAR). A CFAR based on an ordered statistic technique (OS CFAR) has some advantages over the cell-averaging technique (CA CFAR), especially in clutter edges or multiple target environments; unfortunately the large processing time required by this technique limits its use. The authors present two new OS CFARs that require only ahlf the processing time. One is an ordered statistic greatest of CFAR (OSGO), while the other is an ordered statistic smallest of CFAR (OSSO). The OSGO CFAR has the advantages of the OS CFAR with only a negligible increment to the CFAR loss     

Analysis of an adaptive CFAR detector in non-Gaussian interference

Coherent signal detection in non-Gaussian interference is presently of interest in adaptive array applications. Conventional array detection algorithms inherently model the interference with a multivariate Gaussian random vector. However, non-Gaussian interference models are also under investigation for applications where the Gaussian assumption may not be appropriate. We analyze the performance of an adaptive array receiver for signal detection in interference modeled with a non-Gaussian distribution referred to as a spherically invariant random vector (SIRV). We first motivate this interference model with results from radar clutter measurements collected in the Mountain Top Program. Then we develop analytical expressions for the probability of false alarm and the probability of detection for the adaptive array receiver. Our analysis shows that the receiver has constant false alarm rate (CFAR) performance with respect to all the interference parameters. Some illustrative examples are included that compare the detection performance of this CFAR receiver with a receiver that has prior knowledge of the interference parameters     

A new and robust CFAR detection algorithm

A constant false alarm rate (CFAR) detection method which is based on a combination of median and morphological filters (MEMO) is proposed. The MEMO algorithm has robust performance with small CFAR loss, very good behavior at clutter edges and high detection performance in the case of closely spaced narrowband signals (targets). The proposed MEMO method is favourably compared with cell averaging (CA) and ordered statistics (OS) CFAR detectors. The Monte Carlo method is employed to analyze the MEMO-CFAR detector     

基于杂波对消-自聚焦的多通道SAR-GMTI

对超高频(UHF)波段多通道合成孔径雷达(SAR)动目标检测技术进行研究,解决了长相干积累时间导致动目标在方位向散焦严重的问题。采用分块自聚焦技术对多通道SAR地面移动目标指示(GMTI)系统自适应杂波抑制后的SAR图像进行处理,改善杂波抑制后的SAR图像中动目标的聚焦情况,增强动目标与周围剩余杂波的对比度,进而提高恒虚警率(CFAR)检测的性能。与传统杂波抑制后直接进行CFAR检测方法相比较,该方法降低了检测虚警概率。实测数据处理结果显示动目标的信杂比明显提高,动目标方位向聚焦成功,证明了该方法的有效性。     

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     

Polarization diversity detection in compound-Gaussian clutter

We present the problem of polarization diversity detection in compound-Gaussian clutter with unknown covariance matrix. To this end we assume that a set of secondary data, free of signal components and with the same covariance structure of the cell under test, is available. Due to the lack of a uniformly most powerful (UMP) detector we resort to a design procedure based upon the Rao and the Wald tests. Specifically we first derive the Rao and the Wald tests assuming that the covariance matrix is known, and then we substitute into the derived decision rules a suitable estimate of the clutter covariance. Interestingly, the newly proposed detectors share the constant false alarm rate (CFAR) property with respect to the texture statistical characterization. Moreover simulation results have shown that the Wald test based detector ensures a performance level higher than the Rao test. We have also conducted a further performance analysis, in the presence of real clutter data and in comparison with the previously proposed generalized likelihood ratio test (GLRT) based receivers, which highlights that, in general, the Wald test receiver outperforms its counterparts. Finally, since the newly proposed decision rules as well as the previously designed GLRTs do not ensure the CFAR property with respect to the clutter covariance matrix, we have developed a sensitivity analysis on the probability of false alarm (P/sub fa/), based on simulated clutter with covariance matrix estimated from real radar data. The results have shown that (P/sub fa/) is only slightly affected by variations in the clutter correlation properties and hence the CFARness is substantially achieved.     

OS-CFAR thresholding in decentralized radar systems

In a decentralized detection scheme, several sensors perform a binary (hard) decision and send the resulting data to a fusion center for the final decision. If each local decision has a constant false alarm rate (CFAR), the final decision is ensured to be CFAR. We consider the case that each local decision is a threshold decision, and the threshold is proportional, through a suitable multiplier, to a linear combination of order statistics (OS) from a reference set (a generalization of the concept of OS thresholding). We address the following problem: given the fusion rule and the relevant system parameters, select each threshold multiplier and the coefficients of each linear combination so as to maximize the overall probability of detection for constrained probability of false alarm. By a Lagrangian maximization approach, we obtain a general solution to this problem and closed-form solutions for the AND and OR fusion logics. A performance assessment is carried on, showing a global superiority of the OR fusion rule in terms of detection probability (for operating conditions matching the design assumptions) and of robustness (when these do not match). We also investigate the effect of the hard quantization performed at the local sensors, by comparing the said performance to those achievable by the same fusion rule in the limiting case of no quantization     

CFAR behavior of adaptive detectors: an experimental analysis

We conduct an experimental analysis for assessing the constant false alarm rate (CFAR) behavior of four coherent adaptive radar detectors in the presence of experimentally measured clutter data. To this end we exploit several data files containing both land, lake, and mixed land and sea clutter, collected by two radar systems (the MIT Lincoln Laboratory Phase-One radar and the McMaster IPIX radar) at different polarizations, range resolutions, and frequency bands. The results show that all the receivers, in the presence of real data, don't respect their nominal probability of false alarm (P/sub fa/), namely they exhibit a false alarm rate higher than the value preassigned at the design stage. Nevertheless one of them, the recursive persymmetric adaptive normalized matched filter (RP-ANMF) is very robust, in the sense that it presents an acceptable displacement from the nominal P/sub fa/, in correspondence of all the analyzed scenarios.     

Two CFAR algorithms for interfering targets and nonhomogeneousclutter

The greatest-of-order statistics estimator (GOOSE) constant false alarm rate (CFAR) and the censored greatest-of (CGO) CFAR are described. Both are designed to accommodate interfering targets in the reference window as well as control false alarms in the presence of clutter boundaries. Both succeed in accomplishing these tasks although the CGO-CFAR is preferred as it has a designed graceful degradation as the number of interfering targets exceeds the number of samples censored. The advantage of the GOOSE-CFAR is a theoretical one in that one can derive analytical results for clutter boundary analysis and thus not have to resort to simulations     

Optimal polarimetric detection of radar target in a slowlyfluctuating environment of clutter

It is shown that in a situation where a radar target is distant enough from the radar and is included in a natural or artificial clutter environment in such a manner that the conventional detection methods fail, it is possible to improve the radar detection performance by using appropriate signal processing on two orthogonal polarization states. A CFAR (constant false alarm rate) polarimetric detection system based on the study of the polarization difference between clutter and target is proposed. Since the polarization state of the clutter echoes fluctuates slowly from cell to cell, an autoregressive model can be applied to the components of the polarization vector to predict the detection thresholds needed to follow the polarization state variation. The detection thresholds are determined to maintain a false alarm probability equal to 10^-6. The presence of a target registers as a significant variation of the estimation error of the polarization vector. Results obtained from measurements of simple and canonical targets with artificial clutter are presented, and these results validate the principle of polarimetric detection     

Ll-CFAR: a flexible and robust alternative

A new family of constant false alarm rate (CFAR) processors is introduced. An Ll-CFAR forms its noise power estimate by linearly filtering ranked samples from the reference set; the weights of this combination, however, depend not only on the rank, but also on the relative proximity of the sample to the cell under test. From the class of Ll-CFARs may be chosen members which effectively censor spurious targets; members which exhibit impressive control of false alarm in the presence of a clutter edge; and members which are robust against both such inhomogeneities. While the design of such schemes is involved, their implementation is not significantly more burdensome than that of plain ordered statistic CFAR (OS-CFAR). After a discussion of the stochastic training of Ll-CFAR, the performance is thoroughly assessed under the most commonly encountered instances of environmental conditions, and compared with those of classical CFAR techniques     

The Detection Performance of the Siebert and Dicke-Fix CFAR Radar Detectors

The Siebert and the Dicke-fix CFAR radar detectors, used to maintain a constant false alarm rate (CFAR) in radar receivers under very similar circumstances, are considered. The Siebert detector represents the maximum-likelihood detection procedure for a signal in Gaussian noise of unknown power level, whereas the Dicke-fix makes use of a bandpass limiter to normalize the input and thus ensure a constant false alarm rate. The detection performance of the two detectors is determined and a comparison shows that over a wide range of parameters, the Dicke-fix introduces a loss which is approximately 1 B larger than for the Siebert detector.     

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.