1133 search results - page 58 / 227 » Basics of Graph Cuts |
SODA
2012
ACM
12 years 15 days ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Presentation
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
ACCV
2010
Springer
13 years 5 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
TRECVID
2007
13 years 11 months ago
2007
TURED ABSTRACT Detection of shot boundary plays important roles in many video applications. Herein, a novel method on shot boundary detection from compressed video is proposed. Fir...