title: Local Submodularization for Binary Pairwise Energies.
abstract: Many computer vision problems require optimization of binary non-submodular energies. We propose a general optimization framework based on local submodular approximations (LSA). Unlike standard LP relaxation methods that linearize the whole energy globally, our approach iteratively approximates the energy locally. On the other hand, unlike standard local optimization methods (e.g., gradient descent or projection techniques) we use non-linear submodular approximations and optimize them without leaving the domain of integer solutions. We discuss two specific LSA algorithms based on trust region and auxiliary function principles, LSA-TR and LSA-AUX. The proposed methods obtain state-of-the-art results on a wide range of applications such as binary deconvolution, curvature regularization, inpainting, segmentation with repulsion and two types of shape priors. Finally, we discuss a move-making extension to the LSA-TR approach. While our paper is focused on pairwise energies, our ideas extend to higher-order problems. The code is available online.
authors.forename: Lena
authors.initials: L
authors.lastname: Gorelick
authors.forename: Yuri
authors.initials: Y
authors.lastname: Boykov
authors.forename: Olga
authors.initials: O
authors.lastname: Veksler
authors.forename: Ismail Ben
authors.initials: IB
authors.lastname: Ayed
authors.forename: Andrew
authors.initials: A
authors.lastname: Delong
mesh_terms: D000465:Algorithms; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D008099:Liver / Q000000981:diagnostic imaging; D008962:Models, Theoretical; D011327:Printing