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.05562

Help | Advanced Search

Computer Science > Graphics

arXiv:2504.05562 (cs)
[Submitted on 7 Apr 2025 ]

Title: Improved Stochastic Texture Filtering Through Sample Reuse

Title: 通过样本重用来改进随机纹理过滤

Authors:Bartlomiej Wronski, Matt Pharr, Tomas Akenine-Möller
Abstract: Stochastic texture filtering (STF) has re-emerged as a technique that can bring down the cost of texture filtering of advanced texture compression methods, e.g., neural texture compression. However, during texture magnification, the swapped order of filtering and shading with STF can result in aliasing. The inability to smoothly interpolate material properties stored in textures, such as surface normals, leads to potentially undesirable appearance changes. We present a novel method to improve the quality of stochastically-filtered magnified textures and reduce the image difference compared to traditional texture filtering. When textures are magnified, nearby pixels filter similar sets of texels and we introduce techniques for sharing texel values among pixels with only a small increase in cost (0.04--0.14~ms per frame). We propose an improvement to weighted importance sampling that guarantees that our method never increases error beyond single-sample stochastic texture filtering. Under high magnification, our method has >10 dB higher PSNR than single-sample STF. Our results show greatly improved image quality both with and without spatiotemporal denoising.
Abstract: 随机纹理滤波(STF)已成为一种可以降低高级纹理压缩方法(例如神经纹理压缩)纹理滤波成本的技术。然而,在纹理放大过程中,STF中过滤和着色的交换顺序可能导致混叠现象。无法平滑插值存储在纹理中的材质属性(例如表面法线)会导致潜在的不理想外观变化。 我们提出了一种新颖的方法来提高随机滤波放大纹理的质量,并减少与传统纹理滤波相比的图像差异。当纹理被放大时,附近的像素会过滤相似的纹理元素集合,我们引入了技术手段在像素之间共享纹理元素值,而仅增加少量成本(每帧0.04-0.14毫秒)。我们还改进了加权重要性采样,以确保我们的方法不会使误差超过单样本随机纹理滤波。 在高倍放大情况下,我们的方法比单样本STF高出>10 dB的PSNR。我们的结果显示,无论是否使用时空去噪,图像质量都得到了极大的提升。
Comments: Accepted to 2025 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2025)
Subjects: Graphics (cs.GR) ; Computer Vision and Pattern Recognition (cs.CV)
Cite as: arXiv:2504.05562 [cs.GR]
  (or arXiv:2504.05562v1 [cs.GR] for this version)
  https://doi.org/10.48550/arXiv.2504.05562
arXiv-issued DOI via DataCite
Journal reference: Proceedings of the ACM on Computer Graphics and Interactive Techniques (2025), Volume 8, Issue 1, Article No: 14. Publication date: May 2025
Related DOI: https://doi.org/10.1145/3728292
DOI(s) linking to related resources

Submission history

From: Bartlomiej Wronski [view email]
[v1] Mon, 7 Apr 2025 23:28:52 UTC (30,197 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon 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号