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 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     

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.     

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     

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     

一种分布式异步航迹融合算法

在多被动传感器目标跟踪中,融合中心处理的信息一般是同步的,然而实际情况并非如此。另外,一些被动传感器只能得到目标的方位信息,无法单独形成有效航迹,这就需要将各传感器数据同步到相同时刻,然后应用同步融合算法。针对被动传感器探测系统,采用传感器到传感器融合和系统到传感器融合的分布式融合结构,并对各局部传感器引入全局反馈,对相关信息采用协方差交叉算法进行处理,完成被动传感器异步数据的融合,仿真结果表明,该算法具有较好的融合效果。     

Passive tracking scheme for a single stationary observer

While there are many techniques for bearings-only tracking (BOT) in the ocean environment, they do not apply directly to the land situation. Generally, for tactical reasons, the land observer platform is stationary; but, it has two sensors, visible and infrared, for measuring bearings and a laser range finder (LRF) for measuring range. There is a requirement to develop a new BOT data fusion scheme that fuses the two sets of bearing readings, and together with a single LRF measurement, produces a unique track. This paper first develops a parameterized solution for the target speeds, and then heading, prior to the occurrence of the LRF measurement, when the track is unobservable. At, and after the LRF measurement, a BOT, formulated as a least squares (LS) estimator, then produces a unique LS estimate of the target states. Bearing readings from the other sensor serve as instrumental variables in a data fusion setting to eliminate the bias in the BOT estimator. The result is an unbiased and decentralized data fusion scheme. Results from two simulation experiments have corroborated the theoretical development and show also that the scheme is optimal.     

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     

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.     

Performance evaluation of multi-sensor classification systems

A common problem in classification is to use one/more sensors to observe repeated measurements of a target's features/attributes, and in turn update the targets' posterior classification probabilities to aid in target identification. This paper addresses the following questions: 1. How do we quantify the classification performance of a sensor? 2. What happens to the posterior probabilities as the number of measurements increase? 3. Will the targets be classified correctly? While the Kalman filter allows for off-line estimation of kinematic performance (covariance matrix), a comparable approach for studying classification accuracy has not been done previously. We develop a new analytical approach for computing the long-run classification performance of a sensor and also present recursive formulas for efficient calculation of the same. We show that, under a minimal condition, a sensor will eventually classify all targets perfectly. We also develop a methodology for evaluating the classification performance of multi-sensor fusion systems involving sensors of varying quality. The contributions of this paper are 1. A simple metric to quantify a sensor's ability to discriminate between the targets being identified, and its use in comparing multiple sensors, 2. An approximate formula based on this metric to compute off-line estimates of the rate of convergence toward perfect classification, and the number of measurements required to achieve a desired level of classification accuracy, and 3. The use of this metric to evaluate classification performance of multi-sensor fusion systems.     

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.     

Fault Detection in Dynamic Systems via Decision Fusion

Due to the growing demands for system reliability and availability of large amounts of data, efficient fault detection techniques for dynamic systems are desired. In this paper, we consider fault detection in dynamic systems monitored by multiple sensors. Normal and faulty behaviors can be modeled as two hypotheses. Due to communication constraints, it is assumed that sensors can only send binary data to the fusion center. Under the assumption of independent and identically distributed (1ID) observations, we propose a distributed fault detection algorithm, including local detector design and decision fusion rule design, based on state estimation via particle filtering. Illustrative examples are presented to demonstrate the effectiveness of our approach.     

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     

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     

基于序贯关联算法的多目标无源跟踪

基于序贯关联算法,对多目标无源跟踪问题进行了研究。在只有角度信息可以利用的情况下,首先,利用波门技术对各个无源传感器角度测量数据进行关联和滤波,形成参数航迹;然后,将各个无源传感器的参数航迹送到融合中心进行关联配对,并在关联过程中通过构造关联质量函数对参数航迹的关联历史情况进行度量,解决参数航迹关联模糊问题;最后,通过对关联成功的参数航迹进行交叉定位,给出多个不同目标的位置信息,实现分布式无源系统对多目标的数据关联和跟踪,并通过仿真分析,对算法的有效性和可行性进行验证。     

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.     

高分影像辅助下的航空高光谱严密几何检校方法

 惯性测量单元(IMU)与传感器视准轴的偏心角和偏心矢量是造成航空线阵列高光谱数据几何校正误差的主要原因之一。在分析偏心角与偏心矢量误差来源之后提出该误差由IMU主轴与传感器主轴的角度偏差、测区固定偏差、GPS中心与传感器投影中心相对偏差组成,在此基础上建立了较为严密的检校模型。针对模型解算时需要大量高精度控制点的问题,提出了一种高分影像辅助下的亚像元精度控制点自动提取方法。通过多地区、多传感器高光谱航测实验表明,亚像元精度控制点能有效提高模型解算精度。新检校模型可获得亚像元校正精度,推扫式传感器——应用型机载成像光谱仪(AISA)建模中误差约为0.39个像元,摆扫式传感器——实用型模块化成像光谱仪(OMIS)建模中误差约为0.23个像元,校正后的影像可直接进行拼接。     

Fusion of distributed extended forgetting factor RLS state estimators

For single-target multisensor systems, two fusion methods are presented for distributed recursive state estimation of dynamic systems without knowledge of noise covariances. The estimator at every local sensor embeds the dynamics and the forgetting factor into the recursive least squares (RLS) method to remedy the lack of knowledge of noise statistics, developed before as the extended forgetting factor recursive least squares (EFRLS) estimator. It is proved that the two fusion methods are equivalent to the centralized EFRLS that uses all measurements from local sensors directly and their good performance is shown by simulation examples.     

A quantization architecture for track fusion

Many practical multi-sensor tracking systems are based on some form of track fusion, in which local track estimates and their associated covariances are shared among sensors. Communication load is a significant concern, and the goal of this paper is to propose an architecture for low-bandwidth track fusion. The scheme involves intelligent scalar and vector quantization of the local state estimates and of the associated estimation error covariance matrices. Simulation studies indicate that the communication saving can be quite significant, with only minor degradation of track accuracy.     

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

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