DocumentCode
951873
Title
Shape from shading with a linear triangular element surface model
Author
Lee, Kyoung Mu ; Kuo, C-C Jay
Author_Institution
Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA
Volume
15
Issue
8
fYear
1993
fDate
8/1/1993 12:00:00 AM
Firstpage
815
Lastpage
822
Abstract
The authors propose to combine a triangular element surface model with a linearized reflectance map to formulate the shape-from-shading problem. The main idea is to approximate a smooth surface by the union of triangular surface patches called triangular elements and express the approximating surface as a linear combination of a set of nodal basis functions. Since the surface normal of a triangular element is uniquely determined by the heights of its three vertices (or nodes), image brightness can be directly related to nodal heights using the linearized reflectance map. The surface height can then be determined by minimizing a quadratic cost functional corresponding to the squares of brightness errors and solved effectively with the multigrid computational technique. The proposed method does not require any integrability constraint or artificial assumptions on boundary conditions. Simulation results for synthetic and real images are presented to illustrate the performance and efficiency of the method
Keywords
image processing; optimisation; image brightness; image processing; linear triangular element surface model; linearized reflectance map; multigrid computational technique; optimisation; quadratic cost functional; shape-from-shading; Boundary conditions; Brightness; Computational modeling; Computer errors; Computer vision; Cost function; Iterative algorithms; Reflectivity; Shape; Surface reconstruction;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.236247
Filename
236247
Link To Document