• Aucun résultat trouvé

Robust adaptive sampling for Monte-Carlo-based rendering

N/A
N/A
Protected

Academic year: 2021

Partager "Robust adaptive sampling for Monte-Carlo-based rendering"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-01518537

https://hal.archives-ouvertes.fr/hal-01518537

Submitted on 4 May 2017

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Robust adaptive sampling for Monte-Carlo-based rendering

Anthony Pajot, Loic Barthe, Mathias Paulin

To cite this version:

(2)

Anthony Pajot, Loïc Barthe, Mathias Paulin

IRIT - University of Toulouse - France

Robust Adaptive Sampling for Monte-Carlo-based rendering

Our approach

- Use a relative error to avoid focusing

all processing power on areas receiving more energy. These zones are not

necessarily the most noticeable after tonemapping, e.g. undersampling in shadows leads to highly visible noise - Alternate between uniform and

adaptive sampling, to ensure that error estimations of all pixels improve during rendering

Previous work and their limitations

- Adaptive sampling based on the statistical nature of the estimation [Purgathofer 1987]

Not a relative error: does not take into account dynamic reduction

during tonemapping

- Adaptive sampling based on

information-theoretic approaches

and entropy measures [Xu et al 2007]

Does not make the error uniform during rendering, thus less

adapted for progressive or time-constrained rendering

Both approaches can lead to poor sampling due to low-samples

error estimations which

underestimate the actual error

Our goals

- Focus processing power where convergence is harder to reach

during Monte-Carlo based rendering

- Make the error over the pixels uniform at any moment for progressive or

time-constrained rendering

Monte-Carlo rendering

- Value of each pixel defined as the expected value of a random variable

- estimated using samples of

0.2 0.4 0.6 0.8 1.2

ratio of estimated error and reference error for the corresponding outlier value

outlier = 10x 0

1

0 0.5 1 1.5 2 2.5 3 3.5 Scene prone to bright spots using : too uniform using : focused on bright spots

Our proposal:

approximate median

average of median of chunks of samples

Goal: focus on bright spots

Relative error and robustness to outliers

For each pixel, relative error:

Standard estimation:

Not robust to outliers underestimation

Alternation: avoid poor low-samples error estimation

Adaptive sampling based on error measure.

poor error estimate poor sampling

Our proposal:

alternate adaptive and uniform sampling

Uniform sampling Adaptive sampling, no alternation.

Patterns in the penumbra

Adaptive sampling, alternation. No patterns in the penumbra Complete scene.

Penumbra prone to poor sampling

Complete adaptive sampling algorithm

Uniform sampling Update error and pixel probabilities Adaptive sampling Uniform sampling

Comparison with Tsallis entropy [Xu, Sbert, Xinh and Zhan 2007]

Références

Documents relatifs

As an application we obtain upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise and related results.. Key-words:

H295R and SW13 cells were treated with mitotane or vehicle (DMSO) alone for various periods of time, 24h, 48 h or 72 h and the activity of four mitochondrial respiratory

Furthermore, switched-angle spinning techniques are demonstrated that allow one to record the proton spectrum of ordered bicellar phases as a function of the angle between the

versions of the Gibbs sampler for a univariate normal mixed linear model assuming prior independence of the variance components. The Gibbs sampler algorithm generates

Specifically, the omniscient strategy reads on the fly and sequentially the input stream and for each read element j, decides whether j is a good candidate for being stored into

Abstract—This paper presents a method for the extraction of blood vessels from fundus images. The proposed method is an unsupervised learning method which can automatically

Les recherches se sont appuyées sur l’analyse des abondances virale et procaryotique ainsi que sur le séquençage de l’ADN de communautés de petits virus (< 0,2 µm)

Starting out with this opposition, they conclude that clitics cannot be associated with any unique criterion, but simply form different constellations of properties that are in one