The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Metropolis light transport
Open accessAbstract
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics.To render an image, we generate a sequence of light transport paths by randomly mutating a single current path (e.g.adding a new vertex to the path).Each mutation is accepted or rejected with a carefully chosen probability, to ensure that paths are sampled according to the contribution they make to the ideal image.We then estimate this image by sampling many paths, and recording their locations on the image plane.Our algorithm is unbiased, handles general geometric and scattering models, uses little storage, and can be orders of magnitude more efficient than previous unbiased approaches.It performs especially well on problems that are usually considered difficult, e.g.those involving bright indirect light, small geometric holes, or glossy surfaces.Furthermore, it is competitive with previous unbiased algorithms even for relatively simple scenes.The key advantage of the Metropolis approach is that the path space is explored locally, by favoring mutations that make small changes to the current path.This has several consequences.First, the average cost per sample is small (typically only one or two rays).Second, once an important path is found, the nearby paths are explored as well, thus amortizing the expense of finding such paths over many samples.Third, the mutation set is easily extended.By constructing mutations that preserve certain properties of the path (e.g. which light source is used) while changing others, we can exploit various kinds of coherence in the scene.It is often possible to handle difficult lighting problems efficiently by designing a specialized mutation in this way.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Kajiya, J. T. (1986) · ACM SIGGRAPH Computer Graphics · doi:10.1145/15886.15902 · Cited by 2,238
An improved illumination model for shaded display
Whitted, T. (1980) · Communications of the ACM · doi:10.1145/358876.358882 · Cited by 1,768
Kalos, M. H., & Whitlock, P. A. (1986) · Wiley eBooks · doi:10.1002/9783527617395 · Cited by 1,546
Robust Monte Carlo methods for light transport simulation
Guibas, L., & Veach, E. (1997) · Cited by 994
Self-citationCook, R. L., Porter, T., & Carpenter, L. C. (1984) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/800031.808590 · Cited by 858
Optimally combining sampling techniques for Monte Carlo rendering
Veach, E., & Guibas, L. J. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218498 · Cited by 616
Self-citationOptimum Monte-Carlo sampling using Markov chains
PESKUN, P. H. (1973) · Biometrika · doi:10.1093/biomet/60.3.607 · Cited by 531
Lafortune, E. P., & Willems, Y. (1993) · Cited by 323
Bidirectional Estimators for Light Transport
Veach, E., & Guibas, L. (1995) · Springer eBooks · doi:10.1007/978-3-642-87825-1_11 · Cited by 275
Self-citationAdaptive radiosity textures for bidirectional ray tracing
Heckbert, P. S. (1990) · Proceedings of the 17th annual conference on Computer graphics and interactive techniques · doi:10.1145/97879.97895 · Cited by 242
Monte Carlo techniques for direct lighting calculations
Shirley, P., Wang, C., & Zimmerman, K. (1996) · ACM Transactions on Graphics · doi:10.1145/226150.226151 · Cited by 211
Adaptive radiosity textures for bidirectional ray tracing
Heckbert, P. S. (1990) · ACM SIGGRAPH Computer Graphics · doi:10.1145/97880.97895 · Cited by 125
Discrete and Computational Geometry
Akiyama, J., Tan, X., & Kanō, M. (2005) · Lecture notes in computer science · doi:10.1007/11589440 · Cited by 104
Computability and complexity of ray tracing
Reif, J. H., Tygar, J. D., & Yoshida, A. (1994) · Discrete & Computational Geometry · doi:10.1007/bf02574009 · Cited by 47
Adjoint equations and random walks for illumination computation
Pattanaik, S. N., & Mudur, S. P. (1995) · ACM Transactions on Graphics · doi:10.1145/200972.200985 · Cited by 45
Cited by
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Debevec, P. (2008) · ACM SIGGRAPH 2008 classes · doi:10.1145/1401132.1401175 · Cited by 969
Interactive motion generation from examples
Arikan, O., & Forsyth, D. A. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566606 · Cited by 539
Animation and rendering of complex water surfaces
Enright, D., Marschner, S., & Fedkiw, R. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566645 · Cited by 523
Differentiable Monte Carlo ray tracing through edge sampling
Li, T.-M., Aittala, M., Durand, F., & Lehtinen, J. (2018) · ACM Transactions on Graphics · doi:10.1145/3272127.3275109 · Cited by 428
Metadata
- Authors
- Veach, E., & Guibas, L. J.
- Venue
- Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 65-76
- OpenAlex
- W2008693968
- Cited by
- 511
- References
- 18
- FWCI
- 7.90
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.