Relational Matching - Problems, Techniques, and Applications

A relational description is a set of relations that can be used to represent an object model or to describe the features, properties, and interrelationships extracted from an image. Given two such relational descriptions, the relational distance between them tells us how similar are two models (for grouping purposes) or how well a part of an image matches a particular model (for identification purposes). Furthermore, once two descriptions have been judged similar enough by their relational distance, the mapping derived from the matching process can be used to determine symbolic differences between them that may aid in the process of image analysis. In this paper we will define all of the above concepts and then discuss some matching procedures — both in general and for some specific matching problems we are encountering in an industrial inspection task. We will also discuss the complex models being used for this task and the problem of organizing object models in general.

[1]  Thomas S Huang,et al.  IMAGE RECOGNITION BY MATCHING RELATIONAL STRUCTURES. , 1981 .

[2]  Ramakant Nevatia,et al.  Description and Recognition of Curved Objects , 1977, Artif. Intell..

[3]  Linda G. Shapiro,et al.  A Structural Model of Shape , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  David Marr,et al.  Spatial Disposition of Axes in a Generalized Cylinder Representation of Objects That Do Not Encompass the Viewer , 1975 .

[5]  Robert M. Haralick,et al.  Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[7]  Michael Thompson,et al.  Frontiers of Pattern Recognition , 1975 .

[8]  Robert M. Haralick,et al.  A hierarchical relational model for automated inspection tasks , 1984, ICRA.

[9]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[10]  Robert M. Haralick,et al.  Organization of Relational Models for Scene Analysis , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[12]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Prasanna G. Mulgaonkar,et al.  Matching three-dimensional objects using a relational paradigm , 1984, Pattern Recognit..

[14]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[15]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Michael Shneier,et al.  A Compact Relational Structure Representation , 1979, IJCAI.

[17]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[19]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[20]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  John Gaschnig,et al.  A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.

[22]  Linda G. Shapiro,et al.  The nearest neighbor problem in an abstract metric space , 1982, Pattern Recognit. Lett..

[23]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[24]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..