Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 (2001)
Dec. 8, 2001 to Dec. 14, 2001
Antonio Robles-Kelly , University of York
Edwin. R. Hancock , University of York
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. The method borrows ideas from routing theory. We exploit the well-known fact that the leading eigenvector of a Markov chain transition probability matrix is the steady-state random walk on the equivalent weighted graph. We use this property to find the minimum total curvature path through the available surface normals. To do this we construct a transition probability matrix whose elements are related to the differences in surface normal direction. 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 data delivered by a shape-from-shading algorithm.
E. R. Hancock and A. Robles-Kelly, "A Graph-Spectral Method for Surface Height Recovery from Needle-maps," Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001(CVPR), Kauai, Hawaii, 2001, pp. 141.