Graph matching by discrete relaxation

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

[2]  Edwin R. Hancock,et al.  Relaxation matching of road networks in aerial images using topological constraints , 1993, Other Conferences.

[3]  Edwin R. Hancock,et al.  Resolving edge-line ambiguities using probabilistic relaxation , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

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

[5]  Radu Horaud,et al.  Symbolic image matching by simulated annealing , 1990, BMVC.

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

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

[8]  A. Pathak,et al.  Bayesian view class determination , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

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

[11]  Josef Kittler,et al.  Discrete relaxation , 1990, Pattern Recognit..

[12]  Robert M. Haralick,et al.  A Metric for Comparing Relational Descriptions , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.