Paper
17 August 2000 Information-theoretic bounds on target recognition performance
Avinash Jain, Pierre Moulin, Michael I. Miller, Kannan Ramchandran
Author Affiliations +
Abstract
This paper derives bounds on the performance of statistical object recognition systems, wherein an image of a target is observed by a remote sensor. Detection and recognition problems are modeled as composite hypothesis testing problems involving nuisance parameters. We develop information- theoretic performance bounds on target recognition based on statistical models for sensors and data, and examine conditions under which these bounds are tight. In particular, we examine the validity of asymptotic approximations to probability of error in such imaging problems. Applications to target recognition based on compressed sensor image data are given. This study provides a systematic and computationally attractive framework for analytically characterizing target recognition performance under complicated, non-Gaussian models, and optimizing system parameters.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Avinash Jain, Pierre Moulin, Michael I. Miller, and Kannan Ramchandran "Information-theoretic bounds on target recognition performance", Proc. SPIE 4050, Automatic Target Recognition X, (17 August 2000); https://doi.org/10.1117/12.395580
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensors

Target recognition

Iron

Signal to noise ratio

Image compression

Image sensors

Target detection

Back to Top