Paper
1 September 1995 Asymptotic estimate for missed/false-track probability in track-before-detect algorithms
Mark Copeland, Keith D. Kastella
Author Affiliations +
Abstract
This article characterizes asymptotic limits for the error probabilities that arise while testing for the detection of targets in the presence of clutter. The hypothesis test decision regions are determined by the discrimination function. The function is the basic measure of the information contained in the measurements. While the Neyman-Pearson Theorem specifies the optimum decision regions, it does not specify the detection performance in terms of the error probabilities. Asymptotic bounds expressed as analytical functions allows us to determine the effect of the decision threshold, the clutter density, and the number of measurements on the error probabilities; thus indicating the effectiveness of the testing procedure.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark Copeland and Keith D. Kastella "Asymptotic estimate for missed/false-track probability in track-before-detect algorithms", Proc. SPIE 2561, Signal and Data Processing of Small Targets 1995, (1 September 1995); https://doi.org/10.1117/12.217725
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Target detection

Error analysis

Signal detection

Detection and tracking algorithms

Algorithm development

Computing systems

Palladium

Back to Top