The non-randomized optimal hard decision fusion under Neyman-Pearson criterion is known to be an NP-hard classical 0–1 Knapsack problem with exponential complexity. In this paper, we show analytically that though the low-complexity non-randomized single-threshold likelihood ratio based test (non-rand-st LRT) is sub-optimal, its performance approaches the upper-bound obtained by randomized LRT (rand LRT) with the increase in the number of participating sensors (N). This alleviates the need for employing the exponentially complex non-randomized optimal solution for large N. Receiver operating characteristics are plotted to verify the performance of the non-rand-st LRT with reference to the upper-bound obtained by rand LRT for different scenarios.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On non-Randomized Hard Decision Fusion Under Neyman-Pearson Criterion Using LRT




    Publication date :

    2018-08-01


    Size :

    173774 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An experimental evatuation of the Neyman-Pearson detector

    Woods, J. / Estes, A. | Tema Archive | 1983


    Crack Identification in Solid Rocket Motors Through the Neyman–Pearson Detection Theory

    Cholevas, Nicholas / Anyfantis, Konstantinos N. / Mußbach, Günter et al. | AIAA | 2023



    Decision making system using machine learning and Pearson for heart attack

    Thirumalai, Chandrasegar / Duba, Anudeep / Reddy, Rajasekhar | IEEE | 2017


    Quantile Streamflow Estimates Based on the Neyman-Scott Rainfall Model

    Mondonedo, Carlo Arturo San Juan / Tachikawa, Yasuto / Takara, Kaoru | HENRY – Federal Waterways Engineering and Research Institute (BAW) | 2008

    Free access