Algorithms for Shape from Shading and Occluding Boundaries

Lee, David

doi:10.1109/CVPR.1988.196278

Algorithms for Shape from Shading and Occluding Boundaries

David Lee

CVPR 1988 pp. 478-485

doi:10.1109/CVPR.1988.196278 /cvpr/1988/lee1988cvpr-algorithms/

Abstract

The problem of shape from shading and occluding boundaries can be reduced to solving a system of nonlinear equations for a smoothing spline, using regularization. The author discusses some theoretical issues corrected with this problem. He studies the existence and uniqueness of the smoothing spline. For solving the system of equations, he presents an iterative algorithm and proves that it converges to the unique solution for arbitrary regions. He also discusses efficient implementations of the iterative method, and analyzes their computational complexity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Lee. "Algorithms for Shape from Shading and Occluding Boundaries." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196278

Markdown

[Lee. "Algorithms for Shape from Shading and Occluding Boundaries." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/lee1988cvpr-algorithms/) doi:10.1109/CVPR.1988.196278

BibTeX

@inproceedings{lee1988cvpr-algorithms,
  title     = {{Algorithms for Shape from Shading and Occluding Boundaries}},
  author    = {Lee, David},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1988},
  pages     = {478-485},
  doi       = {10.1109/CVPR.1988.196278},
  url       = {https://mlanthology.org/cvpr/1988/lee1988cvpr-algorithms/}
}