Matching delaunay graphs
- 31 January 1997
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 30 (1) , 123-140
- https://doi.org/10.1016/s0031-3203(96)00060-x
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A Bayesian compatibility model for graph matchingPattern Recognition Letters, 1996
- Relational matching by discrete relaxationImage and Vision Computing, 1995
- Perceptual organization in computer vision: a review and a proposal for a classificatory structureIEEE Transactions on Systems, Man, and Cybernetics, 1993
- Matching: Invariant to translations, rotations and scale changesPattern Recognition, 1992
- Computational strategies for object recognitionACM Computing Surveys, 1992
- Relative sensitivity of a family of closest-point graphs in computer vision applicationsPattern Recognition, 1991
- 3-D object recognition using bipartite matching embedded in discrete relaxationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Structural stereopsis for 3-D visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Contextual decision rule for region analysisImage and Vision Computing, 1987
- Labeled point pattern matching by Delaunay triangulation and maximal cliquesPattern Recognition, 1986