One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
Many applications need to segment out all small round
regions in an image. This task of finding dots can be viewed
as a region segmentation problem where the dots form one
regio...
—Power and energy consumption has emerged as the premier and most constraining aspect in modern computational systems. Dynamic Voltage Scheduling (DVS) has been provably one of t...
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...