Shape representation and recognition based on invariant unary and binary relations

The problem of transformation invariant object recognition is considered. We develop a projective transformation invariant representation for both scene and model which facilitates an attributed relational graph object matching based only on unary and binary relations. The unary and binary measurements used for matching are derived from sets of reference points such as corners and bi-tangent points which are stable under the various transformations considered. Each set of reference points is used to generate a distinct barycentric coordinate basis system associated with one node of the object graph representation. We show that barycentric coordinates of the reference image points can be made invariant under any arbitrary projective transformation. The conditions that must hold for a basis to be valid are stated. We illustrate the construction of the barycentric coordinate systems for the affine and perspective transformations. For the object and scene representation we use the barycentric coordinates of the reference points generating the barycentric coordinate system, together with auxiliary measurements such as colour and texture as the node's unary measurements. For binary measurements we use the product of the barycentric coordinate system for one node with the inverse of the barycentric coordinate system associated with another node. The unary and binary relations provide an orthogonal decomposition of the shape being matched. They are used in a relaxation process to detect instances of objects consistent with a given model. We demonstrate the proposed methodology of projective transformation invariant object representation on several examples. First we illustrate the stability of the shape representation in terms of unary relations both visually and numerically. We then experimentally demonstrated the invariance of binary relations on a star-like object. We show experimentally that the binary relations derived are invariant. The final example demonstrates the proposed approach as a tool for 3D object recognition. The aim is to recognize 3D objects in terms of planar faces. A hexagonal model shape is hypothesized in the image. The only instance of the hypothesized model is successfully recovered.

[1]  Martin A. Fischler,et al.  Locating Perceptually Salient Points on Planar Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  David A. Forsyth,et al.  Invariant Descriptors for 3D Object Recognition and Pose , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Basil G. Mertzios,et al.  Shape recognition with a neural classifier based on a fast polygon approximation technique , 1994, Pattern Recognit..

[4]  Craig Gotsman On the most robust affine basis , 1993, Pattern Recognit. Lett..

[5]  Zhimin Shao 3D/2D object recognition from surface patterns , 1997 .

[6]  Fernand S. Cohen,et al.  Part I: Modeling Image Curves Using Invariant 3-D Object Curve Models-A Path to 3-D Recognition and Shape Estimation from Image Contours , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Subhashis Banerjee,et al.  Finding Point Correspondences in Motion Sequences Preserving Affine Structure , 1993, BMVC.

[8]  Josef Kittler,et al.  MFT based discrete relaxation for matching high order relational structures , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[9]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  M. Carter Computer graphics: Principles and practice , 1997 .

[11]  Josef Kittler,et al.  Probabilistic Relaxation: Potential, Relationships and Open Problems , 1997, EMMCVPR.

[12]  Josef Kittler,et al.  Combining Evidence in Probabilistic Relaxation , 1989, Int. J. Pattern Recognit. Artif. Intell..

[13]  Narendra Ahuja,et al.  Image representation using Voronoi tessellation , 1985, Comput. Vis. Graph. Image Process..

[14]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Thomas H. Reiss,et al.  Recognizing Planar Objects Using Invariant Image Features , 1993, Lecture Notes in Computer Science.

[16]  Josef Kittler,et al.  Fuzzy non-iterative ARG labeling with multiple interpretations , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[17]  Jiri Matas,et al.  On representation and matching of multi-coloured objects , 1995, Proceedings of IEEE International Conference on Computer Vision.

[18]  Thomas S. Huang,et al.  Finding point correspondences and determining motion of a rigid object from two weak perspective views , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[19]  Richard I. Hartley,et al.  Projective Reconstruction and Invariants from Multiple Images , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Ehud Rivlin,et al.  Local Invariants For Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Hartmut Noltemeier,et al.  Geometric Modelling , 1998, Computing Supplement.

[22]  William J. Christmas,et al.  Probabilistic relaxation for matching problems in computer vision , 1993, 1993 (4th) International Conference on Computer Vision.

[23]  Fernand S. Cohen,et al.  Part II: 3-D Object Recognition and Shape Estimation from Image Contours Using B-splines, Shape Invariant Matching, and Neural Network , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Kenichi Kanatani Computational cross ratio for computer vision , 1994 .