Sciweavers

Share
ICCV
2009
IEEE

Minimizing energy functions on 4-connected lattices using elimination

9 years 11 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often minimized using graph-cuts/max-flow, but this method is only applicable to submodular problems. In this paper, we describe an algorithm that will solve any binary problem, irrespective of whether it is submodular or not, and for multilabel problems we use alpha-expansion. The method is based on the elimination algorithm, which eliminates nodes from the graph until the remaining function is submodular. It can then be solved using max-flow. Values of eliminated variables are recovered using back-substitution. We compare the algorithm's performance against alternative methods for solving non-submodular problems, with favourable results.
Peter Carr, Richard Hartley
Added 18 Feb 2011
Updated 18 Feb 2011
Type Journal
Year 2009
Where ICCV
Authors Peter Carr, Richard Hartley
Comments (0)
books