Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities |
 |
| Overview | |
| We consider the problem of reconstructing a smooth surface under constraints that have discrete ambiguiti es. 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. | |
| People | |
| Allan D. Jepson (University of Toronto) | |
| Kiriakos N. Kutulakos (University of Toronto) | |
| Ady Ecker (University of Toronto) | |
| Related Publications | |
| Ady Ecker, Kiriakos N. Kutulakos and Allan D. Jepson, Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities. Proc. 10th European Conf. on Computer Vision, Marseilles, France, 2008. PDF (3054KB) | |
| Acknowledgements | |
| This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under the RGPIN program and by an Ontario Premier's Research Excellence Award. | |
| Site last modified on Tuesday, September 8, 2009 Send questions or comments about this page to Kyros Kutulakos |