Sciweavers

1390 search results - page 39 / 278
» Computing the depth of a flat
Sort
View
MMM
2005
Springer
172views Multimedia» more  MMM 2005»
15 years 3 months ago
A Novel Approach of 3D Reconstruction of Human Face Using Monocular Camera
Three-dimensional model acquisition of an object is essential in many multimedia applications. Constructing three-dimensional models of objects from two-dimensional images is an o...
Ben Yip, Jesse S. Jin
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 1 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
ICCV
1998
IEEE
15 years 11 months ago
Depth Discontinuities by Pixel-to-Pixel Stereo
Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India An algorithm to detect depth discontinuities from a stereo pair of images is presented. The ...
Stan Birchfield, Carlo Tomasi
ICPR
2004
IEEE
15 years 10 months ago
Towards Shape from Shading under Realistic Photographic Conditions
This paper describes a new modeling of the shape from shading problem taking perspective projection into account, and proposes a method of resolution for the new equation. An appl...
Alain Crouzil, Frédéric Courteille, ...
FOCS
1991
IEEE
15 years 1 months ago
Communication Complexity Towards Lower Bounds on Circuit Depth
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
Jeff Edmonds, Steven Rudich, Russell Impagliazzo, ...