Sciweavers

2009 search results - page 68 / 402
» Dense Interest Points
Sort
View
3DPVT
2002
IEEE
146views Visualization» more  3DPVT 2002»
14 years 1 months ago
Geometry of Contour-based Correspondence for Stereo
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
Steven W. Zucker, Gang Li
SIGGRAPH
1993
ACM
14 years 3 days ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
ACCV
2010
Springer
13 years 9 months ago
Efficient Large-Scale Stereo Matching
ACCV In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a ...
Andreas Geiger, Martin Roser and Raquel Urtasun
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 8 months ago
Accelerating Scientific Computations with Mixed Precision Algorithms
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
Marc Baboulin, Alfredo Buttari, Jack Dongarra, Jak...
BMVC
2010
13 years 6 months ago
Sparse Sparse Bundle Adjustment
Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where c...
Kurt Konolige