Sciweavers

138 search results - page 19 / 28
» Efficient Planar Graph Cuts with Applications in Computer Vi...
Sort
View
CVPR
2006
IEEE
14 years 10 months ago
Bilayer Segmentation of Live Video
This paper presents an algorithm capable of real-time separation of foreground from background in monocular video sequences. Automatic segmentation of layers from colour/contrast ...
Antonio Criminisi, Geoffrey Cross, Andrew Blake, V...
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 8 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CVPR
2008
IEEE
14 years 10 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
PAMI
2006
181views more  PAMI 2006»
13 years 7 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
ICPR
2000
IEEE
14 years 9 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan