13 May 2010 A probability of error-constrained sequential decision algorithm for data-rich automatic target recognition
Author Affiliations +
Abstract
This paper illustrates an approach to sequential hypothesis testing designed not to minimize the amount of data collected but to reduce the overall amount of processing required, while still guaranteeing pre-specified conditional probabilities of error. The approach is potentially useful when sensor data are plentiful but time and processing capability are constrained. The approach gradually reduces the number of target hypotheses under consideration as more sensor data are processed, proportionally allocating time and processing resources to the most likely target classes. The approach is demonstrated on a multi-class ladar-based target recognition problem and compared with uniform-computation tests.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Irwin O. Reyes, Irwin O. Reyes, Michael D. DeVore, Michael D. DeVore, Peter A. Beling, Peter A. Beling, Barry M. Horowitz, Barry M. Horowitz, "A probability of error-constrained sequential decision algorithm for data-rich automatic target recognition", Proc. SPIE 7696, Automatic Target Recognition XX; Acquisition, Tracking, Pointing, and Laser Systems Technologies XXIV; and Optical Pattern Recognition XXI, 769615 (13 May 2010); doi: 10.1117/12.858293; https://doi.org/10.1117/12.858293
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top