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...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE International Conference on Computer Vision (ICCV 2009)|
|01_Carr_Minimizing_Energy_Functions_on_2009.pdf||485.55 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.