Sciweavers

432 search results - page 14 / 87
» Normalized Cuts and Image Segmentation
Sort
View
ICIP
2006
IEEE
15 years 11 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
CVPR
2010
IEEE
15 years 5 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
106
Voted
CVPR
2005
IEEE
15 years 11 months ago
Interactive Graph Cut Based Segmentation with Shape Priors
Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a sma...
Daniel Freedman, Tao Zhang
ISBI
2011
IEEE
14 years 1 months ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...
CVPR
2000
IEEE
15 years 11 months ago
Image Segmentation by Nested Cuts
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...
Olga Veksler