Sciweavers

84 search results - page 7 / 17
» Image partitioning with kernel mapping and graph cuts
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
CVPR
2005
IEEE
14 years 9 months ago
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
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...
Yichen Wei, Long Quan
PR
2008
169views more  PR 2008»
13 years 7 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
14 years 1 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
ICCV
2011
IEEE
12 years 7 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...