1115 search results - page 12 / 223 » Active Graph Cuts |
186
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
143
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
148
click to vote
ICCV
2001
IEEE
16 years 7 months ago
2001
IEEE
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
168
click to vote
MICCAI
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
177
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we propose a method of object recognition and segmentation using Scale-Invariant Feature Transform (SIFT) and Graph Cuts. SIFT feature is invariant for rotations, s...