Sciweavers

15 search results - page 3 / 3
» Fast and Efficient Dense Variational Stereo on GPU
Sort
View
CVPR
2008
IEEE
14 years 6 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
ICCV
2003
IEEE
14 years 6 months ago
Surface Reconstruction by Integrating 3D and 2D Data of Multiple Views
Surface representation is needed for almost all modeling and visualization applications, but unfortunately, 3D data from a passive vision system are often insufficient for a tradi...
Maxime Lhuillier, Long Quan
CVPR
2004
IEEE
14 years 6 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 6 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
CVPR
2009
IEEE
14 years 12 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...