会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明授权
    • Arbitrary ratio image resizing in the DCT domain
    • DCT域中的任意比例图像调整大小
    • US08478059B2
    • 2013-07-02
    • US13535945
    • 2012-06-28
    • Longji WangEn-hui Yang
    • Longji WangEn-hui Yang
    • G06K9/36G06K9/46G06K9/32
    • H04N19/122G06T3/4084H04N19/124H04N19/134H04N19/176H04N19/59H04N19/60
    • To resize a compressed image, first and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach.
    • 为了调整压缩图像的大小,根据块号L和M以及缩放比例L / M或M / L来确定第一和第二缩放参数P和Q。 然后根据缩放参数将DCT域中的不均匀或不均匀的采样应用于压缩图像中的连续块的系数。 在一个实施例中,对P块进行采样并从给定块长度变换为| P | 根据| P |点IDCT,而Q块被从采样和从给定块长度变换到| Q | 根据| Q | -point IDCT。 然后将非均匀采样和变换的像素域样本重新组合成预定的块大小并转换回生成压缩图像的DCT系数。 与其他DCT域任意比例图像调整大小方法相比,所提出的方法显着降低了计算复杂度。
    • 53. 发明授权
    • Method, system and computer program product for optimization of data compression
    • 方法,系统和计算机程序产品优化数据压缩
    • US08374449B2
    • 2013-02-12
    • US13166951
    • 2011-06-23
    • En-hui YangLongji Wang
    • En-hui YangLongji Wang
    • G06K9/46
    • 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. 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) 指数衍生)对; 以及使用基于运行折射导数编码分布的熵编码对相应的所选成本确定的(运行,索引导数)对序列进行编码。
    • 55. 发明申请
    • METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION
    • 方法,系统和计算机程序产品优化数据压缩
    • US20120014615A1
    • 2012-01-19
    • US13166951
    • 2011-06-23
    • 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. 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) 指数衍生)对; 以及使用基于运行折射导数编码分布的熵编码对相应的所选成本确定的(运行,索引导数)对序列进行编码。
    • 58. 发明授权
    • Method, system and computer program product for providing entropy constrained color splitting for palette images with color-wise splitting
    • 方法,系统和计算机程序产品,用于通过色彩分割为调色板图像提供熵约束的颜色分割
    • US08559740B2
    • 2013-10-15
    • US13565967
    • 2012-08-03
    • 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 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 and updating an encoded image by repeatedly (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 selected 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相关联的索引信息,两个新叶子节点的代表颜色以及与两个新的叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息 。
    • 60. 发明申请
    • Method, System and Computer Program Product for Providing Entropy Constrained Color Splitting for Palette Images with Color-Wise Splitting
    • 方法,系统和计算机程序产品为色调分割的调色板图像提供熵约束色彩分割
    • US20120321183A1
    • 2012-12-20
    • US13565967
    • 2012-08-03
    • En-hui YangLongji WANG
    • En-hui YangLongji WANG
    • G06K9/36
    • H04N1/64H04N19/103H04N19/147H04N19/182H04N19/186H04N19/19H04N19/91H04N19/94H04N19/96
    • 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 and updating an encoded image by repeatedly (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 selected 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相关联的索引信息,两个新叶子节点的代表颜色以及与两个新的叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息 。