Shape From Shading Using Linear-Approximation

    Authors

    P. S. Tsai;M. Shah

    Comments

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

    Abbreviated Journal Title

    Image Vis. Comput.

    Keywords

    PHYSICS-BASED VISION; 3D SHAPE; SHAPE FROM SHADING; ILLUMINANT DIRECTION; Computer Science, Artificial Intelligence; Computer Science, Software; Engineering; Computer Science, Theory & Methods; Engineering, Electrical; & Electronic; Optics

    Abstract

    In this paper, we present an extremely simple algorithm for shape from shading, which can be implemented in 25 lines of C code*. The algorithm is very fast, taking 0.2 seconds on a Sun SparcStation-1 for a 128 x 128 image, and is purely local and highly parallelizable (parallel implementation included). In our approach, we employ a linear approximation of the reflectance function, as used by others. However. the main difference is that we first use the discrete approximations for surface normal, p and q, using finite differences, and then linearize the reflectance function in depth, Z(x, y), instead of p and q. The algorithm has been tested on several synthetic and real images of both Lambertian and specular surfaces. and good results have been obtained.

    Journal Title

    Image and Vision Computing

    Volume

    12

    Issue/Number

    8

    Publication Date

    1-1-1995

    Document Type

    Article

    Language

    English

    First Page

    487

    Last Page

    498

    WOS Identifier

    WOS:A1994PG38400002

    ISSN

    0262-8856

    Share

    COinS