An optimal probabilistic graphical model for point set matching

DOI10.1007/978-3-540-27868-9_16MaRDI QIDQ5466302zbMATH OpenOpenAlexFDO

Authors T. Caelli, Dante Augusto Couto Barone, Tibério S. Caetano

Publication date 24 August 2005

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

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• A dynamic generating graphical model for point-sets matching
• Approximating the problem, not the solution: an alternative view of point set matching
• Approximating the problem, not the solution: An alternative view of point set matching
• Relational constraints for point distribution models
• Smooth simultaneous structural graph matching and point-set registration

Cited in

(11)

• A new matching algorithm between trees of shapes and its application to brain tumor segmentation
• Approximating the problem, not the solution: an alternative view of point set matching
• Smooth simultaneous structural graph matching and point-set registration
• Data graph formulation as the minimum-weight maximum-entropy problem
• POINT MATCHING WITH A "SOFT" RELAXATION ALGORITHM
• Structural Matching with Active Triangulations
• Approximating the problem, not the solution: An alternative view of point set matching
• Exact recovery with symmetries for procrustes matching
• Matching Delaunay graphs
• Bayesian matching of unlabeled marked point sets using random fields, with an application to molecular alignment
• A dynamic generating graphical model for point-sets matching

This page was built for publication: An optimal probabilistic graphical model for point set matching

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