公开(公告)号：US08111755B2

公开(公告)日：2012-02-07

申请号：US12145920

申请日：2008-06-25

申请人： Dake He ,  Ashish Jagmohan

发明人： Dake He ,  Ashish Jagmohan

IPC分类号： H04N7/12

CPC分类号： H04N19/395 ,  H04N19/513 ,  H04N19/537 ,  H04N19/59 ,  H04N19/80

摘要： A method and system for low-complexity Slepian-Wolf rate estimator in a hybrid Wyner-Ziv video encoder determines the minimum Slepian-Wolf code rate required to allow correct decoding. The Slepian-Wolf estimator does not assume ideality of source and side-information statistics and does not require the presence of a feedback channel from the decoder to the encoder in order to determine the correct Slepian-Wolf coding rate. Instead, it adapts to the statistical properties of the video steam. The Slepian-Wolf estimator provides very efficient compression performance while avoiding Slepian-Wolf decoding failures.

摘要翻译： 混合Wyner-Ziv视频编码器中的低复杂度Slepian-Wolf速率估计器的方法和系统确定了允许正确解码所需的最小Slepian-Wolf码率。 Slepian-Wolf估计器不假定源和侧信息统计的理想，并且不需要存在从解码器到编码器的反馈信道，以便确定正确的Slepian-Wolf编码率。 相反，它适应视频流的统计特性。 Slepian-Wolf估计器提供非常有效的压缩性能，同时避免Slepian-Wolf解码失败。

公开(公告)号：US08077064B2

公开(公告)日：2011-12-13

申请号：US12713576

申请日：2010-02-26

申请人： Gergely Ferenc Korodi ,  Dake He

发明人： Gergely Ferenc Korodi ,  Dake He

IPC分类号： H03M7/00

CPC分类号： H03M7/40

摘要： A method for encoding an input sequence of symbols. The method includes, sequentially, for each symbol in the input sequence, determining an estimated probability for that symbol based on a context model, identifying a codeword associated with a sequence of symbols resulting from appending that symbol to a previous sequence of symbols associated with that estimated probability, using an encoding tree associated with that estimated probability, and storing the codeword in a buffer element of a first-in-first-out buffer, wherein the buffer element is associated with the estimated probability. Stored codewords are output from the buffer in a first-in-first-out order.

摘要翻译： 一种编码输入符号序列的方法。 该方法包括依次为输入序列中的每个符号确定基于上下文模型的该符号的估计概率，识别与由该符号序列相关联的符号序列相关联的码元与之前相关联的符号相关联的码元相关联的码字 估计概率，使用与该估计概率相关联的编码树，以及将码字存储在先进先出缓冲器的缓冲器元件中，其中缓冲器元件与估计的概率相关联。 以先入先出的顺序从缓冲器输出存储的代码字。

公开(公告)号：US20110285557A1

公开(公告)日：2011-11-24

申请号：US13112597

申请日：2011-05-20

申请人： Gergely Ferenc KORODI ,  Dake He

发明人： Gergely Ferenc KORODI ,  Dake He

IPC分类号： H03M5/00

CPC分类号： H03M7/4006

摘要： Methods and systems are described for combining sources in a data compression system. In a system in which a context model results in the production of multiple sources or symbols, each source being associated with a probability estimate, sources may be combined by defining another, reduced size, set of probabilities. The new set of probabilities may be a subset of the predefined set of probabilities provided by the context model. Minimizing relative entropy may be a basis upon which to define a mapping of predefined probabilities to the new set of probabilities. An input sequence that was modeled using the context model may then be entropy encoded and entropy decoded using the new set of probabilities based on a mapping between the new probabilities and the predefined probabilities.

摘要翻译： 描述了用于在数据压缩系统中组合源的方法和系统。 在上下文模型导致产生多个源或符号的系统中，每个源与概率估计相关联，源可以通过定义另一个缩小的大小的概率集合来组合。 新的概率集合可以是由上下文模型提供的预定义概率集合的子集。 最小化相对熵可以是将预定义概率映射到新的概率集合的基础。 然后使用上下文模型建模的输入序列可以基于新概率和预定义概率之间的映射，使用新的概率集进行熵编码和熵解码。

公开(公告)号：US20110200104A1

公开(公告)日：2011-08-18

申请号：US12707797

申请日：2010-02-18

申请人： Gergely Ferenc KORODI ,  Dake He ,  En-Hui Yang

发明人： Gergely Ferenc KORODI ,  Dake He ,  En-Hui Yang

IPC分类号： H04N7/12 ,  H03M7/00

CPC分类号： H03M7/40 ,  H04N19/13 ,  H04N19/436 ,  H04N19/44 ,  H04N19/46 ,  H04N19/61

摘要： A method for entropy coding data using parallel entropy coders to encode an input sequence as a plurality of encoded subsequences, which are then combined to form an output bitstream. The input sequence is separated into subsequences on the basis of a context model. A method for entropy decoding a bitstream of encoded data by extracting a plurality of encoded subsequences from the bitstream and entropy decoding the encoded subsequences in parallel to generate a plurality of decoded subsequences, which are then interleaved based on a context model to produce a reconstructed sequence.

摘要翻译： 一种用于使用并行熵编码器熵编码数据以将输入序列编码为多个编码子序列的方法，其然后被组合以形成输出比特流。 基于上下文模型将输入序列分成子序列。 一种用于通过从比特流中提取多个编码子序列来熵解码编码数据的比特流的方法，并行地对编码的子序列进行熵解码以产生多个经解码的子序列，然后基于上下文模型进行交织以产生重构序列 。

公开(公告)号：US20110170608A1

公开(公告)日：2011-07-14

申请号：US12684247

申请日：2010-01-08

申请人： Xun Shi ,  Xiang Yu ,  Dake He

发明人： Xun Shi ,  Xiang Yu ,  Dake He

IPC分类号： H04N7/26

CPC分类号： H04N19/109 ,  H04N19/147 ,  H04N19/40 ,  H04N19/59 ,  H04N19/61 ,  H04N19/96

摘要： An encoder for encoding a downsampled video in which macroblock partitioning is based upon downsampled partitioning of full-resolution macroblocks. The refinement of the downsampled partitioning involves storing the downsampled partitioning in a quad-tree data structure and recursively identifying and evaluating possible mergers of leaf nodes having a common parent node. Using rate-distortion analysis possible mergers are evaluated and advantageous mergers are performed, thereby creating larger partitions and new leaf nodes. The traversing of the quad-tree to identify possible leaf node mergers is stopped when no further possible mergers may be identified that would result in a rate-distortion advantage.

摘要翻译： 用于编码下采样视频的编码器，其中宏分区基于全分辨率宏块的下采样分区。 下采样分区的细化涉及将下采样分区存储在四叉树数据结构中，并递归地识别和评估具有公共父节点的叶节点的可能合并。 使用速率失真分析来评估可能的合并，并执行有利的合并，从而创建更大的分区和新的叶节点。 当不能识别可能导致速率失真优势的可能的合并时，停止遍历四叉树以识别可能的叶节点合并。

公开(公告)号：US20110170598A1

公开(公告)日：2011-07-14

申请号：US12684461

申请日：2010-01-08

申请人： Xun Shi ,  Xiang Yu ,  Dake He ,  En-Hui Yang

发明人： Xun Shi ,  Xiang Yu ,  Dake He ,  En-Hui Yang

IPC分类号： H04N7/26

CPC分类号： H04N19/109 ,  H04N19/147 ,  H04N19/176 ,  H04N19/52 ,  H04N19/61

摘要： An encoder for encoding a video by performing motion estimation using predicted residuals in the rate-distortion cost expression. The predicted residuals are determined by finding a predicted motion vector with respect to the original reference frame and calculating the corresponding residual values. The actual motion vector is then selected based on minimization of the rate-distortion cost expression with respect to the reconstructed reference frame, where the rate-distortion cost expression includes the predicted residuals. In particular, the cost expression includes reconstructed predicted residuals within the distortion term.

摘要翻译： 一种用于通过使用速率失真成本表达式中的预测残差执行运动估计来对视频进行编码的编码器。 通过找到关于原始参考帧的预测运动矢量并计算相应的残差来确定预测残差。 然后基于相对于重构的参考帧的速率失真成本表达式的最小化来选择实际运动矢量，其中速率失真成本表达式包括预测的残差。 特别地，成本表达式包括在失真项内的重建的预测残差。

公开(公告)号：US07679536B2

公开(公告)日：2010-03-16

申请号：US11782249

申请日：2007-07-24

申请人： Jun Chen ,  Dake He ,  Ashish Jagmohan

发明人： Jun Chen ,  Dake He ,  Ashish Jagmohan

IPC分类号： H03M7/30

CPC分类号： H03M7/30

摘要： Disclosed is a method for constructing Slepian-Wolf codes, wherein the designed Slepian-Wolf codes are robust to mismatched decoding. The disclosed method for constructing Slepian-Wolf codes includes the steps of: choosing representative probability distributions from a set of possible probability distributions; choosing a probability distribution as a decoding metric; converting the chosen decoding metric to a cyclic-symmetric channel; computing the initial message value given the cyclic-symmetric channel; computing a set of probability distributions of the initial message given the initial message values and the representative probability distributions; optimizing the degree distribution given the set of probability distributions of the initial message; optimizing the decoding metric.

