Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities

We consider the problem of reconstructing a smooth surface under constraints that have discrete ambiguities. These problems arise in areas such as shape from texture, shape from shading, photometric stereo and shape from defocus. While the problem is computationally hard, heuristics based on semidefinite programming may reveal the shape of the surface.

• Type: Conference
• Year: 2008
• Where: ECCV
• Authors: Ady Ecker, Allan D. Jepson, Kiriakos N. Kutulakos
• Keywords: Computer Vision, Discrete Ambiguities, ECCV 2008, Smooth Surface