利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

20 条记录 (耗时 0.057 秒)

    REDUCING MOTION VECTOR INFORMATION TRANSMISSION IN BI-DIRECTIONAL TEMPORAL PREDICTION
    3.
    发明申请
    REDUCING MOTION VECTOR INFORMATION TRANSMISSION IN BI-DIRECTIONAL TEMPORAL PREDICTION 有权

    公开(公告)号：US20210274192A1

    公开(公告)日：2021-09-02

    申请号：US17163059

    申请日：2021-01-29

    申请人： ARRIS Enterprises LLC

    发明人： Krit PANUSOPONE ,  Yue YU ,  Limin WANG

    IPC分类号： H04N19/159 ,  H04N19/174 ,  H04N19/30 ,  H04N19/137

    摘要： A method for inter-coding video is provided in which transmission bandwidth requirements associated with second motion vectors for bi-directional temporal prediction is reduced. In the method motion vector information for only one of the two motion vectors for bi-directional temporal prediction can be transmitted together with information on how to derive or construct the second motion vector. Thus, rather than sending express information regarding two motion vectors, express information related to only one motion vector along with information related to reconstruction/derivation of the second motion vector is transmitted, thus reducing bandwidth requirements and increasing coding efficiency.

    ADAPTIVE UNEQUAL WEIGHT PLANAR PREDICTION
    4.
    发明申请
    ADAPTIVE UNEQUAL WEIGHT PLANAR PREDICTION 审中-公开

    公开(公告)号：US20200336734A1

    公开(公告)日：2020-10-22

    申请号：US16753296

    申请日：2018-10-09

    申请人： ARRIS Enterprises LLC

    发明人： Krit PANUSOPONE ,  Yue YU ,  Seungwook HONG ,  Limin WANG

    IPC分类号： H04N19/105 ,  H04N19/13 ,  H04N19/157 ,  H04N19/182

    摘要： A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child nodes represented by leaf nodes of the binary tree with JVET, wherein coding efficiency is improved by taking advantage of the similarity of coding modes 2 and 66.

    TEMPLATE MATCHING FOR JVET INTRA PREDICTION
    5.
    发明公开
    TEMPLATE MATCHING FOR JVET INTRA PREDICTION 审中-公开

    公开(公告)号：US20230254480A1

    公开(公告)日：2023-08-10

    申请号：US18134279

    申请日：2023-04-13

    申请人： ARRIS Enterprises LLC

    发明人： Krit PANUSOPONE ,  Limin WANG ,  Koohyar MINOO

    IPC分类号： H04N19/107 ,  H04N19/105 ,  H04N19/176 ,  H04N19/149 ,  H04N19/64 ,  H04N19/91

    CPC分类号： H04N19/107 ,  H04N19/105 ,  H04N19/176 ,  H04N19/149 ,  H04N19/647 ,  H04N19/91 ,  H04N19/503

    摘要： A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

    TEMPLATE MATCHING FOR JVET INTRA PREDICTION
    7.
    发明申请
    TEMPLATE MATCHING FOR JVET INTRA PREDICTION 有权

    公开(公告)号：US20220210407A1

    公开(公告)日：2022-06-30

    申请号：US17694528

    申请日：2022-03-14

    申请人： ARRIS Enterprises LLC

    发明人： Krit PANUSOPONE ,  Limin WANG ,  Koohyar MINOO

    IPC分类号： H04N19/107 ,  H04N19/105 ,  H04N19/176 ,  H04N19/149 ,  H04N19/64 ,  H04N19/91

    摘要： A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

    ADAPTIVE UNEQUAL WEIGHT PLANAR PREDICTION
    9.
    发明申请
    ADAPTIVE UNEQUAL WEIGHT PLANAR PREDICTION 有权

    公开(公告)号：US20220021907A1

    公开(公告)日：2022-01-20

    申请号：US17473807

    申请日：2021-09-13

    申请人： ARRIS Enterprises LLC

    发明人： Krit PANUSOPONE ,  Yue YU ,  Seungwook HONG ,  Limin WANG

    IPC分类号： H04N19/91 ,  H04N19/119 ,  H04N19/182 ,  H04N19/96 ,  H04N19/593 ,  H04N19/157 ,  H04N19/176 ,  H04N19/11 ,  H04N19/13

    摘要： A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child nodes represented by leaf nodes of the binary tree with JVET, wherein coding efficiency is improved by taking advantage of the similarity of coding modes 2 and 66.