摘要翻译： 披露了一种用于构造Slepian-Wolf码的方法，其中设计的Slepian-Wolf码对于不匹配的解码是鲁棒的。 所公开的用于构造Slepian-Wolf码的方法包括以下步骤：从一组可能的概率分布中选择代表性概率分布; 选择概率分布作为解码度量; 将所选择的解码度量转换为循环对称信道; 计算给定循环对称信道的初始消息值; 给出初始消息值和代表性概率分布的初始消息的一组概率分布; 优化给定初始消息的概率分布集的度数分布; 优化解码度量。

公开(公告)号：US20090030922A1

公开(公告)日：2009-01-29

申请号：US11782249

申请日：2007-07-24

申请人： Jun Chen ,  Dake He ,  Ashish Jagmohan

发明人： Jun Chen ,  Dake He ,  Ashish Jagmohan

IPC分类号： G06F17/30

CPC分类号： H03M7/30

摘要： Disclosed is a method for constructing Slepian-Wolf codes, wherein the designed Slepian-Wolf codes are robust to mismatched decoding. The disclosed method for constructing Slepian-Wolf codes includes the steps of: choosing representative probability distributions from a set of possible probability distributions; choosing a probability distribution as a decoding metric; converting the chosen decoding metric to a cyclic-symmetric channel; computing the initial message value given the cyclic-symmetric channel; computing a set of probability distributions of the initial message given the initial message values and the representative probability distributions; optimizing the degree distribution given the set of probability distributions of the initial message; optimizing the decoding metric.

摘要翻译： 披露了一种用于构造Slepian-Wolf码的方法，其中设计的Slepian-Wolf码对于不匹配的解码是鲁棒的。 所公开的用于构造Slepian-Wolf码的方法包括以下步骤：从一组可能的概率分布中选择代表性概率分布; 选择概率分布作为解码度量; 将所选择的解码度量转换为循环对称信道; 计算给定循环对称信道的初始消息值; 给出初始消息值和代表性概率分布的初始消息的一组概率分布; 优化给定初始消息的概率分布集的度数分布; 优化解码度量。

公开(公告)号：US06859151B2

公开(公告)日：2005-02-22

申请号：US10240707

申请日：2001-04-26

申请人： Dake He ,  Wei He

发明人： Dake He ,  Wei He

IPC分类号： G06F17/22 ,  H03M7/04 ,  H03M7/30 ,  H03M7/00

CPC分类号： H03M7/04 ,  G06F17/2217

摘要： A coding transformation method includes the steps of dividing an input data into blocks with the length of 13 bits, where the original data set X includes all 8192 13-bit symbols and 12 filling-bit symbols, and uses 91 printable characters in the output representation of the input data. The output set Y is a sub-set of the direct product R91×R91, with R91 being a set of 91 printable ASCII characters. The reversible coding mapping relationship is Base91[x]=(ch1, ch2)=(R91—CH[x/91], R91—CH[x%91]) where xεX, ch1, ch2εR91. For an input data block less than 13-bits long, n bits are added to the specified side to make it become a complete block with the image of the block of data in the direct product R91×R91.

摘要翻译： 编码变换方法包括以下步骤：将输入数据划分成长度为13位的块，其中原始数据集X包括所有8192个13位符号和12个填充位符号，并且在输出表示中使用91个可打印字符 的输入数据。 输出集Y是直接产品R91xR91的子集，其中R91是91个可打印的ASCII字符的集合。 可逆编码映射关系在其中xepsilon，ch1，ch2epsilonR91。 对于小于13位长的输入数据块，在指定端添加n位，使其成为直接产品R91xR91中数据块的图像的完整块。

公开(公告)号：US10257520B2

公开(公告)日：2019-04-09

申请号：US13533337

申请日：2012-06-26

申请人： Dake He ,  Jing Wang ,  Gaëlle Christine Martin-Cocher

发明人： Dake He ,  Jing Wang ,  Gaëlle Christine Martin-Cocher

IPC分类号： H04N19/122 ,  H04N19/136 ,  H04N19/157 ,  H04N19/176

摘要： Methods and devices for modified coding of blocks of residuals in the case of transform skipping. To better align the data with assumptions upon which the entropy coding scheme is based, the block of residual data is permuted at the encoder prior to entropy coding. The block of reconstructed data is then inverse permuted at the decoder to recover the reconstructed block of residuals. The permutation may include 180 rotation of the block, which may be of particular benefit in the case of intra-coded residuals.