Sciweavers

36 search results - page 1 / 8
» Global Minimization for Continuous Multiphase Partitioning P...
Sort
View
IJCV
2011
180views more  IJCV 2011»
12 years 11 months ago
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
Egil Bae, Jing Yuan, Xue-Cheng Tai
CVPR
2009
IEEE
14 years 11 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CP
2005
Springer
13 years 10 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
EMMCVPR
2011
Springer
12 years 4 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
PAMI
2006
180views more  PAMI 2006»
13 years 4 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot