Error bounds for parallel distributed detection under the Neyman-Pearson criterion

DOI10.1109/18.370163MaRDI QIDQ4838682zbMATH OpenOpenAlexFDO

Authors Poning Chen, Adrianos Papamarcou

Publication date 12 July 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.370163

zbMATH Keywords

distributed detectionerror exponentsNeyman-Pearson

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Detection theory in information and communication theory (94A13)

Recommendations

• New asymptotic results in parallel distributed detection
• Multisensor distributed Neyman-Pearson decision
• Distributed signal detection under the Neyman-Pearson criterion
• Randomized fusion rules can be optimal in distributed Neyman-Pearson detectors
• A note on the asymptotics of distributed detection with feedback

Cited in

(5)

• A note on the asymptotics of distributed detection with feedback
• New asymptotic results in parallel distributed detection
• Error exponents for distributed detection of Markov sources
• Closed-Form Error Exponent for the Neyman–Pearson Fusion of Dependent Local Decisions in a One-Dimensional Sensor Network
• General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds

This page was built for publication: Error bounds for parallel distributed detection under the Neyman-Pearson criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838682)