CFAR integration processors in randomly arriving impulseinterference

Time diversity transmission is often used to circumvent the high probability of a deep fade on a single transmission which may result in loss of the signal. One way to combat deep fades is to postdetection integrate the received observations from each range resolution cell. The false alarm rate of the postdetection integrator (PI) is extremely sensitive to randomly arriving impulse interference. Such interfering pulses may be unintentionally generated by nearby radars or intentionally generated by pulse jammers seeking to destroy the visibility of the radar. The binary integrator (PI) which uses an M-out-of-L decision rule is insensitive to at most M-1 interfering pulses. We consider the adaptive implementation of the PI and BI detectors for constant false alarm rate (CFAR) operation. We show that the CFAR BI detector when the “AND” (L-out-of-L) decision rule is used exhibits more robust false alarm control properties in the presence of impulse interference at the expense of severe detection loss when no interference is present. The CFAR adaptive PI (API) detector is proposed to alleviate this problem. The CFAR API detector implements an adaptive censoring algorithm which determines and censors with high probability the interference samples thereby achieving robust false alarm control in the presence of interference and optimum detection performance in the absence of interference     

Adaptive array CFAR detection

Presented here is a large class of adaptive array detection algorithms with constant false alarm rate (CFAR), so that the false alarm rate can be set to any preassigned number without knowledge of the noise covariance matrix. This class map incorporate any usual method of cell averaging and any method for array weight vector synthesis. A sufficient condition for CFAR is derived, which is easy to satisfy in practice. Basic system parameters are discussed. An example of detection performance for a simple cell-averaging detector, in which the array weight vector is synthesized by the method of diagonal loading, is provided using Monte Carlo simulations     

Robust adaptive radar detection in the presence of steering vector mismatches

In this paper, we consider the problem of robust radar detection in the presence of Gaussian disturbance with unknown covariance matrix. We design and assess three new robust adaptive detectors, capable of operating in the presence of unknown discrepancies between the nominal and the actual steering vector. Remarkably the new decision rules exhibit a bounded constant false alarm rate (CFAR) behavior and allow, through the regulation of a design parameter, to trade off target sensitivity with sidelobes energy rejection. Finally, computer simulations show that the proposed detectors achieve a visible performance improvement, in many situations of practical interest, over the traditional adaptive detection algorithms, especially in the presence of severe steering vector mismatches.     

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.     

基于双边截断的双参数海上风电站 SAR图像 CFAR检测

文章提出了 1种基于双边截断的双参数海上风电站 SAR图像 CFAR检测器 DTCS-TPCFAR,目的是提高在具有多个目标海上区域和石油泄漏区域等环境下对海上风电站的检测性能。DTCS-TPCFAR所提出的双边截断杂波的方法,能够同时消除高强度和低强度异常值的干扰,同时保留真实的杂波样本。通过使用最大似然估计计算双边截断后样本的均值和标准差,然后通过这 2个参数估计值计算出截断阈值,最后再结合指定的虚警率(Probability of False Alarm,PFA)来对测试单元(Test Cell,TC)进行判断,完成最终的目标检测。这也是首次将 CFAR检测器用于检测海上风电站。文章通过 Sentinel-1数据集来验证该方法的有效性。实验结果表明,文章所提出的算法在相同指定虚警率下,具有更高的检测率(Detection Rate,DR)和更低的误报率(False Alarm Rate,FAR)。     

Data quantization effects in CFAR signal detection

In this paper, we investigate data quantization effects in constant false alarm rate (CFAR) signal detection. Exponential distribution for the input data and uniform quantization are assumed for the CFAR detector analysis. Such assumptions are valid in the case of radar for a Swerling I target in Gaussian clutter plus noise and a receiver with analog square-law detection followed by analog-to-digital (A/D) conversion. False alarm and detection probabilities of the cell averaging (CA) and order statistic (OS) CFAR detectors operating on quantized observations are analytically determined. In homogeneous backgrounds with 15 dB clutter power fluctuations, we show analytically that a 12-bit uniform quantizer is sufficient to achieve false alarm rate invariance. Detector performance characteristics in nonhomogeneous backgrounds, due to regions of clutter power transitions and multiple interfering targets, are also presented and detailed comparisons are given     

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     

Performance analysis of linearly combined order statistic CFARdetectors

