Title

Shape From Shading: A Survey

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. The implementation of these algorithms in C and images used in this paper are available by anonymous ftp under the pub/tech_paper/survey directory at eustis.cs.ucf.edu (132.170.108.42). These are also part of the electronic version of paper.

Publication Date

1-1-1999

Publication Title

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volume

21

Issue

8

Number of Pages

690-706

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/34.784284

Socpus ID

0032659026 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0032659026

This document is currently not available here.

Share

COinS