Optimal Decision Fusion in Multiple Sensor Systems

The problem of optimal data fusion in the sense of the Neyman-pearson (N-P) test in a centralized fusion center is considered. The fusion center receives data from various distributed sensors. Each sensor implements a N-P test individually and independently of the other sensors. Due to limitations in channel capacity, the sensors transmit their decision instead of raw data. In addition to their decisions, the sensors may transmit one or more bits of quality information. The optimal, in the N-P sense, decision scheme at the fusion center is derived and it is seen that an improvement in the performance of the system beyond that of the most reliable sensor is feasible, even without quality information, for a system of three or more sensors. If quality information bits are also available at the fusion center, the performance of the distributed decision scheme is comparable to that of the centralized N-P test. Several examples are provided and an algorithm for adjusting the threshold level at the fusion center is provided.     

Optimal serial distributed decision fusion

The problem of distributed detection involving N sensors is considered. The configuration of sensors is serial in the sense that the Jth sensor decides using the decision it receives along with its own observation. When each sensor uses the Neyman-Pearson test, the probability of detection is maximized for a given probability of false alarm, at the Nth stage. With two sensors, the serial scheme has a performance better than or equal to the parallel fusion scheme analyzed in the literature. Numerical examples illustrate the global optimization by the selection of operating thresholds at the sensors     

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     

Explicit solutions for some simple decentralized detection problems

A decentralized detection problem is considered in which a number of identical sensors transmit a finite-valued function of their observations to a fusion center which makes a final decision on one of M alternative hypotheses. The authors consider the case in which the number of sensors is large, and they derive (asymptotically) optimal rules for determining the messages of the sensors when the observations are generated from a simple and symmetrical set of discrete distributions. They also consider the tradeoff between the number of sensors and the communication rate of each sensor when there is a constraint on the total communication rate from the sensors to the fusion center. The results suggest that it is preferable to have several independent sensors transmitting low-rate (coarse) information instead of a few sensors transmitting high-rate (very detailed) information. They also suggest that an M-ary hypothesis testing problem can be viewed as a collection of M(M-1)/2 binary hypothesis testing problems. From this point of view the most useful messages (decision rules) are those that provide information to the fusion center that is relevant to the largest possible numbers of these binary hypothesis testing problems     

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     

Decision fusion rules in multi-hop wireless sensor networks

The decision fusion problem for a wireless sensor network (WSN) operating in a fading environment is considered. In particular, we develop channel-aware decision fusion rules for resource-constrained WSNs where binary decisions from local sensors may need to be relayed through multi-hop transmission in order to reach a fusion center. Each relay node employs a binary relay scheme whereby the relay output is inferred from the channel impaired observation received from its source node. This estimated binary decision is subsequently transmitted to the next node until it reaches the fusion center. Under a flat fading channel model, we derive the optimum fusion rules at the fusion center for two cases. In the first case, we assume that the fusion center has knowledge of the fading channel gains at all hops. In the second case, we assume a Rayleigh fading model, and derive fusion rules utilizing only the fading channel statistics. We show that likelihood ratio (LR) based optimum decision fusion statistics for both cases reduce to respective simple linear test statistics in the low channel signal-to-noise ratio (SNR) regime. These suboptimum detectors are easy to implement and require little a priori information. Performance evaluation, including a study of the robustness of the fusion statistics with respect to unknown system parameters, is conducted through simulations.     

一种基于相邻模块化加权D-S的融合诊断方法

常规D-S (Dempster-Shafter)决策融合方法由于其自身理论不足,不能很好直接处理决策结果偏差大、冲突大的传感器融合问题,因而对于信息高冲突情况下的转子微弱故障融合诊断存在着失效问题。针对该类问题与不足,借鉴复杂网络的舆论传播、社会学习理论及多智能体一致性决策的相关概念与思路,从避免决策结果冲突大的传感器直接进行融合的角度进行改进,提出相邻模块化加权D-S融合方法。该方法首先根据初步结果进行相邻节点与模块划分,只有决策距离在相邻界限值范围内的相邻模块节点才能进行决策融合;对于同一模块内相邻节点,根据各节点决策权重及初步决策结果采用加权D-S融合方法进行决策融合;针对融合结果再进行相邻节点模块划分与融合,依此步骤进行循环划分与融合,直到所有模块与节点均不相邻;最后采用专家权威决策方法确定权重和最大的模块融合结果作为最终的传感器网络一致性决策结果。通过多传感器网络的转子故障模拟实验对所提方法进行验证,应用结果表明:所提方法可以较好解决少数传感器诊断正确、而多数诊断错误的信息高冲突条件下的局部微弱故障融合诊断问题。     

A Boolean algebra approach to multiple sensor voting fusion

A technique for integrating multiple-sensor data using a voting fusion process that combines the individual sensor outputs is described. An important attribute of the method is the automatic confirmation of the target by the fusion processor without the need to explicitly determine which sensors and what level of sensor participation are involved. A three-sensor system, with multiple confidence levels in each sensor, is discussed to illustrate the approach. Boolean algebra is used to derive closed-form expressions for the multiple sensor-system detection probability and false-alarm probability. Procedures for relating confidence levels to detection and false alarm probabilities are described through an example. The hardware implementation for the sensor system fusion algorithm is discussed     

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     

