ML Anthology

Polynomial Shape from Shading

Ady Ecker, Allan D. Jepson
CVPR 2010 pp. 145-152
doi:10.1109/CVPR.2010.5540219 /cvpr/2010/ecker2010cvpr-polynomial/

Abstract

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.

PDF CVPR Semantic Scholar

Cite

Text

Ecker and Jepson. "Polynomial Shape from Shading." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010. doi:10.1109/CVPR.2010.5540219

Markdown

[Ecker and Jepson. "Polynomial Shape from Shading." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010.](https://mlanthology.org/cvpr/2010/ecker2010cvpr-polynomial/) doi:10.1109/CVPR.2010.5540219

BibTeX

@inproceedings{ecker2010cvpr-polynomial,
  title     = {{Polynomial Shape from Shading}},
  author    = {Ecker, Ady and Jepson, Allan D.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2010},
  pages     = {145-152},
  doi       = {10.1109/CVPR.2010.5540219},
  url       = {https://mlanthology.org/cvpr/2010/ecker2010cvpr-polynomial/}
}