利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

90 条记录 (耗时 0.031 秒)

    Apparatus and method for encoding zerotrees generated by a wavelet-based coding technique
    3.
    发明授权
    Apparatus and method for encoding zerotrees generated by a wavelet-based coding technique 失效
    用于编码通过基于小波的编码技术产生的零点的装置和方法

    公开(公告)号：US06483946B1

    公开(公告)日：2002-11-19

    申请号：US08736114

    申请日：1996-10-24

    申请人： Stephen A. Martucci ,  Iraj Sodagar ,  Ya-Qin Zhang

    发明人： Stephen A. Martucci ,  Iraj Sodagar ,  Ya-Qin Zhang

    IPC分类号： G06K936

    CPC分类号： H04N19/94 ,  H04N19/64 ,  H04N19/645 ,  H04N19/647

    摘要： Apparatus and method for encoding zerotrees in a wavelet-based coding technique. The method uses a depth-first pattern for traversing the zerotree, i.e., each branch of the tree, from parent to child to grandchild and so on, is fully traversed before a next branch is traversed. The depth-first tree traversal pattern is used to quantize the coefficients of the tree as well as to assign symbols to the quantized coefficients. The method assigns one of three symbols to each node: ZEROTREE ROOT, VALUED ZEROTREE ROOT, and VALUE. By using three symbols and the efficient tree traversal pattern, the method is substantially more efficient at encoding a zerotree than the prior art. Additionally, this concept is applied to the encoding of “vector” zerotrees.

    摘要翻译： 在基于小波的编码技术中编码零点的装置和方法。 该方法使用深度优先模式遍历零树，即树的每个分支，从父到子到孙，等等，在遍历下一个分支之前，完全遍历。 深度优先树遍历模式用于对树的系数进行量化，并将符号分配给量化系数。 该方法为每个节点分配三个符号之一：ZEROTREE ROOT，VALUED ZEROTREE ROOT和VALUE。 通过使用三个符号和有效的树遍历模式，该方法比现有技术在编码零树方面显着更有效率。 另外，这个概念被应用于“矢量”零点的编码。

    Vector wavelet organization
    4.
    发明授权
    Vector wavelet organization 有权
    矢量小波组织

    公开(公告)号：US06298167B1

    公开(公告)日：2001-10-02

    申请号：US09177219

    申请日：1998-10-22

    申请人： Stephen A. Martucci ,  Iraj Sodagar ,  Ya-Qin Zhang

    发明人： Stephen A. Martucci ,  Iraj Sodagar ,  Ya-Qin Zhang

    IPC分类号： G06K936

    CPC分类号： H04N19/94 ,  H04N19/64 ,  H04N19/645 ,  H04N19/647

    摘要： Apparatus and method for encoding zerotrees in a wavelet-based coding technique. The method uses a depth-first pattern for traversing the zerotree, i.e., each branch of the tree, from parent to child to grandchild and so on, is fully traversed before a next branch is traversed. The depth-first tree traversal pattern is used to quantize the coefficients of the tree as well as to assign symbols to the quantized coefficients. The method assigns one of three symbols to each node: ZEROTREE ROOT, VALUED ZEROTREE ROOT, and VALUE. By using three symbols and the efficient tree traversal pattern, the method is substantially more efficient at encoding a zerotree than the prior art. Additionally, this concept is applied to the encoding of “vector” zerotrees.

    摘要翻译： 在基于小波的编码技术中编码零点的装置和方法。 该方法使用深度优先模式遍历零树，即树的每个分支，从父到子到孙，等等，在遍历下一个分支之前，完全遍历。 深度优先树遍历模式用于对树的系数进行量化，并将符号分配给量化系数。 该方法为每个节点分配三个符号之一：ZEROTREE ROOT，VALUED ZEROTREE ROOT和VALUE。 通过使用三个符号和有效的树遍历模式，该方法比现有技术在编码零树方面显着更有效率。 另外，这个概念被应用于“矢量”零点的编码。

    Apparatus and method for performing scalable hierarchical motion estimation
    7.
    发明授权
    Apparatus and method for performing scalable hierarchical motion estimation 失效
    用于执行可分级运动估计的装置和方法

    公开(公告)号：US06208692B1

    公开(公告)日：2001-03-27

    申请号：US09106706

    申请日：1998-06-29

    申请人： Xudong Song ,  Tihao Chiang ,  Ya-Qin Zhang ,  Ravi Krishnamurthy

    发明人： Xudong Song ,  Tihao Chiang ,  Ya-Qin Zhang ,  Ravi Krishnamurthy

    IPC分类号： H04N718

    CPC分类号： H04N19/53 ,  H04N19/56 ,  H04N19/63

    摘要： An apparatus and a concomitant method for performing hierarchial block-based motion estimation with a high degree of scalability is disclosed. The present invention decomposes each of the image frames within an image sequence into an M-ary pyramid. Different dynamic ranges for representing the pixel values are used for different levels of the M-ary pyramid, thereby generating a plurality of different “P-bit” levels, i.e., a plurality of different M-ary pyramid architectures. The present scalable hierarchical motion estimation provides the flexibility of switching from one M-ary pyramid architecture to another M-ary pyramid architecture according to the available platform resources and/or user's choice.

    摘要翻译： 公开了一种用于以高度可扩展性执行基于层次的基于块的运动估计的装置和并发方法。 本发明将图像序列中的每个图像帧分解成M字节金字塔。 用于表示像素值的不同动态范围用于不同级别的金字塔，从而产生多个不同的“P位”电平，即，多个不同的M元金字塔架构。 本发明的可分级运动估计提供了根据可用平台资源和/或用户的选择从一个M元金字塔架构切换到另一个M元金字塔架构的灵活性。