Matching Delaunay graphs

DOI10.1016/S0031-3203(96)00060-XMaRDI QIDQ676779zbMATH OpenOpenAlexWikidataFDO

Authors Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock

Publication date 6 July 1997

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0031-3203(96)00060-x

zbMATH Keywords

Voronoi tessellationsvolumetric surface data

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Graph matching with hierarchical discrete relaxation
• Structural Matching with Active Triangulations
• Structural, Syntactic, and Statistical Pattern Recognition
• Shape matching by random sampling

Cites work

• A distance measure between attributed relational graphs for pattern recognition
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• Representing stereo data with the Delaunay triangulation
• Scene Labeling by Relaxation Operations
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

Cited in

(8)

• Text region extraction in a document image based on the Delaunay tessellation
• Clique descriptor of affine invariant regions for robust wide baseline image matching
• Fuzzy morphisms between graphs
• An applied point pattern matching problem: Comparing 2D patterns of protein spots
• Relational object recognition from large structural libraries
• Structural, Syntactic, and Statistical Pattern Recognition
• Point matching under non-uniform distortions.
• Data graph formulation as the minimum-weight maximum-entropy problem

This page was built for publication: Matching Delaunay graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676779)