Diffusion Based Photon Mapping

Research output: Contribution to journalJournal articleResearchpeer-review

Standard

Diffusion Based Photon Mapping. / Schjøth, Lars; Sporring, Jon; Fogh Olsen, Ole.

In: Computer Graphics Forum, Vol. 27, No. 8, 2008, p. 2114-2127.

Research output: Contribution to journalJournal articleResearchpeer-review

Harvard

Schjøth, L, Sporring, J & Fogh Olsen, O 2008, 'Diffusion Based Photon Mapping', Computer Graphics Forum, vol. 27, no. 8, pp. 2114-2127. https://doi.org/10.1111/j.1467-8659.2008.01196.x

APA

Schjøth, L., Sporring, J., & Fogh Olsen, O. (2008). Diffusion Based Photon Mapping. Computer Graphics Forum, 27(8), 2114-2127. https://doi.org/10.1111/j.1467-8659.2008.01196.x

Vancouver

Schjøth L, Sporring J, Fogh Olsen O. Diffusion Based Photon Mapping. Computer Graphics Forum. 2008;27(8):2114-2127. https://doi.org/10.1111/j.1467-8659.2008.01196.x

Author

Schjøth, Lars ; Sporring, Jon ; Fogh Olsen, Ole. / Diffusion Based Photon Mapping. In: Computer Graphics Forum. 2008 ; Vol. 27, No. 8. pp. 2114-2127.

Bibtex

@article{e2e23ed0bfa511dd8e02000ea68e967b,
title = "Diffusion Based Photon Mapping",
abstract = "Density estimation employed in multi-pass global illumination algorithms give cause to a trade-off problem between bias and noise. The problem is seen most evident as blurring of strong illumination features. In particular, this blurring erodes fine structures and sharp lines prominent in caustics. To address this problem, we introduce a photon mapping algorithm based on nonlinear anisotropic diffusion. Our algorithm adapts according to the structure of the photon map such that smoothing occurs along edges and structures and not across. In this way, we preserve important illumination features, while eliminating noise. We demonstrate the applicability of our algorithm through a series of tests. In the tests, we evaluate the visual and computational performance of our algorithm comparing it to existing popular algorithms. Udgivelsesdato: December",
author = "Lars Schj{\o}th and Jon Sporring and {Fogh Olsen}, Ole",
note = "Paper id:: 10.1111/j.1467-8659.2008.01196.x",
year = "2008",
doi = "10.1111/j.1467-8659.2008.01196.x",
language = "English",
volume = "27",
pages = "2114--2127",
journal = "Computer Graphics Forum (Print)",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "8",

}

RIS

TY - JOUR

T1 - Diffusion Based Photon Mapping

AU - Schjøth, Lars

AU - Sporring, Jon

AU - Fogh Olsen, Ole

N1 - Paper id:: 10.1111/j.1467-8659.2008.01196.x

PY - 2008

Y1 - 2008

N2 - Density estimation employed in multi-pass global illumination algorithms give cause to a trade-off problem between bias and noise. The problem is seen most evident as blurring of strong illumination features. In particular, this blurring erodes fine structures and sharp lines prominent in caustics. To address this problem, we introduce a photon mapping algorithm based on nonlinear anisotropic diffusion. Our algorithm adapts according to the structure of the photon map such that smoothing occurs along edges and structures and not across. In this way, we preserve important illumination features, while eliminating noise. We demonstrate the applicability of our algorithm through a series of tests. In the tests, we evaluate the visual and computational performance of our algorithm comparing it to existing popular algorithms. Udgivelsesdato: December

AB - Density estimation employed in multi-pass global illumination algorithms give cause to a trade-off problem between bias and noise. The problem is seen most evident as blurring of strong illumination features. In particular, this blurring erodes fine structures and sharp lines prominent in caustics. To address this problem, we introduce a photon mapping algorithm based on nonlinear anisotropic diffusion. Our algorithm adapts according to the structure of the photon map such that smoothing occurs along edges and structures and not across. In this way, we preserve important illumination features, while eliminating noise. We demonstrate the applicability of our algorithm through a series of tests. In the tests, we evaluate the visual and computational performance of our algorithm comparing it to existing popular algorithms. Udgivelsesdato: December

U2 - 10.1111/j.1467-8659.2008.01196.x

DO - 10.1111/j.1467-8659.2008.01196.x

M3 - Journal article

VL - 27

SP - 2114

EP - 2127

JO - Computer Graphics Forum (Print)

JF - Computer Graphics Forum (Print)

SN - 0167-7055

IS - 8

ER -

ID: 8805419