1390 search results - page 26 / 278 » Computing the depth of a flat |
73
Voted
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
CVPR
2012
IEEE
13 years 3 days ago
2012
IEEE
In this paper, we propose a novel dense depth recovery method for a trinocular video sequence. Specifically, we contribute a novel trinocular stereo matching model, which can eff...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE