CFAR data fusion center with inhomogeneous receivers

Detection systems with distributed sensors and data fusion are increasingly used by surveillance systems. A system formed by N inhomogeneous constant false alarm rate (CFAR) detectors (cell-averaging (CA) and ordered statistic (OS) CFAR detectors) is studied. A recursive formulation of an algorithm that permits a fixed level of false alarms in the data fusion center is presented, to set the optimum individual threshold levels in the CFAR receivers and the optimum `K out of N' decision rule in order to maximize the total probability of detection. The algorithm also considers receivers of different quality or with different communication channel qualities connecting them with the fusion center. This procedure has been applied to several hypothetical networks with distributed CA-CFAR and OS-CFAR receivers and for Rayleigh targets and interference, and it was seen that in general the fusion decision OR rule is not always the best     

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     

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     

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     

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     

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     

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     

基于子空间投影的未知背景航拍高光谱图像恒虚警目标检测

针对航拍高光谱图像中未知背景地物特征条件下小目标的检测问题,给出一种检测算法。利用目标的低概率特性,通过模糊聚类获取高光谱图像中背景的光谱特性;然后将高光谱数据向背景光谱信号的正交子空间及目标信号子空间投影以抑制背景和噪声信号;最后在特征层利用广义似然比检验构造出具有恒虚警特性的检测器,完成融合检测过程。理论分析和实验结果表明了算法的有效性。     

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检测系统优化与性能分析

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

Optimal distributed decision fusion

The problem of decision fusion in distributed sensor systems is considered. Distributed sensors pass their decisions about the same hypothesis to a fusion center that combines them into a final decision. Assuming that the sensor decisions are independent of each other for each hypothesis, the authors provide a general proof that the optimal decision scheme that maximizes the probability of detection at the fusion for fixed false alarm probability consists of a Neyman-Pearson test (or a randomized N-P test) at the fusion and likelihood-ratio tests at the sensors     

Parallel Distributed CFAR Detection Optimization Based on Genetic Algorithm with Interval Encoding

Aiming at parallel distributed constant false alarm rate (CFAR) detection employing K/N fusion rule, an optimization algorithm based on the genetic algorithm with interval encoding is proposed. N-1 local probabilities of false alarm are selected as optimization variables. And the encoding intervals for local false alarm probabilities are sequentially designed by the person-by-person optimization technique according to the constraints. By turning constrained optimization to unconstrained optimization, the problem of increasing iteration times due to the punishment technique frequently adopted in the genetic algorithm is thus overcome. Then this optimization scheme is applied to spacebased synthetic aperture radar (SAR) multi-angle collaborative detection, in which the nominal factor for each local detector is determined. The scheme is verified with simulations of cases including two, three and four independent SAR systems. Besides, detection performances with varying K and N are compared and analyzed.     

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.     

Optimum local decision space partitioning for distributed detection

A distributed detection system is considered that consists of a number of independent local detectors and a fusion center. The decision statistics and performance characteristics (i.e. the false alarm probabilities and detection probabilities) of the local detectors are assumed as given. Communication is assumed only between each local detector and the fusion center and is one-way from the former to the latter. The fusion center receives decisions from the local detectors and combines them for a global decision. Instead of a one-bit hard decision, the authors propose that each local detector provides the fusion center with multiple-bit decision value which represents its decision and, conceptually, its degree of confidence on that decision. Generating a multiple-bit local decision entails a subpartitioning of the local decision space the optimization of which is studied. It is shown that the proposed system significantly outperforms one in which each local detector provides only a hard decision. Based on optimum subpartitioning of local decision space, the detection performance is shown to increase monotonically with the number of partitions     

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.     

CFAR detection of distributed targets in non-Gaussian disturbance

The subject of detection of spatially distributed targets in non-Gaussian noise with unknown statistics is addressed. At the design stage, in order to cope with the a priori uncertainty, we model noise returns as Gaussian vectors with the same structure of the covariance matrix, but possibly different power levels (heterogeneous environment). We also assume that a set of secondary data, free of signal components, is available to estimate the correlation properties of the disturbance The proposed detector assumes no a priori knowledge about the spatial distribution of the target scatterers and ensures the constant false alarm rate (CFAR) property with respect to both the structure of the covariance matrix and the power levels. Finally, the performance assessment, conducted modeling the disturbance as a spherically invariant random process (SIRP), confirms its validity to operate in real radar scenarios     

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     

Nonstochastic adaptive decision fusion in distributed-detection systems

Implementing the optimal Neyman-Pearson (NP) fusion rule in distributed detection systems requires the sensor error probabilities to be a priori known and constant during the system operation. Such a requirement is practically impossible to fulfil for every resolution cell in a multiflying target multisensor environment. The true performance of the fusion center is often worse than expected due to fluctuations of the observed environment and instabilities of sensor thresholds. This work considers a nonparametric data fusion situation in which the fusion center knows only the number of the sensors, but ignores their error probabilities and cannot control their thresholds. A data adaptive approach to the problem is adopted, and combining P reports from Q independent distributed sensors through a least squares (LS) formulation to make a global decision is investigated. Such a fusion scheme does not entail strict stationarity of the noise environment nor strict invariance of the sensor error probabilities as is required in the NP formulation. The LS fusion scheme is analyzed in detail to simplify its form and determine its asymptotic behavior. Conditions of performance improvement as P increases and of quickness of such improvement are found. These conditions are usually valid in netted radar surveillance systems.     

Decentralized CFAR signal detection

The authors develop the theory of CA-CFAR (cell-averaging constant false-alarm rate) detection using multiple sensors and data fusion, where detection decisions are transmitted from each CA-CFAR detector to the data fusion center. The overall decision is obtained at the data fusion center based on some k out of n fusion rule. For a Swerling target model I embedded in white Gaussian noise of unknown level, the authors obtain the optimum threshold multipliers of the individual detectors. At the data fusion center, they derive an expression for the overall probability of detection while the overall probability of false alarm is maintained at the desired value for the given fusion rules. An example is presented showing numerical results     

A Detection Algorithm for Optical Targets in Clutter

There is active interest in the development of algorithms for detecting weak stationary optical and IR targets in a heavy opticalclutter background. Often only poor detectability of low signal-to-noise ratio (SNR) targets is achieved when the direct correlation method is used. In many cases, this is partly obviated by using detection with correlated reference scenes [1, 2].This paper uses the experimentally justified assumption that most optical clutter can be modeled as a whitened Gaussian randomprocess with a rapidly space-varying mean and a more slowlyvarying covariance [2]. With this assumption, a new constant falsealarm rate (CFAR) detector is developed as an application of the classical generalized maximum likelihood ratio test of Neyman and Pearson. The final CFAR test is a dimensionless ratio. This test exhibits the desirable property that its probability of a false alarm(PFA) is independent of the covariance matrix of the actual noiseencountered. When the underlying noise processes are complex intime, similar considerations can yield a sidelobe canceler CFARdetection criterion for radar and communications. Performance analyses based on the probability of detection (PD)versus signal-to-noise ratio for several given fixed false alarm probabilities are presented. Finally these performance curves are validated by computer simulations of the detection process which use real image data with artificially implanted signals.