1133 search results - page 53 / 227 » Basics of Graph Cuts |
APAL
2008
13 years 9 months ago
2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...
CRV
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
An integral element of every surgical simulator is the ability to interactively cut tissue. A number of approaches have been suggested in the past, the most important being mesh su...
CVPR
2000
IEEE
14 years 11 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...