A practical, globally optimal algorithm for geometric matching under uncertainty

DOI10.1016/S1571-0661(04)80986-1MaRDI QIDQ4917099zbMATH OpenFDO

Authors Thomas M. Breuel

Publication date 26 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80986-1

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10)

Recommendations

• Implementation techniques for geometric branch-and-bound matching methods
• Feature matching with bounded distortion
• scientific article; zbMATH DE number 2062654
• A general method for geometric feature matching and model extraction
• Global optimization through rotation space search

Cites work

• A practical, globally optimal algorithm for geometric matching under uncertainty
• scientific article; zbMATH DE number 3986662 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Locating geometric primitives by pruning the parameter space
• Solution of the Simultaneous Pose and Correspondence Problem Using Gaussian Error Model
• Topologically sweeping an arrangement

Cited in

(9)

• Attributed point matching for automatic groundtruth generation
• Geometric Matching Algorithms for Two Realistic Terrains
• On the use of interval arithmetic in geometric branch and bound algorithms
• scientific article; zbMATH DE number 2062654 (Why is no real title available?)
• A practical, globally optimal algorithm for geometric matching under uncertainty
• Feature matching with bounded distortion
• Discrete Geometry for Computer Imagery
• Global optimization through rotation space search
• Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments

This page was built for publication: A practical, globally optimal algorithm for geometric matching under uncertainty

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