Approximating the problem, not the solution: an alternative view of point set matching

DOI10.1016/J.PATCOG.2005.10.005MaRDI QIDQ2369583zbMATH OpenOpenAlexFDO

Authors Tibério S. Caetano, T. Caelli

Publication date 22 May 2006

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2005.10.005

zbMATH Keywords

graphical modelsgraph matchingMarkov random fieldspoint pattern matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Graph-Based Representations in Pattern Recognition
• 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

Cites work

• scientific article; zbMATH DE number 3900666 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Point matching under non-uniform distortions.
• Scene Labeling by Relaxation Operations
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• Spectral correspondence for point pattern matching
• Structural, Syntactic, and Statistical Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition

Cited in

(6)

• A dynamic generating graphical model for point-sets matching
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Matching point sets with respect to the earth mover's distance
• Computing and Combinatorics
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

This page was built for publication: Approximating the problem, not the solution: an alternative view of point set matching

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