• DocumentCode
    398566
  • Title

    Shape from shading using graph cuts

  • Author

    Chang, Ju Yong ; Lee, Kyoung Mu ; Lee, Sung Uk

  • Author_Institution
    Sch. of Electr. Eng., Seoul Nat. Univ., South Korea
  • Volume
    1
  • fYear
    2003
  • fDate
    14-17 Sept. 2003
  • Abstract
    This paper describes a new semiglobal method for SFS (shape-from-shading) using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld (1985) and the global method using energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of the Lee and Rosenfeld method can be resolved efficiently. A new combinatorial optimization technique, 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.
  • Keywords
    concave programming; convex programming; graph theory; image reconstruction; minimisation; multidimensional signal processing; 3-dimensional shape; SFS; combinatorial optimization technique; convex-concave ambiguity problem; energy minimization technique; graph cuts; minimization; semiglobal method; shape-from-shading; Brightness; Computer vision; Energy resolution; Equations; Minimization methods; Noise robustness; Optimization methods; Pixel; Shape; Solid modeling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on
  • ISSN
    1522-4880
  • Print_ISBN
    0-7803-7750-8
  • Type

    conf

  • DOI
    10.1109/ICIP.2003.1246988
  • Filename
    1246988