A Fast Linear Shape from Shading
Abstract
A method for computing depth from a single shaded image is presented. Discrete approximations for p and q using finite differences are used, and the reflectance in Z/sub ij/ is linearized. The method is faster, since each operation is purely local. In addition, it gives good results for spherical surfaces, in contrast to other linear methods.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Tsai and Shah. "A Fast Linear Shape from Shading." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223187Markdown
[Tsai and Shah. "A Fast Linear Shape from Shading." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/tsai1992cvpr-fast/) doi:10.1109/CVPR.1992.223187BibTeX
@inproceedings{tsai1992cvpr-fast,
title = {{A Fast Linear Shape from Shading}},
author = {Tsai, Ping-Sing and Shah, Mubarak},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {734-736},
doi = {10.1109/CVPR.1992.223187},
url = {https://mlanthology.org/cvpr/1992/tsai1992cvpr-fast/}
}