270 search results - page 44 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
PR
2008
13 years 7 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...