The DOI matches its Crossref record.
A simple algorithm for shape from shading
Abstract
A shape-from-shading algorithm that recovers depth from a brightness image typically in fewer than ten iterations, is described. This algorithm, which is a simplification of the algorithm of J. Oliensis and P. Dupuis (1991), is based on a minimum downhill principle that guarantees continuous surfaces and stable results. The algorithm is applicable to a broad variety of objects and reflectance maps.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Zhang, R., Tsai, P.-S., Cryer, J. E., & Shah, M. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.784284 · Cited by 1,731
Shape from shading using linear approximation
Ping-Sing, T., & Shah, M. (1994) · Image and Vision Computing · doi:10.1016/0262-8856(94)90002-7 · Cited by 317
Metadata
- Authors
- Bichsel, M., & Pentland, A. P.
- Venue
- Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-02
- Pages
- 459-465
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1946812025
- Cited by
- 172
- References
- 0
- FWCI
- 11.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A simple algorithm for shape from shading. https://app.cochat.ai/papers/10.1109/cvpr.1992.223150
- The paper
- Bichsel, M., & Pentland, A. P. (2003). A simple algorithm for shape from shading. Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. https://doi.org/10.1109/cvpr.1992.223150
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.