Sciweavers

48 search results - page 8 / 10
» Fast Approximate Energy Minimization via Graph Cuts
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
ECCV
2008
Springer
14 years 9 months ago
Automatic Image Colorization Via Multimodal Predictions
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Bernhard Schölkopf, Guillaume Charpiat, Matth...
CVPR
2008
IEEE
14 years 9 months ago
3D occlusion recovery using few cameras
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
Mark A. Keck, James W. Davis
ICCV
2009
IEEE
15 years 17 days ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...