会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • 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相关联的索引信息,两个新叶子节点的代表颜色以及与两个新的叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息 。
    • 12. 发明授权
    • Method, system and computer program product for providing entropy constrained color splitting for palette images with color-wise splitting
    • 方法,系统和计算机程序产品,用于通过色彩分割为调色板图像提供熵约束的颜色分割
    • US08260071B2
    • 2012-09-04
    • US13186857
    • 2011-07-20
    • 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 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相关联的索引信息,两个新叶节点的代表颜色,以及关于与两个新叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息。
    • 13. 发明授权
    • Arbitrary ratio image resizing in the DCT domain
    • DCT域中的任意比例图像调整大小
    • US08233727B2
    • 2012-07-31
    • US11875282
    • 2007-10-19
    • Longji WangEn-Hui Yang
    • Longji WangEn-Hui Yang
    • G06K9/36G06K9/46G06K9/32
    • H04N19/122G06T3/4084H04N19/124H04N19/134H04N19/176H04N19/59H04N19/60
    • A method and system for arbitrary resizing of a compressed image in the discrete cosine transform (DCT) domain. 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. It also facilitates the practical implementations since only the fast implementations of IDCT with length N (1
    • 一种用于在离散余弦变换(DCT)域中任意调整压缩图像大小的方法和系统。 第一和第二缩放参数P和Q根据块号L和M以及缩放比例L / M或M / L来确定。 然后根据缩放参数将DCT域中的不均匀或不均匀的采样应用于压缩图像中的连续块的系数。 在一个实施例中,对P块进行采样并从给定块长度变换为| P | 根据| P |点IDCT,而Q块被从采样和从给定块长度变换到| Q | 根据| Q | -point IDCT。 然后将非均匀采样和变换的像素域样本重新组合成预定的块大小并转换回生成压缩图像的DCT系数。 与其他DCT域任意比例图像调整大小方法相比,所提出的方法显着降低了计算复杂度。 这也有助于实际实现,因为只需要具有长度为N(1
    • 16. 发明申请
    • Method, System and Computer Program Product for Providing Entropy Constrained Color Splitting for Palette Images with Color-Wise Splitting
    • 方法,系统和计算机程序产品为色调分割的调色板图像提供熵约束色彩分割
    • US20070071339A1
    • 2007-03-29
    • 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 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 an associated subset of pixels in the set of pixels, is provided. This involves: (a) initializing a tree structure by providing at least one starting leaf node comprising a set of colors from 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 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 color 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 a plurality of pixels of the digitized color image corresponding to the two representative colors of the two new leaf nodes.
    • 一种用于使用数据处理系统对分配给一组像素的M个不同颜色逐渐编码数字化彩色图像的方法,系统和计算机程序产品,所述数字化彩色图像通过将每个M个不同颜色分配给相关联的子集 提供了像素集中的像素。 这涉及:(a)通过提供包括来自M个不同颜色的一组颜色的至少一个起始叶节点来初始化树结构; (b)为每个起始叶节点确定至少一个代表颜色; 以及(c)通过以下方式来生长树结构:(i)基于相关联的可实现成本,选择叶节点n以变成与两个新叶节点相关联的非叶节点n,其中相关联的可实现成本通过以下方式确定:1) 通过将叶节点转换为链接到两个新叶节点的非叶节点而导致的失真相关联的变化; 2)确定通过将叶节点转换为链接到两个新叶节点的非叶节点而导致的相关联的熵率增加; 以及3)基于相关的失真变化和相关联的熵率增加来确定相关的可实现成本; (ii)通过在两个新叶节点中的一个中分配每个颜色来创建两个新叶节点; (iii)确定两个新叶节点中的每一个的代表颜色; 以及(iv)编码与叶节点n相关联的索引信息,两个新叶节点的代表颜色,以及关于与两个新叶节点的两个代表颜色相对应的数字化彩色图像的多个像素的信息。
    • 17. 发明授权
    • System and method for progressive delivery of multimedia objects
    • 逐行递送多媒体对象的系统和方法
    • US08775662B2
    • 2014-07-08
    • US11535765
    • 2006-09-27
    • En-Hui YangAjit SinghBrian LambLongji Wang
    • En-Hui YangAjit SinghBrian LambLongji Wang
    • G06F15/16
    • H04W12/06G06F17/30899H04L63/20H04L65/4069H04L67/02H04N21/234327H04N21/41407H04N21/64322H04W28/06
    • The present disclosure relates to methods and systems for progressively delivering multimedia content over a network. According to one aspect, a system for delivering multimedia content through a network includes a server side sub-system and a client side sub-system. The server side sub-system is configured to: concurrently send a first predetermined portion of each of the plurality of objects through the network, wherein the first predetermined portion is less than a complete object for at least one of the plurality of objects; and after sending the first predetermined portion of each of the plurality of objects, successively send subsequent predetermined portions of each of the plurality of objects until all portions of the plurality of objects have been sent. The client side sub-system is configured to: receive the first predetermined portion of each of the plurality of objects through the network; and after receiving the first predetermined portion of each of the plurality of objects, successively receive subsequent predetermined portions of each of the plurality of objects until all portions of each of the plurality of objects have been received.
    • 本公开涉及通过网络逐渐递送多媒体内容的方法和系统。 根据一方面,通过网络传送多媒体内容的系统包括服务器侧子系统和客户端子系统。 服务器侧子系统被配置为:通过网络同时发送多个对象中的每一个的第一预定部分,其中第一预定部分小于多个对象中的至少一个的完整对象; 并且在发送所述多个对象中的每一个的所述第一预定部分之后,连续发送所述多个对象中的每一个的后续预定部分,直到所述多个对象的所有部分已被发送。 客户侧子系统被配置为:通过网络接收多个对象中的每一个的第一预定部分; 并且在接收到多个对象中的每一个的第一预定部分之后,连续接收多个对象中的每一个的后续预定部分,直到已经接收到多个对象中的每一个的所有部分。
    • 19. 发明申请
    • METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZATION OF DATA COMPRESSION
    • 方法,系统和计算机程序产品优化数据压缩
    • US20130028533A1
    • 2013-01-31
    • 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)每个(运行,索引导数)对定义表示特殊值的连续索引的数目的运行值,以及基于索引的值,该索引依据索引的值, 特价。