Matching Delaunay graphs
From MaRDI portal
Publication:676779
DOI10.1016/S0031-3203(96)00060-XzbMath0866.68115WikidataQ62523671 ScholiaQ62523671MaRDI QIDQ676779
Edwin R. Hancock, Richard C. Wilson, Andrew M. Finch
Publication date: 6 July 1997
Published in: Pattern Recognition (Search for Journal in Brave)
68T10: Pattern recognition, speech recognition
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Fuzzy morphisms between graphs, Clique descriptor of affine invariant regions for robust wide baseline image matching, An applied point pattern matching problem: Comparing 2D patterns of protein spots, Text region extraction in a document image based on the Delaunay tessellation, Relational object recognition from large structural libraries, Point matching under non-uniform distortions.
Cites Work
- Constraints on deformable models: Recovering 3D shape and nonrigid motion
- Representing stereo data with the Delaunay triangulation
- Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Scene Labeling by Relaxation Operations
- A distance measure between attributed relational graphs for pattern recognition