Asymptotic performance analysis of Bayesian target recognition

  • Authors:
  • U. Grenander;A. Srivastava;M. I. Miller

  • Affiliations:
  • Div. of Appl. Math., Brown Univ., Providence, RI;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

This article investigates the asymptotic performance of Bayesian target recognition algorithms using deformable-template representations. Rigid computer-aided design (CAD) models represent the underlying targets; low-dimensional matrix Lie-groups (rotation and translation) extend them to particular instances. Remote sensors observing the targets are modeled as projective transformations, converting three-dimensional scenes into random images. Bayesian target recognition corresponds to hypothesis selection in the presence of nuisance parameters; its performance is quantified as the Bayes' error. Analytical expressions for this error probability in small noise situations are derived, yielding asymptotic error rates for exponential error probability decay