会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明申请
    • UNIFIED TEXTURE COMPRESSION FRAMEWORK
    • 统一纹理压缩框架
    • US20090322777A1
    • 2009-12-31
    • US12146496
    • 2008-06-26
    • Yan LuWen SunFeng WuShipeng Li
    • Yan LuWen SunFeng WuShipeng Li
    • G09G5/00
    • G06T15/04G06T9/00G06T2207/20208
    • A method for compressing textures. A first block of texels is transformed from a red-green-blue (RGB) space to a second block of texels in a luminance-chrominance space. The first block has red values, green values and blue values. The second block has luminance values and chrominance values. The chrominance values may be based on a sum of the red values, a sum of the green values and a sum of the blue values. The chrominance values may be sampled for a first subset of texels in the second block. The luminance values and the sampled chrominance values may be converted to an 8-bit integer format. The luminance values of the first subset may be modified to restore a local linearity property to the first subset. The second block may be compressed into a third block.
    • 一种压缩纹理的方法。 纹素的第一块从红 - 绿 - 蓝(RGB)空间转换为亮度 - 色度空间中的纹素的第二块。 第一个块具有红色值,绿色值和蓝色值。 第二块具有亮度值和色度值。 色度值可以基于红色值的总和,绿色值的和与蓝色值的和。 可以对第二块中的纹素的第一子集对色度值进行采样。 亮度值和采样色度值可以被转换成8位整数格式。 可以修改第一子集的亮度值以恢复与第一子集的局部线性特性。 第二块可以被压缩成第三块。
    • 92. 发明申请
    • HIGH DYNAMIC RANGE TEXTURE COMPRESSION
    • 高动态范围压缩
    • US20090304298A1
    • 2009-12-10
    • US12133369
    • 2008-06-05
    • Yan LuWen SunFeng WuShipeng Li
    • Yan LuWen SunFeng WuShipeng Li
    • G06K9/00
    • G06T9/00
    • A method for compressing a high dynamic range (HDR) texture. A first block of texels of the HDR texture in a red-green-blue (RGB) space may be transformed to a second block of texels in a luminance-chrominance space. The first block may have red values, green values and blue values. The second block may have luminance values and chrominance values. The chrominance values may be based on a sum of the red values, a sum of the green values and a sum of the blue values. The luminance values and the chrominance values may be converted to an 8-bit integer format. The luminance values may be modified to restore a local linearity property to the second block. The second block may be compressed.
    • 一种用于压缩高动态范围(HDR)纹理的方法。 红 - 绿 - 蓝(RGB)空间中的HDR纹理的纹素的第一块可以被变换为亮度 - 色度空间中的第二纹理纹理块。 第一个块可能具有红色值,绿色值和蓝色值。 第二块可以具有亮度值和色度值。 色度值可以基于红色值的总和,绿色值的和与蓝色值的和。 亮度值和色度值可以被转换成8位整数格式。 可以修改亮度值以恢复与第二块的局部线性特性。 第二个块可能被压缩。
    • 95. 发明申请
    • Strategies for Compressing Textures
    • 压缩纹理的策略
    • US20080002895A1
    • 2008-01-03
    • US11627171
    • 2007-01-25
    • Andrew C. FlavellYan LuWen SunFeng WuShipeng Li
    • Andrew C. FlavellYan LuWen SunFeng WuShipeng Li
    • G06K9/36G06K9/46
    • G06T9/005H04N19/186
    • A technique is described for compressing textures for use in a graphics application, such as a 3D game application. The technique includes parsing first-compressed texture information (e.g., S3TC texture information) into respective components of the first-compressed texture information (such as main color information, color index information, main alpha information, and alpha index information). The technique then further compresses the respective components to yield second-compressed texture information (referred to as modified compressed texture information or MCT texture information). The MCT texture information can be stored and then decoded to reconstruct the original S3TC texture information for use in the graphics application. Compared to the use of unmodified S3TC texture information, the technique allows more economical storage of texture information, as well as more efficient loading of the texture information from storage to memory.
    • 描述了一种用于压缩纹理以用于诸如3D游戏应用的图形应用中的技术。 该技术包括将第一压缩纹理信息(例如,S3TC纹理信息)解析成第一压缩纹理信息(诸如主色信息,颜色索引信息,主阿尔法信息和阿尔法索引信息)的各个分量。 然后,该技术进一步压缩各个组件以产生第二压缩纹理信息(称为修改的压缩纹理信息或MCT纹理信息)。 MCT纹理信息可以被存储然后被解码以重建用于图形应用中的原始S3TC纹理信息。 与使用未修改的S3TC纹理信息相比,该技术允许更经济地存储纹理信息,以及更有效地将纹理信息从存储器加载到存储器。
    • 97. 发明申请
    • Architecture for scalable video coding applications
    • 可扩展视频编码应用的架构
    • US20070112811A1
    • 2007-05-17
    • US11254843
    • 2005-10-20
    • Guo ShenFeng WuShipeng Li
    • Guo ShenFeng WuShipeng Li
    • G06F7/00
    • H04L65/4076H04L69/32H04N21/234354H04N21/23439H04N21/4424
    • An architecture provides adaptive access to scalable media codestreams. Minimum coding units from the codestream to facilitate presentation of the media content at a selected access level are collected in packettes. The data needed for the packettes are identified and assembled by a peering subsystem or peer layer that supplements a conventional architecture in a sending system. The packettes are communicated to one or more receiving systems, such as by collecting the packeftes into transport packets recognized by conventional architecture. The peering subsystem or peering layer of a receiving system unpacks the packeftes needed to support the desired access level to the media content. The peer subsystems or peer layers communicate between systems to effect changes in the packettes provided to adapt access levels or avoid waste of network resources. The architecture supports applications including multiple access level streaming of media content, device roaming, and time-dependent access level shifting.
    • 一种架构提供对可扩展媒体码流的自适应访问。 来自码流的最小编码单元便于在所选择的访问级别上呈现媒体内容以分组的形式收集。 通过在发送系统中补充传统架构的对等子系统或对等层来识别和组合数据包所需的数据。 分组被传送到一个或多个接收系统,例如通过将包装收集到由常规架构识别的传输分组中。 接收系统的对等子系统或对等层将包含支持所需的媒体内容所需的访问级别所需的包装解包。 对等子系统或对等层在系统之间进行通信,以实现为了适应接入级别而提供的分组的改变,或避免浪费网络资源。 该架构支持包括媒体内容的多个访问级流媒体,设备漫游和时间依赖的访问级别转换的应用。