专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20150154772A1 Variable Rasterization Order for Motion Blur and Depth of Field 有权
标题翻译：运动模糊和景深的可变光栅化顺序
公开(公告)号：US20150154772A1
公开(公告)日：2015-06-04
申请号：US13991452
申请日：2013-05-13
申请人： Jon N. Hasselgren , Tomas G. Akenine-Moller , Carl J. Munkberg , Franz P. Clarberg , Jim K. Nilsson
发明人： Jon N. Hasselgren , Tomas G. Akenine-Moller , Carl J. Munkberg , Franz P. Clarberg , Jim K. Nilsson
IPC分类号： G06T11/40 , G06T7/00 , G06T7/40
CPC分类号： G06T11/40 , G06T7/49 , G06T7/529 , G06T15/005
摘要： 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.
摘要翻译：可以通过反转不同粒度的三角形遍历顺序来减少高速缓存的高速缓存颠簸或超级访问。在三角形未分组的情况下，每个三角形上的横移顺序可以颠倒。在三角形分组的情况下，遍历顺序可以反转，每组改变。然而，当运动过大时，例如超过阈值，则可以禁用遍历顺序反转。

2. 发明申请

US20140300619A1 Programmable Tile Shader 有权
标题翻译：可编程瓦片着色器
公开(公告)号：US20140300619A1
公开(公告)日：2014-10-09
申请号：US13858988
申请日：2013-04-09
申请人： Jon N. Hasselgren , Tomas G. Akenine-Moller , Carl J. Munkberg , Jim K. Nilsson , Robert M. Toth , Franz P. Clarberg
发明人： Jon N. Hasselgren , Tomas G. Akenine-Moller , Carl J. Munkberg , Jim K. Nilsson , Robert M. Toth , Franz P. Clarberg
IPC分类号： G09G5/10
CPC分类号： G06T15/005
摘要： In accordance with some embodiments, a tile shader executes on a group of pixels prior to a pixel shader. The tile of pixels may be rectangular in some embodiments. The tile may be executed hierarchically, refining each tile into smaller subtiles until the pixel or sample level is reached. The tile shader program can be written to discard groups of pixels, thereby quickly removing areas of the bounding triangles that lie outside the shape being rasterized or quickly discarding groups of pixel shader executions that will not contribute to the final image.
摘要翻译：根据一些实施例，瓦片着色器在像素着色器之前的一组像素上执行。在一些实施例中，像素块可以是矩形的。可以分层执行瓦片，将每个瓦片细化为较小的子屏幕，直到达到像素或样品级别。可以将瓦片着色器程序写入丢弃像素组，从而快速移除位于正被光栅化的形状之外的边界三角形的区域，或快速丢弃不会对最终图像做出贡献的像素着色器执行组。

3. 发明申请

US20160283391A1 Compaction for Memory Hierarchies 有权
标题翻译：内存层次结构的压缩
公开(公告)号：US20160283391A1
公开(公告)日：2016-09-29
申请号：US14666756
申请日：2015-03-24
申请人： Jim K. Nilsson , Tomas G. Akenine-Moller , Franz P. Clarberg
发明人： Jim K. Nilsson , Tomas G. Akenine-Moller , Franz P. Clarberg
IPC分类号： G06F12/08
CPC分类号： G06F12/0893 , G06F12/023 , G06F12/0897 , G06F2212/1021 , G06F2212/1044 , G06F2212/302 , G06F2212/401 , G06F2212/455
摘要： In accordance with some embodiments, compaction, as contrasted with compression, is used to reduce the footprint of a near memory. In compaction, the density of data storage within a storage device is increased. In compression, the number of bits used to represent information is reduced. Thus you can have compression while still having sparse or non-contiguously arranged storage. As a result, compression may not always reduce the memory footprint. By compacting compressed data, the footprint of the information stored within the memory may be reduced. Compaction may reduce the need for far memory accesses in some cases.
摘要翻译：根据一些实施例，与压缩形成对比的压缩被用于减少近存储器的占用。在压缩时，存储设备内的数据存储密度增加。在压缩中，用于表示信息的比特数减少。因此，您可以具有压缩，同时仍然具有稀疏或非连续排列的存储。因此，压缩可能并不总是减少内存占用。通过压缩压缩数据，可以减少存储在存储器内的信息的占用面积。在某些情况下，压缩可能会减少对远程存储器访问的需求。

