Subscribe
Issue No.08 - August (1999 vol.21)
pp: 690-706
ABSTRACT
<p><b>Abstract</b>—Since the first shape-from-shading (SFS) technique was developed by Horn in the early 1970s, many different approaches have emerged. In this paper, six well-known SFS algorithms are implemented and compared. The performance of the algorithms was analyzed on synthetic images using mean and standard deviation of depth (<tmath>$Z$</tmath>) error, mean of surface gradient (<tmath>$p$</tmath>, <tmath>$q$</tmath>) error, and CPU timing. Each algorithm works well for certain images, but performs poorly for others. In general, minimization approaches are more robust, while the other approaches are faster. The implementation of these algorithms in C and images used in this paper are available by anonymous ftp under the pub/tech_paper/survey directory at eustis.cs.ucf.edu (132.170.108.42). These are also part of the electronic version of paper.</p>
INDEX TERMS
Shape from shading, analysis of algorithms, Lambertian model, survey of shape from shading algorithms.
CITATION
Ruo Zhang, Ping-Sing Tsai, James Edwin Cryer, Mubarak Shah, "Shape from Shading: A Survey", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.21, no. 8, pp. 690-706, August 1999, doi:10.1109/34.784284