A graph-spectral method for surface height recovery

  • Authors:
  • Antonio Robles-Kelly;Edwin R. Hancock

  • Affiliations:
  • NICTA, Building 115, ANU, 0200 ACT, Australia;Department of Computer Science, University of York, York YO1 5DD, UK

  • Venue:
  • Pattern Recognition
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a shape-from-shading or shape-from-texture procedure. We commence by using the surface normals to obtain an affinity weight matrix whose elements are related to the surface curvature. The weight matrix is used to compute a row-normalized transition probability matrix, and we pose the recovery of the integration path as that of finding the steady-state random walk for the Markov chain defined by this matrix. The steady-state random walk is given by the leading eigenvector of the original affinity weight matrix. By threading the surface normals together along the path specified by the magnitude order of the components of the leading eigenvector we perform surface integration. The height increments along the path are simply related to the traversed path length and the slope of the local tangent plane. The method is evaluated on needle-maps delivered by a shape-from-shading algorithm applied to real-world data and also on synthetic data. The method is compared with the local geometric height reconstruction method of Bors, Hancock and Wilson, and the global methods of Horn and Brooks and Frankot and Chellappa.