On the use of interval arithmetic in geometric branch and bound algorithms

T.M. Breuel
2003 Pattern Recognition Letters  
Branch and bound methods have become established methods for geometric matching over the last decade. This paper presents techniques that improve on previous branch and bound methods in two important ways: they guarantee reliable solutions even in the presence of numerical roundoff error, and they eliminate the need to derive bounding functions manually. These new techniques are compared experimentally with recognition-by-alignment and previous branch and bound techniques on geometric matching
more » ... roblems. Novel methods for non-linear baseline finding and globally optimal robust linear regression using these techniques are described.
doi:10.1016/s0167-8655(02)00378-1 fatcat:xhvm5h44cfhupa257msv7mz5jm