Paper
3 April 2000 Optimal decision rules for distributed binary decision tree classifiers
Qian Zhang, Pramod K. Varshney
Author Affiliations +
Abstract
We consider the problem of recognizing M objects using a fusion center with N parallel sensors. Unlike conventional M-ary decision fusion systems, our fusion system breaks a complex M-ary decision fusion problem into a sequence of simpler binary decision fusion problems. In our systems, a binary decision tree (BDT) is employed to hierarchically partition the object space at all system elements. The traversal of the BDT is synchronized by the fusion center. The sensor observations are assumed conditionally independent given the unknown object type. We use a greedy performance criterion in which the probability of error is minimized at individual nodes. Using this performance criterion, we characterize the optimal fusion rules and the optimal sensor rules. We compare our results with some important results on conventional one-stage binary fusion.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qian Zhang and Pramod K. Varshney "Optimal decision rules for distributed binary decision tree classifiers", Proc. SPIE 4051, Sensor Fusion: Architectures, Algorithms, and Applications IV, (3 April 2000); https://doi.org/10.1117/12.381630
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensors

Binary data

Sensor fusion

Signal to noise ratio

Data fusion

Promethium

Telecommunications

Back to Top