A practical, globally optimal algorithm for geometric matching under uncertainty
From MaRDI portal
Recommendations
- Implementation techniques for geometric branch-and-bound matching methods
- Feature matching with bounded distortion
- A comparison of search strategies for geometric branch and bound algorithms
- 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
- A comparison of search strategies for geometric branch and bound algorithms
- A practical, globally optimal algorithm for geometric matching under uncertainty
- Feature matching with bounded distortion
- Uncertain geometry in computer vision
- 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)