Optimal Inference for Distributed Detection

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Akofor, Earnest
Format: Preprint
Veröffentlicht: 2016
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929461917646848
author Akofor, Earnest
author_facet Akofor, Earnest
contents In distributed detection, there does not exist an automatic way of generating optimal decision strategies for non-affine decision functions. Consequently, in a detection problem based on a non-affine decision function, establishing optimality of a given decision strategy, such as a generalized likelihood ratio test, is often difficult or even impossible. In this thesis we develop a novel detection network optimization technique that can be used to determine necessary and sufficient conditions for optimality in distributed detection for which the underlying objective function is monotonic and convex in probabilistic decision strategies. Our developed approach leverages on basic concepts of optimization and statistical inference which are provided in sufficient detail. These basic concepts are combined to form the basis of an optimal inference technique for signal detection. We prove a central theorem that characterizes optimality in a variety of distributed detection architectures. We discuss three applications of this result in distributed signal detection. These applications include interactive distributed detection, optimal tandem fusion architecture, and distributed detection by acyclic graph networks. In the conclusion we indicate several future research directions, which include possible generalizations of our optimization method and new research problems arising from each of the three applications considered.
format Preprint
id arxiv_https___arxiv_org_abs_1605_05808
institution arXiv
publishDate 2016
record_format arxiv
spellingShingle Optimal Inference for Distributed Detection
Akofor, Earnest
Information Theory
Optimization and Control
Applications
94A05, 94A13, 94A15
In distributed detection, there does not exist an automatic way of generating optimal decision strategies for non-affine decision functions. Consequently, in a detection problem based on a non-affine decision function, establishing optimality of a given decision strategy, such as a generalized likelihood ratio test, is often difficult or even impossible. In this thesis we develop a novel detection network optimization technique that can be used to determine necessary and sufficient conditions for optimality in distributed detection for which the underlying objective function is monotonic and convex in probabilistic decision strategies. Our developed approach leverages on basic concepts of optimization and statistical inference which are provided in sufficient detail. These basic concepts are combined to form the basis of an optimal inference technique for signal detection. We prove a central theorem that characterizes optimality in a variety of distributed detection architectures. We discuss three applications of this result in distributed signal detection. These applications include interactive distributed detection, optimal tandem fusion architecture, and distributed detection by acyclic graph networks. In the conclusion we indicate several future research directions, which include possible generalizations of our optimization method and new research problems arising from each of the three applications considered.
title Optimal Inference for Distributed Detection
topic Information Theory
Optimization and Control
Applications
94A05, 94A13, 94A15
url https://arxiv.org/abs/1605.05808