Theoretical Analysis of Finite Difference Algorithms for Linear Shape from Shading

Authors:
Tiangong Wei;Reinhard Klette
Affiliations:
-;-
Venue:
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Year:
2001

Citing 12
Cited 0

The variational approach to shape from shading

Computer Vision, Graphics, and Image Processing
Finite difference schemes and partial differential equations

Finite difference schemes and partial differential equations
Linear shape from shading

International Journal of Computer Vision
Height and gradient from shading

International Journal of Computer Vision
Uniqueness in shape from shading

International Journal of Computer Vision
Existence and uniqueness in photometric stereo

Applied Mathematics and Computation
Tracking level sets by level sets: a method for solving the shape from shading problem

Computer Vision and Image Understanding
Provably Convergent Methods for the Linear and Nonlinear Shape from Shading Problem

Journal of Mathematical Imaging and Vision
Shape from Shading: A Survey

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robot Vision

Robot Vision
Computer Vision: Three-Dimensional Data from Images

Computer Vision: Three-Dimensional Data from Images
Shape from Shading with a Linear Triangular Element Surface Model

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes four explicit, two implicit and four semi-implicit finite difference algorithms for the linear shape from shading problem. Comparisons of accuracy, solvability, stability and convergence of these schemes indicate that the weighted semi-implicit scheme and the box scheme are better than the other ones because they can be calculated more easily, they are more accurate, faster in convergence and unconditionally stable.