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

1. 发明申请

US20160086299A1 Position-Only Shading Pipeline 有权
标题翻译：仅定位着色管道
公开(公告)号：US20160086299A1
公开(公告)日：2016-03-24
申请号：US14494653
申请日：2014-09-24
申请人： Saurabh Sharma , Subramaniam Maiyuran , Thomas A. Piazza , Kalyan K. Bhiravabhatla , Peter L. Doyle , Paul A. Johnson , Bimal Poddar , Jon N. Hasselgren , Carl J. Munkberg , Tomas G. Akenine-Moller , Harri Syrja , Kevin Rogovin , Robert L. Farrell
发明人： Saurabh Sharma , Subramaniam Maiyuran , Thomas A. Piazza , Kalyan K. Bhiravabhatla , Peter L. Doyle , Paul A. Johnson , Bimal Poddar , Jon N. Hasselgren , Carl J. Munkberg , Tomas G. Akenine-Moller , Harri Syrja , Kevin Rogovin , Robert L. Farrell
IPC分类号： G06T1/20 , G06T15/40
CPC分类号： G06T1/20 , G06T15/40 , G06T15/405 , G06T15/503 , G09G5/393
摘要： In position-only shading, two geometry pipes exist, a trimmed down version called the Cull Pipe and a full version called the Replay Pipe. Thus, the Cull Pipe executes the position shaders in parallel with the main application, but typically generates the critical results much faster as it fetches and shades only the position attribute of the vertices and avoids the rasterization as well as the rendering of pixels for the frame buffer. Furthermore, the Cull Pipe uses these critical results to compute visibility information for all the triangles whether they are culled or not. On the other hand, the Replay Pipe consumes the visibility information to skip the culled triangles and shades only the visible triangles that are finally passed to the rasterization phase. Together the two pipes can hide the long cull runs of discarded triangles and can complete the work faster in some embodiments.
摘要翻译：在仅位置阴影中，存在两个几何管道，一个称为Cull管道的修剪版本以及称为Replay Pipe的完整版本。因此，Cull管道与主应用程序并行执行位置着色器，但是通常会生成关键结果的速度要快得多，因为它仅获取和仅阴影顶点的位置属性，并避免光栅化以及帧的像素渲染缓冲。此外，Cull管道使用这些关键结果来计算所有三角形的可见性信息，无论它们是否被淘汰。另一方面，重放管道消耗可见性信息来跳过被剔除的三角形，并仅遮蔽最终传递到光栅化阶段的可见三角形。两个管道一起可以隐藏丢弃的三角形的长的剔除运行，并且在一些实施例中可以更快地完成工作。

2. 发明授权

US09305368B2 Compression and decompression of graphics data using pixel region bit values 有权
标题翻译：使用像素区域位值对图形数据进行压缩和解压缩
公开(公告)号：US09305368B2
公开(公告)日：2016-04-05
申请号：US13924151
申请日：2013-06-21
申请人： Tomas G. Akenine-Moller , Jim K. Nilsson , Prasoonkumar Surti , Jon N. Hasselgren , Carl J. Munkberg
发明人： Tomas G. Akenine-Moller , Jim K. Nilsson , Prasoonkumar Surti , Jon N. Hasselgren , Carl J. Munkberg
IPC分类号： G06K9/46 , G06T9/00
CPC分类号： G06T1/60 , G06K9/4652 , G06K2009/4666 , G06T7/90 , G06T9/00 , G06T11/00 , G06T2200/28 , G06T2207/20021
摘要： Techniques related to graphics rendering including techniques for compression and/or decompression of graphics data by use of pixel region bit values are described.
摘要翻译：描述了与图形渲染相关的技术，包括通过使用像素区域位值来压缩和/或解压缩图形数据的技术。

3. 发明申请

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.
摘要翻译：描述了可以延迟或甚至阻止使用存储器来存储与瓦片相关联的三角形以及处理与顶点着色和合并三角形相关联的资源的技术。这些技术还可以在一组核心之间提供更好的负载平衡，从而提供更好的性能。生成一个边界体来表示一个几何组。进行剔除以确定几何组是否具有呈现的三角形。顶点阴影和三角形与瓦片的关联可以并行执行多个核心。分配处理资源用于光栅化其三角形已经被顶点着色的图块，并且在三角形尚未被顶点着色和分块的图块上进行分块。不同瓦片三角形的光栅化可以由多个并行的核心执行。

4. 发明申请

