会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • METHOD AND DEVICE FOR STORING A COMPRESSION RATIO INDICATION IN A PIXEL VALUE BUFFER IN TILE ENCODING
    • 用于在层编码中存储像素值缓冲器中的压缩比率的方法和装置
    • WO2012082029A1
    • 2012-06-21
    • PCT/SE2010/051380
    • 2010-12-14
    • TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)STRÖM, JacobWENNERSTEN, Per
    • STRÖM, JacobWENNERSTEN, Per
    • H04N7/26G06T9/00
    • G06T9/005G06T9/00H04N19/428H04N19/46H04N19/91
    • A tile (1) of pixels (6) is encoded by variable length encoding blocks (3-9) of pixels (10) constituting different subsets of the tile (1) to form sequences of symbols (23-29) as encoded representations of the pixel values. A respective size indication (33-39, 52, 54, 56, 58) is determined for each set (12, 14) of at least block. A size indication (33-39, 52, 54, 56, 58) is representative of a compression ratio of a combined sequence (23-29, 51, 53, 55, 57) corresponding to the at least one sequence of symbols (23- 29) obtained for the at least one block of the set (12, 14). The combined sequences (23-29, 51, 53, 55, 57) are arranged in a pixel value buffer (80) in a buffer memory (20). The size indication (32-39, 52, 54, 56, 58) determined for a given set (12, 14) is also stored in the pixel value buffer (80) in the buffer memory (20) to precede, according to a reading order of the pixel value buffer (80), the combined sequence (23-29, 51, 53, 55, 57) of the given set (12, 14).
    • 像素(6)的瓦片(1)由构成瓦片(1)的不同子集的像素(10)的可变长度编码块(3-9)编码,以形成符号序列(23-29),作为 像素值。 对于至少块的每个集合(12,14)确定相应的大小指示(33-39,52,54,56,58)。 尺寸指示(33-39,52,54,56,58)表示对应于至少一个符号序列的组合序列(23-29,51,53,55,57)的压缩比(23 - 29),用于所述组(12,14)的所述至少一个块获得。 组合序列(23-29,51,53,55,57)被布置在缓冲存储器(20)中的像素值缓冲器(80)中。 对于给定集合(12,14)确定的尺寸指示(32-39,52,54,56,58)也存储在缓冲存储器(20)中的像素值缓冲器(80)中,根据 像素值缓冲器(80)的读取顺序,给定组(12,14)的组合序列(23-29,51,53,55,57)。
    • 6. 发明申请
    • DEPTH BUFFER COMPRESSION
    • 深度缓冲区压缩
    • WO2009035410A3
    • 2009-06-11
    • PCT/SE2008051027
    • 2008-09-12
    • ERICSSON TELEFON AB L MWENNERSTEN PERSTROEM JACOB
    • WENNERSTEN PERSTROEM JACOB
    • G06T9/00G06T15/40
    • G06T9/00G06T15/405H04N19/119H04N19/12H04N19/15H04N19/176H04N19/42H04N19/46
    • Device, computer readable medium, and method for selecting compression modes to be applied in a depth buffer (20). The method includes obtaining values corresponding to a tile (30) of the depth buffer (20), selecting a first compression mode (34) from a first plurality of compression modes, compressing the values of the tile (30), writing the compressed values into a first block, based on the first mode (34), and using a preset number of primary bits (34) to store information related to at least one of the first mode (34) and a compression size of the first block, selecting a set of secondary compression modes (32) from a second plurality of compression modes, determining a number of sub-tiles (28), that make up the tile (30), compressing values of the sub-tiles, writing the compressed values into a second block, based on the set of secondary modes (32), and using the same preset number of primary bits (34) to store information related to at least one of the set of secondary modes (32) and a compression size of the second block, comparing the compression size of the tile (30) to the compression size of the sub-tiles (28), choosing the first mode (34) or the set of secondary modes (32) and a corresponding tile size based on a result of the comparing, and storing the selected compressed tile or sub-tiles into the depth buffer (20) and writing into the preset number of primary bits (34) information related to the chosen first mode (34) or set of secondary compression modes (32) or a corresponding size.
    • 设备,计算机可读介质和用于选择要在深度缓冲器(20)中应用的压缩模式的方法。 该方法包括获得与深度缓冲器(20)的瓦片(30)对应的值,从第一多个压缩模式中选择第一压缩模式(34),压缩瓦片(30)的值,将压缩值 基于第一模式(34),并使用预设数量的主位(34)来存储与第一模式(34)和第一模块(34)中的至少一个相关的信息和第一模块的压缩大小的第一块,选择 来自第二多个压缩模式的一组二次压缩模式(32),确定构成瓦片(30)的子图块(28)的数量,压缩子瓦片的值,将压缩值写入 第二块,基于所述二次模式集合(32),并且使用相同的预设数量的主位(34)来存储与所述一组次模式(32)中的至少一个相关的信息,以及所述第二模式 第二块,将瓦片(30)的压缩尺寸与压缩比例进行比较 (28)的e,基于比较结果选择第一模式(34)或二次模式集合(32)和相应的块大小,并将选择的压缩块或子块存储到 深度缓冲器(20)并且写入与所选择的第一模式(34)或一组辅助压缩模式(32)相关的预设数量的主位(34)信息或相应的大小。
    • 7. 发明申请
    • SIGNALING OF END OF SLICES
    • 信息结束信号
    • WO2012169952A2
    • 2012-12-13
    • PCT/SE2012050308
    • 2012-03-21
    • ERICSSON TELEFON AB L MSJOEBERG RICKARDWENNERSTEN PER
    • SJOEBERG RICKARDWENNERSTEN PER
    • H04N7/26
    • H04N19/174H04N19/46H04N19/61H04N19/70
    • A slice granularity representing a hierarchical level for slice boundary alignment in a picture (1) comprising at least one slice (10, 12) of coding units (20-56) is used together with coordinates of the coding units (20-56) in a slice (10, 12) to determine those coding units (30, 46A, 46B, 36) that potentially could constitute an end of a slice (10, 12). Each coding unit (30, 46A, 46B) except one of the determined coding units (30, 46A, 46B, 36) is assigned an end-of-slice flag with a first value, while the one determined coding unit (36) gets an end-of-slice flag with a second value. The end-of-slice flags are used during decoding for identifying the end of a slice (10, 12). The embodiments provide an efficient end-of-slice flag signaling by merely assigning such flags to some of the coding units (30, 46A, 46B, 36) in the picture (1), while other coding units need no associated flag.
    • 与包括编码单元(20-56)的至少一个切片(10,12)的图像(1)中的用于切片边界对准的分级水平的切片粒度与编码单元(20-56)的坐标一起使用 切片(10,12),用于确定可能构成切片(10,12)的末端的那些编码单元(30,46A,46B,36)。 除了所确定的编码单元(30,46A,46B,36)之一之外的每个编码单元(30,46A,46B)被分配具有第一值的片断结束标志,而一个确定的编码单元(36)获得 具有第二个值的片断结束标志。 切片结束标志在解码期间用于识别切片的末端(10,12)。 这些实施例通过仅向图像(1)中的一些编码单元(30,46A,46B,36)分配这样的标志来提供有效的片尾标志信号,而其他编码单元不需要相关联的标志。
    • 8. 发明申请
    • ENCODER, DECODER AND METHODS THEREOF FOR TEXTURE COMPRESSION
    • 编码器,解码器及其对于纹理压缩的方法
    • WO2012146320A1
    • 2012-11-01
    • PCT/EP2011/068145
    • 2011-10-18
    • TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)STRÖM, JacobWENNERSTEN, Per
    • STRÖM, JacobWENNERSTEN, Per
    • G06T9/00
    • G06T9/004G06T9/00
    • The embodiments of the present invention relate to compression of parameters of an encoded texture block such that an efficient encoding is achieved. Index data is used as an example of parameters to be encoded. Accordingly, encoding the index data is achieved by predicting the index data, wherein the prediction is done in the pixel color domain, where changes often are smooth, instead of in the pixel index domain where the changes vary a lot. Hence, according to embodiments of the present invention the index data is predicted from previously predicted neighboring pixels taking into account that the base value and a modifier table value are known. When the index value is predicted the real index value can be decoded with the prediction as an aid. Since this way of predicting the index provides a very good prediction, it lowers the number of bits needed to represent the pixel index.
    • 本发明的实施例涉及编码纹理块的参数的压缩,使得实现有效的编码。 索引数据用作要编码的参数的示例。 因此,通过预测索引数据来实现索引数据的编码,其中在像素颜色域中完成预测,其中变化通常是平滑的,而不是在像素索引域中,其中变化很大。 因此,根据本发明的实施例,考虑到基值和修改表值是已知的,从先前预测的相邻像素预测索引数据。 当预测索引值时,可以用预测来解码实际索引值。 由于这种预测索引的方式提供了非常好的预测,因此降低了表示像素索引所需的位数。
    • 9. 发明申请
    • TILE ENCODING AND DECODING
    • 编码和解码
    • WO2012082028A1
    • 2012-06-21
    • PCT/SE2010/051379
    • 2010-12-14
    • TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)STRÖM, JacobWENNERSTEN, Per
    • STRÖM, JacobWENNERSTEN, Per
    • G06T9/00H03M7/40
    • G06T9/005G06T9/00H04N19/176H04N19/42H04N19/436H04N19/69H04N19/91
    • A tile (1) of pixels (6) is encoded by variable length encoding at least a first block (4) of pixels (6) into a first sequence (10) of symbols and a second block (5) of pixels (6) into a second sequence (20) of symbols. The symbols of the first and second sequences (10, 20) are co-organized into a combined sequence (70) of symbols in which the symbols of the first sequence (10) are readable in a first reading direction and at least a portion of the symbols in the second sequence (20) are readable in a second, opposite reading direction. The encoding of the tile (1) to form one or more combined sequences (70) significantly reduces the bandwidth requirements when writing the tile (1) to a pixel value buffer (9). The co-organization of the first and second sequences (10, 20) enables parallel reading and decoding of the first and second sequences (10, 20) from the pixel value buffer (9), thereby reducing any decoding latency.
    • 像素(6)的瓦片(1)通过将像素(6)的至少第一块(4)可变长度编码为符号的第一序列(10)和像素(6)的第二块(5)来编码, 转换成符号的第二个序列(20)。 第一和第二序列(10,20)的符号被共同组织成符号的组合序列(70),其中第一序列(10)的符号在第一读取方向上是可读的,并且至少一部分 第二序列(20)中的符号在第二相反的读取方向上是可读的。 当将瓦片(1)写入像素值缓冲器(9)时,瓦片(1)的形成一个或多个组合序列(70)的编码显着地减少了带宽需求。 第一和第二序列(10,20)的共同组织使得能够从像素值缓冲器(9)并行读取和解码第一和第二序列(10,20),从而减少任何解码等待时间。
    • 10. 发明申请
    • CO-COMPRESSION AND CO-DECOMPRESSION OF DATA VALUES
    • 数据值的共同压缩和共同解除
    • WO2012030262A1
    • 2012-03-08
    • PCT/SE2010/050939
    • 2010-09-03
    • TELEFONAKTIEBOLAGET LM ERICSSON (publ)STRÖM, JacobWENNERSTEN, Per
    • STRÖM, JacobWENNERSTEN, Per
    • G06T9/00H03M7/30
    • H03M7/30G06T9/008G10L19/00H03M7/3082H04N19/126H04N19/51
    • A first and a second data value are co-compressed by generating a sequence of symbols having a most significant symbol that is the most significant symbol of a compressed representation of the first data value and a least significant symbol that is the most significant symbol of a compressed representation of the second data value. The compressed representation of the first data value corresponds to at least a portion of the symbols of the sequence of symbols starting from the most significant symbol and extending towards the least significant symbol in a first reading direction. The compressed representation of the second data value also corresponds to at least a portion of the symbols of the sequence of symbols, however, starting from the least significant symbol and extending in an opposite reading direction towards the most significant symbol.
    • 通过产生具有最高有效符号的符号序列来共同压缩第一和第二数据值,所述最重要符号是第一数据值的压缩表示的最高有效符号,以及作为第一数据值的最重要符号的最小有效符号 第二数据值的压缩表示。 第一数据值的压缩表示对应于从最高有效符号开始的符号序列的符号的至少一部分,并且朝向第一读取方向上的最小有效符号延伸。 第二数据值的压缩表示也对应于符号序列的符号的至少一部分,然而,从最小有效符号开始并且朝着最重要符号的相反读取方向延伸。