Path Space Partitioning and Guided Image Sampling for MCMC
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929671236485120 |
|---|---|
| author | Bashford-Rogers, Thomas Santos, Luis Paulo |
| author_facet | Bashford-Rogers, Thomas Santos, Luis Paulo |
| contents | Rendering algorithms typically integrate light paths over path space. However, integrating over this one unified space is not necessarily the most efficient approach, and we show that partitioning path space and integrating each of these partitioned spaces with a separate estimator can have advantages. We propose an approach for partitioning path space based on analyzing paths from a standard Monte Carlo estimator and integrating these partitioned path spaces using a Markov Chain Monte Carlo (MCMC) estimator. This also means that integration happens within a sparser subset of path space, so we propose the use of guided proposal distributions in image space to improve efficiency. We show that our method improves image quality over other MCMC integration approaches at the same number of samples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_06214 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Path Space Partitioning and Guided Image Sampling for MCMC Bashford-Rogers, Thomas Santos, Luis Paulo Computer Vision and Pattern Recognition Graphics Rendering algorithms typically integrate light paths over path space. However, integrating over this one unified space is not necessarily the most efficient approach, and we show that partitioning path space and integrating each of these partitioned spaces with a separate estimator can have advantages. We propose an approach for partitioning path space based on analyzing paths from a standard Monte Carlo estimator and integrating these partitioned path spaces using a Markov Chain Monte Carlo (MCMC) estimator. This also means that integration happens within a sparser subset of path space, so we propose the use of guided proposal distributions in image space to improve efficiency. We show that our method improves image quality over other MCMC integration approaches at the same number of samples. |
| title | Path Space Partitioning and Guided Image Sampling for MCMC |
| topic | Computer Vision and Pattern Recognition Graphics |
| url | https://arxiv.org/abs/2501.06214 |