公开(公告)号：US09483869B2

公开(公告)日：2016-11-01

申请号：US14274958

申请日：2014-05-12

Applicant: Intel Corporation

Inventor： Carl J. Munkberg ,  Karthik Vaidyanathan ,  Jon N. Hasselgren ,  Franz P. Clarberg ,  Tomas G. Akenine-Moller ,  Marco Salvi

IPC: G06T15/50 ,  G06T15/06 ,  G06T5/50 ,  H04N5/232

CPC classification number: G06T15/503 ,  G06T5/50 ,  G06T15/06 ,  G06T15/50 ,  G06T15/506 ,  G06T2200/21 ,  G06T2207/10052 ,  H04N5/23229

Abstract: Real-time light field reconstruction for defocus blur may be used to handle the case of simultaneous defocus and motion blur. By carefully introducing a few approximations, a very efficient sheared reconstruction filter is derived, which produces high quality images even for a very low number of input samples in some embodiments. The algorithm may be temporally robust, and is about two orders of magnitude faster than previous work, making it suitable for both real-time rendering and as a post-processing pass for high quality rendering in some embodiments.

Abstract translation: 用于散焦模糊的实时光场重建可用于处理同时散焦和运动模糊的情况。 通过仔细地引入几个近似值，导出非常有效的剪切重建滤波器，即使在一些实施例中对于非常低数量的输入样本也可产生高质量图像。 该算法可以在时间上是稳健的，并且比以前的工作快两个数量级，使得它在一些实施例中适合于实时渲染和用于高质量渲染的后处理通行。

公开(公告)号：US09390550B2

公开(公告)日：2016-07-12

申请号：US14056131

申请日：2013-10-17

Applicant: Intel Corporation

Inventor： Carl J. Munkberg ,  Jon N. Hasselgren ,  Tomas G. Akenine-Moller

IPC: G06T15/30 ,  G06T15/40 ,  G06T13/20

CPC classification number: G06T15/30 ,  G06T13/20 ,  G06T15/405

Abstract: Efficient overlap tests between a screen space tile and a moving triangle with per-vertex motion following Bézier curves report conservative time bounds in which the moving triangle overlaps with a tile. The tests can be used in designing efficient hierarchical traversal algorithms for higher order motion blur rendering.

Abstract translation: 屏幕空间瓦片和Bézier曲线之后的每顶点运动的移动三角形之间的高效重叠测试报告了运动三角形与瓦片重叠的保守时间范围。 这些测试可用于设计高阶运动模糊渲染的高效层次遍历算法。

公开(公告)号：US09183652B2

公开(公告)日：2015-11-10

申请号：US13991452

申请日：2013-05-15

Applicant: Intel Corporation

Inventor： Jon N. Hasselgren ,  Tomas G. Akenine-Moller ,  Carl J. Munkberg ,  Franz P. Clarberg ,  Jim K. Nilsson

IPC: G06T5/00 ,  G06T15/00 ,  G06T11/40 ,  G06T7/00 ,  G06T7/40

CPC classification number: G06T11/40 ,  G06T7/49 ,  G06T7/529 ,  G06T15/005

Abstract: Cache thrashing or over-accessing of a cache can be reduced by reversing the order of traversal of a triangle on different granularities. In the case where triangles are not grouped, the traverse order may be reversed on each triangle. In cases where triangles are grouped, the traversal order may be reversed with each group change. However, when motion is excessive, for example beyond a threshold, then the traversal order reversal may be disabled.

Abstract translation: 可以通过反转不同粒度的三角形遍历顺序来减少高速缓存的高速缓存颠簸或超级访问。 在三角形未分组的情况下，每个三角形上的横移顺序可以颠倒。 在三角形分组的情况下，遍历顺序可以反转，每组改变。 然而，当运动过大时，例如超过阈值，则可以禁用遍历顺序反转。