An Iterative Marching with Correctness Criterion Algorithm for Shape from Shading Under Oblique Light Source

In this paper, a fast and robust Shape from Shading (SfS) algorithm by iterative marching with corrections criterion under oblique light source is presented. Usually, SfS algorithms are based on the assumption that image radiance is a function of normal surface alone. SfS algorithms solve first-order nonlinear Hamilton Jacobi equation called image irradiance equation. Both Fast Marching Method (FMM) and Marching with Correctness Criterion (MCC) basically work for the frontal light illumination direction, in which the image irradiance equation is an Eikonal equation. The problem task is to recover the surface from the image—which amounts to finding a solution to the Eikonal equation. FMM copes better the image irradiance iteratively under oblique light sources with the cost of computational complexity \(O(N log N)\). One prominent solution is the Marching with MCC of Mauch which solves the Eikonal equation with computational complexity \(O(N)\). Here, we present a new iterative variant of the MCC which copes better with images taken under oblique light sources. The proposed approach is evaluated on two synthetic real images and compared with the iterative variant of FMM. The experimental results show that the proposed approach, iterative variant of MCC is more efficient than the iterative variant of FMM.

[1]  Maurizio Falcone,et al.  Some Remarks on Perspective Shape-from-Shading Models , 2007, SSVM.

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

[3]  Olivier D. Faugeras,et al.  "Perspective shape from shading" and viscosity solutions , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[4]  Berthold K. P. Horn,et al.  Shape from shading , 1989 .

[5]  Ron Kimmel,et al.  Optimal Algorithm for Shape from Shading and Path Planning , 2001, Journal of Mathematical Imaging and Vision.

[6]  Stefano Soatto,et al.  Fast Marching Method for Generic Shape from Shading , 2005, VLSM.

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

[8]  Y. Yeshurun,et al.  Shape-from-Shading by Iterative Fast Marching for Vertical and Oblique Light Sources , 2006 .

[9]  Michael Breuß,et al.  Numerical algorithms for perspective shape from shading , 2010, Kybernetika.

[10]  Ping-Sing Tsai,et al.  Shape from Shading: A Survey , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Paul Dupuis,et al.  Direct method for reconstructing shape from shading , 1991, Optics & Photonics.

[12]  Yehezkel Yeshurun,et al.  A new perspective [on] shape-from-shading , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[13]  Shiu Yin Yuen,et al.  A fast marching formulation of perspective shape from shading under frontal illumination , 2007, Pattern Recognit. Lett..

[14]  Yehezkel Yeshurun,et al.  Perspective shape-from-shading by fast marching , 2004, CVPR 2004.

[15]  D. Meiron,et al.  Efficient algorithms for solving static hamilton-jacobi equations , 2003 .

[16]  Yehezkel Yeshurun,et al.  Shape-from-Shading Under Perspective Projection , 2005, International Journal of Computer Vision.

[17]  U. Ascher,et al.  A multigrid method for shape from shading , 1993 .

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