Sciweavers

396 search results - page 15 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
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
3DPVT
2006
IEEE
203views Visualization» more  3DPVT 2006»
14 years 1 months ago
Graph Cut Based Multiple View Segmentation for 3D Reconstruction
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
Mario Sormann, Christopher Zach, Konrad F. Karner
PAMI
2010
215views more  PAMI 2010»
13 years 5 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
13 years 11 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner