By Topic

Shape from intensity gradient

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ruo Zhang ; Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA ; Shah, M.

We propose a new shape-from-shading (SFS) algorithm which replaces the brightness constraint with an intensity gradient constraint. This is a global approach which obtains the solution by the minimization of an error function over the entire image. Through the linearization of the gradient of the reflectance map and the discretization of the surface gradient, the intensity gradient can be expressed as a linear function of the surface height. A quadratic error function, which involves the intensity gradient constraint and the traditional smoothness constraint, is minimized efficiently by solving a sparse linear system using the multigrid technique. Neither the information at singular points nor the information at occluding boundaries is needed for the initialization of the height. Results for real images are presented to show the robustness of the algorithm, and the execution time is demonstrated to prove its efficiency

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:29 ,  Issue: 3 )