A variance analysis of the Metropolis Light Transport algorithm

The Metropolis Light Transport algorithm is a variant of the classic Metropolis method used in statistical physics. A variance analysis of the Metropolis Light Transport algorithm is presented that bounds its variance in terms of the number of paths used and the intrinsic correlation between samples...

Full description

Saved in:
Bibliographic Details
Published in:Computers & graphics Vol. 25; no. 2; pp. 287 - 294
Main Authors: Ashikhmin, Michael, Premože, Simon, Shirley, Peter, Smits, Brian
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.04.2001
Subjects:
Analysis of algorithms and problem complexity
Monte Carlo
numerical algorithms and problems
Probability and statistics
raytracing
Simulation and modeling
Three-dimensional graphics and realism
Analysis of algorithms and problem complexity
Three-dimensional graphics and realism
Monte Carlo
raytracing
Probability and statistics
numerical algorithms and problems
Simulation and modeling
ISSN:0097-8493, 1873-7684
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Metropolis Light Transport algorithm is a variant of the classic Metropolis method used in statistical physics. A variance analysis of the Metropolis Light Transport algorithm is presented that bounds its variance in terms of the number of paths used and the intrinsic correlation between samples. It is shown that the variance of a pixel is Θ(1/ N), where N is the number of samples for the entire image. The analysis uses basic probability, Bayes’ law, and the principle of stationary distributions. This result implies that the presence of correlation in the algorithm does not make its asymptotic time complexity worse than uncorrelated Monte Carlo methods such as path tracing.
AbstractList The Metropolis Light Transport algorithm is a variant of the classic Metropolis method used in statistical physics. A variance analysis of the Metropolis Light Transport algorithm is presented that bounds its variance in terms of the number of paths used and the intrinsic correlation between samples. It is shown that the variance of a pixel is theta (1/N), where N is the number of samples for the entire image. The analysis uses basic probability, Bayes' law, and the principle of stationary distributions. This result implies that the presence of correlation in the algorithm does not make its asymptotic time complexity worse than uncorrelated Monte Carlo methods such as path tracing. copyright 2001 Elsevier Science Ltd.
The Metropolis Light Transport algorithm is a variant of the classic Metropolis method used in statistical physics. A variance analysis of the Metropolis Light Transport algorithm is presented that bounds its variance in terms of the number of paths used and the intrinsic correlation between samples. It is shown that the variance of a pixel is Θ(1/ N), where N is the number of samples for the entire image. The analysis uses basic probability, Bayes’ law, and the principle of stationary distributions. This result implies that the presence of correlation in the algorithm does not make its asymptotic time complexity worse than uncorrelated Monte Carlo methods such as path tracing.
Author Ashikhmin, Michael
Smits, Brian
Shirley, Peter
Premože, Simon
Author_xml – sequence: 1
  givenname: Michael
  surname: Ashikhmin
  fullname: Ashikhmin, Michael
  email: michael@cs.utah.edu
– sequence: 2
  givenname: Simon
  surname: Premože
  fullname: Premože, Simon
  email: premoze@cs.utah.edu
– sequence: 3
  givenname: Peter
  surname: Shirley
  fullname: Shirley, Peter
  email: shirley@cs.utah.edu
– sequence: 4
  givenname: Brian
  surname: Smits
  fullname: Smits, Brian
  email: bes@cs.utah.edu
BookMark eNqFkM9LwzAYhoMouE3_BKEn0UP1S5M2LR7GGP6CiQcn7Bay9OsW6ZqaZIP993abePCy0wcv7_PC9_TJaWMbJOSKwh0Fmt1_ABQiznnBbgBuASij8eyE9GguWCyynJ-S3l_lnPS9_wKAJMl4jwxH0UY5oxqNkWpUvfXGR7aKwhKjNwzOtrbukolZLEM0darxrXUhUvXCOhOWqwtyVqna4-XvHZDPp8fp-CWevD-_jkeTWDOWhxhzYCwpOZtzUXKB81zoVJeguC4oVoIXNFOMpqXmIPISCkBepUoxSEpgc8YG5Pqw2zr7vUYf5Mp4jXWtGrRrL7tn0oTyvCs-HIraWe8dVlKboIKxTXDK1JKC3EmTe2lyZ0QCyL00Oevo9B_dOrNSbnuUGx447BxsDDrptcFOamkc6iBLa44s_AB7cYYg
CitedBy_id crossref_primary_10_1145_1073204_1073330
crossref_primary_10_1007_s11390_016_1646_2
crossref_primary_10_1111_j_1467_8659_2010_01713_x
crossref_primary_10_1007_s41095_023_0338_4
crossref_primary_10_1134_S0361768821040034
crossref_primary_10_1111_cgf_13775
crossref_primary_10_1145_3658218
crossref_primary_10_1109_TVCG_2018_2880455
crossref_primary_10_1111_1467_8659_t01_1_00703
crossref_primary_10_1111_cgf_12154
crossref_primary_10_1016_j_cag_2017_07_032
crossref_primary_10_1111_j_1467_8659_2009_01540_x
crossref_primary_10_1145_3388538
crossref_primary_10_1002_cav_1896
Cites_doi 10.1145/258734.258775
10.1145/192161.192179
10.1146/annurev.pc.27.100176.001535
10.1145/258734.258818
10.1063/1.1699114
ContentType Journal Article
Copyright 2001 Elsevier Science Ltd
Copyright_xml – notice: 2001 Elsevier Science Ltd
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/S0097-8493(00)00131-X
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1873-7684
EndPage 294
ExternalDocumentID 10_1016_S0097_8493_00_00131_X
S009784930000131X
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABMAC
ABTAH
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEKER
AFFNX
AFKWA
AFTJW
AGHFR
AGSOS
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
H~9
IHE
J1W
K-O
KOM
LG9
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
UHS
VH1
VOH
WH7
WUQ
XPP
ZMT
ZY4
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ADNMO
AEIPS
AFJKZ
AGQPQ
AIIUN
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-e80332d43b47d47eb87c5cd0a4c91ef74916a315dc4078d090e4f5aa302d03b33
ISICitedReferencesCount 15
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168177200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0097-8493
IngestDate Mon Sep 29 05:44:59 EDT 2025
Sat Nov 29 05:33:13 EST 2025
Tue Nov 18 22:41:05 EST 2025
Fri Feb 23 02:17:02 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Analysis of algorithms and problem complexity
Three-dimensional graphics and realism
Monte Carlo
raytracing
Probability and statistics
numerical algorithms and problems
Simulation and modeling
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-e80332d43b47d47eb87c5cd0a4c91ef74916a315dc4078d090e4f5aa302d03b33
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 26452148
PQPubID 23500
PageCount 8
ParticipantIDs proquest_miscellaneous_26452148
crossref_citationtrail_10_1016_S0097_8493_00_00131_X
crossref_primary_10_1016_S0097_8493_00_00131_X
elsevier_sciencedirect_doi_10_1016_S0097_8493_00_00131_X
PublicationCentury 2000
PublicationDate 2001-04-01
PublicationDateYYYYMMDD 2001-04-01
PublicationDate_xml – month: 04
  year: 2001
  text: 2001-04-01
  day: 01
