DocumentCode
1912905
Title
Simple counting rule for optimal data fusion
Author
Mansouri, Naghmeh ; Fathi, Madjid
Author_Institution
Dept. of Electr. Eng., Ferdwosi Univ., Mashhhad, Iran
Volume
2
fYear
2003
fDate
23-25 June 2003
Firstpage
1186
Abstract
In the problem of optimal decision fusion, the data fusion center receives the information sent independently by each detector. Z. Chair and P.K. Varshney et al., (1986) showed that, the optimal decision rule is a weighted sum of local decisions, and the weight is a function of the probability of detection (PD) and the probability of false alarm (PF).PD and PF for each detector must be known, but this information is not always available practically and these probabilities may not be constant with the time. In this paper, we have presented an adaptive fusion model which estimate the PD and PF adaptively by a simple counting. Reference signals are not given, so the fused decision of all detectors is considered as the reference signal, the decision of a local detector is arbitrated by this fusion result.
Keywords
distributed sensors; learning (artificial intelligence); probability; sensor fusion; adaptive fusion model; data fusion center; detection probability; distributed detection systems; false alarm probability; optimal decision fusion; reinforcement learning; sensor fusion; simple counting rule; Communication channels; Decision making; Detectors; Fuses; Learning; Mechanical engineering; Probability; Sensor fusion; Sensor phenomena and characterization; Sensor systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Applications, 2003. CCA 2003. Proceedings of 2003 IEEE Conference on
Print_ISBN
0-7803-7729-X
Type
conf
DOI
10.1109/CCA.2003.1223179
Filename
1223179
Link To Document