Shape from intensity gradient

We propose a new shape-from-shading (SFS) algorithm which replaces the brightness constraint with an intensity gradient constraint. This is a global approach which obtains the solution by the minimization of an error function over the entire image. Through the linearization of the gradient of the reflectance map and the discretization of the surface gradient, the intensity gradient can be expressed as a linear function of the surface height. A quadratic error function, which involves the intensity gradient constraint and the traditional smoothness constraint, is minimized efficiently by solving a sparse linear system using the multigrid technique. Neither the information at singular points nor the information at occluding boundaries is needed for the initialization of the height. Results for real images are presented to show the robustness of the algorithm, and the execution time is demonstrated to prove its efficiency.

[1]  John Oliensis,et al.  A global algorithm for shape from shading , 1993, 1993 (4th) International Conference on Computer Vision.

[2]  Richard Szeliski,et al.  Fast shape from shading , 1990, CVGIP Image Underst..

[3]  P. Dupuis,et al.  Direct method for reconstructing shape from shading , 1991, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  Takeo Kanade,et al.  Surface Reflection: Physical and Geometrical Perspectives , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Alex Pentland,et al.  Local Shading Analysis , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Rama Chellappa,et al.  Estimation of illuminant direction, albedo, and shape from shading , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Katsushi Ikeuchi,et al.  Numerical Shape from Shading and Occluding Boundaries , 1981, Artif. Intell..

[8]  Demetri Terzopoulos,et al.  Multilevel computational processes for visual surface reconstruction , 1983, Comput. Vis. Graph. Image Process..

[9]  Takeo Kanade,et al.  Shape from interreflections , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[10]  Berthold K. P. Horn.  SHAPE FROM SHADING: A METHOD FOR OBTAINING THE SHAPE OF A SMOOTH OPAQUE OBJECT FROM ONE VIEW , 1970 .

[11]  Aaron F. Bobick,et al.  The direct computation of height from shading , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[12]  David A. Forsyth,et al.  Mutual illumination , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  W. Singer,et al.  Long-range synchronization of oscillatory light responses in the cat retina and lateral geniculate nucleus , 1996, Nature.

[14]  Alex Pentland,et al.  A simple algorithm for shape from shading , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  Mubarak Shah,et al.  Shape from shading using linear approximation , 1994, Image Vis. Comput..

[16]  J. Oliensis,et al.  Shape from shading as a partially well-constrained problem , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Azriel Rosenfeld,et al.  Improved Methods of Estimating Shape from Shading Using the Light Source Coordinate System , 1985, Artif. Intell..

[18]  C.-C. Jay Kuo,et al.  Shape from Shading with a Linear Triangular Element Surface Model , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[20]  Alex Pentland,et al.  Shape Information From Shading: A Theory About Human Perception , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[21]  Michael J. Brooks,et al.  Shape and Source from Shading , 1985, IJCAI.