Distributed Denoising via Ghost Region Data Exchange

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing denoising frameworks for real-time ray tracing operate on a single machine, limiting their ability to access all rendered pixels for computing a denoised image when rendering is done across multiple devices, and they require extensive training data that may not adapt well to new scenarios.

Innovation Solution

A distributed denoising algorithm that uses machine learning, where nodes exchange 'ghost region' data to perform denoising operations, and a machine learning engine is continually trained and updated during runtime using a sub-region of the image, allowing it to improve its denoising capabilities dynamically.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If rendering is done across multiple devices, then productivity and image quality improve, but existing denoising frameworks cannot access all rendered pixels for computing denoised portions

Engineering Contradiction:
Improverendering throughputVSAvoidpixel data accessibility
Core Design Contradiction:
ProductivityVSLoss of information

Solution Approach 1:

The image is divided into multiple tiles that are rendered and processed across different devices. Each device handles a subset of tiles, and the system coordinates data exchange between devices to maintain access to rendered pixel information across the distributed rendering frontier, enabling denoising operations despite the distributed architecture.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If a fixed denoising model is used, then device complexity is reduced, but adaptability to new rendering scenarios deteriorates

Engineering Contradiction:
Improvemodel management complexityVSAvoidscenario adaptability
Core Design Contradiction:
Device complexityVSAdaptability or versatility

Solution Approach 1:

The denoising model transitions from a fixed, pre-trained configuration to a dynamic system that continuously learns from rendered image data during execution. The model adapts its parameters based on the specific rendering scene and tile data processed by each device, enabling automatic adaptation to new scenarios without manual reconfiguration.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system implements feedback loops where rendered tile data is fed back into the denoising model to refine and update model parameters. This continuous feedback mechanism allows the model to improve its performance on the current rendering task and adapt to variations in the scene, maintaining high adaptability while managing complexity through automated learning processes.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11900523B2Early termination in bottom-up acceleration data structure refit
Publication Date: 2024.02.13 INTEL CORP
  • US11900523B2 patent drawing
  • US11900523B2 patent drawing
  • US11900523B2 patent drawing

AI summary

Apparatus and method for bottom-up BVH refit. For example, one embodiment of an apparatus comprises: a hierarchical acceleration data structure generator to construct an acceleration data structure comprising a plurality of hierarchically arranged nodes; traversal hardware logic to traverse one or more rays through the acceleration data structure; intersection hardware logic to determine intersections between the one or more rays and one or more primitives within the hierarchical acceleration data structure; a node unit comprising circuitry and/or logic to perform refit operations on nodes of the hierarchical acceleration data structure, the refit operations to adjust spatial dimensions of one or more of the nodes; and an early termination evaluator to determine whether to proceed with refit operations or to terminate refit operations for a current node based on refit data associated with one or more child nodes of the current node.