2019
Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration
ICCV 2019oral
In recent years, several branch-and-bound (BnB) algorithms have been proposed to globally optimize rigid registration problems. In this paper, we suggest a general framework to improve upon the BnB approach, which we name Quasi BnB. Quasi BnB replaces the linear lower bounds used in BnB algorithms w…