-
1.发明授权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
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.
摘要翻译： 描述了与图形渲染相关的技术，包括通过使用像素区域位值来压缩和/或解压缩图形数据的技术。
-
公开(公告)号：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
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.
摘要翻译： 描述了可以延迟或甚至阻止使用存储器来存储与瓦片相关联的三角形以及处理与顶点着色和合并三角形相关联的资源的技术。 这些技术还可以在一组核心之间提供更好的负载平衡，从而提供更好的性能。 生成一个边界体来表示一个几何组。 进行剔除以确定几何组是否具有呈现的三角形。 顶点阴影和三角形与瓦片的关联可以并行执行多个核心。 分配处理资源用于光栅化其三角形已经被顶点着色的图块，并且在三角形尚未被顶点着色和分块的图块上进行分块。 不同瓦片三角形的光栅化可以由多个并行的核心执行。
-
公开(公告)号：US20150326862A1
公开(公告)日：2015-11-12
申请号：US14270435
申请日：2014-05-06
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.
摘要翻译： 首先，将颜色在瓦片内划分成不同的组，使得每组中的颜色变化降低。 第二，每组可以有效地编码。 这里描述的算法可以给出比先前的算法更高的压缩比，并且因此在一些实施例中可以以非常低的计算成本增加进一步减少存储器带宽。 可以将该算法添加到具有现有缓冲器压缩算法的系统中，处理现有算法无法压缩的附加瓦片，从而增加总体压缩率。
-
公开(公告)号：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.
摘要翻译： 根据一些实施例，可以利用使用加盖帧时间的知识来降低功耗。 通常，加盖帧时间是在图形处理中应用电力进行渲染的预分配时间量。 通常，帧时间涉及在下一帧时间内仅施加空闲功率的功率和一些停机时间。 通过更好地利用该停机时间，在一些实施例中可以实现功耗降低。
-
公开(公告)号：US09569879B2
公开(公告)日：2017-02-14
申请号：US14119977
申请日：2012-05-31
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光栅化器的基础的一部分，其提取散焦和运动模糊中的相干性，以最小化可见性测试的数量。
-
公开(公告)号：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
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管道使用这些关键结果来计算所有三角形的可见性信息，无论它们是否被淘汰。 另一方面，重放管道消耗可见性信息来跳过被剔除的三角形，并仅遮蔽最终传递到光栅化阶段的可见三角形。 两个管道一起可以隐藏丢弃的三角形的长的剔除运行，并且在一些实施例中可以更快地完成工作。
-
公开(公告)号：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
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.
摘要翻译： 可以通过反转不同粒度的三角形遍历顺序来减少高速缓存的高速缓存颠簸或超级访问。 在三角形未分组的情况下，每个三角形上的横移顺序可以颠倒。 在三角形分组的情况下，遍历顺序可以反转，每组改变。 然而，当运动过大时，例如超过阈值，则可以禁用遍历顺序反转。
-
公开(公告)号：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
摘要： 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.
摘要翻译： 在编译期间，如果可能，计算可编程剔除单元的间隔范围。 对于每个变量，在编译期间计算间隔边界，并且边界与其他元数据一起用于生成优化的剔除程序。 如果不可能，则可以作出假设，并且用于编译代码的假设。 如果假设证明是无效的，则可以作出新的假设，并且在一些实施例中代码可以被重新编译。
-
公开(公告)号：US20100253683A1
公开(公告)日：2010-10-07
申请号：US12618273
申请日：2009-11-13
IPC分类号： G06T15/30
CPC分类号： G06T17/20
摘要： A non-uniform fractional tessellation technique adapts a tessellation of a base object to the on-screen projection before the domain shader in a graphics processing pipeline executes. The tessellation is adapted in a non-uniform manner such that the distribution of vertices across the surface of the base object is substantially uniform when the base object is projected to screen space. Non-uniform tessellation may be applied to only a portion of the base object, and regular (uniform) tessellation may be applied to the other portion. In such a case, an edge interpolation technique is used to smoothly blend between the non-uniform and uniform portions.
摘要翻译： 在图形处理流水线中的域着色器执行之前，非均匀分数镶嵌技术将基础对象的镶嵌调整到屏幕投影。 镶嵌以不均匀的方式进行调整，使得当基础物体投射到屏幕空间时，顶点在基础物体的表面上的分布基本上是均匀的。 不均匀的细分可以仅应用于基础物体的一部分，并且规则（均匀）细分可以应用于另一部分。 在这种情况下，使用边缘内插技术来平滑地在不均匀和均匀的部分之间进行混合。
-
公开(公告)号：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
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.
摘要翻译： 用于散焦模糊的实时光场重建可用于处理同时散焦和运动模糊的情况。 通过仔细地引入几个近似值，导出非常有效的剪切重建滤波器，即使在一些实施例中对于非常低数量的输入样本也可产生高质量图像。 该算法可以在时间上是稳健的，并且比以前的工作快两个数量级，使得它在一些实施例中适合于实时渲染和用于高质量渲染的后处理通行。
-
-
-
-
-
-
-
-
-
搜索结果
46 条记录 (耗时 0.023 秒)
