US 12,192,443 B2
Merge candidate list for gradual decoding refresh
Limin Wang, San Diego, CA (US); Seungwook Hong, San Diego, CA (US); and Krit Panusopone, San Diego, CA (US)
Assigned to NOKIA TECHNOLOGIES OY, Espoo (FI)
Appl. No. 17/995,201
Filed by NOKIA TECHNOLOGIES OY, Espoo (FI)
PCT Filed Mar. 18, 2021, PCT No. PCT/EP2021/056966
§ 371(c)(1), (2) Date Sep. 30, 2022,
PCT Pub. No. WO2021/197862, PCT Pub. Date Oct. 7, 2021.
Claims priority of provisional application 63/002,919, filed on Mar. 31, 2020.
Prior Publication US 2023/0146398 A1, May 11, 2023
Int. Cl. H04N 19/577 (2014.01); H04N 19/105 (2014.01); H04N 19/154 (2014.01); H04N 19/172 (2014.01)
CPC H04N 19/105 (2014.11) [H04N 19/154 (2014.11); H04N 19/172 (2014.11)] 12 Claims
OG exemplary drawing
 
1. An apparatus comprising: at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to:
determine whether a picture comprises a gradual decoding refresh picture; and
in an instance in which the picture comprises a gradual decoding refresh picture:
access a current coding unit of a picture;
generate a merge candidate list comprising a plurality of coding unit representations in a predefined order;
determine 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
in accordance with a determination that the particular coding unit representation within the merge candidate list is representative of a coding unit within a dirty area of the picture:
prevent 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.