A novel method for solving the shape from shading (SFS) problem

  • Authors:
  • Yi Liao;Rong-chun Zhao

  • Affiliations:
  • Northwestern Polytechnical University, Xi'an, Shaanxi, China;Northwestern Polytechnical University, Xi'an, Shaanxi, China

  • Venue:
  • ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the generalized regularization problem of Shape-from- Shading. The traditional algorithms are to find the minimum point of the optimization problem where the regularization term is considered as the part of the objective function. However, the result of regularization may deviate from the true surface, due to the ill-posedness of the SFS problem. In this paper, we propose a novel method to solve this problem. The algorithm consists of two steps. In the first step, we recover the components of the surface in the range space of the transpose of the system matrix, from the observed image by using the Landweber iteration method, where the Pentland's linear SFS model is adopted without any regularization. In the second step, we represent the regularization condition as an energy spline in the Fourier domain, and find the minimum value of the energy function with respect to the components of the surface in the null space of the system matrix. Quantitative and visual comparisons, using simulated data of a fractal and smooth surface, show that the proposed method significantly outperforms the Horn, Zheng-Chellappa, Tsai-Shah and Pentland linear methods for surface reconstruction.