GRADUAL DECODING REFRESH
    1.
    发明申请

    公开(公告)号:US20250071295A1

    公开(公告)日:2025-02-27

    申请号:US18724393

    申请日:2022-11-17

    Abstract: There are disclosed various methods, apparatuses and computer program products for video encoding. In some embodiments the method comprises obtaining a coding unit of a coding tree unit of a picture comprising a refreshed region and a non-refreshed region and a virtual boundary between the refreshed region and the non-refreshed region; examining whether the coding unit belongs to the refreshed region or to the non-refreshed region; treating the virtual boundary as a picture boundary when determining that the coding unit belongs to the refreshed region; or treating the virtual boundary as no boundary when determining that the coding unit belongs to the non-refreshed region.

    GENERAL REGION-BASED HASH
    2.
    发明公开

    公开(公告)号:US20240171780A1

    公开(公告)日:2024-05-23

    申请号:US18551100

    申请日:2022-03-09

    CPC classification number: H04N19/70 H04N19/17 H04N19/186

    Abstract: Example embodiments of the invention provide at least methods and apparatus to perform interpreting at an encoder of a communication network a region of at least one reconstructed picture: and based on the interpreting, generating compressed bits for generating the at least one reconstructed picture comprising at least one hash and using at least one specified variable, wherein based on the generating it can be determined whether or not the at least one hash of the at least one reconstructed picture is matched to at least one other hash. Further, to perform interpreting compressed bits for constructing at least one reconstructed picture, wherein at least one region of the at least one reconstructed picture comprises at least one hash and is using at least one specified variable, wherein the interpreting comprises generating at least one other hash: and comparing the at least one hash of the at least one reconstructed picture to the at least one other hash for determining whether or not at least one hash of the at least one reconstructed picture is matched to the at least one other hash.

    MERGE CANDIDATE LIST FOR GRADUAL DECODING REFRESH

    公开(公告)号:US20230146398A1

    公开(公告)日:2023-05-11

    申请号:US17995201

    申请日:2021-03-18

    CPC classification number: H04N19/105 H04N19/154 H04N19/172

    Abstract: A method, apparatus, and computer program product provide for solving merge candidate list mismatches. In the context of a method, the method accesses a current coding unit of a picture. The method can also generate a merge candidate list comprising a plurality of coding unit representations in a predefined order. The method also determines whether a particular coding unit representation within the merge candidate list is representative of a coding unit within a dirty area of the picture and prevents the particular coding unit representation and one or more coding unit representations following the particular coding unit in the predefined order from being selected as a merge candidate for the current coding unit.

    METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR GRADUAL DECODING REFRESH FOR VIDEO ENCODING AND DECODING

    公开(公告)号:US20230031540A1

    公开(公告)日:2023-02-02

    申请号:US17789112

    申请日:2020-12-15

    Abstract: A method, apparatus and a non-transitory computer readable medium are provided for receiving an input picture divided into a plurality of coding units (CUs) and comprising a virtual boundaries between a dirty area and a clean area of the input picture, each CU located within either the clean area or the dirty area. The virtual boundary is treated as a picture boundary for coding units within the clean area and as a non-boundary for coding units within the dirty area. For a current CU, a history-based motion vector prediction (HMVP) table can be prepared that identifies other CUs as HMVP candidates for inter prediction, the HMVP candidates being adjacent the current CU. The HMVP candidate CUs are limited to CUs previously coded in the clean area. The current CU can be intra coded based at least upon the HMVP candidates from the HMVP table.

    Luma Mapping with Chroma Scaling for Gradual Decoding Refresh

    公开(公告)号:US20230164338A1

    公开(公告)日:2023-05-25

    申请号:US17916925

    申请日:2021-03-25

    CPC classification number: H04N19/44 H04N19/46 H04N19/172 H04N19/186

    Abstract: A method, apparatus, and computer program product provide for management of luma mapping with chroma scaling (LMCS) processes for Gradual Decoding Refresh (GDR) pictures. In the context of a method, the method accesses a picture to be decoded and determines whether the picture is within a GDR period. The method can also prevent a LMCS decoding process from being applied to the picture within the GDR period. Another method can determine whether a virtual boundary is within a current coding tree unit of a picture with a GDR period and if so, prevent a chroma residual scaling decoding process associated with LMCS from being applied to one or more coding units within a clean area. Another method can pad a neighboring pixel area from one or more reconstructed pixels in a clean area for a chroma residual scaling decoding process associated with LMCS.

    A METHOD, AN APPARATUS AND A COMPUTER PROGRAM PRODUCT FOR VIDEO ENCODING AND VIDEO DECODING WITH WAVEFRONT-BASED GRADUAL RANDOM ACCESS

    公开(公告)号:US20220329787A1

    公开(公告)日:2022-10-13

    申请号:US17753455

    申请日:2020-07-29

    Abstract: There are disclosed a method and an apparatus for video encoding. The method can include determining that a coding unit is in intra coded area and encoding the coding unit in intra prediction mode into a bitstream unless the intra prediction for the coding unit needs a reference sample for prediction from a dirty area. The method can further include determining that a coding unit is in clean area when the coding unit is encoded in inter prediction mode into a bitstream, the method comprises validating a plurality of inter prediction modes to determine which of the plurality of inter prediction modes do not use reference samples from a dirty area, and defining such inter prediction mode as a valid inter prediction mode. The method further includes encoding into a bitstream that exact-match is required at a recovery point and encoding into a bitstream an indication of a use of a diagonal refresh; and transmitting the encoded bitstream to a decoder.

    HISTORY-BASED MOTION VECTOR PREDICTION AND MODE SELECTION FOR GRADUAL DECODING REFRESH

    公开(公告)号:US20230362390A1

    公开(公告)日:2023-11-09

    申请号:US18246257

    申请日:2021-09-02

    CPC classification number: H04N19/159 H04N19/105 H04N19/176 H04N19/52

    Abstract: A method, apparatus, and computer program product provide for management of history-based motion vector prediction (HMVP) processes for Gradual Decoding Refresh (GDR) pictures, as well as efficient implementations of mode selection within a GDR period and tuning of coding tools such as in-loop filters and Luma Mapping with Chroma Scaling (LMCS) such that current coding units within a clean area avoid use of coding information within a dirty area of a picture. In the context of a method, the method accesses a current coding unit of a picture. The method also accesses information associated with coding unit references each associated with a respective inter-coded coding unit. The method also determines at least one candidate coding unit reference based at least upon a comparison of an associated index value to a dirty index, and assigns at least one coding unit to a candidate list for selection in a coding process.

    Geometric Partitioning Merge Mode with Merge Mode with Motion Vector Difference

    公开(公告)号:US20230144567A1

    公开(公告)日:2023-05-11

    申请号:US17914875

    申请日:2021-03-25

    CPC classification number: H04N19/137 H04N19/159 H04N19/46

    Abstract: A method, apparatus, and computer program product provide for improving prediction accuracy of a geometric partitioning merge mode. In the context of a method, the method accesses a coding unit partitioned into a first partition and a second partition. The method also determines whether an enabling value associated with the coding unit is indicative of additional motion vector refinement and, in accordance with a determination that the enabling value associated with the coding unit is indicative of additional motion vector refinement, determines at least one motion vector difference value for at least one partition of the first partition and the second partition. The method additionally applies a prediction of the coding unit in accordance with the at least one motion vector difference value.

Patent Agency Ranking