27 search results - page 2 / 6 » Computing Visual Correspondence with Occlusions via Graph Cu... |
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
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...
EMMCVPR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...