Direct Shape-from-Shading with Adaptive Higher Order Regularisation

Although variational methods are popular techniques in the context of shape-from-shading, they are in general restricted to indirect approaches that only estimate the gradient of the surface depth. Such methods suffer from two drawbacks: (i) They need additional constraints to enforce the integrability of the solution. (ii) They require the application of depth-from-gradient algorithms to obtain the actual surface. In this paper we present three novel approaches that avoid the aforementioned drawbacks by construction: (i) First, we present a method that is based on homogeneous higher order regularisation. Thus it becomes possible to estimate the surface depth directly by solving a single partial differential equation. (ii) Secondly, we develop a refined technique that adapts this higher order regularisation to semantically important structures in the original image. This addresses another drawback of existing variational methods: the blurring of the results due to the regularisation. (iii) Thirdly, we present an even further improved approach, in which the smoothness process is steered directly by the evolving depth map. This in turn allows to tackle the well-known problem of spontaneous concave-convex switches in the solution. In our experimental section both qualitative and quantitative experiments on standard shape-from-shading data sets are performed. A comparison to the popular variational method of Frankot and Chellappa shows the superiority of all three approaches.

[1]  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.

[2]  Michael J. Brooks,et al.  The variational approach to shape from shading , 1986, Comput. Vis. Graph. Image Process..

[3]  Alfred M. Bruckstein,et al.  Shape from shading: Level set propagation and viscosity solutions , 1995, International Journal of Computer Vision.

[4]  Antti Oulasvirta,et al.  Computer Vision – ECCV 2006 , 2006, Lecture Notes in Computer Science.

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

[6]  B. Brunt The calculus of variations , 2003 .

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

[8]  Ryszard Kozera An Overview of the shape-from-shading problem , 1998 .

[9]  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.

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

[11]  Jiří Matas,et al.  Computer Vision - ECCV 2004 , 2004, Lecture Notes in Computer Science.

[12]  Rama Chellappa,et al.  What Is the Range of Surface Reconstructions from a Gradient Field? , 2006, ECCV.

[13]  Olivier D. Faugeras,et al.  Shape from shading: a well-posed problem? , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[14]  Rama Chellappa,et al.  A Method for Enforcing Integrability in Shape from Shading Algorithms , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[17]  Olivier D. Faugeras,et al.  Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help , 2004, ECCV.

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