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

1. 发明申请

US20140064363A1 Decoders and Methods Thereof for Managing Pictures in Video Decoding Process 审中-公开
标题翻译：解码器及其在视频解码过程中管理图像的方法
公开(公告)号：US20140064363A1
公开(公告)日：2014-03-06
申请号：US13637242
申请日：2012-09-20
申请人： Jonatan Samuelsson , Rickard Sjöberg , Per Wennersten
发明人： Jonatan Samuelsson , Rickard Sjöberg , Per Wennersten
IPC分类号： H04N7/26 , H04N7/32
CPC分类号： H04N19/50 , H04N19/31 , H04N19/44 , H04N19/46
摘要： An object with the embodiments of the present invention is to make it well defined from which previously decoded picture to retrieve the values for calculating POC of the current picture regardless of how many temporal layers have been decoded.That is achieved by determining the POC of the current picture, to be used by the decoder, as a sum of a syntax element pic_order_cnt_lsb and a most significant bits of the POC, PicOrderCntMsb, of the current picture, wherein the PicOrderCntMsb of the current picture is derived using at least a prevPicOrderCntMsb and a prevPicOrderCntLsb and the prevPicOrderCntMsb is set equal to the most significant bits of the POC of a previous reference picture in decoding order that has a layer identity equal to zero and prevPicOrderCntLsb is set equal to the value of the least significant bits of the POC of a previous reference picture in decoding order that has a layer identity equal to zero.
摘要翻译：具有本发明的实施例的目的是使其从先前解码的图像中很好地定义，以检索用于计算当前图像的POC的值，而不管已经解码了多少时间层。这是通过将解码器使用的当前画面的POC确定为当前画面的语法元素pic_order_cnt_lsb和POC，PicOrderCntMsb的最高有效位的总和来实现的，其中当前画面的PicOrderCntMsb 使用至少一个prevPicOrderCntMsb和prevPicOrderCntLsb导出，并且将prevPicOrderCntMsb设置为等于先前参考图片的POC的最高有效位，其解码顺序具有等于零的层标识，并且将prevPicOrderCntLsb设置为等于解码顺序中先前参考图片的POC的最低有效位具有等于零的层标识。

2. 发明授权

US10674171B2 Decoders and methods thereof for managing pictures in video decoding process 审中-公开
公开(公告)号：US10674171B2
公开(公告)日：2020-06-02
申请号：US13637242
申请日：2012-09-20
申请人： Jonatan Samuelsson , Rickard Sjöberg , Per Wennersten
发明人： Jonatan Samuelsson , Rickard Sjöberg , Per Wennersten
IPC分类号： H04N19/50 , H04N19/46 , H04N19/44 , H04N19/31
摘要： The solution presented herein defines from which previously decoded picture to retrieve the values for calculating POC of the current picture regardless of how many temporal layers have been decoded. That is achieved by determining the POC of the current picture, to be used by the decoder, as a sum of a syntax element pic_order_cnt_lsb and most significant bits of the POC, PicOrderCntMsb, of the current picture, wherein the PicOrderCntMsb of the current picture is derived using at least a prevPicOrderCntMsb and a prevPicOrderCntLsb and the prevPicOrderCntMsb is set equal to the most significant bits of the POC of a previous reference picture in decoding order that has a layer identity equal to zero and prevPicOrderCntLsb is set equal to the value of the least significant bits of the POC of a previous reference picture in decoding order that has a layer identity equal to zero.

3. 发明申请

US20130294511A1 Methods and Devices for Intra Coding of Video 审中-公开
标题翻译：视频内编码方法与设备
公开(公告)号：US20130294511A1
公开(公告)日：2013-11-07
申请号：US13978918
申请日：2012-01-12
申请人： Rickard Sjöberg , Jonatan Samuelsson , Per Wennersten
发明人： Rickard Sjöberg , Jonatan Samuelsson , Per Wennersten
IPC分类号： H04N7/32
CPC分类号： H04N19/59 , H04N19/159 , H04N19/174 , H04N19/176 , H04N19/182 , H04N19/50
摘要： Encoder, decoder and methods for intra coding of video. The method in the decoder relates to decoding of an intra coded block IZ having a number N of neighboring blocks CU1-CUN. When at least one block CUk of the number of neighboring blocks is unavailable for intra prediction, pixel values for spatial positions covered by CUk are estimated based on at least one pixel value of at least one of blocks CUk−m and CUk+p within the range [CU1-CUk−1, CUk+1-CUN] of blocks, which is available for intra prediction. Further, the block IZ is decoded, using the estimated pixel values for prediction, thus generating a block Z of pixels. k, m and p are integers, and 1≦k≦N; 1≦m≦k; and 1≦p≦N−k; and N is a positive integer.
摘要翻译：编码器，解码器和视频内编码方法。解码器中的方法涉及具有相邻块CU1-CUN的数目N的帧内编码块IZ的解码。当相邻块的数量的至少一个块CU k不可用于帧内预测时，基于CUk-m和CUk + p中的至少一个块CUk-m和CUk + p中的至少一个的至少一个像素值来估计由CUK覆盖的空间位置的像素值范围[CU1-CUK-1，CUK + 1-CUN]，可用于帧内预测。此外，使用估计的用于预测的像素值来解码块IZ，从而生成像素块Z。 k，m和p是整数，1 @ k @ N; 1 @ m @ k; 和1 @ p @ N-k; 并且N是正整数。

