Sciweavers

CVPR
2010
IEEE

Polynomial Shape from Shading

13 years 10 months ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects. For the general case we propose a semidefinite programming relaxation procedure, and an exact line search iterative procedure with a new smoothness term that favors folds at edges. We use this numerical technique to inspect shading ambiguities.
Ady Ecker, Allan Jepson
Added 23 Jun 2010
Updated 23 Jun 2010
Type Conference
Year 2010
Where CVPR
Authors Ady Ecker, Allan Jepson
Comments (0)