Convex Optimization for Parallel Energy Minimization

K. S. Sesh Kumar 1, 2 Alvaro Barbero 3 Stefanie Jegelka 4 Suvrit Sra 4 Francis Bach 1, 2
2 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : Energy minimization has been an intensely studied core problem in computer vision. With growing image sizes (2D and 3D), it is now highly desirable to run energy minimization algorithms in parallel. But many existing algorithms, in particular, some efficient combinatorial algorithms, are difficult to par-allelize. By exploiting results from convex and submodular theory, we reformulate the quadratic energy minimization problem as a total variation denoising problem, which, when viewed geometrically, enables the use of projection and reflection based convex methods. The resulting min-cut algorithm (and code) is conceptually very simple, and solves a sequence of TV denoising problems. We perform an extensive empirical evaluation comparing state-of-the-art combinatorial algorithms and convex optimization techniques. On small problems the iterative convex methods match the combinatorial max-flow algorithms, while on larger problems they offer other flexibility and important gains: (a) their memory footprint is small; (b) their straightforward parallelizability fits multi-core platforms; (c) they can easily be warm-started; and (d) they quickly reach approximately good solutions, thereby enabling faster " inexact " solutions. A key consequence of our approach based on submodularity and convexity is that it is allows to combine any arbitrary combinatorial or convex methods as subroutines, which allows one to obtain hybrid combinatorial and convex optimization algorithms that benefit from the strengths of both.
Liste complète des métadonnées

https://hal.inria.fr/hal-01123492
Contributeur : Ks Seshkumar <>
Soumis le : jeudi 5 mars 2015 - 06:15:50
Dernière modification le : vendredi 25 mai 2018 - 12:02:06
Document(s) archivé(s) le : samedi 6 juin 2015 - 10:16:51

Fichiers

TV_for_cuts.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01123492, version 1
  • ARXIV : 1503.01563

Collections

Citation

K. S. Sesh Kumar, Alvaro Barbero, Stefanie Jegelka, Suvrit Sra, Francis Bach. Convex Optimization for Parallel Energy Minimization. 2015. 〈hal-01123492〉

Partager

Métriques

Consultations de la notice

400

Téléchargements de fichiers

986