Shape from shading using graph cuts

  • Authors:
  • Ju Yong Chang;Kyoung Mu Lee;Sang Uk Lee

  • Affiliations:
  • Mitsubishi Electric Research Laboratories, 201 Broadway, Cambridge, MA 02139, USA;Department of Electrical Engineering, ASRI, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul 151-742, Republic of Korea;Department of Electrical Engineering, ASRI, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul 151-742, Republic of Korea

  • Venue:
  • Pattern Recognition
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently.