Theoretical Analysis of Finite Difference Algorithms for Linear Shape from Shading

@inproceedings{Wei2001TheoreticalAO,
  title={Theoretical Analysis of Finite Difference Algorithms for Linear Shape from Shading},
  author={Tiangong Wei and Reinhard Klette},
  booktitle={CAIP},
  year={2001}
}
This paper presents and 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. 1 The University of Auckland, Tamaki Campus… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Existence and uniqueness on photometric stereo

  • R. Kozera
  • Applied Mathematics and Computation,
  • 1991
Highly Influential
7 Excerpts

Criteria for di erential equations in computer vision. CITR-TR-27

  • R. Kozera, R. Klette
  • 1998
Highly Influential
7 Excerpts

Finite di erence based algorithms in linear shape from shading

  • R. Kozera, R. Klette
  • Machine Graphics and Vision,
  • 1997
Highly Influential
7 Excerpts

Kozera : Existence and uniqueness on photometric stereo

  • R.
  • Applied Mathematics and Computation
  • 1998

uns and A

  • R. Klette, K. Schl
  • Koschan: Computer Vision - Three-dimensional Data…
  • 1998
1 Excerpt

Klette : Criteria for di erential equations in computer vision

  • R.
  • 1997

Bruckstein : Tracking level sets by level sets : a method for solving the shape from shading problem

  • M. A.
  • Computer VisionThree - dimensional Data from…
  • 1995

Similar Papers

Loading similar papers…