PublicationDecade 2000
PublicationTitle Computers & graphics
PublicationYear 2001
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Cormen, Leiserson, Rivest (BIB6) 1990
Szirmay-Kalos L, Dornbach P, Purgathofer W. On the start-up bias problem of metropolis sampling. In: Skala V, editor. WSCG’99 — The Seventh International Conference in Central Europe on Computer Graphics. West Bohemia: University of West Bohemia Press.
Kalos, Whitlock (BIB8) 1986
Veach E, Guibas LJ. Metropolis light transport. In: Whitted T, editor. SIGGRAPH 97 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH, Reading, MA: Addison-Wesley, August 1997. p. 65–76.
Newman, Barkema (BIB9) 1999
Ferwerda JA, Pattanaik SN, Shirley P, Greenberg DP. A model of visual masking for computer graphics. In: Whitted T, editor. SIGGRAPH 97 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH, Reading, MA: Addison-Wesley, August 1997. p. 143–152.
Arvo J, Torrance K, Smits B. A framework for the analysis of error in global illumination algorithms. In: Glassner A, editor. Proceedings of SIGGRAPH ’94, Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, New York: ACM Press, Orlando, Florida, July 24–29, 1994. p. 75–84.
Wood, Erpenbeck (BIB5) 1976; 27
Metropolis, Rosenbluth, Rosenbluth, Teller, Teller (BIB4) 1953; 21
Billingsley (BIB7) 1995
Dutré P. Mathematical frameworks for global illumination. Ph.D. thesis, Katholieke Universiteit Leuven, 1996.
10.1016/S0097-8493(00)00131-X_BIB3
10.1016/S0097-8493(00)00131-X_BIB11
Cormen (10.1016/S0097-8493(00)00131-X_BIB6) 1990
10.1016/S0097-8493(00)00131-X_BIB10
Billingsley (10.1016/S0097-8493(00)00131-X_BIB7) 1995
10.1016/S0097-8493(00)00131-X_BIB1
Newman (10.1016/S0097-8493(00)00131-X_BIB9) 1999
10.1016/S0097-8493(00)00131-X_BIB2
Kalos (10.1016/S0097-8493(00)00131-X_BIB8) 1986
Metropolis (10.1016/S0097-8493(00)00131-X_BIB4) 1953; 21
Wood (10.1016/S0097-8493(00)00131-X_BIB5) 1976; 27
References_xml – reference: Dutré P. Mathematical frameworks for global illumination. Ph.D. thesis, Katholieke Universiteit Leuven, 1996.
– reference: Szirmay-Kalos L, Dornbach P, Purgathofer W. On the start-up bias problem of metropolis sampling. In: Skala V, editor. WSCG’99 — The Seventh International Conference in Central Europe on Computer Graphics. West Bohemia: University of West Bohemia Press.
– volume: 27
  start-page: 319
  year: 1976
  ident: BIB5
  article-title: Molecular dynamics and Monte Carlo calculations in statistical mechanics
  publication-title: Annual Review of Physical Chemistry
– year: 1999
  ident: BIB9
  publication-title: Monte Carlo methods in statistical physics
– reference: Arvo J, Torrance K, Smits B. A framework for the analysis of error in global illumination algorithms. In: Glassner A, editor. Proceedings of SIGGRAPH ’94, Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, New York: ACM Press, Orlando, Florida, July 24–29, 1994. p. 75–84.
– reference: Veach E, Guibas LJ. Metropolis light transport. In: Whitted T, editor. SIGGRAPH 97 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH, Reading, MA: Addison-Wesley, August 1997. p. 65–76.
– volume: 21
  start-page: 1087
  year: 1953
  ident: BIB4
  article-title: Equations of state calculations by fast computing machines
  publication-title: Journal of Chemical Physics
– year: 1995
  ident: BIB7
  publication-title: Probability and measure
– reference: Ferwerda JA, Pattanaik SN, Shirley P, Greenberg DP. A model of visual masking for computer graphics. In: Whitted T, editor. SIGGRAPH 97 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH, Reading, MA: Addison-Wesley, August 1997. p. 143–152.
– year: 1986
  ident: BIB8
  publication-title: Monte Carlo methods
– year: 1990
  ident: BIB6
  publication-title: Introduction to algorithms
– year: 1990
  ident: 10.1016/S0097-8493(00)00131-X_BIB6
– year: 1995
  ident: 10.1016/S0097-8493(00)00131-X_BIB7
– ident: 10.1016/S0097-8493(00)00131-X_BIB10
– ident: 10.1016/S0097-8493(00)00131-X_BIB3
  doi: 10.1145/258734.258775
– ident: 10.1016/S0097-8493(00)00131-X_BIB1
  doi: 10.1145/192161.192179
– volume: 27
  start-page: 319
  year: 1976
  ident: 10.1016/S0097-8493(00)00131-X_BIB5
  article-title: Molecular dynamics and Monte Carlo calculations in statistical mechanics
  publication-title: Annual Review of Physical Chemistry
  doi: 10.1146/annurev.pc.27.100176.001535
