229 search results - page 21 / 46 » Iterated Graph Cuts for Image Segmentation |
103
click to vote
ISBI
2009
IEEE
15 years 4 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 ...
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
111
click to vote
VLSM
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
EMMCVPR
2009
Springer
15 years 4 months ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
14 years 9 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...