Blar i Department of Mathematics på emneord "VDP::Mathematics and natural science: 400::Information and communication science: 420::Simulation, visualization, signal processing, image processing: 429"
Viser treff 1-7 av 7
-
A Continuous Max-Flow Approach to Minimal Partitions with Label Cost Prior
(Chapter; Peer reviewed, 2011)This paper investigates a convex relaxation approach for minimum description length (MDL) based image partitioning or labeling, which proposes an energy functional regularized by the spatial smoothness prior joint with a ... -
Efficient Global Minimization for the Multiphase Chan-Vese Model of Image Segmentation
(Peer reviewed; Journal article, 2009)The Mumford-Shah model is an important variational image segmentation model. A popular multiphase level set approach, the Chan-Vese model, was developed as a numerical realization by representing the phases by several ... -
Efficient global minimization methods for variational problems in imaging and vision
(Doctoral thesis, 2011-08-19)Energy minimization has become one of the most important paradigms for formulating image processing and computer vision problems in a mathematical language. Energy minimization models have been developed in both the ... -
A Fast Continuous Max-Flow Approach to Non-Convex Multilabeling Problems
(Journal article, 2011)This work addresses a class of multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded function, not necessarily convex. Two total variation based regularization ... -
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach
(Peer reviewed; Journal article, 2010)This paper is devoted to the optimization problem of continuous multi-partitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contrast to previous efforts, which are tackling ... -
Reconstructing Open Surfaces via Graph-Cuts
(Journal article, 2011)A novel graph-cuts-basedmethod is proposed for reconstructing open surfaces from unordered point sets. Through a boolean operation on the crust around the data set, the open surface problem is translated to a watertight ... -
A Study on Continuous Max-Flow and Min-Cut Approaches
(Chapter; Peer reviewed, 2010)We propose and investigate novel max-flow models in the spatially continuous setting, with or without supervised constraints, under a comparative study of graph based max-flow / min-cut. We show that the continuous max-flow ...