DocumentCode
2992902
Title
Algorithms for shape from shading and occluding boundaries
Author
Lee, David
Author_Institution
AT&T Bell Lab., Murray Hill, NJ, USA
fYear
1988
fDate
5-9 Jun 1988
Firstpage
478
Lastpage
485
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
Keywords
computational complexity; computerised pattern recognition; splines (mathematics); computational complexity; computerised pattern recognition; existence; iterative algorithm; occluding boundaries; regularization; shading; shape; smoothing spline; uniqueness; Boundary conditions; Brightness; Computational complexity; Image converters; Iterative algorithms; Iterative methods; Linear systems; Nonlinear equations; Shape; Spline;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1988. Proceedings CVPR '88., Computer Society Conference on
Conference_Location
Ann Arbor, MI
ISSN
1063-6919
Print_ISBN
0-8186-0862-5
Type
conf
DOI
10.1109/CVPR.1988.196278
Filename
196278
Link To Document