Rate-distortion optimization for advanced audio coding
    1.
    发明授权
    Rate-distortion optimization for advanced audio coding 有权
    高级音频编码的速率失真优化

    公开(公告)号:US08380524B2

    公开(公告)日:2013-02-19

    申请号:US12626653

    申请日:2009-11-26

    IPC分类号: G10L19/00

    CPC分类号: G10L19/032 G10L19/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编码提供了一种迭代速率失真优化算法。 在每次迭代中,该方法首先在霍夫曼码本固定时首先找到最优比例因子和量化频谱系数,然后根据优化的比例因子更新霍夫曼码本和量化频谱系数。 可以应用迭代直到达到预定阈值。

    Optimization of MP3 audio encoding by scale factors and global quantization step size
    2.
    发明授权
    Optimization of MP3 audio encoding by scale factors and global quantization step size 有权
    通过缩放因子和全局量化步长优化MP3音频编码

    公开(公告)号:US08204744B2

    公开(公告)日:2012-06-19

    申请号:US12325409

    申请日:2008-12-01

    IPC分类号: G10L19/02 H03M7/40

    CPC分类号: G10L19/032

    摘要: An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.

    摘要翻译: 基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。

    OPTIMIZATION OF MP3 ENCODING WITH COMPLETE DECODER COMPATIBILITY
    3.
    发明申请
    OPTIMIZATION OF MP3 ENCODING WITH COMPLETE DECODER COMPATIBILITY 有权
    具有完整解码器兼容性的MP3编码优化

    公开(公告)号:US20100138225A1

    公开(公告)日:2010-06-03

    申请号:US12325409

    申请日:2008-12-01

    IPC分类号: G10L21/04

    CPC分类号: G10L19/032

    摘要: An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.

    摘要翻译: 基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。

    Optimization of MP3 audio encoding by scale factors and global quantization step size
    4.
    发明授权
    Optimization of MP3 audio encoding by scale factors and global quantization step size 有权
    通过缩放因子和全局量化步长优化MP3音频编码

    公开(公告)号:US08457957B2

    公开(公告)日:2013-06-04

    申请号:US13477121

    申请日:2012-05-22

    IPC分类号: G10L19/00 G10L19/02

    CPC分类号: G10L19/032

    摘要: An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.

    摘要翻译: 基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。

    Method, system and computer program product for entropy constrained color splitting for palette images with pixel-wise splitting
    5.
    发明授权
    Method, system and computer program product for entropy constrained color splitting for palette images with pixel-wise splitting 有权
    用于具有像素分割的调色板图像的熵约束色彩分割的方法,系统和计算机程序产品

    公开(公告)号:US08503807B2

    公开(公告)日:2013-08-06

    申请号:US13559854

    申请日:2012-07-27

    IPC分类号: G06K9/46

    摘要: A method, system and computer program product are provided for progressively encoding a digitized color image 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 initializing and growing the tree structure by 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 based on 1) a determined associated change in distortion resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes; and 2) a determined associated increase in entropy rate resulting from turning the leaf node into the non-leaf node linked to the two new leaf nodes.

    摘要翻译: 提供了一种方法,系统和计算机程序产品,用于使用数据处理系统逐行编码数字化彩色图像,通过将M个不同颜色中的每一个分配给该像素组中的至少一个像素来提供数字化彩色图像。 这涉及到通过基于相关的可实现成本选择叶节点n来变成链接到两个新叶节点的非叶节点n来初始化和增长树结构,其中相关联的可实现成本基于1)确定的相关联的变化 将叶节点转换为与两个新叶节点相连的非叶节点产生的失真; 和2)通过将叶节点转换为链接到两个新叶节点的非叶节点而导致的确定的熵率的相关联的增加。

    METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR PROVIDING ENTROPY CONSTRAINED COLOR SPLITTING FOR PALETTE IMAGES WITH COLOR-WISE SPLITTING
    6.
    发明申请
    METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR PROVIDING ENTROPY CONSTRAINED COLOR SPLITTING FOR PALETTE IMAGES WITH COLOR-WISE SPLITTING 有权
    方法,系统和计算机程序产品,用于提供彩色分割的PALETTE图像的入门约束色彩分割

    公开(公告)号:US20120039530A1

    公开(公告)日:2012-02-16

    申请号:US13186857

    申请日:2011-07-20

    IPC分类号: G06K9/00

    摘要: A method, system and computer program product for progressively encoding a digitized color image is provided. This involves: initializing a tree structure with at least one starting leaf node; determining at least one representative color for each starting leaf node; and 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; (ii) creating the two new leaf nodes by re-allocating each color in n; (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 a plurality of pixels of the digitized color image corresponding to the two representative colors of the two new leaf nodes.

    摘要翻译: 提供了用于逐行编码数字化彩色图像的方法,系统和计算机程序产品。 这包括:使用至少一个起始叶节点初始化树结构; 确定每个起始叶节点的至少一个代表颜色; 并且通过(i)基于相关联的可实现成本来选择叶节点n以变成链接到两个新叶节点的非叶节点n; (ii)通过在n中重新分配每种颜色来创建两个新的叶节点; (iii)确定两个新叶节点中的每一个的代表颜色; 以及(iv)编码与叶节点n相关联的索引信息,两个新叶节点的代表颜色,以及关于与两个新叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息。

    Method, system and computer program product for optimization of data compression
    7.
    发明授权
    Method, system and computer program product for optimization of data compression 有权
    方法,系统和计算机程序产品优化数据压缩

    公开(公告)号:US07978923B2

    公开(公告)日:2011-07-12

    申请号:US12774313

    申请日:2010-05-05

    IPC分类号: G06K9/46

    摘要: 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. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution.

    摘要翻译: 通过确定在给定量化表和运行指数导数编码分布下由成本确定的(运行,索引导数)对序列表示的n个系数索引的成本确定的序列来压缩n个系数的序列,其中每个序列 (运行,索引导数)对定义相应的系数索引序列,使得(i)系数索引的相应序列中的每个索引是数字数字,(ii)系数索引的相应序列包括多个值,包括特殊的 值,和(iii)每个(运行,索引导数)对定义表示特殊值的连续索引的数目的运行值,以及基于索引的值,该索引依据索引的值, 特价。 这涉及(a)使用给定的量化表和运行指数导数编码分布来为多个可能的(运行,索引导数)对序列制定成本函数; (b)将成本函数应用于(run,index)对的多个可能序列中的每个可能序列,以确定相关联的成本; 以及(c)基于多个可能的序列(run,index)中的每个的相关联的成本,从(run,index)对的多个可能序列中选择成本确定的(run,index) 指数衍生)对; 以及使用基于运行折射导数编码分布的熵编码对相应的所选成本确定的(运行,索引导数)对序列进行编码。

    METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION
    8.
    发明申请
    METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION 有权
    方法,系统和计算机程序产品优化数据压缩

    公开(公告)号:US20100272373A1

    公开(公告)日:2010-10-28

    申请号:US12774313

    申请日:2010-05-05

    IPC分类号: G06K9/46

    摘要: 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. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution.

    摘要翻译: 通过确定在给定量化表和运行指数导数编码分布下由成本确定的(运行,索引导数)对序列表示的n个系数索引的成本确定的序列来压缩n个系数的序列,其中每个序列 (运行,索引导数)对定义相应的系数索引序列,使得(i)系数索引的相应序列中的每个索引是数字数字,(ii)系数索引的相应序列包括多个值,包括特殊的 值,以及(iii)每个(运行,索引导数)对定义表示特殊值的连续索引的数目的运行值,以及基于索引的值,该值基于索引的值, 特价。 这涉及(a)使用给定的量化表和运行指数导数编码分布来为多个可能的(运行,索引导数)对序列制定成本函数; (b)将成本函数应用于(run,index)对的多个可能序列中的每个可能序列,以确定相关联的成本; 以及(c)基于多个可能的序列(run,index)中的每个的相关联的成本,从(run,index)对的多个可能序列中选择成本确定的(run,index) 指数衍生)对; 以及使用基于运行折射导数编码分布的熵编码对相应的所选成本确定的(运行,索引导数)对序列进行编码。

    Method, system and computer program product for optimization of data compression
    9.
    发明授权
    Method, system and computer program product for optimization of data compression 有权
    方法,系统和计算机程序产品优化数据压缩

    公开(公告)号:US07742643B2

    公开(公告)日:2010-06-22

    申请号:US11180513

    申请日:2005-07-14

    IPC分类号: G06K9/36

    摘要: 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. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution.

    摘要翻译: 通过确定在给定量化表和运行指数导数编码分布下由成本确定的(运行,索引导数)对序列表示的n个系数索引的成本确定的序列来压缩n个系数的序列,其中每个序列 (运行,索引导数)对定义相应的系数索引序列,使得(i)系数索引的相应序列中的每个索引是数字数字,(ii)系数索引的相应序列包括多个值,包括特殊的 值,和(iii)每个(运行,索引导数)对定义表示特殊值的连续索引的数目的运行值,以及基于索引的值,该索引依据索引的值, 特价。 这涉及(a)使用给定的量化表和运行指数导数编码分布来为多个可能的(运行,索引导数)对序列制定成本函数; (b)将成本函数应用于(run,index)对的多个可能序列中的每个可能序列,以确定相关联的成本; 以及(c)基于多个可能的序列(run,index)中的每个的相关联的成本,从(run,index)对的多个可能序列中选择成本确定的(run,index) 指数衍生)对; 以及使用基于运行折射导数编码分布的熵编码对相应的所选成本确定的(运行,索引导数)对序列进行编码。

    Method, system and computer program product for optimization of data compression

    公开(公告)号:US20060013493A1

    公开(公告)日:2006-01-19

    申请号:US11180513

    申请日:2005-07-14

    IPC分类号: G06K9/36

    摘要: 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. This involves (a) using the given quantization table and run-index derivative coding distribution to formulate a cost function for a plurality of possible sequences of (run, index derivative) pairs; (b) applying the cost function to each possible sequence in the plurality of possible sequences of (run, index derivative) pairs to determine an associated cost; and, (c) selecting the cost-determined sequence of (run, index derivative) pairs from the plurality of possible sequences of (run, index derivative) pairs based on the associated cost of each of the plurality of possible sequences of (run, index derivative) pairs; and encoding the corresponding selected cost-determined sequence of (run, index derivative) pairs using entropy coding based on a run-index derivative coding distribution.