专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5623262A Multi-word variable length encoding and decoding 失效
标题翻译：多字可变长度编码和解码
公开(公告)号：US5623262A
公开(公告)日：1997-04-22
申请号：US291655
申请日：1994-08-17
申请人： James O. Normile , Katherine Shu-wei Wang , Ke-Chiang Chu , Dulce B. Ponceleon , Hsi-Jung Wu
发明人： James O. Normile , Katherine Shu-wei Wang , Ke-Chiang Chu , Dulce B. Ponceleon , Hsi-Jung Wu
IPC分类号： H03M7/42 , H03M7/40
CPC分类号： H03M7/425
摘要： Decoding and encoding of variable length data words and data strings is accelerated by testing for and processing more than one word or string per encoding or decoding cycle. In an encoding scheme wherein fixed length data words are encoded into variable length data strings, decoding is carried out by first receiving a data stream having a plurality of encoded data strings contained therein, and then testing at least a portion of the data stream to determine whether the portion contains one of a number of selected sets of multiple data strings. If the portion of the data stream contains one of the selected sets of multiple data strings, the multiple data strings are decoded into a corresponding set of multiple data words. This decoding procedure allows a plurality of encoded data strings to be decoded in a single decoding cycle. The procedure may be implemented using either a single lookup table or a set of split-level lookup tables. The above procedure may also be applied to an encoding scheme wherein variable length data words are transformed into fixed length encoded data strings to encode the variable length data words. Furthermore, the above procedure may be applied to an encoding scheme wherein variable length data words are transformed into variable length data strings to both encode and decode the variable length data words and data strings.
摘要翻译：可变长度数据字和数据串的解码和编码通过对每个编码或解码周期进行测试和处理多个字或字符串来加速。在将固定长度数据字编码为可变长度数据串的编码方案中，通过首先接收其中包含多个编码数据串的数据流，然后测试数据流的至少一部分来确定该部分是否包含多个选定的多个数据串集合中的一个。如果数据流的部分包含所选择的多个数据串集合中的一个，则将多个数据串解码成相应的多个数据字集合。该解码过程允许在单个解码周期中解码多个编码数据串。该过程可以使用单个查找表或一组拆分级查找表来实现。上述过程也可以应用于其中可变长度数据字被变换成固定长度编码数据串以对可变长度数据字进行编码的编码方案。此外，上述过程可以应用于编码方案，其中可变长度数据字被变换成可变长度数据串，以对可变长度数据字和数据串进行编码和解码。

2. 发明授权

US5822465A Image encoding by vector quantization of regions of an image and codebook updates 失效
标题翻译：通过矢量量化图像和码本更新的区域进行图像编码
公开(公告)号：US5822465A
公开(公告)日：1998-10-13
申请号：US486828
申请日：1995-06-07
申请人： James Oliver Normile , Katherine Shu-Wei Wang
发明人： James Oliver Normile , Katherine Shu-Wei Wang
IPC分类号： H04N11/04 , G06T9/00 , H03M7/30 , H04B14/04 , H04N1/41 , H04N7/26 , H04N7/28 , H04N7/36 , H04N7/46 , H04N7/54 , G06K9/00
CPC分类号： H04N7/54 , G06T9/008 , H04N19/149 , H04N19/154 , H04N19/186 , H04N19/192 , H04N19/196 , H04N19/198 , H04N19/507 , H04N19/59 , H04N19/94 , H04N19/96 , H04N19/146 , H04N19/152
摘要： Improved method and apparatus for vector quantization (VQ) to build a codebook for the compression of data. The codebook or "tree" is initialized by establishing N initial nodes and creating the remainder of the codebook as a binary codebook. Children entries are split upon determination of various attributes, such as maximum distortion, population, etc. Vectors obtained from the data are associated with the children nodes, and then representative children entries are recalculated. This splitting/reassociation continues iteratively until a difference in error associated with the previous children and current children becomes less than a threshold. This splitting and reassociating process continues until the maximum number of terminal nodes is created in the tree, a total error or distortion threshold has been reached or some other criterion. The data may then be transmitted as a compressed bitstream comprising a codebook and indices referencing the codebook.
摘要翻译：用于矢量量化（VQ）的改进的方法和装置来构建用于压缩数据的码本。通过建立N个初始节点并将码本的其余部分作为二进制码本来初始化码本或“树”。儿童条目在确定各种属性（例如最大失真，人口等）时被分割。从数据获得的向量与子节点相关联，然后重新计算代表性的子条目。这种分裂/重新关联继续迭代，直到与先前的孩子和当前孩子相关联的错误差异变得小于阈值。该分解和重新关联过程继续，直到在树中创建最大数量的终端节点，已经达到总误差或失真阈值或一些其他准则。然后可以将数据作为包括码本的压缩比特流和引用码本的索引来发送。

