会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for rateless source coding with/without decoder side information
    • 用于具有/不具有解码器侧信息的无源源编码的方法和装置
    • US07945842B2
    • 2011-05-17
    • US11764876
    • 2007-06-19
    • Dake HeAshish JagmohanJing Jiang
    • Dake HeAshish JagmohanJing Jiang
    • H03M13/00
    • H03M13/1102H03M7/30H03M13/6312H03M13/6362
    • A method of and system for rateless source coding are disclosed. The method comprises the steps of providing a set of low-density parity check (LDPC) codes, each of which accepts a range of data input lengths and a range of target compression rates; identifying a data input having a data input length; and identifying a desired compression rate. The method comprises the further steps of selecting one of said LDPC codes based on said data input length and desired compression rate; encoding the data input, using the selected LDPC code, to generate a sequence of data values; and puncturing some of said encoded data values to achieve the desired compression rate. Preferably, the encoding step includes the steps of generating a syndrome and a parity sequence from the data input, puncturing the generated parity sequence, and mixing a remaining portion of the data input with the punctuated parity sequence.
    • 公开了一种用于无源源编码的方法和系统。 该方法包括以下步骤:提供一组低密度奇偶校验(LDPC)码,每一个码接受数据输入长度的范围和目标压缩率的范围; 识别具有数据输入长度的数据输入; 并识别期望的压缩率。 该方法包括以下步骤:基于所述数据输入长度和期望的压缩率来选择所述LDPC码之一; 使用所选择的LDPC码对数据输入进行编码,以生成数据值序列; 以及对某些所述编码的数据值进行穿孔以实现所需的压缩率。 优选地,编码步骤包括以下步骤:从数据输入产生校正子和奇偶校验序列,对所生成的奇偶校验序列进行穿孔,以及将输入的数据的剩余部分与标点奇偶校验序列进行混合。
    • 2. 发明申请
    • METHOD AND APPARATUS FOR RATELESS SOURCE CODING WITH/WITHOUT DECODER SIDE INFORMATION
    • 用于具有/不具有解码器侧信息的无源源编码的方法和装置
    • US20080320363A1
    • 2008-12-25
    • US11764876
    • 2007-06-19
    • Dake HeAshish JagmohanJing Jiang
    • Dake HeAshish JagmohanJing Jiang
    • G06F11/10
    • H03M13/1102H03M7/30H03M13/6312H03M13/6362
    • A method of and system for rateless source coding are disclosed. The method comprises the steps of providing a set of low-density parity check (LDPC) codes, each of which accepts a range of data input lengths and a range of target compression rates; identifying a data input having a data input length; and identifying a desired compression rate. The method comprises the further steps of selecting one of said LDPC codes based on said data input length and desired compression rate; encoding the data input, using the selected LDPC code, to generate a sequence of data values; and puncturing some of said encoded data values to achieve the desired compression rate. Preferably, the encoding step includes the steps of generating a syndrome and a parity sequence from the data input, puncturing the generated parity sequence, and mixing a remaining portion of the data input with the punctuated parity sequence.
    • 公开了一种用于无源源编码的方法和系统。 该方法包括以下步骤:提供一组低密度奇偶校验(LDPC)码,每一个码接受数据输入长度的范围和目标压缩率的范围; 识别具有数据输入长度的数据输入; 并识别期望的压缩率。 该方法包括以下步骤:基于所述数据输入长度和期望的压缩率来选择所述LDPC码之一; 使用所选择的LDPC码对数据输入进行编码,以生成数据值序列; 以及对某些所述编码的数据值进行穿孔以实现所需的压缩率。 优选地,编码步骤包括以下步骤:从数据输入产生校正子和奇偶校验序列,对所生成的奇偶校验序列进行穿孔,以及将输入的数据的剩余部分与标点奇偶校验序列进行混合。
    • 3. 发明授权
    • Method and apparatus for run-time statistics dependent program execution using source-coding
    • 使用源代码的运行时统计依赖程序执行的方法和装置
    • US08341612B2
    • 2012-12-25
    • US11749295
    • 2007-05-16
    • Dake HeAshish JagmohanJian LouLigang Lu
    • Dake HeAshish JagmohanJian LouLigang Lu
    • G06F9/455G06F17/50G06F9/45
    • G06F9/30G06F8/4441G06F9/45525
    • Disclosed are a method and system for optimized, dynamic data-dependent program execution. The disclosed system comprises a statistics computer which computes statistics of the incoming data at the current time instant, where the said statistics include the probability distribution of the incoming data, the probability distribution over program modules induced by the incoming data, the probability distribution induced over program outputs by the incoming data, and the time-complexity of each program module for the incoming data, wherein the said statistics are computed on as a function of current and past data, and previously computed statistics; a plurality of alternative execution path orders designed prior to run-time by the use of an appropriate source code; a source code selector which selects one of the execution path orders as a function of the statistics computed by the statistics computer; a complexity measurement which measures the time-complexity of the currently selected execution path-order.
    • 公开了一种用于优化的动态数据相关程序执行的方法和系统。 所公开的系统包括统计计算机,其计算当前时刻的输入数据的统计量,其中所述统计包括输入数据的概率分布,由输入数据引起的程序模块上的概率分布,所引入的概率分布 输入数据的程序输出和输入数据的每个程序模块的时间 - 复杂度,其中根据当前和过去数据以及先前计算的统计量来计算所述统计; 通过使用适当的源代码在运行时间之前设计的多个替代执行路径命令; 源代码选择器,其根据由统计计算机计算出的统计量的函数选择执行路径顺序之一; 测量当前选择的执行路径顺序的时间 - 复杂度的复杂度测量。
    • 4. 发明申请
    • METHOD AND SYSTEM FOR EFFICIENT VIDEO COMPRESSION WITH LOW-COMPLEXITY ENCODER
    • 低复杂度编码器高效视频压缩的方法与系统
    • US20090122868A1
    • 2009-05-14
    • US11939882
    • 2007-11-14
    • Jun ChenDake HeAshish JagmohanLigang LuVadim Sheinin
    • Jun ChenDake HeAshish JagmohanLigang LuVadim Sheinin
    • H04N7/26
    • H04N19/149H03M7/30H04N19/395H04N19/46H04N19/61
    • Disclosed are a method and system for video compression, wherein the video encoder has low computational complexity and high compression efficiency. The disclosed system comprises a video encoder and a video decoder, wherein the method for encoding includes the steps of converting a source frame into a space-frequency representation; estimating conditional statistics of at least one vector of space-frequency coefficients; estimating encoding rates based on the said conditional statistics; and applying Slepian-Wolf codes with the said computed encoding rates. The preferred method for decoding includes the steps of; generating a side-information vector of frequency coefficients based on previously decoded source data, encoder statistics, and previous reconstructions of the source frequency vector; and performing Slepian-Wolf decoding of at least one source frequency vector based on the generated side-information, the Slepian-Wolf code bits and the encoder statistics.
    • 公开了一种用于视频压缩的方法和系统,其中视频编码器具有低计算复杂度和高压缩效率。 所公开的系统包括视频编码器和视频解码器,其中用于编码的方法包括以下步骤:将源帧转换成空间频率表示; 估计至少一个空 - 频系数矢量的条件统计; 基于所述条件统计估计编码率; 以及使用所述计算的编码速率的Slepian-Wolf码。 优选的解码方法包括以下步骤: 基于先前解码的源数据,编码器统计量和源频率向量的先前重建来生成频率系数的侧信息向量; 并且基于所生成的侧信息,Slepian-Wolf码比特和编码器统计,对至少一个源频率向量执行Slepian-Wolf解码。
    • 6. 发明授权
    • Methods and apparatus for secure distribution and storage of data using N channels
    • 使用N个通道安全地分发和存储数据的方法和装置
    • US08532220B2
    • 2013-09-10
    • US12712740
    • 2010-02-25
    • Ligang LuAshish JagmohanDake He
    • Ligang LuAshish JagmohanDake He
    • H04L27/00
    • H03M7/30
    • Methods and apparatus are provided for secure distribution and storage of data using N channels. An input data sequence, X, is distributed using a plurality, N, of channels. In one embodiment, the input data sequence, X, is split into N subsequences; and the N subsequences are encoded into N bit streams using a set of Slepian-Wolf codes with N separate encoders and a joint decoder. The Slepian-Wolf codes can be selected to ensure a computational complexity to obtain a portion of the input data sequence grows exponentially with respect to a length of the input data sequence unless all of the N bit streams are compromised. In another embodiment, the input data sequence, X, is compressed using a lossless data compressing techniques; and the compressed input data sequence is split into N subsequences that are distributed.
    • 提供了使用N个信道来安全地分发和存储数据的方法和装置。 使用多个N个信道来分配输入数据序列X。 在一个实施例中,输入数据序列X被分成N个子序列; 并且使用具有N个分离编码器和联合解码器的Slepian-Wolf码集合将N个子序列编码为N个比特流。 可以选择Slepian-Wolf码,以确保获得输入数据序列的一部分相对于输入数据序列的长度指数地增长的计算复杂度,除非所有N个比特流都受到损害。 在另一个实施例中,使用无损数据压缩技术来压缩输入数据序列X; 并且压缩的输入数据序列被分割成分布的N个子序列。
    • 8. 发明授权
    • Method and system for coding mode selection in video compression systems
    • 视频压缩系统中编码模式选择的方法和系统
    • US08804837B2
    • 2014-08-12
    • US13545414
    • 2012-07-10
    • Dake HeAshish JagmohanLigang Lu
    • Dake HeAshish JagmohanLigang Lu
    • H04N11/02
    • H04N19/395H04N19/103H04N19/18H04N19/48
    • A method and system are disclosed for selecting a mode to encode video data. The method comprises the steps of (a) transforming a source video frame into a set of coefficients, (b) partitioning said set of coefficients into a plurality of subsets of the coefficients on the basis of probability statistics corresponding to a plurality of encoding modes, wherein each of said subsets is identified for encoding by one of the plurality of encoding modes. The method comprises the further steps of (c) for each of the plurality of subsets of coefficients, computing defined parameters of an associated probability distribution for said subset, and (d) repeating steps (b) and (c) until a predetermined termination condition is satisfied. When this predetermined termination condition is satisfied, the subsets of coefficients, as they exist at that time, are output to a video encoder, which preferably is a Wyner-Ziv encoder.
    • 公开了一种用于选择对视频数据进行编码的模式的方法和系统。 该方法包括以下步骤:(a)将源视频帧变换成一组系数,(b)基于对应于多个编码模式的概率统计,将所述系数集合划分成系数的多个子集, 其中所述子集中的每一个被识别用于通过所述多个编码模式之一进行编码。 该方法还包括以下步骤:(c)针对所述多个系数子集中的每一个,计算所述子集的关联概率分布的定义参数,以及(d)重复步骤(b)和(c)直到预定终止条件 满意 当满足该预定终止条件时,如同在那时存在的系数子集被输出到视频编码器,其优选地是Wyner-Ziv编码器。
    • 10. 发明授权
    • Method and apparatus for constructing efficient slepian-wolf codes with mismatched decoding
    • 用于构建具有错误解码的高效率的蛇形码的方法和装置
    • US07679536B2
    • 2010-03-16
    • US11782249
    • 2007-07-24
    • Jun ChenDake HeAshish Jagmohan
    • Jun ChenDake HeAshish Jagmohan
    • H03M7/30
    • 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码的方法包括以下步骤:从一组可能的概率分布中选择代表性概率分布; 选择概率分布作为解码度量; 将所选择的解码度量转换为循环对称信道; 计算给定循环对称信道的初始消息值; 给出初始消息值和代表性概率分布的初始消息的一组概率分布; 优化给定初始消息的概率分布集的度数分布; 优化解码度量。