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