17 search results - page 1 / 4 » A Simple Topology Preserving Max-Flow Algorithm for Graph Cu... |
MEMICS
2010
12 years 11 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 4 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
PAMI
2010
12 years 11 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
ISBI
2009
IEEE
13 years 11 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...