摘要
When all the rules of sensor decision are known, the optimal distributeddecision fusion, which relies only on the joint conditional probability densities, can be derivedfor very general decision systems. They include those systems with interdependent sensorobservations and any network structure. It is also valid for m-ary Bayesian decision problems andbinary problems under the Neyman-Pearson criterion. Local decision rules of a sensor withcommunication from other sensors that are optimal for the sensor itself are also presented, whichtake the form of a generalized likelihood ratio test. Numerical examples are given to reveal someinteresting phenomena that communication between sensors can improve performance of a senordecision, but cannot guarantee to improve the global fusion performance when sensor rules were givenbefore fusing.
When all the rules of sensor decision are known, the optimal distributeddecision fusion, which relies only on the joint conditional probability densities, can be derivedfor very general decision systems. They include those systems with interdependent sensorobservations and any network structure. It is also valid for m-ary Bayesian decision problems andbinary problems under the Neyman-Pearson criterion. Local decision rules of a sensor withcommunication from other sensors that are optimal for the sensor itself are also presented, whichtake the form of a generalized likelihood ratio test. Numerical examples are given to reveal someinteresting phenomena that communication between sensors can improve performance of a senordecision, but cannot guarantee to improve the global fusion performance when sensor rules were givenbefore fusing.
基金
ThisworkwassupportedinpartbyNSFofChina(No.60374025and60328306)andSRFDP(No.20030610018)
inpartbyARO(No.W911NF_04_1_0274),NASA/LEQSF(No.2001-4-01),andtheNSFofChina(No.60328306).
