| R. Kimmel and J. A. Sethian. An optimal time algorithm for shape from shading. In 4th Asian Conference on Computer Vision,Taipei, Taiwan, January 8-11 2000. |
....of Lambertian surfaces. Our deformable model framework allows us to use the constraint on the normals to reconstruct plausible 3D shape. In the last few years there havebeenanumber of promising approaches using level sets (a class of non parametric deformable models) based on a viscosity framework [20, 33]. The general differences between parametric and non parametric deformable models are discussed in [7] The most recent and computationally efficient such method [20] which proposes an SFS solution for oblique light sources (although it is not clear how this generalizes to nonLambertian ....
.... of promising approaches using level sets (a class of non parametric deformable models) based on a viscosity framework [20, 33] The general differences between parametric and non parametric deformable models are discussed in [7] The most recent and computationally efficient such method [20] which proposes an SFS solution for oblique light sources (although it is not clear how this generalizes to nonLambertian reflectance) requires knowledge of all local minima, whichcanbe hard to obtain for topologically complex surfaces, such as the ones used in the experiments presented here. ....
R. Kimmel and J. A. Sethian. An optimal time algorithm for shape from shading. In 4th Asian Conference on Computer Vision,Taipei, Taiwan, January 8-11 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC