Sciweavers

165 search results - page 9 / 33
» Stereo Matching as a Nearest-Neighbor Problem
Sort
View
CVPR
2006
IEEE
14 years 10 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
ECCV
2002
Springer
14 years 10 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
CVPR
2004
IEEE
14 years 10 months ago
Learning Methods for Generic Object Recognition with Invariance to Pose and Lighting
We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter...
Fu Jie Huang, Léon Bottou, Yann LeCun
CVPR
2004
IEEE
14 years 10 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
ECCV
2008
Springer
14 years 10 months ago
SIFT Flow: Dense Correspondence across Different Scenes
While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition tha...
Ce Liu, Jenny Yuen, Antonio B. Torralba, Josef Siv...