Probabilistic Connections for Bidirectional Path Tracing
Computer Graphics Forum (Proceedings of the Eurographics Symposium on Rendering), Volume 34, Number 4 - 2015
Download the publication :
![PCBPT.pdf [14.4Mo]](/reves/Basilic/images/pdf.png)
Images and movies
![teaser.jpg [581Ko]](http://www-sop.inria.fr/reves/Basilic/2015/PRDD15b/teaser.jpg){kind=small}
See also
- PMF interpolation details and comparison to Metropolis methods: pmf_interpolation_and_metropolis_comparisons.pdf
- Derivation of weights for correlated paths: correlated_mis.pdf
- Proof of unbiasedness of the PCPT estimator: proof_that_pcbpt_is_unbiased.pdf
- More complete proof of unbiasedness of the PCPT estimator: pcbpt_proof.pdf from Peter Hedman from UCL
- Convergence graphs for inner paths: convergence_graphs_inner.pdf
- Zip file with images of all results and comparisons: Additional Material (306Mb) .
BibTex references
@Article{PRDD15b,
author = "Popov, Stefan and Ramamoorthi, Ravi and Durand, Fr\'edo and Drettakis, George",
title = "Probabilistic Connections for Bidirectional Path Tracing",
journal = "Computer Graphics Forum (Proceedings of the Eurographics Symposium on Rendering)",
number = "4",
volume = "34",
year = "2015",
url = "http://www-sop.inria.fr/reves/Basilic/2015/PRDD15b"
}