US20150326862A1 Clustering and Encoding for Color Compression 审中-公开
标题翻译：颜色压缩的聚类和编码
公开(公告)号：US20150326862A1
公开(公告)日：2015-11-12
申请号：US14270435
申请日：2014-05-06
申请人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg
发明人： Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg
IPC分类号： H04N19/136 , H04N19/137
CPC分类号： H04N19/136 , G06T9/00 , G06T11/00 , G06T11/40 , H04N1/41 , H04N19/137 , H04N19/186 , H04N19/428 , H04N19/50
摘要： First, the colors are partitioned within a tile into distinct groups, such that the variation of color within each group is lowered. Second, each group can be encoded in an efficient manner. The algorithm described herein may give a higher compression ratio than previous algorithms, and therefore may further reduce memory bandwidth at a very low increase in computational cost in some embodiments. The algorithm may be added to a system with existing buffer compression algorithms, handling additional tiles that the existing algorithm fails to compress, thereby increasing the overall compression rate.
摘要翻译：首先，将颜色在瓦片内划分成不同的组，使得每组中的颜色变化降低。第二，每组可以有效地编码。这里描述的算法可以给出比先前的算法更高的压缩比，并且因此在一些实施例中可以以非常低的计算成本增加进一步减少存储器带宽。可以将该算法添加到具有现有缓冲器压缩算法的系统中，处理现有算法无法压缩的附加瓦片，从而增加总体压缩率。

5. 发明申请

US20140258754A1 Reducing Power Consumption During Graphics Rendering 有权
标题翻译：降低图形渲染期间的功耗
公开(公告)号：US20140258754A1
公开(公告)日：2014-09-11
申请号：US13784950
申请日：2013-03-05
申请人： Tomas G. Akenine-Moller , Bjorn Johnsson , Magnus Andersson , Jim K. Nilsson , Robert M. Toth , Carl J. Munkberg , Jon N. Hasselgren
发明人： Tomas G. Akenine-Moller , Bjorn Johnsson , Magnus Andersson , Jim K. Nilsson , Robert M. Toth , Carl J. Munkberg , Jon N. Hasselgren
IPC分类号： G06F1/32
CPC分类号： G06F1/3296 , G06F1/3203 , G06F1/3228 , G06F1/3234 , G06F1/324 , G06F1/329 , Y02D10/126 , Y02D10/24
摘要： In accordance with some embodiments, the knowledge that a capped frame time is used can be exploited to reduce power consumption. Generally a capped frame time is a pre-allocated amount of time to apply power for rendering in graphics processing. Generally the frame time involves the application of power and some down time in which only idle power is applied pending the next frame time. By making better use of that down time, power consumption reductions can be achieved in some embodiments.
摘要翻译：根据一些实施例，可以利用使用加盖帧时间的知识来降低功耗。通常，加盖帧时间是在图形处理中应用电力进行渲染的预分配时间量。通常，帧时间涉及在下一帧时间内仅施加空闲功率的功率和一些停机时间。通过更好地利用该停机时间，在一些实施例中可以实现功耗降低。

6. 发明授权

US09466090B2 Subset based compression and decompression of graphics data 有权
标题翻译：基于子集的图形数据压缩和解压缩
公开(公告)号：US09466090B2
公开(公告)日：2016-10-11
申请号：US13922404
申请日：2013-06-20
申请人： Prasoonkumar Surti , Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Jim. K. Nilsson
发明人： Prasoonkumar Surti , Tomas G. Akenine-Moller , Jon N. Hasselgren , Carl J. Munkberg , Jim. K. Nilsson
IPC分类号： G06T1/60 , G06T11/40 , G06T9/00
CPC分类号： G06T1/60 , G06T9/005 , G06T11/40
摘要： Techniques related to graphics rendering including techniques for compression and/or decompression of graphics data by use of indexed subsets are described. In one example, compression in graphics rendering may include determining a plurality of color values associated with individual pixels of a tile of pixels, generating a subset of the plurality of color values such that the subset of the plurality of color values include one or more distinct color values from the plurality of color values, associating an index value with each color value of the subset of the plurality of color values, determining, for each of the individual pixels, an associated pixel index value to generate a plurality of pixel index values associated with the individual pixels of the tile of pixels, storing, in memory, graphics data including the subset of the plurality of color values, the associated index values, and the plurality of pixel index values.
摘要翻译：描述与图形渲染相关的技术，包括通过使用索引子集来压缩和/或解压缩图形数据的技术。在一个示例中，图形渲染中的压缩可以包括确定与像素块的各个像素相关联的多个颜色值，生成多个颜色值的子集，使得多个颜色值的子集包括一个或多个不同的颜色值将索引值与多个颜色值的子集的每个颜色值相关联，为每个单独的像素确定相关联的像素索引值以生成与多个颜色值相关的多个像素索引值与像素块的各个像素一起存储在存储器中，包括多个颜色值的子集，相关联的索引值和多个像素索引值的图形数据。

7. 发明申请

