Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities
Abstract
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.
Cite
Text
Ecker et al. "Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities." European Conference on Computer Vision, 2008. doi:10.1007/978-3-540-88682-2_11Markdown
[Ecker et al. "Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities." European Conference on Computer Vision, 2008.](https://mlanthology.org/eccv/2008/ecker2008eccv-semidefinite/) doi:10.1007/978-3-540-88682-2_11BibTeX
@inproceedings{ecker2008eccv-semidefinite,
title = {{Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities}},
author = {Ecker, Ady and Jepson, Allan D. and Kutulakos, Kiriakos N.},
booktitle = {European Conference on Computer Vision},
year = {2008},
pages = {127-140},
doi = {10.1007/978-3-540-88682-2_11},
url = {https://mlanthology.org/eccv/2008/ecker2008eccv-semidefinite/}
}