Implementing the optimal Neyman-Pearson (NP) fusion rule in distributed detection systems requires the sensor error probabilities to be a priori known and constant during the system operation. Such a requirement is practically impossible to fulfil for every resolution cell in a multiflying target multisensor environment. The true performance of the fusion center is often worse than expected due to fluctuations of the observed environment and instabilities of sensor thresholds. This work considers a nonparametric data fusion situation in which the fusion center knows only the number of the sensors, but ignores their error probabilities and cannot control their thresholds. A data adaptive approach to the problem is adopted, and combining P reports from Q independent distributed sensors through a least squares (LS) formulation to make a global decision is investigated. Such a fusion scheme does not entail strict stationarity of the noise environment nor strict invariance of the sensor error probabilities as is required in the NP formulation. The LS fusion scheme is analyzed in detail to simplify its form and determine its asymptotic behavior. Conditions of performance improvement as P increases and of quickness of such improvement are found. These conditions are usually valid in netted radar surveillance systems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Nonstochastic adaptive decision fusion in distributed-detection systems


    Contributors:


    Publication date :

    2002-10-01


    Size :

    309412 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Blind adaptive decision fusion for distributed detection

    Mirjalily, G. / Zhi-Quan Luo, / Davidson, T.N. et al. | IEEE | 2003


    Blind Adaptive Decision Fusion for Distributed Detection

    Mirjalily, G. | Online Contents | 2003