– ident: 10.1016/S0097-8493(00)00131-X_BIB11
  doi: 10.1145/258734.258818
– year: 1999
  ident: 10.1016/S0097-8493(00)00131-X_BIB9
– ident: 10.1016/S0097-8493(00)00131-X_BIB2
– volume: 21
  start-page: 1087
  year: 1953
  ident: 10.1016/S0097-8493(00)00131-X_BIB4
  article-title: Equations of state calculations by fast computing machines
  publication-title: Journal of Chemical Physics
  doi: 10.1063/1.1699114
– year: 1986
  ident: 10.1016/S0097-8493(00)00131-X_BIB8
SSID ssj0002264
Score 1.6414704
Snippet The Metropolis Light Transport algorithm is a variant of the classic Metropolis method used in statistical physics. A variance analysis of the Metropolis Light...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 287
SubjectTerms Analysis of algorithms and problem complexity
Monte Carlo
numerical algorithms and problems
Probability and statistics
raytracing
Simulation and modeling
Three-dimensional graphics and realism
Title A variance analysis of the Metropolis Light Transport algorithm
URI https://dx.doi.org/10.1016/S0097-8493(00)00131-X
https://www.proquest.com/docview/26452148
Volume 25
WOSCitedRecordID wos000168177200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-7684
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002264
  issn: 0097-8493
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9RAFB7WrQ_6IF6xrZc8WFBK2klmkkyeJJYVlVqEVslbSObiBneTkqRLf4O_2rlkkmiRquBLWCaZGZjz7TlnzhWAFyHD1Ato4QY8RC7mTLjEVy0BGRVhQCPh6aI-X46jkxOSpvGn2ey7zYXZrKKqIpeX8fl_JbUck8RWqbN_Qe5hUTkgf0uiy6cku3z-EeGT_Y28__aZAGPFEaVgfuSdboogR47VpXwsbb6fr77WTdkt11Nt1bZ8aDVAdG3rSXB80i7Lb8t1eSX8XnHahq_rvaNg783C2LjL9ejvP12WTW8q_yk8WFl5WgM4C1prj_AmYSzaSGYTZcaoJM14YykMsWmGeMANryURcpUfcMqMTRZ0Dzp_yll7uWyEtG86I1_h_8YUcTpsJ7V01ew61mWF3HQUekMoov5Wfar9HMhLb4AtPwpiMgdbyftF-mGQ6yrl2NQ0NWuP-WCH44YvIXzVb_Y7TecXma8VmbO74E5_A3ESg5x7YMar--D2pC7lA_A6cSyGHIshpxaOxJAzYsjRGHIGDDkDhh6Cz28XZ0fv3L7ThksRIp3LCUTIZxgVOGI44gWJaEAZzDGNPS4iLC8ROfICRpXbl8EYciyCPEfQZxAVCD0C86qu-GPgiFBg-Z5BGhU4ZqTwBRNeEBYB51AQvA2wPZWM9mXoVTeUVTbGG6qgCHWYGVS1a-VhZuk2OBimnZs6LNdNIPbIs16ZNEpiJrFy3dTnlkSZZLbKg5ZXvL5oM1-FAXiY7Pz74rvg1viveQLmXXPBn4KbdNOVbfOsx9wPsHOeZg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+variance+analysis+of+the+Metropolis+Light+Transport+algorithm&rft.jtitle=Computers+%26+graphics&rft.au=Ashikhmin%2C+Michael&rft.au=Premo%C5%BEe%2C+Simon&rft.au=Shirley%2C+Peter&rft.au=Smits%2C+Brian&rft.date=2001-04-01&rft.pub=Elsevier+Ltd&rft.issn=0097-8493&rft.eissn=1873-7684&rft.volume=25&rft.issue=2&rft.spage=287&rft.epage=294&rft_id=info:doi/10.1016%2FS0097-8493%2800%2900131-X&rft.externalDocID=S009784930000131X
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-8493&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-8493&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-8493&client=summon