Gradient algorithm for quantization levels in distributed detection systems
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 31 (1) , 390-398
- https://doi.org/10.1109/7.366320
Abstract
An iterative gradient algorithm is presented for determining the quantization levels in each of a number of independent sensors so arranged as to pick up a common signal field. The system is to satisfy the Neyman-Pearson criterion that the probability of detection be maximum for a preassigned false-alarm probability. In general a number of local maxima exist, and the proposed method enables efficient search for these by starting from a variety of initial trial values.Keywords
This publication has 15 references indexed in Scilit:
- Optimum distributed detection of weak signals in dependent sensorsIEEE Transactions on Information Theory, 1992
- An algorithm for determining the decision thresholds in a distributed detection problemIEEE Transactions on Systems, Man, and Cybernetics, 1991
- An approach to the design of distributed Bayesian detection structuresIEEE Transactions on Systems, Man, and Cybernetics, 1991
- Distributed Bayesian signal detectionIEEE Transactions on Information Theory, 1989
- Optimal Data Fusion in Multiple Sensor Detection SystemsIEEE Transactions on Aerospace and Electronic Systems, 1986
- Distributed detection of swerling targetsIEE Proceedings F Communications, Radar and Signal Processing, 1986
- Distributed radar detection theoryIEE Proceedings F Communications, Radar and Signal Processing, 1986
- Detection with Distributed SensorsIEEE Transactions on Aerospace and Electronic Systems, 1981
- Recursive Computation of the Generalized Q FunctionIEEE Transactions on Aerospace and Electronic Systems, 1973
- Another recursive method of computing the Q function (Corresp.)IEEE Transactions on Information Theory, 1970