4. 发明申请

US20130251022A1 SIGNALING OF END OF SLICES 审中-公开
标题翻译：信息结束信号
公开(公告)号：US20130251022A1
公开(公告)日：2013-09-26
申请号：US13500014
申请日：2012-03-21
申请人： Rickard Sjöberg , Per Wennersten
发明人： Rickard Sjöberg , Per Wennersten
IPC分类号： H04N7/26
CPC分类号： H04N19/174 , H04N19/46 , H04N19/61 , H04N19/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）分配这些标志来提供有效的切片标志信号，而其他编码单元不需要相关联的标志。

5. 发明申请

US20110194609A1 Selecting Predicted Motion Vector Candidates 审中-公开
标题翻译：选择预测运动矢量候选者
公开(公告)号：US20110194609A1
公开(公告)日：2011-08-11
申请号：US13022170
申请日：2011-02-07
申请人： Thomas Rusert , Jacob Ström , Kenneth Andersson , Per Wennersten , Rickard Sjöberg
发明人： Thomas Rusert , Jacob Ström , Kenneth Andersson , Per Wennersten , Rickard Sjöberg
IPC分类号： H04N7/32
CPC分类号： H04N19/105 , H04N19/137 , H04N19/176 , H04N19/52
摘要： There is provided a method of selecting PMV candidates, wherein each PMV candidate corresponds to a motion vector used for coding of a previous block, said previous block having a distance from a current block. The method comprises identifying allowed distance values of distances between the current block and the previous block. The method further comprises selecting a set of PMV candidates as a subset of the set of previously coded motion vectors that were used for previous blocks having an allowed distance from the current block.
摘要翻译：提供了一种选择PMV候选的方法，其中每个PMV候选对应于用于前一块的编码的运动矢量，所述先前块具有与当前块的距离。该方法包括识别当前块和先前块之间的距离的允许距离值。该方法还包括选择一组PMV候选作为先前编码的运动矢量集合的子集，其用于具有来自当前块的允许距离的先前块。

6. 发明申请

US20110194608A1 Managing Predicted Motion Vector Candidates 审中-公开
标题翻译：管理预测的运动矢量候选者
公开(公告)号：US20110194608A1
公开(公告)日：2011-08-11
申请号：US13022133
申请日：2011-02-07
申请人： Thomas Rusert , Jacob Ström , Kenneth Andersson , Per Wennersten , Rickard Sjöberg
发明人： Thomas Rusert , Jacob Ström , Kenneth Andersson , Per Wennersten , Rickard Sjöberg
IPC分类号： H04N7/12
CPC分类号： H04N19/105 , H04N19/137 , H04N19/176 , H04N19/52
摘要： There is provided a method of managing PMV candidates. The method comprises selecting a set of PMV candidates as a subset of the previously coded motion vectors. The method further comprises assigning a code value to each PMV candidate in the set of PMV candidates. The code values vary in length and are assigned to the PMV candidates in order of expected usage such that the PMV candidate having the highest expected usage has one of the shortest code values.
摘要翻译：提供了一种管理PMV候选人的方法。该方法包括选择一组PMV候选作为先前编码的运动矢量的子集。该方法还包括向PMV候选集合中的每个PMV候选分配码值。代码值的长度不同，按照预期的使用顺序分配给PMV候选，使得具有最高预期使用的PMV候选具有最短代码值之一。

7. 发明授权

US08737750B2 Pixel block compression and decompression 有权
标题翻译：像素块压缩和解压缩
公开(公告)号：US08737750B2
公开(公告)日：2014-05-27
申请号：US13024077
申请日：2011-02-09
申请人： Jacob Strom , Per Wennersten
发明人： Jacob Strom , Per Wennersten
IPC分类号： G06K9/36
CPC分类号： H04N1/41 , H04N19/428 , H04N19/50
摘要： Compression of a pixel block having multiple pixels comprises calculating a respective prediction error for each pixel component of the pixels except a defined starting pixel. Respective minimum number of symbols required for representing the prediction errors are determined and used to select a symbol configuration among multiple different symbol configurations. Each such symbol configuration defines respective numbers of symbols maximally available for the different prediction errors. A compressed representation of the pixel block comprises a configuration identifier of the selected symbol configuration, a representation of the pixel value of the defined starting pixel and representations of the prediction errors calculated for the remaining pixels.
摘要翻译：具有多个像素的像素块的压缩包括计算除了定义的起始像素之外的像素的每个像素分量的相应预测误差。确定表示预测误差所需的符号的最小数量，并用于在多个不同符号配置中选择符号配置。每个这样的符号配置定义对于不同的预测误差最大可用的符号的相应数目。像素块的压缩表示包括所选择的符号配置的配置标识符，所定义的起始像素的像素值的表示和针对剩余像素计算的预测误差的表示。

