Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
DOI: 10.1109/cvpr.1992.223150
|View full text |Cite
|
Sign up to set email alerts
|

A simple algorithm for shape from shading

Abstract: In this paper we describe a simple shape from shading algorithm which recovers depth from a brightness image, typically in fewer than ten iterations. This algorithm, which is a simplification of the algorithm of Oliensis and Dupuis, is based on a minimum downhill principle which guarantees continuous surfaces and stable results. The algorithm is applicable to a broad variety of objects and reflectance maps.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
73
0

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 130 publications
(73 citation statements)
references
References 5 publications
0
73
0
Order By: Relevance
“…Here we consider the formulation of Brooks and Horn [17], which is couched in terms of unit surface normals. Whilst there are other, more recent and in some cases more elegant, approaches to the problem (for example, [13,14,19]), the Horn and Brooks formulation provides a simple and easily adaptable platform upon which to test the utility of the methods described here. We fully expect that the robust techniques presented in this article may be applied to any scheme which utilizes smoothness or other constraints to achieve a corresponding performance improvement.…”
Section: Shape From Shadingmentioning
confidence: 99%
“…Here we consider the formulation of Brooks and Horn [17], which is couched in terms of unit surface normals. Whilst there are other, more recent and in some cases more elegant, approaches to the problem (for example, [13,14,19]), the Horn and Brooks formulation provides a simple and easily adaptable platform upon which to test the utility of the methods described here. We fully expect that the robust techniques presented in this article may be applied to any scheme which utilizes smoothness or other constraints to achieve a corresponding performance improvement.…”
Section: Shape From Shadingmentioning
confidence: 99%
“…Previous methods [1,9,17,19,20] perform poorly on these examples. Energy minimization approaches suffer from smoothness constraint and local minima: the result surface is flat globally but bumpy locally (Figure 6(e)).…”
Section: Resultsmentioning
confidence: 99%
“…Local propagation methods can give reasonable smooth surfaces, but fail to give a correct global shape (Figure 6(f)). For a fair comparison, we have already tuned the parameters for the previous methods [1,17] and take the best results. Further, we choose the top two results from the six methods surveyed in [19].…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We compare the resulting height estimates with the height data for the original surfaces. We also provide a comparative study using the shape-fromshading height recovery method of Bichsel and Pentland [18] as an alternative to our graph-spectral shape-from-shading algorithm. We have chosen the algorithm of Bichsel and Pentland since, from Zhang et al [7], appears to deliver reasonable results on a wide variety of images.…”
Section: A Synthetic Datamentioning
confidence: 99%