会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • ENTROPY ENCODING AND DECODING SCHEME
    • 熵编码和解码方案
    • WO2012095488A3
    • 2012-12-13
    • PCT/EP2012050431
    • 2012-01-12
    • FRAUNHOFER GES FORSCHUNGMARPE DETLEVNGUYEN TUNGSCHWARZ HEIKOWIEGAND THOMAS
    • MARPE DETLEVNGUYEN TUNGSCHWARZ HEIKOWIEGAND THOMAS
    • H03M7/40H04N7/26
    • H03M7/00H03M7/40H03M7/4006H03M7/46
    • Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VCL coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, in accordance with embodiments, syntax elements are decomposed into a respective number n of source symbols s; with i=1...n, the respective number n of source symbols depending on as to which of a sequence of n partitions (1401-3) into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols si yields z, and, if n>l, for all i=l...n- 1, the value of Si corresponds to a range of the ith partition.
    • 将各个语法元素的值范围分解成n个分区序列,其中使用通过VCL编码和至少一个通过PIPE或熵编码分别编码各个分区内的z的分量的各个分区的编码,以大大增加 在中等编码开销下的压缩效率,因为使用的编码方案可以更好地适应语法元素统计。 因此,根据实施例,语法元素被分解为相应数量的n个源符号s; 在i = 1 ... n的情况下,源符号的相应数量n取决于对各个语法元素的值范围进行细分的哪个n个分区(1401-3)中的哪一个,值z 各个语法元素的数值落入,使得源符号si的数量的和的总和产生z,并且如果n> 1,对于所有i = 1 ... n- 1,Si的值对应于 一系列的第i个分区。
    • 5. 发明申请
    • DEVICE AND METHOD FOR PRODUCING A SPATIALLY AND TEMPORALLY SCALED DATA FLOW
    • 装置和方法,用于产生空间和时间标度数据流
    • WO2005091223A3
    • 2005-11-24
    • PCT/EP2005001895
    • 2005-02-23
    • FRAUNHOFER GES FORSCHUNGMARPE DETLEVSCHWARZ HEIKOWIEGAND THOMAS
    • MARPE DETLEVSCHWARZ HEIKOWIEGAND THOMAS
    • H04N7/26
    • H04N19/615H04N19/13H04N19/174H04N19/186H04N19/30H04N19/61H04N19/63H04N19/635
    • The invention relates to a device for producing a scaled data flow from a group of temporally successive images with a first local resolution. Said device comprises a unit (1002) for converting the images with a first local resolution into images with a second local resolution that is smaller than the first. The images with the second resolution are encoded (1004) in order to obtain a first scaling layer (1006). An auxiliary representation is produced from the images with the second resolution, said representation having a third resolution that is larger than the second resolution and smaller than, or the same as, the first resolution. The auxiliary representation is used to predict intrablocks in the second scaling layer. A version of the temporally successive images with the third resolution is then filtered, predicted and encoded (1016), for example, using a temporal wavelet subband decomposition, in order to obtain a second scaling layer. In this way, a flexible, local scalable concept is provided, that represents an extension of the H.264/AVC standard and especially uses a maximum number of standardised modules.
    • 用于在第一空间分辨率生成从一组在时间上连续的图像的经缩放的数据流的装置包括用于从所述第一空间分辨率图像转换为小于所述第一空间分辨率的第二空间分辨率的装置(1002)。 在所述第二分辨率的图像被编码(1004),以获得第一缩放层(1006)。 此外,从图像,这是目前在其与第三分辨率比所述第二分辨率大于和小于或等于第一分辨率中给出的第二分辨率产生的辅助显示器。 中间表示用于帧内编码块的在所述第二缩放层的预测。 连续图像的第三分辨率的一个版本则z。 B.使用时间小波子带分解滤,预测的及然后编码(1016),以获得第二缩放层。 因此,柔性本地扩展性概念存在,这是标准的H.264 / AVC的扩展,并且特别地使用标准化模块的最大数量。
    • 10. 发明申请
    • EFFICIENT MULTI-VIEW CODING USING DEPTH-MAP ESTIMATE FOR A DEPENDENT VIEW
    • 使用深度映射估计对于依赖视图的高效多视图编码
    • WO2013068548A2
    • 2013-05-16
    • PCT/EP2012072300
    • 2012-11-09
    • FRAUNHOFER GES FORSCHUNG
    • SCHWARZ HEIKOWIEGAND THOMAS
    • H04N7/26
    • H04N13/0022H04N13/0048H04N19/194H04N19/46H04N19/513H04N19/52H04N19/597H04N19/895H04N2213/003
    • The usual coding order according to which the reference view is coded prior to the dependent view, and within each view, a depth map is coded subsequent to the respective picture, may be maintained and does lead to a sacrifice of efficiency in performing interview redundancy removal by, for example, predicting motion data of the current picture of the dependent view from motion data of the current picture of the reference view. Rather, a depth map estimate of the current picture of the dependent view is obtained by warping the depth map of the current picture of the reference view into the dependent view, thereby enabling various methods of inter-view redundancy reduction more efficiently by bridging the gap between the views. According to another aspect, the following discovery is exploited: the overhead associated with an enlarged list of motion predictor candidates for a block of a picture of a dependent view is comparatively low compared to a gain in motion vector prediction quality resulting from an adding of a motion vector candidate which is determined from an, in disparity-compensated sense, co-located block of a reference view.
    • 参考视图在依赖视图之前编码的通常编码顺序,并且在每个视图内,在相应图片之后编码深度图,可以被维护,并且确实导致牺牲执行面试冗余移除中的效率 通过例如从参考视图的当前图片的运动数据预测从属视图的当前图片的运动数据。 相反,依赖视图的当前图像的深度图估计是通过将参考视图的当前图像的深度图扭曲到从属视图中获得的,从而通过弥合间隙来更有效地实现各种视角间冗余减少的方法 之间的意见。 根据另一方面,利用以下发现:与依赖视图的图像块的运动预测器候选的放大列表相关联的开销相对于由添加的 从视差补偿意义上确定的运动矢量候选是参考视图的同位置块。