by Wei, T and Klette, R
Abstract:
This paper analyzes four explicit, two implicit and four semi-implicit _nite di_erence 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.
Reference:
Theoretical analysis of finite difference algorithms for linear shape from shading (Wei, T and Klette, R), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, volume 2124, 2001.
Bibtex Entry:
@inproceedings{wei2001theoreticalshading,
author = "Wei, T and Klette, R",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "638--645",
publisher = "Springer Verlag",
title = "Theoretical analysis of finite difference algorithms for linear shape from shading",
volume = "2124",
year = "2001",
abstract = "This paper analyzes four explicit, two implicit and four semi-implicit _nite di_erence 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.",
isbn = "9783540425137",
issn = "0302-9743",
eissn = "1611-3349",
keyword = "Finite difference scheme",
keyword = "Shape from shading",
keyword = "Stability",
language = "eng",
}