会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 71. 发明授权
    • Encoding visual data with computation scheduling and allocation
    • 用计算调度和分配编码视觉数据
    • US08358693B2
    • 2013-01-22
    • US11457705
    • 2006-07-14
    • Yan LuFeng WuWei PuShipeng Li
    • Yan LuFeng WuWei PuShipeng Li
    • H04N7/12H04N11/02
    • H04N19/567H04N19/127H04N19/156H04N19/172H04N19/19H04N19/196H04N19/43H04N19/533H04N19/557
    • Computation scheduling and allocation for visual communication is described. In one aspect, multiple frames of video data are encoded by allocating for at least a subset of inter-coded frames, on frame-by-frame basis, computational resources to encode the inter-coded frame. To this end, a computational budget to encode a current inter-coded frame is estimated. The estimate is based on the actual computational costs to encode a previous inter-coded frame of video data. Next, sets of operations associated with encoding the current inter-coded frame are analyzed to determine computational resources to implement the operations. If the computational resources exceed the computational budget, complexity of the operations is reduced until the associated computational resources are less than or equal to the computational budget. At this point, the current inter-coded frame is encoded using the operations and the computational budget. This process is repeated for the remaining inter-coded frames of video data.
    • 描述视觉通信的计算调度和分配。 在一个方面,通过在逐帧的基础上为帧间编码帧的至少一个子集分配计算资源来编码帧间编码帧来编码多个视频数据帧。 为此,估计用于编码当前帧间编码帧的计算预算。 该估计是基于对先前的视频数据的帧间编码帧进行编码的实际计算成本。 接下来,分析与当前帧间编码帧的编码相关联的操作集合,以确定用于实现操作的计算资源。 如果计算资源超过计算预算,则减少操作的复杂度,直到相关的计算资源小于或等于计算预算。 此时,使用操作和计算预算对当前帧间编码帧进行编码。 对于视频数据的剩余帧间编码帧重复该过程。
    • 72. 发明授权
    • Wyner-Ziv coding with multiple side information
    • Wyner-Ziv编码与多方信息
    • US08340192B2
    • 2012-12-25
    • US12047317
    • 2008-03-12
    • Yan LuFeng WuMei GuoShipeng Li
    • Yan LuFeng WuMei GuoShipeng Li
    • H04N11/04
    • H03M7/30H03M13/2957H03M13/6312
    • A Wyner-Ziv coding scheme jointly utilizes multiple side information at the decoder is described. A new probability model is introduced based on an extended turbo decoding trellis, so that the transitional probability is calculated from the probabilities conditioned on multiple side information. The proposed scheme handles multiple side information in a multi-dimensional manner to potentially achieve coding performance better than either selecting one side information or generating a single side information by averaging several side information. When the decoder receives multiple streams of parity bits, the conditional probabilities on the parity bits from the multiple streams all contribute in turbo decoding. The errors existing in some of the streams can be automatically eliminated during the decoding process.
    • 描述了在解码器处共同利用多边信息的Wyner-Ziv编码方案。 基于扩展turbo解码网格引入新的概率模型,从而根据多边信息的概率计算过渡概率。 所提出的方案以多维方式处理多个侧面信息,以便比选择一个侧面信息或通过平均多个边缘信息来生成单个侧面信息来潜在地实现编码性能。 当解码器接收到多个奇偶校验位流时,来自多个流的奇偶校验位的条件概率在turbo解码中都有贡献。 在解码过程中可以自动消除一些流中存在的错误。
    • 73. 发明授权
    • High dynamic range texture compression
    • 高动态范围纹理压缩
    • US08165393B2
    • 2012-04-24
    • US12133369
    • 2008-06-05
    • Yan LuWen SunFeng WuShipeng Li
    • Yan LuWen SunFeng WuShipeng Li
    • G06K9/36
    • 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位整数格式。 可以修改亮度值以恢复与第二块的局部线性特性。 第二个块可能被压缩。
    • 74. 发明授权
    • Strategies for compressing textures
    • 压缩纹理的策略
    • US07714873B2
    • 2010-05-11
    • US11627171
    • 2007-01-25
    • Andrew C. FlavellYan LuWen SunFeng WuShipeng Li
    • Andrew C. FlavellYan LuWen SunFeng WuShipeng Li
    • G06K9/36G06K9/00G09G5/02G06T17/20G06T17/00H04B1/66H04B14/06
    • 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纹理信息相比,该技术允许更经济地存储纹理信息,以及更有效地将纹理信息从存储器加载到存储器。
    • 75. 发明授权
    • Strategies for lossy compression of textures
    • 纹理有损压缩的策略
    • US07683910B2
    • 2010-03-23
    • US11627228
    • 2007-01-25
    • Yan LuWen SunAndrew C. FlavellFeng WuShipeng Li
    • Yan LuWen SunAndrew C. FlavellFeng WuShipeng Li
    • G06K9/36G06T17/20G06T17/00G06T9/00G09G5/02G06K9/00
    • G06T9/005G06T15/04H04N19/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纹理信息相比,该技术允许更经济地存储纹理信息,以及更有效地将纹理信息从存储器加载到存储器。
    • 76. 发明申请
    • VIDEO CODING
    • 视频编码
    • US20090245373A1
    • 2009-10-01
    • US12474821
    • 2009-05-29
    • Alexandros TourapisFeng WuShipeng Li
    • Alexandros TourapisFeng WuShipeng Li
    • H04N7/32
    • H04N19/109H04N19/147H04N19/176H04N19/513H04N19/52H04N19/56H04N19/573H04N19/577
    • Improved video coding is described to encode video data within a sequence of video frames. To this end, at least a portion of a reference frame is encoded to include motion information associated with the portion of the reference frame. At least a portion of a predictable frame that includes video data predictively correlated to said portion of said reference frame is defined based on the motion information. At least said portion of the predictable frame is encoded without including corresponding motion information and including mode identifying data. The mode identifying data indicate that the encoded portion of the predictable frame can be directly derived using at least the motion information associated with the portion of the reference frame.
    • 描述了改进的视频编码以对视频帧序列内的视频数据进行编码。 为此,参考帧的至少一部分被编码以包括与参考帧的该部分相关联的运动信息。 基于运动信息来定义包括与所述参考帧的所述部分预测相关的视频数据的可预测帧的至少一部分。 可预测帧的至少所述部分被编码而不包括对应的运动信息并且包括模式识别数据。 模式识别数据指示可以使用至少与参考帧的部分相关联的运动信息直接导出可预测帧的编码部分。
    • 80. 发明申请
    • Request Bits Estimation for a Wyner-Ziv Codec
    • Wyner-Ziv编解码器的请求位估计
    • US20080079612A1
    • 2008-04-03
    • US11537947
    • 2006-10-02
    • Yan LuMei GuoFeng WuShipeng Li
    • Yan LuMei GuoFeng WuShipeng Li
    • H03M7/00
    • H03M7/30H04N19/395
    • Request bits estimation for a Wyner-Ziv codec is described. In one aspect, and prior to communicating Wyner-Ziv parity bits to a Wyner-Ziv decoder, an estimated total number of parity bits to send to the Wyner-Ziv decoder are determined. This estimated number of parity bits allows the Wyner-Ziv decoder to reconstruct a frame of different coded content using the Wyner-Ziv parity bits such that the reconstructed frame will meet particular quality criteria. This estimated number of parity bits is determined independent of a request-bits feedback loop between the Wyner-Ziv coder and the Wyner-Ziv decoder. The estimated number of parity bits is communicated to the Wyner-Ziv decoder for reconstruction and presentation of the frame to a user.
    • 描述了Wyner-Ziv编解码器的请求比特估计。 在一个方面中,并且在将Wyner-Ziv奇偶校验位传送到Wyner-Ziv解码器之前,确定发送到Wyner-Ziv解码器的估计的奇偶校验位数。 该估计的奇偶校验位数允许Wyner-Ziv解码器使用Wyner-Ziv奇偶校验位来重建不同编码内容的帧,使得重建的帧将满足特定的质量标准。 独立于Wyner-Ziv编码器和Wyner-Ziv解码器之间的请求位反馈环路来确定该估计的奇偶校验位数。 将估计的奇偶校验位数传送给Wyner-Ziv解码器,以重构并向用户呈现帧。