Sciweavers

241 search results - page 26 / 49
» Geodesic Graph Cut for Interactive Image Segmentation
Sort
View
MVA
2007
189views Computer Vision» more  MVA 2007»
15 years 1 months ago
Image Segmentation Using Region Merging Combined with a Multi-class Spectral Method
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...
Fernando C. Monteiro, Aurélio C. Campilho
CVPR
2009
IEEE
16 years 7 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CVPR
2009
IEEE
16 years 7 months ago
Active Volume Models for 3D Medical Image Segmentation
In this paper, we propose a novel predictive model for object boundary, which can integrate information from any sources. The model is a dynamic “object” model whose manifes...
Tian Shen (Lehigh University), Hongsheng Li (Lehig...
CVPR
2004
IEEE
16 years 1 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
CVPR
2010
IEEE
15 years 4 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince