Graph-Based Representations in Pattern Recognition

DOI10.1007/B107037MaRDI QIDQ5316464zbMATH OpenOpenAlexFDO

Authors T. Caelli, Tibério S. Caetano

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107037

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Approximating the problem, not the solution: an alternative view of point set matching
• Structural, Syntactic, and Statistical Pattern Recognition
• Inexact Bayesian point pattern matching for linear transformations
• Improved approximation bounds for planar point pattern matching
• Approximate one-to-one point pattern matching

Cited in

(6)

• Approximating the problem, not the solution: an alternative view of point set matching
• Matching point sets with respect to the earth mover's distance
• Computing and Combinatorics
• Structural, Syntactic, and Statistical Pattern Recognition
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• A dynamic generating graphical model for point-sets matching

This page was built for publication: Graph-Based Representations in Pattern Recognition

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