Sciweavers

241 search results - page 29 / 49
» Geodesic Graph Cut for Interactive Image Segmentation
Sort
View
PAMI
2007
202views more  PAMI 2007»
14 years 11 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
CVPR
2008
IEEE
16 years 1 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
CVPR
2005
IEEE
16 years 1 months ago
OBJ CUT
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 ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CVIU
2010
78views more  CVIU 2010»
14 years 12 months ago
Synergistic arc-weight estimation for interactive image segmentation using graphs
P. A. V. de Miranda, Alexandre X. Falcão, J...
ECCV
2010
Springer
14 years 12 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani