Issue No. 08 - August (1993 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.236247
<p>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.</p>
image processing; optimisation; linear triangular element surface model; linearized reflectance map; shape-from-shading; image brightness; quadratic cost functional; multigrid computational technique; image processing; optimisation
K. Lee and C. Kuo, "Shape from Shading with a Linear Triangular Element Surface Model," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 815-822, 1993.