Shape from shading: A survey

    Authors

    R. Zhang; P. S. Tsai; J. E. Cryer;M. Shah

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    IEEE Trans. Pattern Anal. Mach. Intell.

    Keywords

    shape from shading; analysis of algorithms; Lambertian model; survey of; shape from shading algorithms; SURFACE; Computer Science, Artificial Intelligence; Engineering, Electrical &; Electronic

    Abstract

    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 (Z) error, mean of surface gradient (p, q) 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.

    Journal Title

    Ieee Transactions on Pattern Analysis and Machine Intelligence

    Volume

    21

    Issue/Number

    8

    Publication Date

    1-1-1999

    Document Type

    Article

    Language

    English

    First Page

    690

    Last Page

    706

    WOS Identifier

    WOS:000081993000002

    ISSN

    0162-8828

    Share

    COinS