A combinatorial method is used to reconstruct a surface by integrating a field of surface normals. An affinity function is defined over pairs of adjacent locations. This function is based on the surface’s principal curvature directions, which are intrinsic and can be estimated from the surface normals. The values of this locally supported function are propagated over the field of surface normals using a diffusion process. The surface normals are then regularised, by computing the weighted sum of the affinity evolved over time. Finally, the surface is reconstructed by integrating along integration paths that maximise the total affinity. Preliminary experimental results are shown for different degrees of evolution under the presence of noise.


Heat Kernel Surface Normal Trapezium Rule Surface Integration Adjacent Location 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Frankot, R.T., Chellappa, R.: A method for enforcing integrability in shape from shading algorithms. IEEE Trans. Pattern Analysis and Machine Intelligence 10, 439–451 (1988)MATHCrossRefGoogle Scholar
  2. 2.
    Zhang, R., Tsai, P.S., Cryer, J., Shah, M.: Shape-from-shading: a survey. IEEE Transactions on Pattern Analysis and Machine Intelligence 21, 690–706 (1999)CrossRefGoogle Scholar
  3. 3.
    Agrawal, A., Chellappa, R.: An algebraic approach to surface reconstruction from gradient fields. In: Proceedings of ICCV 2005, pp. 23–114 (2005)Google Scholar
  4. 4.
    Agrawal, A., Chellappa, R.: What is the range of surface reconstructions from a gradient field. In: Proceedings of ECCV 2006 (to appear, 2006)Google Scholar
  5. 5.
    Robles-Kelly, A., Hancock, E.: Steady state random walks for path estimation. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 143–152. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Klette, R., Schlüns, K.: Height data from gradient fields. In: Proceedings of SPIE, vol. 2908, pp. 204–215 (1996)Google Scholar
  7. 7.
    Kondor, R.I., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: ICML 2002 (2002)Google Scholar
  8. 8.
    Zhang, F., Qiu, H., Hancock, E.: Evolving spanning trees using the heat equation. In: Int. Conf. on Computer Analysis of Images and Patterns (2005)Google Scholar
  9. 9.
    Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)MATHGoogle Scholar
  10. 10.
    Perona, P., Malik, J.: Scale space and edge detection using anisotropic diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 629–639 (1990)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Roberto Fraile
    • 1
  • Edwin Hancock
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkUK

Personalised recommendations