US20150187124A1 Adaptive Depth Offset Compression 有权
标题翻译：自适应深度偏移压缩
公开(公告)号：US20150187124A1
公开(公告)日：2015-07-02
申请号：US14141523
申请日：2013-12-27
申请人： Tomas G. Akenine-Moller , Magnus Andersson , Jon N. Hasselgren , Carl J. Munkberg , Robert M. Toth
发明人： Tomas G. Akenine-Moller , Magnus Andersson , Jon N. Hasselgren , Carl J. Munkberg , Robert M. Toth
IPC分类号： G06T15/40 , G09G5/39
CPC分类号： G06T15/405 , G06F3/14 , G06T9/00 , G06T15/005 , G09G5/39 , G09G5/393 , G09G2340/02 , G09G2360/122
摘要： Because using the same number of bits per residual depth offset compression is not the best distribution of bits, the bits per residual may be distributed instead according to the content of the depths of a tile. For example, if the depth differences close to the Zmax are small, then fewer bits can be spent on residuals for the samples that are encoded relative to Zmax. Consequently, more bits can be spent on the residuals for the samples that are encoded relative to Zmin. As a result, more tiles succeed at compressing to the required number of bits.
摘要翻译：因为每个残留深度偏移压缩使用相同数量的比特不是比特的最佳分布，所以根据瓦片的深度的内容可以分配每个残差的比特。例如，如果接近Zmax的深度差小，则相对于Zmax编码的样本的残差可以花费更少的位。因此，对于相对于Zmin编码的样本的残差，可以花费更多的比特。结果，更多的瓦片成功地压缩到所需的位数。

8. 发明申请

US20140375666A1 COMPRESSION AND DECOMPRESSION OF GRAPHICS DATA USING PIXEL REGION BIT VALUES 有权
标题翻译：使用像素区域位值的图形数据的压缩和解码
公开(公告)号：US20140375666A1
公开(公告)日：2014-12-25
申请号：US13924151
申请日：2013-06-21
申请人： Tomas G. Akenine-Moller , Jim K. Nilsson , Prasoonkumar Surti , Jon N. Hasselgren , Carl J. Munkberg
发明人： Tomas G. Akenine-Moller , Jim K. Nilsson , Prasoonkumar Surti , Jon N. Hasselgren , Carl J. Munkberg
IPC分类号： G06T9/00
CPC分类号： G06T1/60 , G06K9/4652 , G06K2009/4666 , G06T7/90 , G06T9/00 , G06T11/00 , G06T2200/28 , G06T2207/20021
摘要： Techniques related to graphics rendering including techniques for compression and/or decompression of graphics data by use of pixel region bit values are described.
摘要翻译：描述了与图形渲染相关的技术，包括通过使用像素区域位值来压缩和/或解压缩图形数据的技术。

9. 发明申请

US20140313194A1 Culling for Higher-Order Motion Blur Rasterization 有权
标题翻译：剔除高阶运动模糊栅格化
公开(公告)号：US20140313194A1
公开(公告)日：2014-10-23
申请号：US14056131
申请日：2013-10-17
申请人： Carl J. Munkberg , Jon N. Hasselgren , Tomas G. Akenine-Moller
发明人： Carl J. Munkberg , Jon N. Hasselgren , Tomas G. Akenine-Moller
IPC分类号： G06T15/08
CPC分类号： G06T15/30 , G06T13/20 , G06T15/405
摘要： 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.
摘要翻译：屏幕空间瓦片和Bézier曲线之后的每顶点运动的移动三角形之间的高效重叠测试报告了运动三角形与瓦片重叠的保守时间范围。这些测试可用于设计高阶运动模糊渲染的高效层次遍历算法。

10. 发明授权

US09569879B2 Culling using linear bounds for stochastic rasterization 有权
标题翻译：使用线性边界进行随机光栅化处理
公开(公告)号：US09569879B2
公开(公告)日：2017-02-14
申请号：US14119977
申请日：2012-05-31
申请人： Carl J. Munkberg , Tomas G. Akenine-Moller , Jon N. Hasselgren
发明人： Carl J. Munkberg , Tomas G. Akenine-Moller , Jon N. Hasselgren
IPC分类号： G06T15/00 , G02B27/00 , G06T15/40 , G06T15/50
CPC分类号： G06T15/005 , G02B27/0075 , G06T15/40 , G06T15/503
摘要： We present a new culling test for rasterization of simultaneous depth of field and motion blur, which efficiently reduces the set of (x, y, u, v, t) samples that need to be coverage tested within a screen space tile. The test finds linear bounds in u, t space and v, t space respectively, using a separating line algorithm. This test is part of the foundation for an efficient 5D rasterizer that extracts coherence in both defocus and motion blur to minimize the number of visibility tests.
摘要翻译：我们提出了一种用于同时景深和运动模糊的光栅化的新的剔除测试，这有效地减少了需要在屏幕空间瓦片内覆盖测试的（x，y，u，v，t）样本集。测试使用分离线算法分别在u，t空间和v，t空间中找到线性边界。该测试是高效5D光栅化器的基础的一部分，其提取散焦和运动模糊中的相干性，以最小化可见性测试的数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式