158 search results - page 7 / 32 » Spatially Coherent Clustering Using Graph Cuts |
CVPR
2010
IEEE
14 years 4 days ago
2010
IEEE
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...
DAGM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
ISBI
2006
IEEE
14 years 8 months ago
2006
IEEE
Given a volume of cardiac MR images, we consider the problem of segmenting the heart based on intensity and dynamics. We first segment the heart and the chest from the background ...
CGF
2010
13 years 7 months ago
2010
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...