Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Tankus, A., Sochen, N., Yeshurun, Y.: A new prespective on shape from shading. In: Proceeding of 9th ICCV, 2, 862–869 (2003)
Tankus, A., Sochen, N., Yeshurun, Y.: Perspective shape from shading by fast marching. In: Proceedings of IEE Computer Society Conference on Computer Vision and, Pattern Recognition, (2004)
Tankus, A., Sochen, N., Yeshurun, Y.: Shape from shading under perspective projection. Int. J. Comp. Vision 63(1), 21–43 (2005)
Tankus, A., Sochen, N., Yeshurun, Y.: Shape from shading by iterative fast marching for vertical and oblique light source, geometric properties for incomplete data, Springer, Netherlands 1, 237–258 (2006)
Ascher, U.M., Carter, P.M.: A multigrid method for shape from shading. SIAM J. Numer. Anal. 30(1), 102–115 (1993)
Cristiani, E., Fast marching and semi-lagrangian methods for hamilton-jacobi equations with applications, Ph.D. thesis, Dipartimento di Metodi e Modelli Matematici per le Scienze Applicate, SAPIENZA Universit‘a di Roma, Rome, Italy (2007) www.iac.rm.cnr.it/_cristiani/attach/ECristianiPhDthesis.pdf
Cristiani, E., Falcone, M., Seghini, A.: Some remarks on perspective shape-from-shading models. In: Proceedings 1st International conference Scale Space and Variational Methods in Computer Vision, Ischia, Italy, 2007, In: Sgallari, F., Murli, A., Paragios, N. (eds.) vol. 4485 of LNCS, 276–287
Prados, E., Faugeras, O.: Perspective shape from shading and viscosity solution. In: Proceedings of 9th ICCV, 2, 826–831 (2003)
Prados, E., Soatto, S.: Fast marching method for generic shape from shading. In: Proceedings of VLSM’05. Third International Workshop on Variational Geometry and Level Set Method in Computer Vision, LNCS 3752, 320–331 (2005)
Rouy, E., Tourin, A.: A viscosity solution approach to shape from shading. SIAM J. Numer. Anal. 29(3), 867–884 (1992)
Horn, B.K.P., Brooks, M.J.: Shape from shading. The MIT Press, Cambridge (1989)
Bichsel, M., Pentland, A.P.: A simple algorithm for shape from shading. In: Proceedings of CVPR, 459–465 (1992)
Breu, M., Cristiani, E., Durou, J.-D., Falcone, M., Vogel, O.: Numerical algorithms for Perspective Shape from Shading, Kybernetika, 46, 207–225 (2010). http://www.kybernetika.cz/content/2010/2/207
Dupis, P., Oliensis, J., Direct method for reconstructing shape from shading. In: Proceedings of CVPR, 453–458 (1992)
Kimmel, R., Sethian, J.A.: Optimal algorithm for shape from shading and path planning. J. Math. Imaging Vision 14(3), 237–244 (2001)
Zhang, R., Tsai, P.S., Cryer, j.E., Shah, M.: Shape from shading: a survey. IEEE Trans. Pattern Anal. Mach. Intell. 21(8), 690–706 (1999)
Yuen, S.Y., Tsui, Y.Y., Leung, Y.W., Chen, R.M.M.: Fast marching method for shape from shading under perspective projection. In: 2nd international Conference Visualization, Imaging and Image Processing, 584–589 (2002)
Yuen, S.Y., Tsui, Y.Y., Chow, C.K.: A fast marching formulation of perspective shape from shading under frontal illumination. Pattern Recogn. Lett. 28, 806–824 (2007)
Sean, M.: Efficient algorithms for solving static Hamilton-Jacobi equations, Ph.D. thesis, California Institute of Technology Pasadena, California (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Gupta, G., Kumar, M. (2014). An Iterative Marching with Correctness Criterion Algorithm for Shape from Shading Under Oblique Light Source. In: Babu, B., et al. Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012. Advances in Intelligent Systems and Computing, vol 236. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1602-5_57
Download citation
DOI: https://doi.org/10.1007/978-81-322-1602-5_57
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1601-8
Online ISBN: 978-81-322-1602-5
eBook Packages: EngineeringEngineering (R0)