A narrow band method for the convex formulation of discrete multi-label problems

Abstract : We study a narrow band type algorithm to solve a discrete formulation of the convex relaxation of energy functionals with total variation regularization and nonconvex data terms. We prove that this algorithm converges to a local minimum of the original nonlinear optimization problem. We illustrate the algorithm with experiments for disparity computation in stereo and a multilabel segmentation problem, and we check experimentally that the energy of the local minimum is very near to the energy of the global minimum obtained without the narrow band type method.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00596060
Contributor : Nicolas Papadakis <>
Submitted on : Thursday, May 26, 2011 - 2:01:37 PM
Last modification on : Tuesday, January 3, 2012 - 7:45:22 PM

Identifiers

  • HAL Id : hal-00596060, version 1

Collections

Citation

Antonio Baeza, Vicent Caselles, Pau Gargallo I Piracés, Nicolas Papadakis. A narrow band method for the convex formulation of discrete multi-label problems. Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, Society for Industrial and Applied Mathematics, 2010, 8 (5), pp.2048-2078. 〈hal-00596060〉

Share

Metrics

Record views

122