241 search results - page 42 / 49 » Geodesic Graph Cut for Interactive Image Segmentation |
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
PAMI
2008
14 years 9 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
CVPR
2008
IEEE
15 years 11 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...
112
Voted
VLSM
2005
Springer
15 years 3 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 ...
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...