A Method for Enforcing Integrability in Shape from Shading Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introductory Techniques for 3-D Computer Vision
Introductory Techniques for 3-D Computer Vision
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Shape and albedo from multiple images using integrability
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Shape from Shading: A Well-Posed Problem?
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
User-guided shape from shading to reconstruct fine details from a single photograph
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Variable-Source Shading Analysis
International Journal of Computer Vision
Removing the example from example-based photometric stereo
ECCV'10 Proceedings of the 11th European conference on Trends and Topics in Computer Vision - Volume Part II
| Hi-index | 0.00 |
Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the depth values. In this paper, we introduce a fast and efficient method for computing the depth values from surface normal vectors. The method is based on solving the Eikonal equation using Fast Marching Method. We introduce two ideas. First, while it is not possible to solve for the depths Z directly using Fast Marching Method, we solve the Eikonal equation for a function W of the form W = Z + λf. With appropriately chosen values for λ, we can ensure that the Eikonal equation for W can be solved using Fast Marching Method. Second, we solve for W in two stages with two different λ values, first in a small neighborhood of the given initial point with large λ, and then for the rest of the domain with a smaller λ. This step is needed because of the finite machine precision and rounding-off errors. The proposed method is very easy to implement, and we demonstrate experimentally that, with insignificant loss in precision, our method is considerably faster than the usual optimization method that uses conjugate gradient to minimize an error function.