Advertisement

What Is the Range of Surface Reconstructions from a Gradient Field?

  • Amit Agrawal
  • Ramesh Raskar
  • Rama Chellappa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3951)

Abstract

We propose a generalized equation to represent a continuum of surface reconstruction solutions of a given non-integrable gradient field. We show that common approaches such as Poisson solver and Frankot-Chellappa algorithm are special cases of this generalized equation. For a N × N pixel grid, the subspace of all integrable gradient fields is of dimension N 2 – 1. Our framework can be applied to derive a range of meaningful surface reconstructions from this high dimensional space. The key observation is that the range of solutions is related to the degree of anisotropy in applying weights to the gradients in the integration process. While common approaches use isotropic weights, we show that by using a progression of spatially varying anisotropic weights, we can achieve significant improvement in reconstructions. We propose (a) α-surfaces using binary weights, where the parameter α allows trade off between smoothness and robustness, (b) M-estimators and edge preserving regularization using continuous weights and (c) Diffusion using affine transformation of gradients. We provide results on photometric stereo, compare with previous approaches and show that anisotropic treatment discounts noise while recovering salient features in reconstructions.

Keywords

Span Tree Surface Reconstruction Laplacian Matrix Photometric Stereo Correction Gradient 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Horn, B.: Height and gradient from shading. Int’l J. Computer Vision 5, 37–75 (1990)CrossRefGoogle Scholar
  2. 2.
    Horn, B.: Determining lightness from an image. Comput. Graphics, Image Processing 3, 277–299 (1974)CrossRefGoogle Scholar
  3. 3.
    Fattal, R., Lischinski, D., Werman, M.: Gradient domain high dynamic range compression. ACM Trans. Graph. 21, 249–256 (2002)CrossRefGoogle Scholar
  4. 4.
    Agrawal, A., Raskar, R., Nayar, S., Li, Y.: Removing photography artifacts using gradient projection and flash-exposure sampling. ACM Trans. Graph. 24, 828–835 (2005)CrossRefGoogle Scholar
  5. 5.
    Forsyth, D.: Shape from texture and integrability. In: Proc. Int’l Conf. Computer Vision, pp. 447–452 (2001)Google Scholar
  6. 6.
    Belhumeur, P., Kriegman, D., Yuille, A.: The bas-relief ambiguity. Int’l J. Computer Vision 35, 33–44 (1999)CrossRefGoogle Scholar
  7. 7.
    Simchony, T., Chellappa, R., Shao, M.: Direct analytical methods for solving poisson equations in computer vision problems. IEEE Trans. Pattern Anal. Machine Intell. 12, 435–446 (1990)CrossRefMATHGoogle Scholar
  8. 8.
    Frankot, R.T., Chellappa, R.: A method for enforcing integrability in shape from shading algorithms. IEEE Trans. Pattern Anal. Machine Intell. 10, 439–451 (1988)CrossRefMATHGoogle Scholar
  9. 9.
    Yuille, A., Snow, D.: Shape and albedo from multiple images using integrability. In: Proc. Conf. Computer Vision and Pattern Recognition, pp. 158–164 (1997)Google Scholar
  10. 10.
    Petrovic, N., Cohen, I., Frey, B., Koetter, R., Huang, T.: Enforcing integrability for surface reconstruction algorithms using belief propagation in graphical models. In: Proc. Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 743–748 (2001)Google Scholar
  11. 11.
    Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Machine Intell. 23, 643–660 (2001)CrossRefGoogle Scholar
  12. 12.
    Kovesi, P.: Shapelets correlated with surface normals produce surfaces. In: Proc. Int’l Conf. Computer Vision, pp. 994–1001 (2005)Google Scholar
  13. 13.
    Perona, P., Malik, J.: Scale-space and edge detection using anisotropic diffusion. IEEE Trans. Pattern Anal. Machine Intell. 12, 629–639 (1990)CrossRefGoogle Scholar
  14. 14.
    Charbonnier, P., Blanc-Feraud, L., Aubert, G., Barluad, M.: Deterministic edge-preserving regularization in computed imaging. IEEE Trans. Image Processing 6, 298–311 (1997)CrossRefGoogle Scholar
  15. 15.
    Aubert, G., Kornprobst, P.: Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations. Applied Mathematical Sciences, vol. 147. Springer, Heidelberg (2002)MATHGoogle Scholar
  16. 16.
    Karacali, B., Snyder, W.: Noise reduction in surface reconstruction from a given gradient field. Int’l J. Computer Vision 60, 25–44 (2004)CrossRefGoogle Scholar
  17. 17.
    Fischler, M.A., Bolles, R.C.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Comm. of the ACM 24, 381–395 (1981)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Agrawal, A., Chellappa, R., Raskar, R.: An algebraic approach to surface reconstruction from gradient fields. In: Proc. Int’l Conf. Computer Vision, vol. 1, pp. 174–181 (2005)Google Scholar
  19. 19.
    Weickert, J.: Anisotropic Diffusion in Image Processing. PhD thesis, University of Kaiserslautern, Germany (1996)Google Scholar
  20. 20.
    Horovitz, I., Kiryati, N.: Depth from gradient fields and control points: Bias correction in photometric stereo. Image and Vision Computing 22, 681–694 (2004)CrossRefGoogle Scholar
  21. 21.
    Kimmel, R., Yavneh, I.: An algebraic multigrid approach to image analysis. SIAM J. Sci. Comput. 24, 1218–1231 (2003)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Amit Agrawal
    • 1
  • Ramesh Raskar
    • 2
  • Rama Chellappa
    • 1
  1. 1.Center for Automation ResearchUniversity of MarylandCollege ParkUSA
  2. 2.Mitsubishi Electric Research Labs (MERL)CambridgeUSA

Personalised recommendations