4. 发明申请

US20160055614A1 Image Processing Techniques 审中-公开
标题翻译：图像处理技术
公开(公告)号：US20160055614A1
公开(公告)日：2016-02-25
申请号：US14931285
申请日：2015-11-03
申请人： Tomas G. Akenine-Moller , Robert M. Toth , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg
发明人： Tomas G. Akenine-Moller , Robert M. Toth , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg
IPC分类号： G06T1/20 , G06T11/40
CPC分类号： G06T1/20 , G06T11/40 , G06T15/005 , G06T2210/12
摘要： Techniques are described that can delay or even prevent use of memory to store triangles associated with tiles as well as processing resources associated with vertex shading and binning triangles. The techniques can also provide better load balancing among a set of cores, and hence provide better performance. A bounding volume is generated to represent a geometry group. Culling takes place to determine whether a geometry group is to have triangles rendered. Vertex shading and association of triangles with tiles can be performed across multiple cores in parallel. Processing resources are allocated for rasterizing tiles whose triangles have been vertex shaded and binned over tiles whose triangles have yet to be vertex shaded and binned. Rasterization of triangles of different tiles can be performed by multiple cores in parallel.
摘要翻译：描述了可以延迟或甚至阻止使用存储器来存储与瓦片相关联的三角形以及处理与顶点着色和合并三角形相关联的资源的技术。这些技术还可以在一组核心之间提供更好的负载平衡，从而提供更好的性能。生成一个边界体来表示一个几何组。进行剔除以确定几何组是否具有呈现的三角形。顶点阴影和三角形与瓦片的关联可以并行执行多个核心。分配处理资源用于光栅化其三角形已经被顶点着色的图块，并且在三角形尚未被顶点着色和分块的图块上进行分块。不同瓦片三角形的光栅化可以由多个并行的核心执行。

5. 发明授权

US09038034B2 Compiling for programmable culling unit 有权
标题翻译：编译可编程剔除单元
公开(公告)号：US09038034B2
公开(公告)日：2015-05-19
申请号：US12644075
申请日：2009-12-22
申请人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg , Robert M. Toth
发明人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg , Robert M. Toth
IPC分类号： G06F9/45 , G06T15/40
CPC分类号： G06F8/41 , G06F8/443 , G06T15/40
摘要： During compilation, the interval bounds for a programmable culling unit are calculated if possible. For each variable, interval bounds are calculated during the compilation, and the bounds together with other metadata are used to generate an optimized culling program. If not possible, then an assumption may be made and the assumption used to compile the code. If the assumption proves to be invalid, a new assumption could be made and the code may be recompiled in some embodiments.
摘要翻译：在编译期间，如果可能，计算可编程剔除单元的间隔范围。对于每个变量，在编译期间计算间隔边界，并且边界与其他元数据一起用于生成优化的剔除程序。如果不可能，则可以作出假设，并且用于编译代码的假设。如果假设证明是无效的，则可以作出新的假设，并且在一些实施例中代码可以被重新编译。

6. 发明申请

