Optimum multisensor fusion of correlated local decisions

A distributed detection system consisting of a number of local detectors and a fusion center is considered. Each detector makes a decision for the underlying binary hypothesis testing problem based on its own observation and transmits its decision to the fusion center where the global decision is derived. The local decision rules are assumed to be given, but the local decisions are correlated. The correlation is generally characterized by a finite number of conditional probabilities. The optimum decision fusion rule in the Neyman-Pearson sense is derived and analyzed. The performance of the distributed detection system versus the degree of correlation between the local decisions is analyzed for a correlation structure that can be indexed by a single parameter. System performance as well as the performance advantage of using a larger number of local detectors degrade as the degree of correlation between local decisions increases     

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     

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     

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     

Optimal Detection and Performance of Distributed Sensor Systems

Global optimization of a distributed sensor detection system withfusion is considered, where the fusion rule and local detectors aresolved to obtain overall optimal performance. This yields coupledequations for the local detectors and the fusion center.The detection performance of the distributed system with fusionis developed. The globally optimal system performance is comparedwith two suboptimal systems. Receiver operating characteristics(ROCs) are computed numerically for the problem of detecting aknown signal embedded in non-Gaussian noise.     

Mutual and conditional mutual informations for optimizingdistributed Bayes detectors

This paper considers optimization of distributed detectors under the Bayes criterion. A distributed detector consists of multiple local detectors and a fusion center that combines the local decision results to obtain a final decision. Introduced first are distributional distance measures, the mutual information (MI) and the conditional mutual information (CMI), that are obtained by applying information theoretic concepts to detection problems. Error bound analyses show that these distance measures approximate the Bayesian probability of error better than the conventional ones regardless of the operational environments. Then, a new optimization technique is proposed for distributed Bayes detectors. The method uses the distributional distances instead of the original Bayes criterion to avoid the complexity barrier of the optimization problem. Numerical examples show that the proposed distance measures yield solutions far better than the existing ones     

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.     

Distributed binary integration

A distributed radar detection system that employs binary integration at each local detector is studied. Local decisions are transmitted to the fusion center where they are combined to yield a global decision. The optimum values of the two thresholds at each local processor are determined so as to maximize the detection probability under a given probability of false alarm constraint. Using an important channel model, performance comparisons are made to determine the integration loss     

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     

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     

Optimal m-ary data fusion with distributed sensors

An optimal data fusion rule is derived for an m-ary detection problem. Each detector determines a local decision using a local decision rule and transmits the local decision to the fusion center. Considering the reliability of local detectors, local decisions are combined to produce the final decision. In this study, based upon the maximum posterior probability concept, optimal decision rules for m-ary detection problems are proposed for the local detector and the data fusion center     

Superimposed HMM transient detection via target tracking ideas

The quickest detection of superimposed hidden Markov model (HMM) transient signals is addressed. It is assumed that a known HMM is always extant but at an unknown time a second known HMM may also be present, and overlapped with the previous. Two approaches are proposed. The first treats the superimposed HMMs as a unit with an expanded state space, thus converting the problem of detecting superimposed HMMs into detection of a change in HMM, this being readily solved using a previously proposed procedure. Such an approach, though excellent in terms of performance, is not suitable for the superposition of multiple HMMs with large state dimensions due to computational complexity. A second detection scheme (based on multiple target tracking ideas) with much lower computational needs but little loss in terms of performance, is therefore developed     

Optimal Data Fusion in Multiple Sensor Detection Systems

There is an increasing interest in employing multiple sensors for surveillance and communications. Some of the motivating factors are reliability, survivability, increase in the number of targets under consideration, and increase in required coverage. Tenney and Sandell have recently treated the Bayesian detection problem with distributed sensors. They did not consider the design of data fusion algorithms. We present an optimum data fusion structure given the detectors. Individual decisions are weighted according to the reliability of the detector and then a threshold comparison is performed to obtain the global decision.     

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.     

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     

Multistatic-Radar Binomial Detection

The performance of multistatic-radar binomial detectors is investigated. Although conceptually similar to the well-knwn "M-out-of-N" detector frequently considered for monostatic systems, the multistatic detector must cope with false alarms generated by target et ghosting as well as by noise threshold crossings. A procedure for deriving the detection statistics of multistatic binomial detectors ors is presented. The procedure is applied to derive the detection probabilities for a spectrum of false alarm probabilities, target densities, and numbers of radar receivers.     

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.     

Bayesian Quickest Signal Detection in a Discrete-Time Observation

This paper deals with the problem of quickest detection of a signal in discrete-time observations where the noise is not necessarily additive. By introducing a new cost function, penalizing the decision delay, in addition to penalizing wrong decisions as in the classical case, a global risk function is derived for use in a Bayesian framework. The minimization of the average risk leads to the optimum Bayesian decision regions, giving the structure of the optimum receiver. Some simplifications for elementary costs and some applications are investigated. The optimum receiver is shown to be a parallel bank of classical optimum filters, each one matched to a particular delay of the signal to be detected. Our approach is shown to apply to the detection of certain changes in a stochastic process.     

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.