[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Shape from shading through photometric motion

  • Theoretical Advances
  • Published:
Pattern Analysis and Applications Aims and scope Submit manuscript

Abstract

We present a new shape from shading algorithm, extending to the single-input case, a recently introduced approach to the photometric motion process. As proposed by Pentland, photometric motion is based on the intensity variation, due to the motion, at a given point on a rotating surface. Recently, an alternative formulation has also appeared, based on the intensity change at a fixed image location. Expressing this as a function of reflectance-map and motion-field parameters, a constraint on the shape of the imaged surface can be obtained. Coupled with an affine matching constraint, this has been shown to yield a closed-form expression for the surface function. Here, we extend such formulation to the single-input case, by using the Green’s function of an affine matching equation to generate an artificial pair to the input image, corresponding to an approximate rendition of the imaged surface under a rotated view. Using this, we are able to obtain high quality shape-from-shading estimates, even under conditions of unknown reflectance map and light source direction, as demonstrated here by an extensive experimental study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  1. Zhang R, Tsai P-S, Cryer JE, Shah M (1999) Shape from shading: a survey. IEEE Trans Pattern Anal Mach Intell 21:690–706

    Article  Google Scholar 

  2. Woodham RJ (1980) Photometric method for determining surface orientation from multiple images. Opt Eng 19(1):139–144

    Google Scholar 

  3. Torreão JRA, Fernandes JL (1998) Matching photometric stereo images. J Opt Soc Am A 15(12):2966–2975

    Article  Google Scholar 

  4. Torreão JRA (2001) A Green’s function approach to shape from shading. Pattern Recogn 34:2367–2382

    Article  MATH  Google Scholar 

  5. Torreão JRA (1999) A new approach to photometric stereo. Pattern Recognit Lett 20(5):535–540

    Article  Google Scholar 

  6. Pentland AP (1991) Photometric motion. IEEE Trans Pattern Anal Mach Intell 13(9):879–890

    Article  Google Scholar 

  7. Pentland AP (1990) Linear shape from shading. Int J Comput Vis 4:153–162

    Article  Google Scholar 

  8. Torreão JRA, Fernandes JL, Leitão HCG (2007) A novel approach to photometric motion. Image Vis Comput 27:126–135

    Article  Google Scholar 

  9. Torreão JRA, Fernandes JL (2004) From photometric motion to shape from shading. In: Proceedings of XVII Brazilian symposium on computer graphics and image processing. IEEE Computer Society, pp 186–192

  10. Brooks MJ, Horn BKP (1985) Shape and source from shading. In: Proceedings of international conference on artificial intelligence, pp 932–936

  11. Frankot RT, Chellappa R (1988) A method for enforcing integrability in shape from shading algorithms. IEEE Trans Pattern Anal Mach Intell 10:439–451

    Article  MATH  Google Scholar 

  12. Torreão JRA (1995) Bayesian shape estimation: shape from shading and photometric stereo revisited. Mach Vis Appl 8(3):163–172

    Article  Google Scholar 

  13. Worthington PL, Hancock ER (1999) New constraints on data-closeness and needle map consistency for shape-from-shading. IEEE Trans Pattern Anal Mach Intell 21:1250–1267

    Article  Google Scholar 

  14. Samaras D, Metaxas D (2003) Incorporating illumination constraints in deformable models for shape from shading and light direction estimation. IEEE Trans Pattern Anal Mach Intell 25(2):247–264

    Article  Google Scholar 

  15. Kimmel R, Bruckstein AM (1995) Tracking level sets by level sets: a method for solving the shape from shading problem. Comput Vis Image Underst 62(1):47–58

    Article  Google Scholar 

  16. Horn BKP (1970) Shape from shading: a method for obtaining the shape of a smooth opaque object from one view. PhD Thesis, MIT Press, Cambridge, MA

  17. Oliensis J, Dupuis P (1993) A global algorithm for shape from shading. In: Proceedings of international conference on computer vision, pp 692–701

  18. Pentland AP (1984) Local shading analysis. IEEE Trans Pattern Anal Mach Intell 6:170–187

    Article  Google Scholar 

  19. Lee CH, Rosenfeld A (1985) Improved methods of estimating shape from shading using the light source coordinate system. Artif Intell 26:125–143

    Article  MATH  MathSciNet  Google Scholar 

  20. Tsai PS, Shah M (1994) Shape from shading using linear approximation. Image Vis Comput 12(8):487–498

    Article  Google Scholar 

  21. Durou J-D, Falcone M, Sagona M (2008) Numerical methods for shape from shading. CVIU 109:22–43

    Google Scholar 

  22. Falcone M, Sagona M (1997) An algorithm for the global solution of the shape from shading model. In: Proceedings of 9th international conference on image analysis and processing. Lecture Notes in Computer Science, vol 1310, pp 596–603

  23. Daniel P, Durou J-D (2000) From deterministic to stochastic methods for shape from shading. In: Proceedings of 4th Asian conference on computer vision, pp 187–192

  24. Hasegawa JK, Tozzi CL (1996) Shape from shading with perspective projection and camera calibration. Comput Graph 20(3):351–364

    Article  Google Scholar 

  25. Prados E, Faugeras O, Camilli F (2004) Shape from shading, a well posed problem? Technical Report no. 5297, INRIA-Sophia Antipolis

  26. Angelopoulou E, Williams J (1999) Photometric surface analysis in a tri-luminal environment. In: Proceedings of international conference on computer vision, pp 442–447

  27. Sakarya U, Erkmen I (2003) An improved method of photometric stereo using local shape from shading. Image Vis Comput 21:941–954

    Article  Google Scholar 

  28. Joshi MV, Chaudhuri S (2005) Joint blind restoration and surface recovery in photometric stereo. J Opt Soc Am A 22(6):1066–1076

    Article  Google Scholar 

  29. Hertzmann A, Seitz S (2005) Example-based photometric stereo: shape reconstruction with general, varying BRDFs. IEEE Trans PAMI 27(8):1254–1264

    Google Scholar 

  30. Basri R, Jacobs D, Kemelmacher I (2007) Photometric stereo with general, unkown lighting. Int J Comput Vis 72(3):239–257

    Article  Google Scholar 

  31. Zhang R, Tsai P-S, Shah M (1996) Photomotion. Comput Vis Image Underst 63(2):221–231

    Article  Google Scholar 

  32. Fua P, Leclerc YG (1995) Object-centered surface reconstruction: combining multi-image stereo and shading. Intl J Comput Vis 16(1):35–56

    Article  Google Scholar 

  33. Samaras D, Metaxas D, Fua P, Leclerc Y G (2000) Variable albedo surface reconstruction from stereo and shape from shading. In: Proceedings of IEEE computer vision and pattern recognition, pp 480–487

  34. Torreão JRA (2003) Geometric-photometric approach to monocular shape estimation. Image Vis Comput 21:1045–1061

    Article  Google Scholar 

  35. Torreão JRA (2007) Disparity estimation through Green’s functions of matching equations. Biol Cybern 97:307–316

    Article  MATH  Google Scholar 

  36. Ferreira P E Jr, Torreão JRA, Carvalho PCP, Vieira MB (2008) Motion synthesis through 1D affine matching. Pattern Anal Appl 11:45–58

    Article  Google Scholar 

  37. Marcelja S (1980) Mathematical description of the responses of simple cortical cells. J Opt Soc Am 70:1297–1300

    Article  MathSciNet  Google Scholar 

  38. Ohzawa I, DeAngelis GC, Freeman RD (1990) Stereoscopic depth discrimiantion in the visual cortex: neurons ideally suited as disparity detectors. Science 249:1037–1041

    Article  Google Scholar 

  39. Fanany MI, Kumuzawa I (2004) A neural network for recovering 3D shape from erroneous and few depth maps of shaded images. Pattern Recognit Lett 25(4):377–389

    Article  Google Scholar 

  40. Prados E, Faugeras O, Rouy E (2002) Shape from shading and viscosity solutions. Technical Report no. 4638, INRIA-Sophia Antipolis

  41. Samaras D, Metaxas D (2000) Incorporating illumination constraints in deformable models. In: Proceedings of IEEE computer vision and pattern recognition, pp 322–329

  42. Torreão JRA, Amaral MS (2006) Efficient, recursively implemented differential operator, with application to edge detection. Pattern Recognit Lett 27(9):987–995

    Article  Google Scholar 

  43. Lehky SR, Sejnowski TJ (1988) Network model of shape-from-shading: neural function arises from both receptive and projective fields. Nature 333:452–454

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to João L. Fernandes.

Appendix

Appendix

Here, we derive the Green’s function of the differential equation (21). Identifying k ≡ a/σ 2, let us rewrite that equation as

$$ \frac{1}{2}I_{2}^{\prime \prime } + \left( {\frac{x + a}{{\sigma^{2} }}} \right)I_{2}^{\prime } + \frac{1}{2}\left[ {k^{2} + \frac{{(x + a)^{2} + \sigma^{2} }}{{\sigma^{4} }}} \right]I_{2} = k^{2} I_{1} .$$
(31)

The Green’s function, G(x,x 0), will then satisfy

$$ \frac{1}{2}G^{\prime\prime}(x,x_{0} ) + \left( {\frac{x + a}{{\sigma^{2} }}} \right)G^{\prime}(x,x_{0} ) + \frac{1}{2}\left[ {k^{2} + \frac{{(x + a)^{2} + \sigma^{2} }}{{\sigma^{4} }}} \right]G(x,x_{0} ) = k^{2} \delta (x - x_{0} ) .$$
(32)

The impulse function vanishes identically for x > x 0 or x < x 0, and thus G(x,x 0) will be the homogeneous solution to (32), as long as x ≠ x 0. This is easily found to be the Gabor function

$$ W(x) = e^{ikx} e^{{ - \frac{{(x + a)^{2} }}{{2\sigma^{2} }}}} .$$
(33)

On the other hand, at x = x 0, G(x,x 0) must be such that the left-hand side of (32) yields an impulse discontinuity. Assuming G(x,x 0) to be continuous, and integrating both sides of (32) with respect to x, around x = x 0, we find that this requires a discontinuity in derivative at x 0, namely,

$$ G^{\prime}(x_{0 + } ,x_{0} ) - G^{\prime}(x_{0 - } ,x_{0} ) = 2k^{2} ,$$
(34)

where \( x_{0 + } = x_{0} + \varepsilon , \) and \( x_{0 - } = x_{0} - \varepsilon , \) for an infinitesimal ε.

Bearing such conditions in mind, we find that a bounded G(x, x 0), tending to zero at infinity, can be obtained as the imaginary part of the complex kernel

$$ K(x,x_{0} ) = \left\{ {\begin{array}{*{20}c} {N(x_{0} )W(x)W(x_{0} )} & {x > x_{0} } \\ 0 & {x < x_{0} } \\ \end{array} } \right. $$
(35)

K(x,x 0) will then, by construction, satisfy (32) for x > x 0 or x < x 0, there remaining only the factor N(x 0) to be determined from the discontinuity condition of (34). After some trivial manipulation, this yields

$$ N(x_{0} ) = \frac{{2k^{2} }}{{\text{Im} [W^{\prime}(x_{0} )W^{*}(x_{0} )]}} ,$$
(36)

and we obtain

$$ G(x,x_{0} ) = 2k^{2} \frac{{\text{Im} [W(x)W^{*}(x_{0} )]}}{{\text{Im} [W^{\prime}(x_{0} )W^{*}(x_{0} )]}} .$$
(37)

Substituting W(x) from (33), we finally get

$$ G(x,x_{0} ) = 2k\sin [k(x - x_{0} )]e^{{ - \left[ {\frac{{(x + a)^{2} - (x_{0} + a)^{2} }}{{2\sigma^{2} }}} \right]}} ,$$
(38)

thus completing our proof.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernandes, J.L., Torreão, J.R.A. Shape from shading through photometric motion. Pattern Anal Applic 13, 35–58 (2010). https://doi.org/10.1007/s10044-009-0156-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10044-009-0156-z

Keywords

Navigation