Sciweavers

40 search results - page 2 / 8
» Image Segmentation with Minimum Mean Cut
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
Discrete minimum ratio curves and surfaces
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
Fred Nicolls, Phil Torr
DAGM
2007
Springer
15 years 3 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
CORR
2004
Springer
223views Education» more  CORR 2004»
14 years 11 months ago
Better Foreground Segmentation Through Graph Cuts
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
Nicholas R. Howe, Alexandra Deschamps
CVPR
2000
IEEE
16 years 1 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
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
16 years 1 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother