Volume 19, Number 1 (7-2000)                   JCME 2000, 19(1): 1-14 | Back to browse issues page


XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

G. Mirjalily, M. R. Aref, M. M. Nayebi and M. Kahrizi. Adaptive Decision Fusion in Detection Networks. JCME. 2000; 19 (1) :1-14
URL: http://jcme.iut.ac.ir/article-1-177-en.html

Abstract:   (1287 Views)
In a detection network, the final decision is made by fusing the decisions from local detectors. The objective of that decision is to minimize the final error probability. To implement and optimal fusion rule, the performance of each detector, i.e. its probability of false alarm and its probability of missed detection as well as the a priori probabilities of the hypotheses, must be known. However, these statistics are usually unknown or may vary with time. In this paper, we develop a recursive algorithm that adapts the fusion center. This approach is based on the time-averaging of local decisions and on using the analytic solutions that guarantee the asymptotic convergence. Also a simple method is proposed that enables the algorithm to track changes faster. Simulation results are presented to demonstrate the efficiency and convergence properties of the algorithm.
Keywords: -
Full-Text [PDF 811 kb]   (139 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Computational Methods in Engineering

Designed & Developed by : Yektaweb