1133 search results - page 14 / 227 » Basics of Graph Cuts |
ICIAP
2009
ACM
14 years 8 months ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
ICML
2009
IEEE
14 years 8 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...
CVPR
2005
IEEE
14 years 9 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...
ICCV
2001
IEEE
14 years 9 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...
MICCAI
2009
Springer
14 years 4 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...