会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 24. 发明授权
    • Method, system and computer program product for optimization of data compression
    • 方法,系统和计算机程序产品优化数据压缩
    • US08542940B2
    • 2013-09-24
    • US13615702
    • 2012-09-14
    • En-hui YangLongji Wang
    • En-hui YangLongji Wang
    • G06K9/00
    • H03M7/4006H03M7/46H04N19/124H04N19/13H04N19/147H04N19/176H04N19/19H04N19/60H04N19/91H04N19/93
    • A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value.
    • 通过确定在给定量化表和运行指数导数编码分布下由成本确定的(运行,索引导数)对序列表示的n个系数索引的成本确定的序列来压缩n个系数的序列,其中每个序列 (运行,索引导数)对定义相应的系数索引序列,使得(i)系数索引的相应序列中的每个索引是数字数字,(ii)系数索引的相应序列包括多个值,包括特殊的 值,和(iii)每个(运行,索引导数)对定义表示特殊值的连续索引的数目的运行值,以及基于索引的值,该索引依据索引的值, 特价。
    • 25. 发明授权
    • Rate-distortion optimization for advanced audio coding
    • 高级音频编码的速率失真优化
    • US08380524B2
    • 2013-02-19
    • US12626653
    • 2009-11-26
    • Guixing WuEn-hui YangLongji Wang
    • Guixing WuEn-hui YangLongji Wang
    • G10L19/00
    • G10L19/032G10L19/0017
    • A method for optimization of rate-distortion for Advanced Audio Coding (AAC). The method provides for the identification of quantized spectral coefficient sequences for optimization of rate-distortion. The method also provides joint optimization of scale factors, Huffman codebooks and quantized spectral coefficient sequences for minimization of a rate-distortion cost. The method provides an iterative rate-distortion optimization algorithm for AAC encoding. In each iteration, the method first finds the optimal scale factors and quantized spectral coefficients when Huffman codebooks are fixed, then updates Huffman codebooks and quantized spectral coefficients given the optimized scale factors. The iterations may be applied until a predetermined threshold is attained.
    • 用于优化高级音频编码(AAC)的速率失真的方法。 该方法提供用于确定速率失真优化的量化频谱系数序列。 该方法还提供缩放因子的联合优化,霍夫曼码本和量化频谱系数序列,以最小化速率失真成本。 该方法为AAC编码提供了一种迭代速率失真优化算法。 在每次迭代中,该方法首先在霍夫曼码本固定时首先找到最优比例因子和量化频谱系数,然后根据优化的比例因子更新霍夫曼码本和量化频谱系数。 可以应用迭代直到达到预定阈值。
    • 28. 发明授权
    • Method, system and computer program product for providing entropy constrained color splitting for palette images with color-wise splitting
    • 方法,系统和计算机程序产品,用于通过色彩分割为调色板图像提供熵约束的颜色分割
    • US08000547B2
    • 2011-08-16
    • US11534956
    • 2006-09-25
    • En-Hui YangLongji Wang
    • En-Hui YangLongji Wang
    • G06K9/46
    • H04N1/64H04N19/103H04N19/147H04N19/182H04N19/186H04N19/19H04N19/91H04N19/94H04N19/96
    • A method, system and computer program product for progressively encoding a digitized color image with M distinct colors by assigning each of the M distinct colors to an associated subset of pixels in the image, is provided. This involves: (a) initializing a tree structure with at least one starting leaf node comprising a subset of the M distinct colors; (b) determining at least one representative color for each starting leaf node; and (c) growing the tree structure by (i) selecting a leaf node n to become a non-leaf node based on the combined distortion and entropy rate resulting from turning the leaf node into the non-leaf node; (ii) allocating each color in leaf node n to one of the two new leaf nodes; (iii) determining a representative color for each new leaf node; and (iv) encoding the resulting index information, representative color information, and pixel information.
    • 提供了通过将M个不同颜色中的每一个分配给图像中的相关子像素来逐渐编码具有M个不同颜色的数字化彩色图像的方法,系统和计算机程序产品。 这涉及:(a)用至少一个包含M个不同颜色的子集的起始叶节点初始化树结构; (b)为每个起始叶节点确定至少一个代表颜色; 以及(c)通过以下方式来生长树结构:(i)基于将叶节点转换成非叶节点而导致的组合失真和熵速率,选择叶节点n成为非叶节点; (ii)将叶节点n中的每个颜色分配给两个新叶节点之一; (iii)确定每个新叶节点的代表性颜色; 和(iv)对所得到的索引信息,代表性颜色信息和像素信息进行编码。
    • 29. 发明申请
    • METHOD AND SYSTEM FOR OPTIMIZED VIDEO CODING
    • 优化视频编码的方法和系统
    • US20100238997A1
    • 2010-09-23
    • US12405447
    • 2009-03-17
    • En-hui YangLongji Wang
    • En-hui YangLongji Wang
    • H04N7/26
    • H04N19/19H04N19/103H04N19/105H04N19/124H04N19/147H04N19/176
    • A method and encoder for full rate-distortion optimization of video coding over four free parameters; namely, coding mode, motion vector, quantizer scaling factor, and transform domain coefficients. In all cases, the rate-distortion cost for each combination of the parameters is determined based on soft decision quantization; specifically, a graph-based searching algorithm that reveals the optimal quantized transform domain coefficients for encoding a macroblock or sub-block of a macroblock. The full joint optimization includes a full search of the product space defined by the possible combinations of the free parameters without approximations. Approximations and simplifications to reduce complexity are also disclosed.
    • 一种用于四个自由参数的视频编码全速率失真优化的方法和编码器; 即编码模式,运动矢量,量化器缩放因子和变换域系数。 在所有情况下,基于软判决量化确定每个参数组合的速率失真成本; 具体地,基于图的搜索算法,其揭示用于对宏块或宏块的子块进行编码的最佳量化变换域系数。 全面联合优化包括对由空闲参数的可能组合定义的产品空间进行全面搜索而无需近似。 还公开了减少复杂性的近似和简化。
    • 30. 发明申请
    • Method, System and Computer Program Product for Entropy Constrained Color Splitting for Palette Images with Pixel-Wise Splitting
    • 方法,系统和计算机程序产品的熵约束色彩分割调色板图像与像素智慧分裂
    • US20070076968A1
    • 2007-04-05
    • US11534942
    • 2006-09-25
    • En-hui YangLongji Wang
    • En-hui YangLongji Wang
    • G06K9/46G06K9/00
    • H04N1/64H04N19/103H04N19/147H04N19/182H04N19/186H04N19/19H04N19/91H04N19/94H04N19/96
    • A method, system and computer program product are provided for progressively encoding a digitized color image with M distinct colors allocated to a set of pixels using a data processing system, the digitized color image being provided by assigning each of the M distinct colors to at least one pixel in the set of pixels. This involves: (a) initializing a tree structure by providing at least one starting leaf node comprising a subset of pixels from the set of pixels; (b) determining at least one representative color for each starting leaf node; and (c) growing the tree structure by (i) selecting a leaf node n to become a non-leaf node n linked to two new leaf nodes based on an associated achievable cost, wherein the associated achievable cost is determined by 1) determining an associated change in distortion resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes; 2) determining an associated increase in entropy rate resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes; and, 3) determining the associated achievable cost based on the associated change in distortion and the associated increase in entropy rate; (ii) creating the two new leaf nodes by allocating each pixel in n to one of the two new leaf nodes; (iii) determining a representative color for each of the two new leaf nodes; and (iv) encoding the index information associated with the leaf node n, the representative colors of the two new leaf nodes, and information regarding each pixel in n.
    • 提供了一种方法,系统和计算机程序产品,用于使用数据处理系统逐行编码分配给一组像素的M个不同颜色的数字化彩色图像,所述数字化彩色图像通过将至少M个不同颜色中的每一个分配至少 像素集中的一个像素。 这涉及:(a)通过提供至少一个起始叶节点来初始化树结构,所述起始叶节点包括来自该像素集合的像素子集; (b)为每个起始叶节点确定至少一个代表颜色; 以及(c)通过以下方式来生长树结构:(i)基于相关联的可实现成本,选择叶节点n以变成与两个新叶节点相关联的非叶节点n,其中相关联的可实现成本通过以下方式确定:1) 通过将叶节点转换为链接到两个新叶节点的非叶节点而导致的失真相关联的变化; 2)确定通过将叶节点转换为链接到两个新叶节点的非叶节点而导致的相关联的熵率增加; 以及3)基于相关的失真变化和相关联的熵率增加来确定相关的可实现成本; (ii)通过将n中的每个像素分配给两个新的叶节点中的一个来创建两个新叶节点; (iii)确定两个新叶节点中的每一个的代表颜色; 和(iv)对与叶节点n相关联的索引信息,两个新叶节点的代表颜色以及关于n中的每个像素的信息进行编码。