会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Adaptive tree-search vector quantization in MPEG2 decoder
    • MPEG2解码器中的自适应树搜索矢量量化
    • US06320907B1
    • 2001-11-20
    • US09195800
    • 1998-11-19
    • Danilo PauRoberta Bruni
    • Danilo PauRoberta Bruni
    • H04B166
    • G06T9/008H04N19/428H04N19/61H04N19/94
    • The memory requirement of MPEG decoders and SQTV/IQTV systems may be reduced by recompressing the MPEG decoded data stream before storing pixels in an external RAM. An efficient compression method for recompressing video picture data based on the tree-search vector quantization (TSVQ) is made more effective by optimizing the way the quantizer is chosen for quantizing the differences among adjacent pel vectors. This method is based on premultiplying a read-only table using quantized complexity measures relative to the centroids of the tree-like scheme used in the TSVQ processing. A plurality of precalculated tables of quantization of the prediction error of a physical parameter of blocks of digital data are produced. For each one of the regions in which a block is divided, the calculated and quantized complexity measure provides an address that selects the most appropriate precalculated table for quantizing the prediction error. The adaptive tree-search vector quantization method is implemented in a corresponding hardware architecture.
    • MPEG解码器和SQTV / IQTV系统的存储器要求可以通过在将像素存储在外部RAM中之前重新压缩MPEG解码数据流来减少。 通过优化用于量化相邻像素矢量之间的差异的量化器的方式,基于树搜索矢量量化(TSVQ)对视频图像数据进行再压缩的有效压缩方法更有效。 该方法基于使用相对于在TSVQ处理中使用的树状方案的质心的量化复杂度度量的只读表。 产生数字数据块的物理参数的预测误差的量化的多个预先计算的表。 对于其中划分块的每个区域,计算和量化的复杂度度量提供了选择用于量化预测误差的最合适的预计算表的地址。 自适应树搜索向量量化方法在相应的硬件架构中实现。
    • 3. 发明授权
    • Tree search vector quantization for compressing digital video data to be
stored in buffers and MPEG decoder and SQTV processor with reduced
memory requisites
    • 用于压缩要存储在缓冲器中的数字视频数据的树搜索矢量量化,具有减少的存储器必需品的MPEG解码器和SQTV处理器
    • US06108381A
    • 2000-08-22
    • US17413
    • 1998-02-02
    • Danilo PauRoberta BruniRoberto Sannino
    • Danilo PauRoberta BruniRoberto Sannino
    • H04N5/92G06F17/30G06T9/00G06T9/40H03M7/30H04N7/01H04N7/26H04N7/28H04N7/32H04N7/50H14N7/12
    • G06T9/008G06T9/40H04N19/423H04N19/61H04N19/94
    • A method for reducing the RAM requirement for temporarily storing a stream of data blocks in a coding/decoding system of information transferable by blocks, includes the steps of: compressing and coding the data by blocks through a tree search vector quantization (TSVQ); storing TSVQ compressed and coded data in the RAM; and decoding and decompressing in a subsequent reading of the data stored in the RAM the coded and compressed data, thereby reconstituting the stream of digital data blocks. The method may include fixing a certain scanning path of each data block of the stream to be decomposed into vectors of preestablished dimensions; coding the first vector of the scanning of a certain block of data in an unmodified manner; generating a replica vector of the last coded vector and calculating a prediction error vector; quantizing according to a binary search in a table of read-only quantized vectors the prediction error, by coding its address in the table; and repeating several of the steps for all the vectors of the scanning of each input data block.
    • 一种减少用于将数据块流临时存储在块可传输信息的编码/解码系统中的RAM要求的方法,包括以下步骤:通过树搜索矢量量化(TSVQ)对数据进行压缩和编码; 将TSVQ压缩和编码数据存储在RAM中; 并且在随后读取存储在RAM中的数据的解码和解压缩编码和压缩数据,从而重构数字数据块流。 该方法可以包括将要分解的流的每个数据块的特定扫描路径固定成预先建立的维度的向量; 以未修改的方式对特定数据块的扫描的第一向量进行编码; 生成最后编码矢量的副本矢量并计算预测误差矢量; 根据在只读量化矢量的表中的二进制搜索量化量化该预测误差,通过对其表中的地址进行编码; 并且对于每个输入数据块的扫描的所有向量重复若干步骤。