US20150070355A1 Adaptive Multi-Frequency Shading 审中-公开
标题翻译：自适应多频阴影
公开(公告)号：US20150070355A1
公开(公告)日：2015-03-12
申请号：US14227045
申请日：2014-03-27
申请人： Franz P. Clarberg , Tomas G. Akenine-Moller , Robert M. Toth , Carl J. Munkberg
发明人： Franz P. Clarberg , Tomas G. Akenine-Moller , Robert M. Toth , Carl J. Munkberg
IPC分类号： G06T15/80
CPC分类号： G06T15/80 , G06T15/005
摘要： An architecture for pixel shading, enables flexible control of shading rates and automatic shading reuse between triangles in tessellated primitives in some embodiments. The cost of pixel shading may then be decoupled from the geometric complexity. Wider use of tessellation and fine geometry may be made more feasible, even at very limited power budgets. Shading may be done over small local grids in parametric patch space, with reusing of shading for nearby samples. The decomposition of shaders into multiple parts is supported, which parts are shaded at different frequencies. Shading rates can be locally and adaptively controlled, in order to direct the computations to visually important areas and to provide performance scaling with a graceful degradation of quality. Another important benefit, in some embodiments, of shading in patch space is that it allows efficient rendering of distribution effects, which further closes the gap between real-time and offline rendering.
摘要翻译：在一些实施例中，用于像素着色的架构能够灵活地控制着色速率和在镶嵌图元中的三角形之间的自动阴影重用。然后可以将像素着色的成本与几何复杂度分离。即使在非常有限的功率预算下，也可以更加可行地使用细分几何和细微几何。可以在参数补丁空间中的小局部网格上进行阴影处理，并对附近样本重新使用阴影。支持将着色器分解成多个部分，哪些部分以不同的频率进行着色。遮蔽率可以在本地和自适应控制下进行，以便将计算引导到视觉上重要的领域，并以优雅的质量下降来提供性能缩放。在一些实施例中，在贴片空间中的阴影的另一重要益处在于它允许有效地渲染分布效应，这进一步缩小了实时和离线渲染之间的差距。

7. 发明申请

US20150206340A1 Layered Reconstruction for Defocus and Motion Blur 有权
标题翻译：散焦和运动模糊的分层重建
公开(公告)号：US20150206340A1
公开(公告)日：2015-07-23
申请号：US14274958
申请日：2014-05-12
申请人： Carl J. Munkberg , Karthik Vaidyanathan , Jon N. Hasselgren , Franz P. Clarberg , Tomas G. Akenine-Moller , Marco Salvi
发明人： Carl J. Munkberg , Karthik Vaidyanathan , Jon N. Hasselgren , Franz P. Clarberg , Tomas G. Akenine-Moller , Marco Salvi
IPC分类号： G06T15/50 , G06T15/20 , G06T15/06 , G06T3/40 , G06T15/40
CPC分类号： G06T15/503 , G06T5/50 , G06T15/06 , G06T15/50 , G06T15/506 , G06T2200/21 , G06T2207/10052 , H04N5/23229
摘要： 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.
摘要翻译：用于散焦模糊的实时光场重建可用于处理同时散焦和运动模糊的情况。通过仔细地引入几个近似值，导出非常有效的剪切重建滤波器，即使在一些实施例中对于非常低数量的输入样本也可产生高质量图像。该算法可以在时间上是稳健的，并且比以前的工作快两个数量级，使得它在一些实施例中适合于实时渲染和用于高质量渲染的后处理通行。

8. 发明申请

US20150145873A1 Image Processing Techniques 有权
标题翻译：图像处理技术
公开(公告)号：US20150145873A1
公开(公告)日：2015-05-28
申请号：US13516781
申请日：2009-12-23
申请人： Tomas G. Akenine-Moller , Robert M. Toth , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg
发明人： Tomas G. Akenine-Moller , Robert M. Toth , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg
IPC分类号： G06T1/20 , G06T11/40
CPC分类号： G06T1/20 , G06T11/40 , G06T15/005 , G06T2210/12
摘要： Techniques are described that can delay or even prevent use of memory to store triangles associated with tiles as well as processing resources associated with vertex shading and binning triangles. The techniques can also provide better load balancing among a set of cores, and hence provide better performance. A bounding volume is generated to represent a geometry group. Culling takes place to determine whether a geometry group is to have triangles rendered. Vertex shading and association of triangles with tiles can be performed across multiple cores in parallel. Processing resources are allocated for rasterizing tiles that have been vertex shaded and binned triangles over tiles that have yet to be vertex shaded and binned triangles. Rasterization of triangles of different tiles can be performed by multiple cores in parallel.
摘要翻译：描述了可以延迟或甚至阻止使用存储器来存储与瓦片相关联的三角形以及处理与顶点着色和合并三角形相关联的资源的技术。这些技术还可以在一组核心之间提供更好的负载平衡，从而提供更好的性能。生成一个边界体来表示一个几何组。进行剔除以确定几何组是否具有呈现的三角形。顶点阴影和三角形与瓦片的关联可以并行执行多个核心。分配处理资源用于光栅化已经是顶点着色的瓦片，以及尚未成为顶点着色和二进制三角形的瓦片的二进制三角形。不同瓦片三角形的光栅化可以由多个并行的核心执行。

