Performance prediction and validation for object recognition

This paper addresses the problem of predicting fundamental performance of vote-based object recognition using 2-D point features. It presents a method for predicting a tight lower bound on performance. Unlike previous approaches, the proposed method considers data-distortion factors, namely uncertainty, occlusion, and clutter, in addition to model similarity, simultaneously. The similarity between every pair of model objects is captured by comparing their structures as a function of the relative transformation between them. This information is used along with statistical models of the data-distortion factors to determine an upper bound on the probability of recognition error. This bound is directly used to determine a lower bound on the probability of correct recognition. The validity of the method is experimentally demonstrated using synthetic aperture radar (SAR) data obtained under different depression angles and target configurations.

[1]  Michael I. Miller,et al.  Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  W. Eric L. Grimson,et al.  On the Verification of Hypothesized Matches in Model-Based Recognition , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  W. Eric L. Grimson,et al.  Bounding performance of peak-based target detectors , 1997, Defense, Security, and Sensing.

[4]  Bir Bhanu,et al.  Performance characterization of a model-based SAR target recognition system using invariants , 1997, Defense, Security, and Sensing.

[5]  Michael Lindenbaum Bounds on Shape Recognition Performance , 1995, IEEE Trans. Pattern Anal. Mach. Intell..