Sciweavers

244 search results - page 21 / 49
» Image Thresholding Using Graph Cuts
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 10 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
2009
IEEE
15 years 6 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
PAMI
2007
127views more  PAMI 2007»
13 years 10 months ago
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
ICCV
2009
IEEE
1136views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Robust Graph-Cut Scene Segmentation and Reconstruction for Free-Viewpoint Video of Complex Dynamic Scenes
Current state-of-the-art image-based scene reconstruction techniques are capable of generating high-fidelity 3D models when used under controlled capture conditions. However, th...
Jean-Yves Guillemaut, Joe Kilner and Adrian Hilton
BMVC
2010
13 years 6 months ago
Saliency Segmentation based on Learning and Graph Cut Refinement
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
Paria Mehrani, Olga Veksler