9. 发明申请

US20150097857A1 Selective Rasterization 有权
标题翻译：选择性光栅化
公开(公告)号：US20150097857A1
公开(公告)日：2015-04-09
申请号：US14047079
申请日：2013-10-07
申请人： Tomas G. Akenine-Moller , Carl J. Munkberg , Franz P. Clarberg
发明人： Tomas G. Akenine-Moller , Carl J. Munkberg , Franz P. Clarberg
IPC分类号： G06T3/00
CPC分类号： H02J7/007 , G01R19/0092 , G06T11/40 , H02J7/0052 , H02J7/0055 , H02J7/025 , H02J7/045
摘要： According to one embodiment, a given tile, made up of pixels or samples, may be of any shape, including a square shape. These pixels may contain colors, depths, stencil values, and other values. Each tile may be further augmented with a single bit, referred to herein as a render bit. In one embodiment, if the render bit is one, then everything is rendered as usual within the tile. However, if the render bit is zero, then nothing is rasterized to this tile and, correspondingly, depth tests, pixel shading, frame buffer accesses, and multi-sampled anti-aliasing (MSAA) resolves are not done for this tile. In other embodiments, some operations may be done nevertheless, but at least one operation is avoided based on the render bit. Of course, the render bits may be switched such that the bit zero indicates that everything should be rendered and the bit one indicates more limited rendering.
摘要翻译：根据一个实施例，由像素或样本组成的给定瓦片可以是包括正方形形状的任何形状。这些像素可能包含颜色，深度，模板值和其他值。每个瓦片可以用单个位进一步增强，这里称为渲染位。在一个实施例中，如果渲染位是一个，则所有内容在平铺块内像往常一样呈现。然而，如果渲染位为零，则没有任何内容被光栅化到该图块，相应地，不对该图块进行深度测试，像素着色，帧缓冲器访问和多采样抗锯齿（MSAA）解析。在其他实施例中，可以进行一些操作，但是基于渲染位来避免至少一个操作。当然，可以切换渲染比特，使得比特零表示应该呈现一切，并且比特1表示更有限的呈现。

10. 发明申请

US20110148876A1 Compiling for Programmable Culling Unit 有权
标题翻译：可编程剔除单元的编译
公开(公告)号：US20110148876A1
公开(公告)日：2011-06-23
申请号：US12644075
申请日：2009-12-22
申请人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg , Robert M. Toth
发明人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Franz P. Clarberg , Robert M. Toth
IPC分类号： G06T15/40
CPC分类号： G06F8/41 , G06F8/443 , G06T15/40
摘要： During compilation, the interval bounds for a programmable culling unit are calculated if possible. For each variable, interval bounds are calculated during the compilation, and the bounds together with other metadata are used to generate an optimized culling program. If not possible, then an assumption may be made and the assumption used to compile the code. If the assumption proves to be invalid, a new assumption could be made and the code may be recompiled in some embodiments.
摘要翻译：在编译期间，如果可能，计算可编程剔除单元的间隔范围。对于每个变量，在编译期间计算间隔边界，并且边界与其他元数据一起用于生成优化的剔除程序。如果不可能，则可以作出假设，并且用于编译代码的假设。如果假设证明是无效的，则可以作出新的假设，并且在一些实施例中代码可以被重新编译。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式