1133 search results - page 70 / 227 » Basics of Graph Cuts |
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
PAMI
2010
13 years 8 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
CVPR
2005
IEEE
15 years 3 days ago
2005
IEEE
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
CVPR
2007
IEEE
15 years 3 days ago
2007
IEEE
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
EMMCVPR
2009
Springer
14 years 4 months ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...