中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

86 records (took 0.023 seconds)

    ENCODING METHOD, DECODING METHOD, ENCODER, AND DECODER
    11.
    发明申请
    ENCODING METHOD, DECODING METHOD, ENCODER, AND DECODER 有权

    公开(公告)号：US20210211666A1

    公开(公告)日：2021-07-08

    申请号：US17212777

    申请日：2021-03-25

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Han GAO ,  Yin ZHAO ,  Semih ESENLIK

    IPC: H04N19/119 ,  H04N19/132 ,  H04N19/105 ,  H04N19/176

    Abstract: This application provides an example method for processing video or image data. The method includes obtaining a non-overlapped region. The method also includes obtaining a transform block (TB) corresponding to a coding block. The method further includes determining whether the TB cross a border of the non-overlapped region or not. The method also includes, if the TB cross a border of the non-overlapped region, splitting the TB to obtain at least two sub-TBs according to the border of the non-overlapped region.

    BOUNDARY BLOCK PARTITIONING IN VIDEO CODING
    12.
    发明申请
    BOUNDARY BLOCK PARTITIONING IN VIDEO CODING 有权

    公开(公告)号：US20210136372A1

    公开(公告)日：2021-05-06

    申请号：US17144976

    申请日：2021-01-08

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Han GAO ,  Jianle CHEN ,  Semih ESENLIK ,  Zhijie ZHAO ,  Anand Meher KOTRA

    IPC: H04N19/119 ,  H04N19/192 ,  H04N19/96 ,  H04N19/176

    Abstract: A partitioning method comprises determining whether a current block of a picture is a boundary block and whether the size of the current block is larger than a minimum allowed quadtree leaf node size; and if the current block is the boundary block and the size of the current block is not larger than the minimum allowed quadtree leaf node size (MinQTSize), applying forced binary tree (BT) partitioning to the current block. A method comprises making a determination that a current block of a picture is a boundary block and that a size of the current block is less than or equal to a minimum allowed quadtree (QT) leaf node size (MinQTSize); and applying, in response to the determination, forced binary tree (BT) partitioning to the current block.

    ENCODER, A DECODER AND CORRESPONDING METHODS OF CHROMA INTRA MODE DERIVATION
    15.
    发明申请
    ENCODER, A DECODER AND CORRESPONDING METHODS OF CHROMA INTRA MODE DERIVATION 有权

    公开(公告)号：US20240373025A1

    公开(公告)日：2024-11-07

    申请号：US18764687

    申请日：2024-07-05

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Biao WANG ,  Semih ESENLIK ,  Anand Meher KOTRA ,  Han GAO ,  Elena Alexandrovna ALSHINA

    IPC: H04N19/132 ,  H04N19/159 ,  H04N19/176 ,  H04N19/186

    Abstract: A method of coding implemented by a decoding device, comprising obtaining a video bitstream; decoding the video bitstream to obtain an initial intra prediction mode value for chroma component of a current coding block; determining whether a ratio between a width for luma component of the current coding block and a width for chroma component of the current coding block is equal to a threshold or not; obtaining a mapped intra prediction mode value for chroma component of the current coding block according to a predefined mapping relationship and the initial intra prediction mode value, when it's determined that the ratio is equal to the threshold; obtaining a prediction sample value for chroma component of the current coding block according to the mapped intra prediction mode value.

    ENCODER, A DECODER AND CORRESPONDING METHODS USING IBC MERGE LIST
    16.
    发明公开
    ENCODER, A DECODER AND CORRESPONDING METHODS USING IBC MERGE LIST 审中-公开

    公开(公告)号：US20240323427A1

    公开(公告)日：2024-09-26

    申请号：US18660485

    申请日：2024-05-10

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Han GAO ,  Semih ESENLIK ,  Biao WANG ,  Anand Meher KOTRA ,  Jianle CHEN

    IPC: H04N19/513 ,  H04N19/176

    CPC classification number: H04N19/513 ,  H04N19/176

    Abstract: The present disclosure provides methods and devices of construct a candidate merge list for Intra block copy (IBC) mode, the method comprising: inserting a block vector of a left neighboring block of a current block into an initial merge list, when the left neighboring block is available and the left neighboring block is using IBC mode; inserting a block vector of an above neighboring block of the current block into the initial merge list, when the above neighboring block is available, the above neighboring block is using IBC mode and the block vector of the above neighboring block is not same as the block vector of the left neighboring block; inserting a block vector of the last candidate in a history based motion vector predictor (HMVP) into the initial merge list; obtaining a block vector of the current block according to the initial merge list.

    CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH
    17.
    发明公开
    CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH 审中-公开

    公开(公告)号：US20240303470A1

    公开(公告)日：2024-09-12

    申请号：US18666930

    申请日：2024-05-17

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Zhongwei WANG ,  Rongchen ZHU ,  Han GAO

    IPC: G06N3/0464 ,  G06N3/0455 ,  G06N3/08 ,  G06T1/20

    CPC classification number: G06N3/0464 ,  G06N3/0455 ,  G06N3/08 ,  G06T1/20

    Abstract: This application discloses a construction method and apparatus for a bipartite graph, and a display method and apparatus for a bipartite graph. The construction method includes: searching a computational graph for at least one cross-communication edge corresponding to a first communication node, where the first communication node is one of M communication nodes included in the computational graph, the first communication node corresponds to P predecessor nodes and Q successor nodes, each of the at least one cross-communication edge indicates a communication path between one of the P predecessor nodes and one of the Q successor nodes, and no cross-communication edge passes through the M communication nodes; and cutting cross-communication edges respectively corresponding to the M communication nodes, and performing an aggregation operation to obtain the bipartite graph, where any two of the M communication nodes are connected without an edge in the bipartite graph.

Patent Agency Ranking