Nonlinearities and Noise Reduction in 3-Source Photometric Stereo

Abstract1-D Leap-Frog (L. Noakes, J. Math. Australian Soc. A, Vol. 64, pp. 37–50, 1999) is an iterative scheme for solving a class of nonquadratic optimization problems. In this paper a 2-D version of Leap-Frog is applied to a non optimization problem in computer vision, namely the recovery (so far as possible) of an unknown surface from 3 noisy camera images. This contrasts with previous work on photometric stereo, in which noise is added to the gradient of the height function rather than camera images. Given a suitable initial guess, 2-D Leap-Frog is proved to converge to the maximum-likelihood estimate for the vision problem. Performance is illustrated by examples.

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

[2]  Stefan Zubrzycki,et al.  Lectures in probability theory and mathematical statistics , 1972 .

[3]  Alfred M. Bruckstein,et al.  Integrability disambiguates surface recovery in two-image photometric stereo , 1992, International Journal of Computer Vision.

[4]  Lyle Noakes,et al.  The 2-D Leap-Frog: Integrability, Noise, and Digitization , 2000, Digital and Image Geometry.

[5]  Ryszard Kozera.  On Shape Recovery from Two Shading Patterns , 1992, Int. J. Pattern Recognit. Artif. Intell..

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

[7]  W. Hackbusch.  Iterative Solution of Large Sparse Systems of Equations , 1993 .

[8]  Reinhard Klette,et al.  Computer vision - three-dimensional data from images , 1998 .

[9]  R. Kozera.  Existence and uniqueness in photometric stereo , 1991 .

[10]  Rama Chellappa,et al.  Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Lyle Noakes,et al.  2D leapfrog algorithm for optimal surface reconstruction , 1999, Optics & Photonics.

[12]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

[13]  Reinhard Klette,et al.  Lawn-mowing algorithm for noisy gradient vector fields , 1999, Optics & Photonics.

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

[15]  L. Noakes.  A Global algorithm for geodesics , 1998, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.