Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2504.04411

Help | Advanced Search

Computer Science > Graphics

arXiv:2504.04411 (cs)
[Submitted on 6 Apr 2025 ]

Title: Hypothesis Testing for Progressive Kernel Estimation and VCM Framework

Title: 渐进核估计和VCM框架的假设检验

Authors:Zehui Lin, Chenxiao Hu, Jinzhu Jia, Sheng Li
Abstract: Identifying an appropriate radius for unbiased kernel estimation is crucial for the efficiency of radiance estimation. However, determining both the radius and unbiasedness still faces big challenges. In this paper, we first propose a statistical model of photon samples and associated contributions for progressive kernel estimation, under which the kernel estimation is unbiased if the null hypothesis of this statistical model stands. Then, we present a method to decide whether to reject the null hypothesis about the statistical population (i.e., photon samples) by the F-test in the Analysis of Variance. Hereby, we implement a progressive photon mapping (PPM) algorithm, wherein the kernel radius is determined by this hypothesis test for unbiased radiance estimation. Secondly, we propose VCM+, a reinforcement of Vertex Connection and Merging (VCM), and derive its theoretically unbiased formulation. VCM+ combines hypothesis testing-based PPM with bidirectional path tracing (BDPT) via multiple importance sampling (MIS), wherein our kernel radius can leverage the contributions from PPM and BDPT. We test our new algorithms, improved PPM and VCM+, on diverse scenarios with different lighting settings. The experimental results demonstrate that our method can alleviate light leaks and visual blur artifacts of prior radiance estimate algorithms. We also evaluate the asymptotic performance of our approach and observe an overall improvement over the baseline in all testing scenarios.
Abstract: 确定一个合适的半径用于无偏核估计对于辐射估计的效率至关重要。 然而,确定半径和无偏性仍然面临巨大的挑战。 本文首先提出了一个基于渐进核估计的光子样本及其相关贡献的统计模型,在此模型下,如果该统计模型的零假设成立,则核估计是无偏的。 然后,我们提出了一种通过方差分析中的F检验来决定是否拒绝关于统计总体(即光子样本)的零假设的方法。 由此,我们实现了一个渐进光子映射(PPM)算法,其中核半径由这个假设检验来确定以实现无偏辐射估计。 其次,我们提出了VCM+,这是顶点连接与合并(VCM)的一种增强,并推导出了它的理论无偏公式。 VCM+通过多重重要性采样(MIS)结合了基于假设检验的PPM和双向路径追踪(BDPT),其中我们的核半径可以利用PPM和BDPT的贡献。 我们在具有不同照明设置的各种场景中测试了我们的新算法——改进的PPM和VCM+。 实验结果表明,我们的方法能够减轻先前辐射估计算法的漏光和视觉模糊伪影。 我们还评估了我们方法的渐近性能,并观察到在所有测试场景中都优于基线的整体改进。
Comments: This paper has been published in IEEE Transactions on Visualization and Computer Graphics. This version is a preprint one
Subjects: Graphics (cs.GR) ; Computer Vision and Pattern Recognition (cs.CV)
Cite as: arXiv:2504.04411 [cs.GR]
  (or arXiv:2504.04411v1 [cs.GR] for this version)
  https://doi.org/10.48550/arXiv.2504.04411
arXiv-issued DOI via DataCite
Journal reference: IEEE Transactions on Visualization and Computer Graphics, 2023
Related DOI: https://doi.org/10.1109/TVCG.2023.3274595
DOI(s) linking to related resources

Submission history

From: Sheng Li [view email]
[v1] Sun, 6 Apr 2025 08:37:35 UTC (44,619 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.GR
< prev   |   next >
new | recent | 2025-04
Change to browse by:
cs
cs.CV

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号