8. 发明授权

US08577164B2 Image processing 有权
标题翻译：图像处理
公开(公告)号：US08577164B2
公开(公告)日：2013-11-05
申请号：US13132524
申请日：2009-05-29
申请人： Jacob Ström , Per Wennersten
发明人： Jacob Ström , Per Wennersten
IPC分类号： G06K9/36
CPC分类号： H04N19/423 , H04N19/115 , H04N19/119 , H04N19/136 , H04N19/176 , H04N19/192
摘要： An image (1) is decomposed into multiple superblocks (20, 22), each encompassing multiple pixel blocks (30A-30D, 32A-32D) having multiple pixels (40). The property values of a superblock (20) is fixed rate compressed to get a compressed block having a target bit length. The compressed block is stored in the memory locations (310, 320) assigned to the multiple pixel blocks (30A-30D) encompassed by the superblock (20) to thereby get multiple copies of the compressed block in the memory (300). The multiple copies collectively constitute a compressed representation of the superblock (20). When accessing a compressed block in a memory location (310) using random access during decoding, property values for neighboring pixel blocks (30B-30D) are obtained for free without the need for any further memory access.
摘要翻译：图像（1）被分解成多个超块（20,22），每个超块包含具有多个像素（40）的多个像素块（30A-30D，32A-32D）。超级块（20）的属性值被固定速率压缩以获得具有目标比特长度的压缩块。压缩块被存储在由超级块（20）包围的分配给多个像素块（30A-30D）的存储器位置（310,320）中，从而获得存储器（300）中的压缩块的多个副本。多个副本共同构成超级块（20）的压缩表示。当在解码期间使用随机访问在存储器位置（310）中访问压缩块时，获得相邻像素块（30B-30D）的属性值，而不需要任何进一步的存储器访问。

9. 发明授权

US08447103B2 Methods and arrangements for image processing 有权
标题翻译：图像处理方法和布置
公开(公告)号：US08447103B2
公开(公告)日：2013-05-21
申请号：US13377106
申请日：2009-12-22
申请人： Jim Rasmusson , Tomas Akenine-Möller , Per Wennersten , Jakob Ström
发明人： Jim Rasmusson , Tomas Akenine-Möller , Per Wennersten , Jakob Ström
IPC分类号： G06K9/00 , G06K9/36
CPC分类号： H04N1/64 , G06T9/00 , H04N19/14 , H04N19/428 , H04N19/593
摘要： The present invention relates to methods and arrangements for compressing images. The invention is based on the fact that edge blocks contain much information in one direction (across the edge), but very little information in the other direction (along the edge). By encoding edges explicitly, it is possible to obtain a high quality to a very low cost for many blocks. A block is encoded by first specifying the orientation of the edge in the block, and then specifying the profile across the edge using a function with a small number of parameters.
摘要翻译：本发明涉及压缩图像的方法和装置。本发明基于以下事实：边缘块在一个方向（跨越边缘）包含许多信息，但在另一个方向（沿着边缘）包含很少的信息。通过明确地编码边缘，可以获得许多块的高质量到非常低的成本。通过首先指定块中边缘的方向，然后使用少量参数的函数来指定边缘上的轮廓来编码块。

10. 发明授权

US08335385B2 Pixel block processing 有权
标题翻译：像素块处理
公开(公告)号：US08335385B2
公开(公告)日：2012-12-18
申请号：US12863692
申请日：2008-09-17
申请人： Jacob Strom , Tomas Akenine-Moller , Per Wennersten
发明人： Jacob Strom , Tomas Akenine-Moller , Per Wennersten
IPC分类号： G06K9/36
CPC分类号： H04N19/192 , H04N19/115 , H04N19/162 , H04N19/176
摘要： A pixel block (300) is losslessly compressed into a candidate compressed block. If the bit length of the candidate block exceeds a threshold value, the property values of the pixels (310-317) in the block (300) are quantized and the quantized values are losslessly compressed into a new candidate compressed block. The procedure is repeated until a candidate compressed block having good image quality and a bit length below the threshold value is found. A compressed representation (400) of the block (300) is determined based on the found candidate compressed block (420) and an identifier (410) of the used quantization parameter.
摘要翻译：像素块（300）被无损压缩成候选压缩块。如果候选块的比特长度超过阈值，则对块（300）中的像素（310-317）的属性值进行量化，并将量化值无损压缩为新的候选压缩块。重复该过程，直到找到具有良好图像质量和位长度低于阈值的候选压缩块。基于所找到的候选压缩块（420）和所使用的量化参数的标识符（410）来确定块（300）的压缩表示（400）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式