基于改进D-S证据理论的航空发动机转子故障决策融合诊断研究

针对单一传感器的测量信息难以准确、全面地反映航空发动机转子、轴承和齿轮的工作状况,进而造成振动故障诊断难度大的问题,提出安装多个振动传感器组成传感器网络,建立基于多传感器信息的发动机转子故障决策融合诊断系统。由于多传感器系统不可避免地会存在各传感器信息不一致、信息冲突的情形,因此针对该融合诊断系统的信号测量、信息预处理、特征提取、故障诊断及决策融合5个环节,重点研究了决策融合环节的Dempster-Shafer（D-S）证据决策融合方法存在的冲突证据融合失效问题。通过分析原因,从避免“一票否决”现象和证据加权平均两个方面进行改进,提出了改进D-S证据融合方法,并应用于航空发动机转子的模拟故障决策融合诊断中。结果表明基于D-S证据理论对3个传感器的单一诊断结果进行决策融合,能得到比任一单个传感器更准确、可靠的结果;而改进D-S证据融合方法由于能在一定程度上克服冲突证据融合带来的失效问题,且能同时兼顾处理好非冲突证据的融合,故其对于证据冲突和非冲突情形都取得了较好的融合效果,因此总的分类正确率要高于常规D-S算法和PCR5算法。     

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.     

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     

A new distributed constant false alarm rate detector

A new constant false alarm rate (CFAR) test termed signal-plus-order statistic CFAR (S+OS) using distributed sensors is developed. The sensor modeling assumes that the returns of the test cells of different sensors are all independent and identically distributed In the S+OS scheme, each sensor transmits its test sample and a designated order statistic of its surrounding observations to the fusion center. At the fusion center, the sum of the samples of the test cells is compared with a constant multiplied by a function of the order statistics. For a two-sensor network, the functions considered are the minimum of the order statistics (mOS) and the maximum of the order statistics (MOS). For detecting a Rayleigh fluctuating target in Gaussian noise, closed-form expressions for the false alarm and detection probabilities are obtained. The numerical results indicate that the performance of the MOS detector is very close to that of a centralized OS-CFAR and it performs considerably better than the OS-CFAR detector with the AND or the OR fusion rule. Extension to an N-sensor network is also considered, and general equations for the false alarm probabilities under homogeneous and nonhomogeneous background noise are presented.     

On distributed detection with correlated sensors: two examples

The authors study the effect of correlated noise on the performance of a distributed detection system. They consider a suboptimal scheme by assuming that the local sensors have the same operating point, and that the distribution of the sensor observation is symmetric. This implies that the joint distribution of the sensor decisions, and therefore the fusion rule, are symmetric functions of the sensor decisions. The detection of a known signal in additive Gaussian noise and in Laplacian noise are considered. In both cases, system performance deteriorates when the correlation between the sensor noises is positive and increasing, whereas the performance improves considerably when the correlation is negative and increasing in magnitude     

Censoring sensors: a low-communication-rate scheme for distributeddetection

We consider a new scheme for distributed detection based on a “censoring” or “send/no-send” idea. The sensors are assumed to “censor” their observations so that each sensor sends to the fusion center only “informative” observations, and leaves those deemed “uninformative” untransmitted. The main result of this work is that with conditionally independent sensor data and under a communication rate constraint, in order to minimize the probability of error, transmission should occur if and only if the local likelihood ratio value observed by the sensor does not fall in a certain single interval. Similar results are derived from Neymarr-Pearson and distance-measure viewpoints. We also discuss simplifications for the most interesting case that the fusion center threshold is high and the communication constraint is severe. We compare censoring with the more common binary-transmission framework and observe its considerable decrease in communication needs. Finally, we explore the use of feedback to achieve optimal performance with very little communication     

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     

Hypotheses Testing in a Distributed Environment

The problem of optimum detection with n decentralized sensors selecting among m possible signals is considered from the decision theory point of view. The loss function is defined in terms of the decisions made by each observer and the transmitted signal. Then the average of this loss function is minimized. This leads to sets of coupled inequalities in terms of the likelihood ratio of each observer and the decisions made at the other sensors. This determines the structure of the optimum decentralized detection for an arbitrary number of sensors and an arbitrary number of possible signals. These results are valuable in numerous situations that may arise in large-scale and distributed systems.     

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.     

Architectures and algorithms for track association and fusion

Target tracking using multiple sensors can provide better performance than using a single sensor. One approach to multiple target tracking with multiple sensors is to first perform single sensor tracking and then fuse the tracks from the different sensors. Two processing architectures for track fusion are presented: sensor to sensor track fusion, and sensor to system track fusion. Technical issues related to the statistical correlation between track estimation errors are discussed. Approaches for associating the tracks and combining the track state estimates of associated tracks that account for this correlation are described and compared by both theoretical analysis and Monte Carlo simulations     

多传感器融合目标跟踪

分析了基于成象和雷达两种传感器对目标状态的测量模型及其融合模型。针对两种传感器之间测量信息的不同步问题,给出了一种基于最小二乘法的不同步信息之间的时间配准和融合方法,并设计了跟踪滤波器。