Structural Matching in Computer Vision Using Probabilistic Relaxation

In this paper, we develop the theory of probabilistic relaxation for matching features extracted from 2D images, derive as limiting cases the various heuristic formulae used by researchers in matching problems, and state the conditions under which they apply, We successfully apply our theory to the problem of matching and recognizing aerial road network images based on road network models and to the problem of edge matching in a stereo pair. For this purpose, each line network is represented by an attributed relational graph where each node is a straight line segment characterized by certain attributes and related with every other node via a set of binary relations. >

[1]  H. Baird.  Model-Based Image Matching Using Location , 1985 .

[2]  Josef Kittler,et al.  Edge-Labeling Using Dictionary-Based Relaxation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Andrew K. C. Wong,et al.  Graph Optimal Monomorphism Algorithms , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

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

[6]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[7]  Roy Weatherford,et al.  Philosophical Foundations of Probability Theory , 2022 .

[8]  Josef Kittler,et al.  Probabilistic Relaxation as an Optimizer , 1995, BMVC.

[9]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[10]  Edward M. Riseman,et al.  Hybrid weak-perspective and full-perspective matching , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[12]  William J. Christmas,et al.  Modelling Compatibility Coefficient Distributions for Probabilistic Feature-Labelling Schemes , 1995, BMVC.

[13]  Wesley E. Snyder,et al.  Matching oversegmented 3D images to models using association graphs , 1989, Image Vis. Comput..

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

[15]  Stan Z. Li,et al.  Matching: Invariant to translations, rotations and scale changes , 1992, Pattern Recognit..

[16]  Josef Kittler,et al.  Matching of road segments using probabilistic relaxation: reducing the computational requirements , 1994, Defense, Security, and Sensing.

[17]  R. Kirby.  A product rule relaxation method , 1980 .

[18]  Robert C. Bolles,et al.  Robust Feature Matching Through Maximal Cliques , 1979, Other Conferences.

[19]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Marcello Pelillo,et al.  An optimization algorithm for determining the compatibility coefficients of relaxation labeling processes , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.

[21]  Rachid Deriche,et al.  From Noisy Edge Points to 3D Reconstruction of a Scene: A Robust Approach and its Uncertainty Analysis , 1992 .

[22]  William J. Christmas,et al.  Non-Iterative Contextual Correspondence Matching , 1994, ECCV.

[23]  Bir Bhanu,et al.  Representation and Shape Matching of 3-D Objects , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Kim L. Boyer,et al.  Structural Stereopsis for 3-D Vision , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Olivier D. Faugeras,et al.  Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[27]  Federico Girosi,et al.  Parallel and Deterministic Algorithms from MRFs: Surface Reconstruction , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  C Koch,et al.  Analog "neuronal" networks in early vision. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Olivier D. Faugeras,et al.  Shape Matching of Two-Dimensional Objects , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Marcello Pelillo,et al.  Relaxation labeling processes for the traveling salesman problem , 1993, Proceedings of 1993 International Conference on Neural Networks (IJCNN-93-Nagoya, Japan).

[31]  Basilis Gidas,et al.  A Renormalization Group Approach to Image Processing Problems , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  Josef Kittler,et al.  Automatic registration of aerial photographs and digitized maps , 1993 .

[33]  Shimon Ullman,et al.  Structural Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

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

[35]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[36]  Andrew Blake,et al.  The least-disturbance principle and weak constraints , 1983, Pattern Recognit. Lett..

[37]  W. Eric L. Grimson,et al.  Localizing Overlapping Parts by Searching the Interpretation Tree , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[39]  Kim L. Boyer,et al.  Stereopsis and image registration from extended edge features in the absence of camera pose information , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[40]  Josef Kittler,et al.  On compatibility and support functions in probabilistic relaxation , 1986, Comput. Vis. Graph. Image Process..

[41]  Martin A. Fischler,et al.  The Representation and Matching of Pictorial Structures , 1973, IEEE Transactions on Computers.

[42]  M. Hebert,et al.  The Representation, Recognition, and Locating of 3-D Objects , 1986 .

[43]  Bernd Radig,et al.  Image sequence analysis using relational structures , 1984, Pattern Recognit..

[44]  W. Well.  MAP model matching , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[45]  William J. Christmas,et al.  PROBABILISTIC RELAXATION FOR MATCHING OF SYMBOLIC STRUCTURES , 1993 .

[46]  Todd A. Cass,et al.  Polynomial-Time Object Recognition in the Presence of Clutter, Occlusion, and Uncertainty , 1992, ECCV.

[47]  William J. Christmas,et al.  Matching of road segments using probabilistic relaxation: a hierarchical approach , 1994, Optics & Photonics.

[48]  M. Petrou.  Optimal convolution filters and an algorithm for the detection of wide linear features , 1993 .

[49]  Shimon Ullman,et al.  Relaxation and constrained optimization by local processes , 1979 .

[50]  Hiromichi Yamamoto.  A method of deriving compatibility coefficients for relaxation operators , 1979 .

[51]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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

[54]  William J. Christmas,et al.  ANALYTICAL APPROACHES TO THE NEURAL NET ARCHITECTURE DESIGN , 1994 .

[55]  Gérard G. Medioni,et al.  Structural Indexing: Efficient 3-D Object Recognition , 1992, IEEE Trans. Pattern Anal. Mach. Intell..