Sciweavers

81 search results - page 12 / 17
» Efficient Shape Matching Via Graph Cuts
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
ICCV
2003
IEEE
14 years 8 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
IJCV
2008
201views more  IJCV 2008»
13 years 6 months ago
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
PAMI
2010
190views more  PAMI 2010»
13 years 5 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CVPR
2010
IEEE
14 years 3 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez