Shape-from-shading: a survey
Ruo Zhang
Ping-Sing Tsai
Cryer, J.E.
Shah, M.
Sch. of Comput. Sci., Central Florida Univ., Orlando, FL;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Aug 1999
Volume: 21,
Issue: 8
On page(s): 690-706
ISSN: 0162-8828
References Cited: 54
CODEN: ITPIDJ
INSPEC Accession Number: 6349087
Digital Object Identifier: 10.1109/34.784284
Current Version Published: 2002-08-06
Abstract
Since the first shape-from-shading (SFS) technique was developed
by Horn in the early 1970s, many different approaches have emerged. In
this paper, six well-known SFS algorithms are implemented and compared.
The performance of the algorithms was analyzed on synthetic images using
mean and standard deviation of depth (Z) error, mean of surface gradient
(p, q) error, and CPU timing. Each algorithm works well for certain
images, but performs poorly for others. In general, minimization
approaches are more robust, while the other approaches are faster
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