Linearly combined order statistic (LCOS) constant false-alarm rate (CFAR) detectors are examined for efficient and robust threshold estimation applied to exponentially distributed background observations for improved detection. Two optimization philosophies have been employed to determine the weighting coefficients of the order statistics. The first method optimizes the coefficients to obtain efficient estimates of clutter referred to the censored maximum likelihood (CML) and best linear unbiased (BLU) CFAR detectors. The second optimization involves maximizing the probability of detection under Swerling II targets and is referred to as the most powerful linear (MPL) CFAR detector. The BLU-CFAR detector assumes no knowledge of the target distribution in contrast to the MPL-CFAR detector which requires partial knowledge of the target distribution. The design of these CFAR detectors and the probability of detection performance are mathematically analyzed for background observations having homogeneous and heterogeneous distributions wherein the trade-offs between robustness and detection performance are illustrated     

Detection of random signals via spectrum matching

Using a priori knowledge of the signal power spectral density (PSD), a spectrum matching approach which effectively utilizes the available signal spectral shape is developed for random signal detection. Two spectrum matching detector (SMD) structures, which are implemented by correlogram and periodogram, respectively, are examined. Theoretical calculation of their false alarm rates is derived and confirmed by simulations. It is also demonstrated that the proposed detectors outperform the standard periodogram, Bartlett method, and energy detector under constant false alarm rate (CFAR) condition for two different random signals.     

Optimum array detector for a weak signal in unknown noise

We study the design of constant false-alarm rate (CFAR) tests for detecting a rank-one signal in the presence of background Gaussian noise with unknown spatial covariance. We look at invariant tests, i.e., those tests whose performance is independent of the nuisance parameters, like the background noise covariance. Such tests are shown to have the desirable CFAR property. We characterize the class of all such tests by showing that any invariant decision statistic can be written as a function of two basic statistics which are in fact the adaptive matched filter (AMF) statistic and Kelly's generalized likelihood ratio statistic. Further, we establish an optimum test in the limit of low signal-to-noise ratio (SNR), the locally most powerful invariant (LMPI) test. We also derive the bound for the probability of detection of any invariant detector, at a fixed false-alarm rate, and compare the LMPI and the published detectors (Kelly and AMF) to it     

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     

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     

Adaptive cell-averaging CFAR detection in distributed sensornetworks

The problem of adaptive cell-averaging constant false-alarm rate (CFAR) detection is considered for two distributed sensor network topologies, namely the parallel and the tandem topologies. The compressed data transmitted amongst the detectors is assumed to be in the form of decisions. The overall systems are optimized to yield the maximum probability of detection for a fixed probability of false alarm. The performance of the systems is also analyzed     

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     

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.     

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     

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.     

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.     

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.     

Partially Adaptive STAP using the FRACTA Algorithm

A partially adaptive space-time adaptive processor (STAP) utilizing the recently developed FRACTA algorithm is presented which significantly reduces the high computational complexity and large sample support requirements of fully adaptive STAP. Multi-window post-Doppler dimensionality reduction techniques are employed to transform the data prior to application of the FRACTA algorithm. The FRACTA algorithm is a reiterative censoring (RC) and detection algorithm which has been shown to provide excellent detection performance in nonhomogeneous interference environments. Two multi-window post-Doppler dimensionality reduction techniques are considered: PRI-staggered and adjacent-bin. The partially adaptive FRACTA algorithm is applied to the KASSPER I (Knowledge-Aided Sensor Signal Processing & Expert Reasoning) challenge datacube. The pulse repetition interval (PRI)-staggered approach with D=6 filters per Doppler bin is found to provide the best detection performance, outperforming the fully adaptive case while simultaneously reducing the runtime by a factor of ten. Using this implementation, partially adaptive FRACTA detects 197 out of 268 targets with one false alarm. The clairvoyant processor (the covariance matrix for each range cell is known) detects 198 targets with one false alarm. In addition, the partially adaptive FRACTA algorithm is shown to be resilient to jamming, and performs well for reduced sample support situations. When compared with partially adaptive STAP using traditional sliding window processing (SWP), the runtime of partially adaptive FRACTA is 14 times faster, and the detection performance is significantly increased (SWP detects 46 out of 268 targets with one false alarm).