Optimal Algorithm for Shape from Shading and Path Planning

An optimal algorithm for the reconstruction of a surface from its shading image is presented. The algorithm solves the 3D reconstruction from a single shading image problem. The shading image is treated as a penalty function and the height of the reconstructed surface is a weighted distance. A consistent numerical scheme based on Sethian's fast marching method is used to compute the reconstructed surface. The surface is a viscosity solution of an Eikonal equation for the vertical light source case. For the oblique light source case, the reconstructed surface is the viscosity solution to a different partial differential equation. A modification of the fast marching method yields a numerically consistent, computationally optimal, and practically fast algorithm for the classical shape from shading problem. Next, the fast marching method coupled with a back tracking via gradient descent along the reconstructed surface is shown to solve the path planning problem in robot navigation.

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

[2]  J. Sethian,et al.  An O(N log N) algorithm for shape modeling. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

[5]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[6]  P. Gács,et al.  Algorithms , 1992 .

[7]  Wojciech Chojnacki,et al.  Direct computation of shape from shading , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[8]  Alfred M. Bruckstein,et al.  Tracking Level Sets by Level Sets: A Method for Solving the Shape from Shading Problem , 1995, Comput. Vis. Image Underst..

[9]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Piet W. Verbeek,et al.  Shading from shape, the eikonal equation solved by grey-weighted distance transform , 1990, Pattern Recognit. Lett..

[11]  Ron Kimmel,et al.  Efficient Dilation, Erosion, Opening and Closing Algorithms , 2000, ISMM.

[12]  P. Lions,et al.  Shape-from-shading, viscosity solutions and edges , 1993 .

[13]  Laurent D. Cohen,et al.  Global Minimum for Active Contour Models: A Minimal Path Approach , 1997, International Journal of Computer Vision.

[14]  P. Dupuis,et al.  An Optimal Control Formulation and Related Numerical Methods for a Problem in Shape Reconstruction , 1994 .

[15]  J. Sethian,et al.  Fast Voronoi Diagrams and Offsets on Triangulated Surfaces , 2000 .

[16]  Laurent D. Cohen,et al.  Minimal Paths in 3D Images and Application to Virtual Endoscopy , 2000, ECCV.

[17]  P. Lions,et al.  User’s guide to viscosity solutions of second order partial differential equations , 1992, math/9207212.

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  RosenfeldAzriel,et al.  Improved methods of estimating shape from shading using the light source coordinate system , 1985 .

[20]  J. Sethian.  Level set methods : evolving interfaces in geometry, fluid mechanics, computer vision, and materials science , 1996 .

[21]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

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

[23]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

[24]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[25]  Olivier D. Faugeras,et al.  Shape From Shading , 2006, Handbook of Mathematical Models in Computer Vision.

[26]  Berthold K. P. Horn.  Obtaining shape from shading information , 1989 .

[27]  Alfred M. Bruckstein,et al.  Global Shape from Shading , 1996, Comput. Vis. Image Underst..

[28]  G. Swaminathan.  Robot Motion Planning , 2006 .

[29]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[30]  Berthold K. P. Horn.  Height and gradient from shading , 1989, International Journal of Computer Vision.