Toward a generic framework for recognition based on uncertain geometric features

The recognition problem is probably one of the most studied in computer vision. However, most techniques were developed on point features and were not designed to cope explicitly with uncertainty in measurements. The aim of this paper is to formulate recognition algorithms explicitly in terms of uncertain geometric features (such as points, lines, oriented points or frames). In the first part we review the principal matching algorithms and adapt them to work with generic geometric features. Then we analyze how to handle uncertainty on geometric features and the influence it has on the matching algorithms. Last but not least, we analyse four key problems for the implementation of these generic algorithms. Key Words: 3D Object Recognition, Invariants of 3D objects. 1 Introduction The recognition problem is probably one of the most studied in computer vision (see for instance [BJ85, CD86]) and many algorithms were developed to compare two images or to recognize objects with an a prior...

[1]  I. Holopainen.  Riemannian Geometry , 1927, Nature.

[2]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[3]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[4]  W. Klingenberg.  Riemannian Geometry , 1982 .

[5]  Ramesh C. Jain,et al.  Three-dimensional object recognition , 1985, CSUR.

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Charles R. Dyer,et al.  Model-based recognition in robot vision , 1986, CSUR.

[8]  Olivier D. Faugeras,et al.  HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[10]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[11]  D. Kendall.  A Survey of the Statistical Theory of Shape , 1989 .

[12]  Trevor J. Hastie,et al.  3-D curve matching using splines , 1990, J. Field Robotics.

[13]  William Grimson,et al.  Object recognition by computer - the role of geometric constraints , 1991 .

[14]  W. Eric L. Grimson,et al.  On the sensitivity of geometric hashing , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[15]  W. Eric L. Grimson,et al.  On the Sensitivity of the Hough Transform for Object Recognition , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Rakesh Mohan,et al.  Multidimensional indexing for recognizing visual shapes , 1991, CVPR 1991.

[17]  Yehezkel Lamdan,et al.  On the error analysis of 'geometric hashing' , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[19]  Trevor J. Hastie,et al.  3-D curve matching using splines , 1991, J. Field Robotics.

[20]  Gérard G. Medioni,et al.  Structural hashing: efficient three dimensional object recognition , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[21]  D. Huttenlocher,et al.  Affine Matching With Bounded Sensor Error: Study of Geometric Hashing and Alignment , 1991 .

[22]  H. Wolfson,et al.  An efficient automated computer vision based technique for detection of three dimensional structural motifs in proteins. , 1992, Journal of biomolecular structure & dynamics.

[23]  Nicholas Ayache,et al.  Smoothing and Matching of 3-D Space Curves , 1992, ECCV.

[24]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Ruth Nussinov,et al.  3-D Substructure Matching in Protein Molecules , 1992, CPM.

[26]  Xavier Pennec,et al.  Correctness and robustness of 3D rigid matching with bounded sensor error , 1993 .

[27]  Robert A. Hummel,et al.  Distributed Bayesian object recognition , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[28]  D. Kendall,et al.  The Riemannian Structure of Euclidean Shape Spaces: A Novel Environment for Statistics , 1993 .

[29]  Nicholas Ayache,et al.  An 0(n2) algorithm for 3D substructure matching of proteins , 1994 .

[30]  Rakesh Mohan,et al.  Multidimensional Indexing for Recognizing Visual Shapes , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  F. Dehne,et al.  Hypercube algorithms for parallel processing of pointer-based quadtrees , 1995 .

[32]  S. P. Mudur,et al.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[33]  Isidore Rigoutsos,et al.  A Bayesian Approach to Model Matching with Geometric Hashing , 1995, Computer Vision and Image Understanding.

[34]  Xavier Pennec.  L'incertitude dans les problèmes de reconnaissance et de recalage - Applications en imagerie médicale et biologie moléculaire , 1996 .

[35]  Nicholas Ayache,et al.  Medical image registration using geometric hashing , 1997 .

[36]  Xavier Pennec,et al.  Registration of Uncertain Geometric Features: Estimating the Pose and its Accuracy , 1997 .

[37]  X. Pennec.  Computing the Mean of Geometric Features Application to the Mean Rotation , 1998 .

[38]  Nicholas Ayache,et al.  A geometric algorithm to find small but highly similar 3D substructures in proteins , 1998, Bioinform..