A Graph-Spectral Method for Surface Height Recovery
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 Mumford-Shah energy function to obtain transition weights for pairs of sites in the field of surface normals. The weights depend on the sectional curvature between locations in the field of surface normals. This curvature may be estimated using the change in surface normal direction between locations. We pose the recovery of the integration path as that of finding a path that maximises the total transition weight. To do this we use a graph-spectral seriation technique. By threading the surface normals together along the seriation path, 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 height reconstruction method of Bichsel and Pentland.
KeywordsSectional Curvature Surface Normal Integration Path Height Function Surface Patch
Unable to display preview. Download preview PDF.
- 2.Horn, B.K.P., Brooks, M.J.: The variational approach to shape from shading. CVGIP 33(2), 174–208 (1986)Google Scholar
- 4.Wu, Z., Li, L.: A line-integration based method for depth recovery from surface normals. CVGIP 43(1), 53–66 (1988)Google Scholar
- 6.Kimmel, R., Siddiqqi, K., Kimia, B.B., Bruckstein, A.M.: Shape from shading: Level set propagation and viscosity solutions. International Journal of Computer Vision (16), 107–133 (1995)Google Scholar
- 8.Leclecrc, Y.G., Bobick, A.F.: The direct computation of height from shading. Proceedings of Computer Vision and Pattern Recognition, 552–558 (1991)Google Scholar
- 10.Dupuis, P., Oliensis, J.: Direct method for reconstructing shape from shading. In: CVPR 1992, pp. 453–458 (1992)Google Scholar
- 11.Bichsel, M., Pentland, A.P.: A simple algorithm for shape from shading. In: CVPR 1992, pp. 459–465 (1992)Google Scholar
- 14.Neuenschwander, W., Fua, P., Szekely, G., Kubler, O.: Deformable velcro surfaces. In: Proc. of the IEEE Int. Conf. on Comp. Vision, pp. 828–833 (1995)Google Scholar
- 16.Lovász, L.: Random walks on graphs: a survey. Bolyai Society Mathematical Studies 2(2), 1–46 (1993)Google Scholar
- 21.Zucker, S.W., David, C., Dobbins, A., Iverson, L.: The organization of curve detection: Coarse tangent fields and fine spline coverings. In: Proc. of the IEEE Int. Conf. on Comp. Vision, pp. 568–577 (1988)Google Scholar
- 23.Bremaud, P.: Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues. Springer, Heidelberg (2001)Google Scholar
- 25.Bors, A., Wilson, R.C., Hancock, E.R.: Terrain analysis using radar imagery. To appear in the IEEE Trans. on Pattern Analysis and Machine Intelligence (2003)Google Scholar