Sciweavers

450 search results - page 46 / 90
» A new stereo matching algorithm for binocular vision
Sort
View
ICPR
2000
IEEE
16 years 26 days 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
PR
2010
148views more  PR 2010»
14 years 10 months ago
Registration and interactive planar segmentation for stereo images of polyhedral scenes
We introduce a two-step iterative segmentation and registration method to find coplanar surfaces among stereo images of a polyhedral environment. The novelties of this paper are:...
Javier-Flavio Vigueras, Mariano Rivera
CVPR
2008
IEEE
16 years 1 months ago
Least squares surface reconstruction from measured gradient fields
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
Matthew Harker, Paul O'Leary
ECCV
2002
Springer
16 years 1 months ago
Minimal Surfaces for Stereo
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
Chris Buehler, Steven J. Gortler, Michael F. Cohen...
MM
2004
ACM
188views Multimedia» more  MM 2004»
15 years 5 months ago
A new method to segment playfield and its applications in match analysis in sports video
With the growing popularity of digitized sports video, automatic analysis of them need be processed to facilitate semantic summarization and retrieval. Playfield plays the fundame...
Shuqiang Jiang, Qixiang Ye, Wen Gao, Tiejun Huang