CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2002 vol.24 Issue No.09 - September
Issue No.09 - September (2002 vol.24)
<p><b>Abstract</b>—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. Problems involving Gaussian, Poisson, and multiplicative noise, and random pixel deletions are considered, as well as least-favorable Gaussian clutter. A sixth application involving compressed sensor image data is considered in some detail. This study provides a systematic and computationally attractive framework for analytically characterizing target recognition performance under complicated, non-Gaussian models and optimizing system parameters.</p>
Object recognition, automatic target recognition, imaging sensors, multisensor data fusion, data compression, performance metrics.
Avinash Jain, Pierre Moulin, Michael I. Miller, Kannan Ramchandran, "Information-Theoretic Bounds on Target Recognition Performance Based on Degraded Image Data", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.24, no. 9, pp. 1153-1166, September 2002, doi:10.1109/TPAMI.2002.1033209