3. 发明授权

US5719961A Adaptive technique for encoder and decoder signal transformation 失效
标题翻译：用于编码器和解码器信号变换的自适应技术
公开(公告)号：US5719961A
公开(公告)日：1998-02-17
申请号：US625608
申请日：1996-03-29
申请人： James Oliver Normile , Katherine Shu-wei Wang , Ke-Chiang Chu , Dulce Beatriz Ponceleon , Hsi-Jung Wu
发明人： James Oliver Normile , Katherine Shu-wei Wang , Ke-Chiang Chu , Dulce Beatriz Ponceleon , Hsi-Jung Wu
IPC分类号： G06T9/00 , H04N7/26 , G06K9/36
CPC分类号： H04N19/103 , H04N19/105 , H04N19/107 , H04N19/132 , H04N19/14 , H04N19/176
摘要： A signal processing system determines the characteristic of a signal for encoding or decoding by examining and classifying such signal, and then applies a transformation or inverse transformation to such signal. Depending on classification of the signal, various transforms or inverse transforms are applicable adaptively thereto.
摘要翻译：信号处理系统通过检查和分类这样的信号来确定用于编码或解码的信号的特性，然后对这样的信号应用变换或逆变换。根据信号的分类，可以适应性地适用各种变换或逆变换。

4. 发明授权

US5649030A Vector quantization 失效
标题翻译：矢量量化
公开(公告)号：US5649030A
公开(公告)日：1997-07-15
申请号：US405448
申请日：1995-03-15
申请人： James Oliver Normile , Katherine Shu-Wei Wang
发明人： James Oliver Normile , Katherine Shu-Wei Wang
IPC分类号： H04N11/04 , G06T9/00 , H03M7/30 , H04B14/04 , H04N1/41 , H04N7/26 , H04N7/28 , H04N7/36 , H04N7/46 , H04N7/54 , H04N7/12
CPC分类号： H04N7/54 , G06T9/008 , H04N19/149 , H04N19/154 , H04N19/186 , H04N19/192 , H04N19/196 , H04N19/198 , H04N19/507 , H04N19/59 , H04N19/94 , H04N19/96 , H04N19/146 , H04N19/152
摘要： Improved method and apparatus for vector quantization (VQ) to build a codebook for the compression of data. The codebook or "tree" is initialized by establishing N initial nodes and creating the remainder of the codebook as a binary codebook. Children entries are split upon determination of various attributes, such as maximum distortion, population, etc. Vectors obtained from the data are associated with the children nodes, and then representative children entries are recalculated. This splitting/reassociation continues iteratively until a difference in error associated with the previous children and current children becomes less than a threshold. This splitting and reassociating process continues until the maximum number of terminal nodes is created in the tree, a total error or distortion threshold has been reached or some other criterion. The data may then be transmitted as a compressed bitstream comprising a codebook and indices referencing the codebook.
摘要翻译：用于矢量量化（VQ）的改进的方法和装置来构建用于压缩数据的码本。通过建立N个初始节点并将码本的其余部分作为二进制码本来初始化码本或“树”。儿童条目在确定各种属性（例如最大失真，人口等）时被分割。从数据获得的向量与子节点相关联，然后重新计算代表性的子条目。这种分裂/重新关联继续迭代，直到与先前的孩子和当前孩子相关联的错误差异变得小于阈值。该分解和重新关联过程继续，直到在树中创建最大数量的终端节点，已经达到总误差或失真阈值或一些其他准则。然后可以将数据作为包括码本的压缩比特流和引用码本的索引来发送。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式