Progressive decoding refresh and coding tool

Abstract

Systems, methods, and instrumentalities for the field of video compression are disclosed herein. An object of the examples herein is to improve compression efficiency compared to existing video compression systems. In an example, a video encoder may obtain a reference picture of a current picture. The reference picture may include clean and dirty regions divided by boundaries. An encoder may obtain a motion compensated block associated with a current block in a reference picture. The encoder may obtain an associated intra coded block based on the motion compensated block. The encoder may determine intra mode propagation information for the current block based on a position of the intra coded block relative to the boundary. The current picture may be encoded based on the intra mode propagation information.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of European patent application 22305501.3 filed on April 8, 2022, the disclosure of which is incorporated herein by reference in its entirety. Background Art

[0003] Video coding systems may be used to compress digital video signals, for example, to reduce the storage and / or transmission bandwidth required for such signals. Video coding systems may include, for example, block-based, wavelet-based, and / or object-based systems. Summary of the invention

[0004] Disclosed herein are systems, methods, and means for video encoding and decoding. In an example, a video encoder may obtain a reference picture for a current picture. The reference picture may include clean areas and dirty areas divided by a boundary (e.g., a progressive decoding refresh (GDR) boundary). The encoder may obtain a motion compensation block associated with a current block in the reference picture. The encoder may obtain an associated intra-coded block based on the motion compensation block. The motion compensation block and the associated intra-coded block may be the same block or may be different blocks. The encoder may determine intra-mode propagation information for the current block based on a position of the intra-coded block relative to a boundary. The current picture may be encoded based on the intra-mode propagation information.

[0005] The intra-mode propagation information may include an intra-mode propagation validity indication. The intra-mode propagation validity indication may be configured to indicate whether intra-mode propagation for the current block is valid. Determining whether intra-mode propagation for the current block is valid may be based on the position of the intra-coded block relative to the boundary. Based on the position of the intra-coded block being in a clean area of ​​a reference picture, the encoder may set the intra-mode propagation information for the current block to include an indication of an intra-prediction mode for the associated intra-coded block and to include an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is valid. Based on the position of the associated intra-coded block being in a dirty area of ​​a reference picture, the encoder may set the intra-mode propagation information for the current block to include an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is invalid.

[0006] The intra-mode propagation information may be configured to indicate whether intra-mode propagation for the current block is valid. Based on the intra-mode propagation information, the encoder may construct a most probable mode (MPM) list including candidate modes corresponding to the current block for a second block in the current picture. Based on the intra-mode propagation information, the encoder may determine whether to remove the candidate mode corresponding to the current block. The candidate mode may be removed based on the intra-mode propagation information indicating that intra-mode propagation for the current block is invalid.

[0007] Based on the location of the associated intra-coded block being in a dirty region of the reference picture, the encoder may set the intra-mode propagation information of the current block to indicate a default intra-prediction mode. In an example, the intra-coded block associated with the motion compensated block may be pruned within the coding tree unit associated with the current block.

[0008] In an example, a video encoder may obtain a reference picture of a current picture. The reference picture may include a clean area and a dirty area divided by a GDR boundary. The encoder may obtain a list of candidate motion vectors. The encoder may obtain a motion compensation block associated with a current block in a reference picture based on the candidate motion vector. The encoder may obtain an associated intra-coded block based on the motion compensation block. The encoder may determine whether to remove the candidate motion vector of the current block based on the position of the intra-coded block relative to the boundary. The current block may be encoded based on the determination. Based on the position of the associated intra-coded block in the clean area of ​​the reference picture, the candidate motion vector may be considered for encoding the current block. Based on the position of the associated intra-coded block in the dirty area of ​​the reference picture, the candidate motion may be removed for encoding the current block.

[0009] In an example, for a candidate motion vector on the candidate motion vector list, a motion compensation block associated with the current block may be identified in a reference picture. The encoder may obtain reference template samples of a template corresponding to the current block based on the motion compensation block. The encoder may determine whether the candidate motion vector is valid for candidate reordering based on the position of the reference template samples relative to a boundary. The current block may be encoded based on the determination. The encoder may determine that the candidate motion vector is invalid for candidate reordering based on the position of the reference template samples being in a dirty region of the reference picture.

[0010] In an example, based on determining that the candidate motion vector is invalid for candidate reordering, the merge candidate subgroup including the invalid candidate motion vector may be removed. In an example, based on determining that the candidate motion vector is invalid for candidate reordering, the candidate motion vector may be placed at the end of the merge candidate subgroup including the candidate motion vector.

[0011] These examples may be performed by a video processing device having a processor. The device may be an encoder or a decoder. These examples may be performed by a computer program product stored on a non-transitory computer-readable medium and including program code instructions. These examples may be performed by a computer program including program code instructions. These examples may be performed by a bitstream including information representing a template matching prediction mode.

[0012] The systems, methods, and means described herein may relate to decoders. In some examples, the systems, methods, and means described herein may relate to encoders. In some examples, the systems, methods, and means described herein may relate to signals (e.g., signals from encoders and / or received by decoders). A computer-readable medium may include instructions for causing one or more processors to perform the methods described herein. A computer program product may include instructions that, when executed by one or more processors, cause one or more processors to perform the methods described herein. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] Figure 1A is a system diagram illustrating an example communication system in which one or more disclosed embodiments may be implemented.

[0014] Figure 1B is an example of a method that can be used according to an embodiment of the present invention. Figure 1A A system diagram of an example wireless transmit / receive unit (WTRU) for use within the illustrated communication system.

[0015] Figure 1C is an example of a method that can be used according to an embodiment of the present invention. Figure 1A System diagram of an example Radio Access Network (RAN) and an example Core Network (CN) for use within the illustrated communication system.

[0016] Figure 1D is an example of a method that can be used according to an embodiment of the present invention. Figure 1A System diagram of yet another example RAN and yet another example CN for use within the illustrated communication system.

[0017] Figure 2 An example video encoder is illustrated.

[0018] Figure 3 An example video decoder is illustrated.

[0019] Figure 4 Examples of systems in which various aspects and examples may be implemented are illustrated.

[0020] Figure 5 An example of the concept of a coding tree representing a compressed picture is illustrated.

[0021] Figure 6 An example of dividing a coding tree unit into a coding unit (CU), a prediction unit (PU), and a transform unit is illustrated. A CU (eg, each CU) may be given intra or inter prediction parameters (eg, prediction information).

[0022] Figure 7 An example of a progressive decoding refresh (GDR) refresh concept is illustrated.

[0023] Figure 8 An example of a slice layout for GDR is illustrated.

[0024] Fig. 9 An example definition of samples used by position dependent intra prediction combining (PDPC) applied to diagonal and adjacent angle intra modes is illustrated.

[0025] Fig.10 An example of a matrix-weighted intra prediction (MIP) process is illustrated.

[0026] Fig.11 An example of derivation of a most probable mode (MPM) list for a current luma coding block (CB) belonging to an intra slice is illustrated.

[0027] Fig.12 An example of signaling (eg, MPM list-based signaling) of an index of a prediction mode (eg, intra prediction mode) for predicting a current luma CB is illustrated.

[0028] Fig.13 An example geometric partitioning mode (GPM) prediction is illustrated.

[0029] FIG. 14A to FIG. 14B An example of two GPM predictions and coarser stored parameters moving into a buffer is illustrated.

[0030] Fig.15 It is illustrated that the current CU decoding intra mode information is stored in the IPM buffer with sub-block precision.

[0031] Fig.16 Example spatial neighboring blocks used by sub-block based temporal motion vector prediction (SbTMVP) are illustrated.

[0032] Fig.17 An example of deriving a sub-CU motion field by applying motion offsets from spatial neighbors and scaling motion information from corresponding collocated sub-CUs is illustrated.

[0033] Fig.18 Reference samples of templates in example templates and reference pictures are illustrated.

[0034] Fig.19 Example templates for blocks having sub-block motion using motion information of sub-blocks of a current block and reference samples of the templates are illustrated.

[0035] Fig. 20 Example intra-mode propagation is illustrated. DETAILED DESCRIPTION

[0036] A more detailed understanding may be obtained from the following description given by way of example in conjunction with the accompanying drawings.

[0037] Figure 1A 1 is a diagram illustrating an example communication system 100 in which one or more disclosed embodiments may be implemented. The communication system 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc. to multiple wireless users. The communication system 100 may enable multiple wireless users to access such content through sharing of system resources (including wireless bandwidth). For example, the communication system 100 may employ one or more channel access methods such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), single carrier FDMA (SC-FDMA), zero tail unique word DFT spread OFDM (ZT UW DTS-s OFDM), unique word OFDM (UW-OFDM), resource block filtered OFDM, filter bank multi-carrier (FBMC), etc.

[0038] like Figure 1A As shown, the communication system 100 may include wireless transmit / receive units (WTRUs) 102a, 102b, 102c, 102d, RAN 104 / 113, CN 106 / 115, public switched telephone network (PSTN) 108, Internet 110 and other networks 112, but it should be understood that the disclosed embodiments contemplate any number of WTRUs, base stations, networks, and / or network elements. Each of the WTRUs 102a, 102b, 102c, 102d may be any type of device configured to operate and / or communicate in a wireless environment. By way of example, the WTRUs 102a, 102b, 102c, 102d (any of which may be referred to as a “station” and / or “STA”) may be configured to send and / or receive wireless signals and may include user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a cellular phone, a personal digital assistant (PDA), a smart phone, a laptop, a netbook, a personal computer, a wireless sensor, a hotspot or Mi-Fi device, an Internet of Things (IoT) device, a watch or other wearable device, a head-mounted display (HMD), a vehicle, a drone, medical devices and applications (e.g., remote surgery), industrial devices and applications (e.g., robots and / or other wireless devices operating in an industrial and / or automated process chain environment), a consumer electronic device, a device operating on a commercial and / or industrial wireless network, etc. Any of the WTRUs 102a, 102b, 102c, and 102d may be interchangeably referred to as a UE.

[0039] The communication system 100 may also include a base station 114a and / or a base station 114b. Each of the base stations 114a, 114b may be any type of device that is configured to wirelessly interface with at least one of the WTRUs 102a, 102b, 102c, 102d to facilitate access to one or more communication networks, such as the CN 106 / 115, the Internet 110, and / or other networks 112. By way of example, the base stations 114a, 114b may be a base transceiver station (BTS), a Node B, an eNode B, a Home Node B, a Home eNode B, a gNB, an NR Node B, a site controller, an access point (AP), a wireless router, and the like. While the base stations 114a, 114b are each depicted as a single element, it will be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and / or network elements.

[0040] The base station 114a may be part of the RAN 104 / 113, which may also include other base stations and / or network elements (not shown), such as a base station controller (BSC), a radio network controller (RNC), a relay node, etc. The base station 114a and / or the base station 114b may be configured to send and / or receive wireless signals on one or more carrier frequencies (which may be referred to as cells (not shown)). These frequencies may be in a licensed spectrum, an unlicensed spectrum, or a combination of licensed and unlicensed spectrums. A cell may provide coverage of wireless services to a specific geographic area, which may be relatively fixed or may change over time. The cell may be further divided into cell sectors. For example, a cell associated with the base station 114a may be divided into three sectors. Therefore, in one embodiment, the base station 114a may include three transceivers, i.e., one transceiver for each sector of the cell. In an embodiment, the base station 114a may employ multiple-input multiple-output (MIMO) technology and may utilize multiple transceivers for each sector of the cell. For example, beamforming may be used to send and / or receive signals in a desired spatial direction.

[0041] The base stations 114a, 114b may communicate with one or more of the WTRUs 102a, 102b, 102c, 102d over an air interface 116, which may be any suitable wireless communication link (e.g., radio frequency (RF), microwave, centimeter wave, micrometer wave, infrared (IR), ultraviolet (UV), visible light, etc.). The air interface 116 may be established using any suitable radio access technology (RAT).

[0042] More specifically, as noted above, the communication system 100 may be a multiple access system and may employ one or more channel access schemes such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA, etc. For example, the base station 114a in the RAN 104 / 113 and the WTRUs 102a, 102b, 102c may implement a radio technology such as Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA), which may use Wideband CDMA (WCDMA) to establish the air interface 115 / 116 / 117. WCDMA may include communication protocols such as High Speed ​​Packet Access (HSPA) and / or Evolved HSPA (HSPA+). HSPA may include High Speed ​​Downlink (DL) Packet Access (HSDPA) and / or High Speed ​​UL Packet Access (HSUPA).

[0043] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as Evolved UMTS Terrestrial Radio Access (E-UTRA) that may establish the air interface 116 using Long Term Evolution (LTE) and / or Advanced LTE (LTE-A) and / or Advanced LTE Pro (LTE-APro).

[0044] In one embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as NR radio access, which may establish the air interface 116 using New Radio (NR).

[0045] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement multiple radio access technologies. For example, the base station 114a and the WTRUs 102a, 102b, 102c may together implement LTE radio access and NR radio access, for example using the dual connectivity (DC) principle. Thus, the air interface used by the WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and / or transmissions transmitted to / from multiple types of base stations (e.g., eNBs and gNBs).

[0046] In other embodiments, the base station 114a and the WTRUs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi)), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, Interim Standard 2000 (IS-2000), Interim Standard 95 (IS-95), Interim Standard 856 (IS-856), Global System for Mobile Communications (GSM), Enhanced Data rates for GSM Evolution (EDGE), GSM EDGE (GERAN), etc.

[0047] Figure 1A The base station 114b in the may be, for example, a wireless router, a Home NodeB, a Home eNodeB, or an access point, and may utilize any suitable RAT to facilitate wireless connectivity in a local area, such as a business location, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a road, and the like. In one embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology (such as IEEE 802.11) to establish a wireless local area network (WLAN). In an embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology (such as IEEE 802.15) to establish a wireless personal area network (WPAN). In yet another embodiment, the base station 114b and the WTRUs 102c, 102d may utilize a cellular-based RAT (e.g., WCDMA, CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR, etc.) to establish a picocell or a femtocell. As Figure 1A As shown, base station 114b may have a direct connection to Internet 110. Therefore, base station 114b may not need to access Internet 110 via CN 106 / 115.

[0048] The RAN 104 / 113 may be in communication with the CN 106 / 115, which may be any type of network configured to provide voice, data, applications, and / or Voice over Internet Protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d. The data may have different quality of service (QoS) requirements, such as different throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, etc. The CN 106 / 115 may provide call control, billing services, mobile location-based services, prepaid calling, Internet connectivity, video distribution, etc., and / or perform advanced security functions, such as user authentication. Although not described in detail in the text, the CN 106 / 115 may be configured to provide voice, data, applications, and / or Voice over Internet Protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d. The data may have different quality of service (QoS) requirements, such as different throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, etc. The CN 106 / 115 may provide call control, billing services, mobile location-based services, prepaid calling, Internet connectivity, video distribution, etc., and / or perform advanced security functions, such as user authentication. Figure 1AAlthough not shown in the figure, it will be appreciated that the RAN 104 / 113 and / or the CN 106 / 115 may be in direct or indirect communication with other RANs that employ the same RAT as the RAN 104 / 113 or a different RAT. For example, in addition to being connected to the RAN 104 / 113, which may utilize NR radio technology, the CN 106 / 115 may also be in communication with another RAN (not shown) that employs GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology.

[0049] The CN 106 / 115 may also serve as a gateway for the WTRUs 102a, 102b, 102c, 102d to access the PSTN 108, the Internet 110, and / or other networks 112. The PSTN 108 may include a circuit-switched telephone network that provides plain old telephone service (POTS). The Internet 110 may include a global system of interconnected computer networks and devices that use common communication protocols, such as the Transmission Control Protocol (TCP), the User Datagram Protocol (UDP), and / or the Internet Protocol (IP) in the TCP / IP Internet protocol suite. The networks 112 may include wired communication networks and / or wireless communication networks owned and / or operated by other service providers. For example, the networks 112 may include another CN connected to one or more RANs, which may employ the same RAT as the RAN 104 / 113 or a different RAT.

[0050] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communication system 100 may include multi-mode capabilities (e.g., the WTRUs 102a, 102b, 102c, 102d may include multiple transceivers for communicating with different wireless networks via different wireless links). Figure 1A The illustrated WTRU 102c may be configured to communicate with the base station 114a, which may employ a cellular-based radio technology, and with the base station 114b, which may employ an IEEE 802 radio technology.

[0051] Figure 1B is a system diagram illustrating an example WTRU 102. Figure 1B As shown, the WTRU 102 may include, among other things, a processor 118, a transceiver 120, a transmit / receive element 122, a speaker / microphone 124, a keypad 126, a display / touchpad 128, non-removable memory 130, removable memory 132, a power source 134, a global positioning system (GPS) chipset 136, and / or other peripherals 138. It will be appreciated that the WTRU 102 may include any sub-combination of the foregoing elements while remaining consistent with an embodiment.

[0052] The processor 118 may be a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors associated with a DSP core, a controller, a microcontroller, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) circuit, any other type of integrated circuit (IC), a state machine, etc. As suggested above, the processor 118 may include a plurality of processors. The processor 118 may perform signal decoding, data processing, power control, input / output processing, and / or any other functionality that enables the WTRU 102 to operate in a wireless environment. The processor 118 may be coupled to the transceiver 120, which may be coupled to the transmit / receive element 122. Although Figure 1B The processor 118 and the transceiver 120 are depicted as separate components, but it is understood that the processor 118 and the transceiver 120 may be integrated together in an electronic package or chip.

[0053] The send / receive element 122 may be configured to send a signal to a base station (e.g., base station 114a) or receive a signal from the base station by an air interface 116. For example, in one embodiment, the send / receive element 122 may be an antenna configured to send and / or receive an RF signal. In an embodiment, the send / receive element 122 may be a transmitter / detector configured to send and / or receive, for example, IR, UV or visible light signals. In another embodiment, the send / receive element 122 may be configured to send and / or receive both RF signals and optical signals. It should be understood that the send / receive element 122 may be configured to send and / or receive any combination of wireless signals.

[0054] Although the transmit / receive element 122 Figure 1B 1 as a single element, the WTRU 102 may include any number of transmit / receive elements 122. More specifically, the WTRU 102 may employ MIMO technology. Thus, in one embodiment, the WTRU 102 may include two or more transmit / receive elements 122 (e.g., multiple antennas) for transmitting and receiving wireless signals over the air interface 116.

[0055] The transceiver 120 may be configured to modulate signals to be transmitted by the transmit / receive element 122 and to demodulate signals received by the transmit / receive element 122. As noted above, the WTRU 102 may have multi-mode capabilities. For example, the transceiver 120 may include multiple transceivers for enabling the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11.

[0056] The processor 118 of the WTRU 102 may be coupled to and may receive user input data from a speaker / microphone 124, a keypad 126, and / or a display / touchpad 128 (e.g., a liquid crystal display (LCD) display unit or an organic light emitting diode (OLED) display unit). The processor 118 may also output user data to the speaker / microphone 124, the keypad 126, and / or the display / touchpad 128. In addition, the processor 118 may access information from and store data in any type of suitable memory, such as a non-removable memory 130 and / or a removable memory 132. The non-removable memory 130 may include a random access memory (RAM), a read-only memory (ROM), a hard disk, or any other type of memory storage device. The removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like. In other embodiments, the processor 118 may access information from and store data in a memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).

[0057] The processor 118 may receive power from the power source 134, and may be configured to distribute and / or control power to other components in the WTRU 102. The power source 134 may be any suitable device for powering the WTRU 102. For example, the power source 134 may include one or more dry cell batteries (e.g., nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel-metal hydride (NiMH), lithium-ion (Li-ion), etc.), solar cells, fuel cells, etc.

[0058] The processor 118 may also be coupled to the GPS chipset 136, which may be configured to provide location information (e.g., longitude and latitude) regarding the current location of the WTRU 102. In addition to or in lieu of the information from the GPS chipset 136, the WTRU 102 may receive location information from a base station (e.g., base stations 114a, 114b) over the air interface 116 and / or determine its location based on the timing of signals received from two or more nearby base stations. It will be appreciated that the WTRU 102 may acquire location information by any suitable location-determination method while remaining consistent with an embodiment.

[0059] The processor 118 may also be coupled to other peripherals 138, which may include one or more software modules and / or hardware modules that provide additional features, functionality, and / or wired or wireless connectivity. For example, the peripherals 138 may include an accelerometer, an electronic compass, a satellite transceiver, a digital camera (for photos and / or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands-free headset, module, a frequency modulation (FM) radio unit, a digital music player, a media player, a video game player module, an Internet browser, a virtual reality and / or augmented reality (VR / AR) device, an activity tracker, etc. Peripheral device 138 may include one or more sensors, which may be one or more of the following: a gyroscope, an accelerometer, a Hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor, and / or a humidity sensor.

[0060] The WTRU 102 may include a full-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) and downlink (e.g., for reception)) may be concurrent and / or simultaneous. The full-duplex radio may include an interference management unit for reducing and / or substantially eliminating self-interference via signal processing performed via hardware (e.g., a choke) or via a processor (e.g., a separate processor (not shown) or via the processor 118). In an embodiment, the WRTU 102 may include a half-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) or downlink (e.g., for reception)) may be concurrent and / or simultaneous.

[0061] Figure 1C 1 is a system diagram illustrating the RAN 104 and the CN 106 in accordance with an embodiment. As noted above, the RAN 104 may employ an E-UTRA radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116. The RAN 104 may also be in communication with the CN 106.

[0062] The RAN 104 may include evolved Node-Bs 160a, 160b, 160c, though it will be appreciated that the RAN 104 may include any number of evolved Node-Bs while remaining consistent with an embodiment. The evolved Node-Bs 160a, 160b, 160c may each include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the evolved Node-Bs 160a, 160b, 160c may implement MIMO technology. Thus, the evolved Node-B 160a, for example, may use multiple antennas to transmit wireless signals to and / or receive wireless signals from the WTRU 102a.

[0063] Each of the evolved Node Bs 160a, 160b, 160c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in UL and / or DL, etc. Figure 1C As shown, the eNode-Bs 160a, 160b, 160c may communicate with one another via an X2 interface.

[0064] Figure 1C The illustrated CN 106 may include a mobility management entity (MME) 162, a serving gateway (SGW) 164, and a packet data network (PDN) gateway (or PGW) 166. While each of the foregoing elements is depicted as being part of the CN 106, it should be understood that any of these elements may be owned and / or operated by an entity other than the CN operator.

[0065] The MME 162 may be connected to each of the evolved Node-Bs 162a, 162b, 162c in the RAN 104 via an S1 interface and may serve as a control node. For example, the MME 162 may be responsible for authenticating users of the WTRUs 102a, 102b, 102c, bearer activation / deactivation, selecting a particular serving gateway during an initial attach of the WTRUs 102a, 102b, 102c, etc. The MME 162 may provide a control plane function for switching between the RAN 104 and other RANs (not shown) that employ other radio technologies, such as GSM and / or WCDMA.

[0066] The SGW 164 may be connected to each of the evolved Node-Bs 160a, 160b, 160c in the RAN 104 via an S1 interface. The SGW 164 may generally route and forward user data packets to / from the WTRUs 102a, 102b, 102c. The SGW 164 may perform other functions, such as anchoring the user plane during inter-evolved Node-B handovers, triggering paging when DL data is available for the WTRUs 102a, 102b, 102c, managing and storing the context of the WTRUs 102a, 102b, 102c, and the like.

[0067] The SGW 164 may be connected to the PGW 166, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices.

[0068] The CN 106 may facilitate communications with other networks. For example, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to circuit-switched networks, such as the PSTN 108, to facilitate communications between the WTRUs 102a, 102b, 102c and traditional land-line communications devices. For example, the CN 106 may include, or may be in communication with, an IP gateway (e.g., an IP Multimedia Subsystem (IMS) server) that acts as an interface between the CN 106 and the PSTN 108. In addition, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired networks and / or wireless networks owned and / or operated by other service providers.

[0069] Although the WTRU Figures 1A to 1D Although described as wireless terminals, it is contemplated that in certain representative embodiments, such terminals may (eg, temporarily or permanently) use a wired communications interface with a communications network.

[0070] In a representative embodiment, the other network 112 may be a WLAN.

[0071] A WLAN in infrastructure basic service set (BSS) mode may have an access point (AP) for the BSS and one or more stations (STA) associated with the AP. The AP may have access or an interface to a distribution system (DS) or another type of wired / wireless network that carries traffic to and / or carries traffic away from the BSS. Traffic originating from outside the BSS and leading to the STA may be reached by the AP and may be delivered to the STA. Traffic originating from the STA and leading to a destination outside the BSS may be transmitted to the AP to be delivered to the corresponding destination. Traffic between STAs within the BSS may be transmitted by the AP, for example, wherein the source STA may transmit traffic to the AP, and the AP may deliver traffic to the destination STA. Traffic between STAs within the BSS may be considered and / or referred to as point-to-point traffic. Point-to-point traffic may be transmitted between the source STA and the destination STA (e.g., directly between them) using a direct link establishment (DLS). In certain representative embodiments, the DLS may use 802.11e DLS or 802.11z tunnel DLS (TDLS). A WLAN using an independent BSS (IBSS) mode may not have an AP, and STAs within or using the IBSS (eg, all STAs in the STA) may communicate directly with each other. The IBSS communication mode may sometimes be referred to herein as an "ad hoc" communication mode.

[0072] When using the 802.11ac infrastructure operating mode or a similar operating mode, the AP may send beacons on a fixed channel (such as a primary channel). The primary channel may be a fixed width (e.g., a 20 MHz wide bandwidth) or a width dynamically set via signaling. The primary channel may be an operating channel of the BSS and may be used by the STA to establish a connection with the AP. In certain representative embodiments, carrier sense multiple access / collision avoidance (CSMA / CA) may be implemented, for example, in an 802.11 system. For CSMA / CA, a STA (e.g., each STA) (including the AP) may listen to the primary channel. In the case where the primary channel is listened / detected and / or determined to be busy by a specific STA, the specific STA may back off. One STA (e.g., only one station) may transmit at any given time in a given BSS.

[0073] High throughput (HT) STAs may communicate using a 40 MHz wide channel, for example, via a combination of a primary 20 MHz channel and adjacent or non-adjacent 20 MHz channels to form a 40 MHz wide channel.

[0074] Very high throughput (VHT) STA can support 20MHz, 40MHz, 80MHz and / or 160MHz wide channels. 40MHz channels and / or 80MHz channels can be formed by combining continuous 20MHz channels. 160MHz channels can be formed by combining 8 continuous 20MHz channels, or by combining two non-continuous 80MHz channels (this can be called 80+80 configuration). For 80+80 configuration, after channel coding, the data can pass through a segment parser that can divide the data into two streams. Each stream can be processed by inverse fast Fourier transform (IFFT) and time domain processing separately. These streams can be mapped to two 80MHz channels, and data can be sent by the transmitter STA. At the receiver of the receiver STA, the above-mentioned operation for the 80+80 configuration can be reversed, and the combined data can be transmitted to the medium access control (MAC).

[0075] 802.11af and 802.11ah support operating modes below 1GHz. Channel operating bandwidths and carriers are reduced in 802.11af and 802.11ah relative to those used in 802.11n and 802.11ac. 802.11af supports 5MHz, 10MHz, and 20MHz bandwidths in the TV White Space (TVWS) spectrum, and 802.11ah supports 1MHz, 2MHz, 4MHz, 8MHz, and 16MHz bandwidths using non-TVWS spectrum. According to a representative embodiment, 802.11ah may support instrument type control / machine type communications, such as MTC devices in macro coverage areas. MTC devices may have certain capabilities, such as limited capabilities, including support for (e.g., only support for) certain bandwidths and / or limited bandwidths. MTC devices may include batteries with battery life above a threshold (e.g., to maintain very long battery life).

[0076] WLAN systems that can support multiple channels and channel bandwidths (such as 802.11n, 802.11ac, 802.11af, and 802.11ah) include channels that can be designated as primary channels. The primary channel may have a bandwidth equal to the maximum common operating bandwidth supported by all STAs in the BSS. The bandwidth of the primary channel may be set and / or limited by a STA (which supports the minimum bandwidth operating mode) from all STAs operating in the BSS. In the example of 802.11ah, for STAs (e.g., MTC-type devices) that support (e.g., only support) a 1MHz mode, the primary channel may be 1MHz wide, even if the AP and other STAs in the BSS support 2MHz, 4MHz, 8MHz, 16MHz, and / or other channel bandwidth operating modes. Carrier sensing and / or network allocation vector (NAV) settings may depend on the state of the primary channel. If the primary channel is busy, for example, because a STA (supporting only a 1MHz operating mode) is sending to the AP, the entire available frequency band may be considered busy even if most of the frequency bands remain idle and may be available.

[0077] In the United States, the available frequency band for 802.11ah is 902MHz to 928MHz. In South Korea, the available frequency band is 917.5MHz to 923.5MHz. In Japan, the available frequency band is 916.5MHz to 927.5MHz. The total bandwidth available for 802.11ah is 6MHz to 26MHz, depending on the country code.

[0078] Figure 1D 1 is a system diagram illustrating the RAN 113 and the CN 115 in accordance with an embodiment. As noted above, the RAN 113 may employ NR radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116. The RAN 113 may also be in communication with the CN 115.

[0079] The RAN 113 may include gNBs 180a, 180b, 180c, though it will be appreciated that the RAN 113 may include any number of gNBs while remaining consistent with an embodiment. The gNBs 180a, 180b, 180c may each include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the gNBs 180a, 180b, 180c may implement MIMO technology. For example, the gNBs 180a, 180b may utilize beamforming to send signals to and / or receive signals from the gNBs 180a, 180b, 180c. Thus, the gNB 180a may, for example, use multiple antennas to send wireless signals to and / or receive wireless signals from the WTRU 102a. In an embodiment, the gNBs 180a, 180b, 180c may implement carrier aggregation technology. For example, gNB 180a may transmit multiple component carriers to WTRU 102a (not shown). A subset of these component carriers may be on unlicensed spectrum, while the remaining component carriers may be on licensed spectrum. In an embodiment, gNBs 180a, 180b, 180c may implement coordinated multi-point (CoMP) technology. For example, WTRU 102a may receive coordinated transmissions from gNB 180a and gNB 180b (and / or gNB 180c).

[0080] The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using transmissions associated with parameter sets that may be scalable. For example, OFDM symbol spacing and / or OFDM subcarrier spacing may vary for different transmissions, different cells, and / or different portions of the wireless transmission spectrum. The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using subframes or Transmission Time Intervals (TTIs) of varying or scalable lengths (e.g., containing varying numbers of OFDM symbols and / or varying absolute time lengths over time).

[0081] The gNBs 180a, 180b, 180c may be configured to communicate with the WTRUs 102a, 102b, 102c in a standalone configuration and / or a non-standalone configuration. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c while not accessing other RANs (e.g., such as the eNodeBs 160a, 160b, 160c). In a standalone configuration, the WTRUs 102a, 102b, 102c may use one or more of the gNBs 180a, 180b, 180c as mobility anchors. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using signals in an unlicensed band. In a non-standalone configuration, the WTRUs 102a, 102b, 102c may communicate / connect with the gNB 180a, 180b, 180c while also communicating / connecting with another RAN, such as the eNode-B 160a, 160b, 160c. For example, the WTRUs 102a, 102b, 102c may implement the DC principle to communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c substantially simultaneously. In a non-standalone configuration, the eNode-B 160a, 160b, 160c may act as a mobility anchor for the WTRUs 102a, 102b, 102c, and the gNB 180a, 180b, 180c may provide additional coverage and / or throughput for serving the WTRUs 102a, 102b, 102c.

[0082] Each of the gNBs 180a, 180b, 180c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in UL and / or DL, support of network slicing, dual connectivity, interworking between NR and E-UTRA, routing of user plane data towards a user plane function (UPF) 184a, 184b, routing of control plane information towards an access and mobility management function (AMF) 182a, 182b, etc. Figure 1D As shown, gNBs 180a, 180b, and 180c may communicate with each other via an Xn interface.

[0083] Figure 1DThe illustrated CN 115 may include at least one AMF 182a, 182b, at least one UPF 184a, 184b, at least one session management function (SMF) 183a, 183b, and possible data networks (DNs) 185a, 185b. Although each of the foregoing elements is depicted as part of the CN 115, it should be understood that any of these elements may be owned and / or operated by an entity other than the CN operator.

[0084] The AMF 182a, 182b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via the N2 interface and may act as a control node. For example, the AMF 182a, 182b may be responsible for authenticating users of the WTRU 102a, 102b, 102c, support of network slicing (e.g., handling of different PDU sessions with different requirements), selecting a specific SMF 183a, 183b, management of registration areas, termination of NAS signaling, mobility management, etc. The AMF 182a, 182b may use network slicing to customize CN support for the WTRU 102a, 102b, 102c based on the type of services utilized by the WTRU 102a, 102b, 102c. For example, different network slices may be established for different use cases, such as services relying on ultra-reliable low latency (URLLC) access, services relying on enhanced mobile broadband (eMBB) access, services for machine type communication (MTC) access, etc. The AMF 162 may provide a control plane function for switching between the RAN 113 and other RANs (not shown) that employ other radio technologies, such as LTE, LTE-A, LTE-A Pro, and / or non-3GPP access technologies, such as WiFi.

[0085] The SMF 183a, 183b may be connected to the AMF 182a, 182b in the CN 115 via the N11 interface. The SMF 183a, 183b may also be connected to the UPF 184a, 184b in the CN 115 via the N4 interface. The SMF 183a, 183b may select and control the UPF 184a, 184b, and configure the traffic routing through the UPF 184a, 184b. The SMF 183a, 183b may perform other functions, such as managing and allocating UE IP addresses, managing PDU sessions, controlling policy enforcement and QoS, providing downlink data notification, etc. The PDU session type may be IP-based, non-IP-based, Ethernet-based, etc.

[0086] The UPF 184a, 184b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via the N3 interface, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices. The UPF 184, 184b may perform other functions, such as routing and forwarding packets, enforcing user plane policies, supporting multi-homed PDU sessions, handling user plane QoS, buffering downlink packets, providing mobility anchoring, etc.

[0087] The CN 115 may facilitate communications with other networks. For example, the CN 115 may include or may communicate with an IP gateway (e.g., an IP Multimedia Subsystem (IMS) server) that acts as an interface between the CN 115 and the PSTN 108. In addition, the CN 115 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired networks and / or wireless networks owned and / or operated by other service providers. In one embodiment, the WTRUs 102a, 102b, 102c may be connected to local data networks (DNs) 185a, 185b via the UPF 184a, 184b via the N3 interface to the UPF 184a, 184b and the N6 interface between the UPF 184a, 184b and the DN 185a, 185b.

[0088] Given that Figures 1A to 1D as well as Figures 1A to 1D Corresponding to the description of the present invention, one or more or all of the functions described herein with reference to one or more of the following may be performed by one or more simulation devices (not shown): WTRU102a-d, base station 114a-b, evolved Node B 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF182a-b, UPF 184a-b, SMF 183a-b, DN 185a-b and / or any other device described herein. The simulation device may be one or more devices configured to emulate one or more or all of the functions described herein. For example, the simulation device may be used to test other devices and / or simulate network and / or WTRU functions.

[0089] The simulation device may be designed to implement one or more tests of other devices in a laboratory environment and / or in an operator network environment. For example, one or more simulation devices may perform one or more functions or all functions while being fully or partially implemented and / or deployed as part of a wired and / or wireless communication network in order to test other devices within the communication network. One or more simulation devices may perform one or more functions or all functions while being temporarily implemented / deployed as part of a wired and / or wireless communication network. The simulation device may be directly coupled to another device for testing purposes and / or may use over-the-air wireless communications to perform testing.

[0090] One or more simulation devices can perform one or more (including all) functions without being implemented / deployed as part of a wired and / or wireless communication network. For example, the simulation device can be used in a test scenario in a test laboratory and / or a non-deployed (e.g., testing) wired and / or wireless communication network to implement testing of one or more components. One or more simulation devices can be test equipment. Direct RF coupling and / or wireless communication via RF circuitry (e.g., which can include one or more antennas) can be used by the simulation device to send and / or receive data.

[0091] The present application describes a number of aspects, including tools, features, examples, models, methods, etc. Many of these aspects are described in a particular manner, and at least in order to illustrate individual features, are usually described in a manner that may sound restrictive. However, this is to describe clearly and does not limit the application or scope of these aspects. In fact, all different aspects can be combined and interchanged to provide further aspects. In addition, these aspects can also be combined and interchanged with the aspects described in the earlier submission.

[0092] The aspects described and contemplated in this application can be implemented in many different forms. Figures 5 to 20 Some examples may be provided, but others are also contemplated. Figures 5 to 20 The discussion of the present invention does not limit the breadth of specific implementations. At least one of these aspects generally relates to video encoding and decoding, and at least one other aspect generally relates to sending a generated or encoded bitstream. These and other aspects can be implemented as methods, apparatus, a computer-readable storage medium having stored thereon instructions for encoding or decoding video data according to any of the methods, and / or a computer-readable storage medium having stored thereon a bitstream generated according to any of the methods.

[0093] In this application, the terms "reconstruction" and "decoding" may be used interchangeably, the terms "pixel" and "sample" may be used interchangeably, and the terms "image", "picture" and "frame" may be used interchangeably.

[0094] Various methods are described herein, and each method includes one or more steps or actions for implementing the method. Unless the correct operation method requires a specific order of steps or actions, the order and / or purpose of specific steps and / or actions can be modified or combined. In addition, in various examples, terms such as "first", "second" and the like can be used to modify elements, parts, steps, operations, etc., such as "first decoding" and "second decoding". Unless specifically required, the use of such terms does not imply the ordering of the modification operation. Therefore, in this example, the first decoding does not need to be performed before the second decoding, and can, for example, occur before, during, or in an overlapping time period of the second decoding.

[0095] like Figure 2 and Figure 3 As shown, various methods and other aspects described in this application can be used to modify modules (e.g., decoding modules) of video encoder 200 and decoder 300. In addition, the subject matter disclosed herein can be applied to, for example, any type, format, or version of video decoding (whether described in a standard or described in a recommendation), whether pre-existing or developed in the future, as well as extensions of any such standards and recommendations. Unless otherwise indicated or technically excluded, the aspects described in this application can be used alone or in combination.

[0096] Various values ​​are used in describing examples of the present application, such as bits, bit depth, etc. These and other specific values ​​are used for the purpose of describing the examples, and the described aspects are not limited to these specific values.

[0097] Figure 2 is a diagram illustrating an example video encoder. Variations of the example encoder 200 are contemplated, but the following describes encoder 200 for clarity without describing all contemplated variations.

[0098] Before being encoded, the video sequence may undergo a pre-encoding process (201), for example, applying a color transform to an input color picture (e.g., conversion from RGB 4:4:4 to YCbCr 4:2:0), or performing a remapping of input picture components to obtain a signal distribution that is more resilient to compression (e.g., using histogram equalization of one of the color components). Metadata may be associated with the pre-processing and appended to the bitstream.

[0099] In encoder 200, a picture is encoded by encoder elements as described below. The picture to be encoded is partitioned (202) and processed in units such as coding units (CUs). Each unit is encoded, for example, using intra mode or inter mode. When a unit is encoded in intra mode, the unit performs intra prediction (260). In inter mode, motion estimation (275) and compensation (270) are performed. The encoder decides (205) which of intra mode or inter mode to use to encode the unit, and indicates the intra / inter decision by, for example, a prediction mode flag. The prediction residual is calculated, for example, by subtracting (210) the predicted block from the original image block.

[0100] The prediction residual is then transformed (225) and quantized (230). The quantized transform coefficients, along with motion vectors and other syntax elements, are entropy coded (245) to output a bitstream. The encoder may skip the transform and apply quantization directly to the untransformed residual signal. The encoder may bypass both the transform and quantization, i.e., directly code the residual without applying the transform or quantization process.

[0101] The encoder decodes the coded block to provide a reference for further prediction. The quantized transform coefficients are dequantized (240) and inverse transformed (250) to decode the prediction residual. The image block is reconstructed by combining the decoded prediction residual and the predicted block (255). An in-loop filter (265) is applied to the reconstructed picture to perform, for example, deblocking / SAO (sample adaptive offset) filtering to reduce coding artifacts. The filtered image is stored at a reference picture buffer (280).

[0102] Figure 3 is a diagram illustrating an example of a video decoder. In the example decoder 300, a bitstream is decoded by decoder elements as described below. The video decoder 300 generally performs the same Figure 2 The decoding process is the reverse of the encoding process described in . The encoder 200 also typically performs video decoding as part of encoding the video data.

[0103] Specifically, the input of the decoder includes a video bitstream, which may be generated by the video encoder 200. First, the bitstream is entropy decoded (330) to obtain transform coefficients, motion vectors, and other decoded information. Picture partition information indicates how the picture is partitioned. Therefore, the decoder can divide (335) the picture according to the decoded picture partition information. The transform coefficients are dequantized (340) and inverse transformed (350) to decode the prediction residual. The image block is reconstructed by combining (355) the decoded prediction residual and the predicted block. The predicted block can be obtained (370) from intra-frame prediction (360) or motion compensated prediction (i.e., inter-frame prediction) (375). An in-loop filter (365) is applied to the reconstructed image. The filtered image is stored at a reference picture buffer (380).

[0104] The decoded picture may also undergo post-decoding processing (385), such as an inverse color transform (e.g., conversion from YCbCr 4:2:0 to RGB 4:4:4) or performing an inverse remapping that is the inverse of the remapping process performed in the pre-encoding process (201). The post-decoding processing may use metadata derived in the pre-encoding process and signaled in the bitstream. In an example, the decoded image (e.g., after applying the in-loop filter (365) and / or after the post-decoding processing (385), if post-decoding processing is used) may be transmitted to a display device for presentation to a user.

[0105] Figure 4 4 is a diagram showing an example of a system in which various aspects and examples described herein can be implemented. System 400 may be embodied as a device including various components described below and configured to perform one or more aspects of the aspects described in this document. Examples of such devices include, but are not limited to, various electronic devices such as personal computers, laptop computers, smart phones, tablet computers, digital multimedia set-top boxes, digital television receivers, personal video recording systems, connected home appliances, and servers. The elements of system 400 may be embodied in a single integrated circuit (IC), multiple ICs, and / or discrete components, either individually or in combination. For example, in at least one example, the processing and encoder / decoder elements of system 400 are distributed over multiple ICs and / or discrete components. In various examples, system 400 is communicatively coupled to one or more other systems or other electronic devices via, for example, a communication bus or through dedicated input ports and / or output ports. In various examples, system 400 is configured to implement one or more aspects of the aspects described in this document.

[0106] The system 400 includes at least one processor 410 configured to execute instructions loaded therein for implementing, for example, various aspects described in this document. The processor 410 may include embedded memory, input-output interfaces, and various other circuits as known in the art. The system 400 includes at least one memory 420 (e.g., a volatile memory device and / or a non-volatile memory device). The system 400 includes a storage device 440, which may include a non-volatile memory and / or a volatile memory, including but not limited to an electrically erasable programmable read-only memory (EEPROM), a read-only memory (ROM), a programmable read-only memory (PROM), a random access memory (RAM), a dynamic random access memory (DRAM), a static random access memory (SRAM), a flash memory, a magnetic disk drive, and / or an optical disk drive. As non-limiting examples, the storage device 440 may include an internal storage device, an attached storage device (including a removable and non-removable storage device), and / or a network-accessible storage device.

[0107] The system 400 includes an encoder / decoder module 430, which is configured to process data, for example, to provide encoded video or decoded video, and the encoder / decoder module 430 may include its own processor and memory. The encoder / decoder module 430 represents a module that may be included in a device to perform encoding and / or decoding functions. As is well known, a device may include one or both of an encoding module and a decoding module. Additionally, the encoder / decoder module 430 may be implemented as a separate element of the system 400, or may be incorporated into the processor 410 as a combination of hardware and software known to those skilled in the art.

[0108] Program code to be loaded onto the processor 410 or the encoder / decoder 430 to perform various aspects described in this document may be stored in the storage device 440 and subsequently loaded onto the memory 420 for execution by the processor 410. According to various examples, one or more of the processor 410, the memory 420, the storage device 440, and the encoder / decoder module 430 may store one or more of various items during the execution of the processes described in this document. Such stored items may include, but are not limited to, input video, decoded video or partially decoded video, bitstreams, matrices, variables, and intermediate or final results of processing equations, formulas, operations, and operation logic.

[0109] In some examples, memory inside the processor 410 and / or the encoder / decoder module 430 is used to store instructions and provide working memory for processing required during encoding or decoding. However, in other examples, memory external to the processing device (e.g., the processing device may be the processor 410 or the encoder / decoder module 430) is used for one or more of these functions. The external memory may be a memory 420 and / or a storage device 440, such as a dynamic volatile memory and / or a non-volatile flash memory. In several examples, the external non-volatile flash memory is used to store, for example, an operating system for a television. In at least one example, a fast external dynamic volatile memory (such as RAM) is used as working memory for video encoding and decoding operations.

[0110] Inputs to the elements of system 400 may be provided through various input devices as indicated in block 445. Such input devices include, but are not limited to: (i) a radio frequency (RF) section that receives an RF signal, such as that transmitted over the air by a broadcaster; (ii) a component (COMP) input terminal (or a set of COMP input terminals); (iii) a universal serial bus (USB) input terminal; and / or (iv) a high-definition multimedia interface (HDMI) input terminal. Other examples ( Figure 4 ) includes composite video.

[0111] In various examples, the input device of frame 445 has the corresponding input processing element associated as known in the art.For example, the RF part can be associated with the element suitable for the following: (i) select the required frequency (also referred to as selecting signal, or limiting the signal band to a band), (ii) down-convert the selected signal, (iii) again band-limit to a narrower band to select the signal band that (for example) can be called a channel in some examples, (iv) demodulate the signal through down-conversion and band-limited, (v) perform error correction, and / or (vi) demultiplex to select the required data packet stream. The RF part of various examples includes one or more elements for performing these functions, such as frequency selector, signal selector, band limiter, channel selector, filter, down-converter, demodulator, error corrector and demultiplexer. The RF part can include a tuner that performs various functions in these functions, including, for example, down-converting the received signal to a lower frequency (for example, intermediate frequency or near baseband frequency) or to baseband. In a set-top box example, the RF part and its associated input processing element receive the RF signal sent by wired (for example, cable) medium, and filter to the desired frequency band by filtering, down-conversion and again to perform frequency selection.Various examples rearrange the order of above-mentioned (and other) elements, remove some elements in these elements, and / or add other elements that perform similar or different functions.Adding element can include inserting element between existing elements, for example, inserting amplifier and analog-to-digital converter.In various examples, the RF part includes antenna.

[0112] The USB and / or HDMI terminals may include corresponding interface processors for connecting the system 400 to other electronic devices across the USB and / or HDMI connections. It should be understood that various aspects of input processing (e.g., Reed-Solomon error correction) may be implemented as needed, for example, in a separate input processing IC or in the processor 410. Similarly, various aspects of USB or HDMI interface processing may be implemented as needed in a separate interface IC or in the processor 410. The demodulated, error-corrected, and demultiplexed streams are provided to various processing elements, including, for example, the processor 410 and the encoder / decoder 430, which operate in conjunction with the memory and storage elements to process the data stream as needed for presentation on the output device.

[0113] The various components of system 400 may be disposed within an integrated housing. Within the integrated housing, the various components may be interconnected and transmit data between the components using a suitable connection arrangement 425 (e.g., an internal bus known in the art, including an inter-chip (I2C) bus, wiring, and a printed circuit board).

[0114] System 400 includes a communication interface 450 that enables communication with other devices via a communication channel 460. Communication interface 450 may include, but is not limited to, a transceiver configured to send and receive data through communication channel 460. Communication interface 450 may include, but is not limited to, a modem or a network card, and communication channel 460 may be implemented, for example, within a wired and / or wireless medium.

[0115] In various examples, data is streamed or otherwise provided to the system 400 using a wireless network, such as a Wi-Fi network, e.g., IEEE 802.11 (IEEE refers to the Institute of Electrical and Electronics Engineers). The Wi-Fi signals of these examples are received via a communication channel 460 and a communication interface 450 suitable for Wi-Fi communications. The communication channel 460 of these examples is typically connected to an access point or router that provides access to external networks, including the Internet, to allow streaming applications and other cross-top communications. Other examples provide streaming data to the system 400 using a set-top box that delivers data via an HDMI connection of an input box 445. Still other examples use an RF connection of an input box 445 to provide streaming data to the system 400. As described above, various examples provide data in a non-streaming manner. Additionally, various examples use wireless networks other than Wi-Fi, such as cellular networks or network.

[0116] The system 400 may provide output signals to various output devices, including a display 475, a speaker 485, and other peripherals 495. The display 475 of various examples includes, for example, one or more of a touch screen display, an organic light emitting diode (OLED) display, a curved display, and / or a foldable display. The display 475 may be used for a television, a tablet computer, a laptop, a cellular phone (mobile phone), or other devices. The display 475 may also be integrated with other components (e.g., as in a smart phone), or may be independent (e.g., an external monitor for a laptop computer). In various examples, other peripherals 495 include one or more of an independent digital video disc (or digital versatile disc) (DVD, for both terms), a disc player, a stereo system, and / or a lighting system. Various examples use one or more peripherals 495 that provide functions based on the output of the system 400. For example, a disc player performs the function of playing the output of the system 400.

[0117] In various examples, control signals are transmitted between the system 400 and the display 475, speaker 485, or other peripheral device 495 using signaling such as AV.Link, consumer electronics control (CEC), or other communication protocols that enable device-to-device control with or without user intervention. Output devices may be communicatively coupled to the system 400 via dedicated connections through respective interfaces 470, 480, and 490. Alternatively, the output devices may be connected to the system 400 via a communication interface 450 using a communication channel 460. The display 475 and speaker 485 may be integrated into a single unit with other components of the system 400 in an electronic device such as, for example, a television. In various examples, the display interface 470 includes a display driver, such as, for example, a timing controller (TCon) chip.

[0118] For example, if the RF portion of input 445 is part of a separate set-top box, the display 475 and speaker 485 may alternatively be separate from one or more of the other components. In various examples where the display 475 and speaker 485 are external components, the output signal may be provided via a dedicated output connection including, for example, an HDMI port, a USB port, or a COMP output.

[0119] These examples may be performed by computer software implemented by processor 410 or by hardware or by a combination of hardware and software. As a non-limiting example, these examples may be implemented by one or more integrated circuits. Memory 420 may be of any type suitable for the technical environment and may be implemented using any appropriate data storage technology, such as, as a non-limiting example, optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memory, and removable memory. Processor 410 may be of any type suitable for the technical environment and may include, as a non-limiting example, one or more of a microprocessor, a general-purpose computer, a special-purpose computer, and a processor based on a multi-core architecture.

[0120] Various implementations involve decoding. As used herein, "decoding" may encompass, for example, all or part of a process performed on a received coded sequence to produce a final output suitable for display. In various examples, such processes include one or more of the processes typically performed by a decoder, such as entropy decoding, inverse quantization, inverse transform, and differential decoding. In various examples, such processes also include or alternatively include processes performed by a decoder of various implementations described herein.

[0121] As another example, in one example, "decoding" refers only to entropy decoding, in another example, "decoding" refers only to differential decoding, and in another example, "decoding" refers to a combination of entropy decoding and differential decoding. Whether the phrase "decoding process" is intended to refer specifically to a subset of operations or broadly to a broader decoding process will be clear based on the context of the specific description and is considered to be well understood by those skilled in the art.

[0122] Various implementations involve encoding. In a manner similar to the discussion above about "decoding", "encoding" as used in this application may cover, for example, all or part of the processes performed on an input video sequence to produce an encoded bitstream. In various examples, such processes include one or more of the processes typically performed by an encoder, such as partitioning, differential coding, transforming, quantization, and entropy coding. In various examples, such processes also include or alternatively include processes performed by encoders of various implementations described in this application, such as obtaining a reference picture of a current picture, the reference picture including clean areas and dirty areas divided by a boundary; obtaining a motion compensation block associated with a current block in the reference picture; obtaining an associated intra-frame decoding block based on the motion compensation block; determining intra-frame mode propagation information for the current block based on the position of the intra-frame decoding block relative to the boundary; and encoding the current picture based on the intra-frame mode propagation information, etc.

[0123] As another example, in one example, "encoding" refers only to entropy encoding, in another example, "encoding" refers only to differential encoding, and in another example, "encoding" refers to a combination of differential decoding and entropy encoding. Whether the phrase "encoding process" specifically refers to a subset of operations or broadly refers to a broader encoding process will be clear based on the context of the specific description and is believed to be well understood by those skilled in the art.

[0124] Note that syntax elements as used herein are descriptive terms that are coding syntax on, for example, template matching prediction, including but not limited to pps_dependent_slice_enabled_flag and pps_dependend_slice flag. Therefore, they do not exclude the use of other syntax element names.

[0125] When the figures are presented as flow charts, it should be understood that they also provide block diagrams of corresponding devices. Similarly, when the figures are presented as block diagrams, it should be understood that they also provide flow charts of corresponding methods / processes.

[0126] The specific implementations and aspects described herein may be implemented in, for example, a method or process, a device, a software program, a data stream, or a signal. Even if only discussed in the context of a single form of specific implementation (e.g., discussed only as a method), the specific implementation of the features discussed may also be implemented in other forms (e.g., a device or program). The device may be implemented in, for example, appropriate hardware, software, and firmware. These methods may be implemented in, for example, a processor, which generally refers to a processing device, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. The processor also includes communication equipment, such as, for example, a computer, a mobile phone, a portable / personal digital assistant ("PDA"), and other equipment that facilitates information communication between end users.

[0127] References to "one example" or "an example" or "one implementation" or "an implementation" and other variations thereof mean that a particular feature, structure, characteristic, etc. described in connection with the example is included in at least one example. Thus, the phrases "in one example" or "in an example" or "in one implementation" or "in an implementation" and any other variations appearing in various places throughout this application are not necessarily all referring to the same example.

[0128] Additionally, the present application may involve "determining" various pieces of information. Determining information may include, for example, one or more of estimating information, calculating information, predicting information, or retrieving information from a memory. Obtaining may include receiving, retrieving, constructing, generating, and / or determining.

[0129] Furthermore, the present application may refer to "accessing" various information. Accessing information may include, for example, one or more of receiving information, retrieving information (e.g., from a memory), storing information, moving information, copying information, calculating information, determining information, predicting information, or estimating information.

[0130] Additionally, the present application may refer to "receiving" various information. Like "accessing," receiving is intended to be a broad term. Receiving information may include, for example, one or more of accessing information or retrieving information (e.g., from a memory). Furthermore, "receiving" generally involves, in one way or another, during operations such as, for example, storing information, processing information, sending information, moving information, copying information, erasing information, calculating information, determining information, predicting information, or estimating information.

[0131] It should be understood that, for example, in the case of "A / B," "A and / or B," and "at least one of A and B," the use of any of the following " / ," "and / or," and "at least one of" is intended to encompass selecting only the first listed option (A), or only the second listed option (B), or both options (A and B). As a further example, in the case of "A, B, and / or C" and "at least one of A, B, and C," such phrases are intended to encompass selecting only the first listed option (A), or only the second listed option (B), or only the third listed option (C), or only the first listed option and the second listed option (A and B), or only the first listed option and the third listed option (A and C), or only the second listed option and the third listed option (B and C), or all three options (A and B and C). This can be extended to as many items as listed, as will be apparent to one of ordinary skill in this and related arts.

[0132] Moreover, as used herein, the term "signaling" refers to (among other things) indicating something to the corresponding decoder. Thus, in one example, the same parameters are used on both the encoder side and the decoder side. Thus, for example, the encoder may send (explicit signaling) specific parameters to the decoder so that the decoder can use the same specific parameters. On the contrary, if the decoder already has specific parameters and other parameters, signaling may be used without sending (implicit signaling) to simply allow the decoder to know and select specific parameters. Bit savings are achieved in various examples by avoiding sending any actual function. It should be understood that signaling can be implemented in a variety of ways. For example, in various examples, one or more syntax elements, flags, etc. are used to signal information to the corresponding decoder. Although the verb form (signaling) of the term "signal" is previously described, the term "signal" may (for example, also) be used as a noun (signal) herein.

[0133] It will be apparent to one of ordinary skill in the art that a specific implementation may generate a variety of signals formatted to carry, for example, storable or transmittable information. The information may include, for example, instructions for executing a method or data generated by one of the described specific implementations. For example, a signal may be formatted to carry a bit stream of the example. Such a signal may be formatted as, for example, an electromagnetic wave (e.g., using a radio frequency portion of a spectrum) or a baseband signal. Formatting may include, for example, encoding a data stream and modulating a carrier using the encoded data stream. The information carried by the signal may be, for example, analog or digital information. As is well known, a signal may be sent over a variety of different wired or wireless links. The signal may be stored on, or accessed or received from, a processor-readable medium.

[0134] Many examples are described herein. The features of the examples may be provided individually or in any combination across various claim categories and types. In addition, the examples may include one or more of the features, devices or aspects described herein individually or in any combination across various claim categories and types. For example, the features described herein may include a bitstream or signal of information generated as described herein to be implemented. This information may allow a decoder to decode a bitstream, an encoder, a bitstream and / or a decoder according to any of the embodiments described in the embodiments. For example, the features described herein may be implemented by creating and / or sending and / or receiving and / or decoding a bitstream or a signal. For example, the features described herein may be implemented by a method, a process, a device, a medium storing instructions, a medium storing data or a signal. For example, the features described herein may be implemented by a TV, a set-top box, a mobile phone, a tablet computer or other electronic devices that perform decoding. A TV, a set-top box, a mobile phone, a tablet computer or other electronic devices may display (e.g., using a monitor, a screen or other type of display) the resulting image (e.g., an image reconstructed from the residual of a video bitstream). A TV, a set-top box, a mobile phone, a tablet computer or other electronic devices may receive a signal including an encoded image and perform decoding.

[0135] The syntax element value may be predicted from a previously coded block whose pixels of surrounding blocks (eg, L-shaped pixels) match the current block template. The examples described herein may increase coding gain and / or reduce signaling of syntax elements.

[0136] These examples may be performed by a device having at least one processor. The device may be an encoder or a decoder. These examples may be performed by a computer program product stored on a non-transitory computer-readable medium and including program code instructions. These examples may be performed by a computer program including program code instructions. These examples may be performed by a bitstream including information representing a template matching prediction mode.

[0137] Figure 5 An example of the concept of a coding tree representing a compressed picture is illustrated. Motion compensated temporal prediction may be employed to exploit the redundancy that exists between consecutive pictures of a video. A motion vector may be associated with a prediction unit (PU) (e.g., each motion vector may be associated with a prediction unit). A coding tree unit (CTU) may be represented by a coding tree in the compressed domain. Figure 5 As shown, the coding tree may be a quadtree partition of the CTU. The leaves of the coding tree (eg, each leaf) may be referred to as a coding unit (CU).

[0138] Figure 6An example of dividing a coding tree unit into CU, PU, ​​and transform unit is illustrated. A CU may be given intra-frame or inter-frame prediction parameters (e.g., prediction information). A CU may be spatially partitioned into one or more PUs. Some prediction information may be assigned to the one or more PUs (e.g., each PU). Figure 6 As shown, intra or inter coding modes may be assigned at the CU level. Motion vectors may be assigned to PUs (e.g., one or more motion vectors may be assigned to each PU). Motion vectors may be used for motion compensated temporal prediction of the PU under consideration. In an example, a CU may not be divided into PUs or TUs, and some motion data may be assigned to the CU (e.g., directly assigned). In an example, a CU may be divided into sub-CUs, where motion vectors are calculated for the sub-CUs (e.g., motion vectors are calculated for each sub-CU).

[0139] Figure 7 An example of progressive decoding refresh (GDR) over N pictures is illustrated. The GDR method (e.g., in a low-delay context) can smooth the bit rate by spreading the encoding of intra pictures across multiple pictures (e.g., multiple frames), while enabling robust decoding by inserting resynchronization frames along the sequence. GDR can progressively refresh pictures by spreading the intra-coded region over multiple pictures, which can be defined as Figure 7 The GDR cycle shown in . Figure 7 The concept of vertical GDR is illustrated, where a GDR picture with a forced intra region can start at POC(n), and then the forced intra-coded clean region can gradually expand from left to right over N pictures. At POC(n+N-1), the picture can be fully refreshed (e.g., intra refreshed).

[0140] A clean area may refer to an area that may be referenced by future frames. A dirty area may refer to an area that may not be referenced by future frames for robustness purposes. Restrictions on areas that may not be referenced may be implemented at the encoder so that the decoder may not need to perform this check. An example of robustness may be robustness against packet loss, where some packets of the frame may be lost.

[0141] POC(n+N-1) may be referred to as a recovery point, and a picture at the recovery point POC(n+N-1) may be referred to as a recovery point picture. A picture between a GDR picture of POC(n) and a recovery point picture of POC(n+N-1) may be referred to as a recovery picture of a GDR picture of POC(n).

[0142] In an example, the GDR may use at least one boundary within a frame (e.g., within a current frame) to separate clean areas from dirty areas. The dirty area may be on a first side of the at least one boundary, and the clean area may be on a second side of the at least one boundary. At least one boundary may be a virtual boundary to allow for finer granularity of progressive refresh (e.g., intra-frame refresh). In an example, the current frame may include slices within the current frame divided by at least one boundary. In an example, the current frame may include tiles within the current frame divided by at least one boundary.

[0143] Figure 8 An example of a slice layout for GDR is illustrated. Slice 0 may be a clean region. The right portion of slice 0 may be a GDR band including intra-coded blocks. Slice 1 may be a dirty region. The following table shows the changes to the PPS syntax to signal the region dependency mode feature when slices are used to separate clean and dirty regions. The table is as follows:

[0144]

[0145] The pps_dependent_slice_enabled_flag may indicate that some slices may be dependent, which may indicate whether at least one region in the current frame depends on at least one other region. If this flag is true, it may be determined that region dependency mode is enabled for the current frame. The current frame may include regions (e.g., slices, tiles, etc.) that may be divided by at least one boundary (e.g., at least one virtual boundary). If this flag is true, during slice construction, the pps_dependend_slice flag may be read to specify that a particular slice 1 may be allowed to read (e.g., use) information outside of the slice. In an example, if the pps_dependent_slice_enabled_flag is first set to 1, slice 0 (e.g., Figure 8 ) can be set with the pps_dependend_slice flag set to 0, and slice 1 (as shown in Figure 8 ) may be set with pps_dependend_slice_flag to 1. Thus, blocks within slice 0 may not use information within the dirty region, while blocks in slice 1 may use information in slice 0. For a current block in a slice, a determination may be made whether a neighboring block may be used for intra prediction using an intra prediction coding tool based at least in part on a region dependency associated with the region, which may be set by pps_dependend_slice_flag. Intra or inter prediction may be performed based on the determination. A dependency region indication associated with the region may be set based on the determination.

[0146] At least under the condition that the neighboring block is outside the region and the region dependency indicates that the region is allowed to use information outside the region (eg, pps_dependend_slice_flag is set to 1), the neighboring block may be determined to be usable for intra prediction of the current block.

[0147] At least under the condition that the neighboring block is outside the region and the region dependency indicates that the region will refrain from using information outside the region (pps_dependend_slice_flag is set to 0), it can be determined that the neighboring block is not available for intra-frame prediction of the current block.

[0148] If not present, pps_dependent_slice_enabled_flag may be inferred to be 0, and pps_dependend_slice_flag[i] may be inferred to be 0. In an example, the flag pps_dependent_slice_enabled_flag may not be signaled, and pps_dependend_slice_flag may be signaled.

[0149] This article provides an example of decoder-side intra mode derivation (DIMD). If DIMD is applied, intra modes (e.g., two intra modes) can be derived from reconstructed neighbor samples, and these predictors (e.g., two predictors) obtained via intra prediction modes can be combined with planar mode predictors using weights derived from gradients.

[0150] The derived intra modes may be included into a main list of intra most probable modes (MPMs), so the DIMD process may be performed before building the MPM list. The main derived intra modes of a DIMD block may be stored with the block and may be used for MPM list construction for the current block and / or neighboring blocks.

[0151] This document provides an example of intra template matching prediction (intra TMP). Intra TMP is an intra prediction mode that can copy the best prediction block from the reconstructed part of the current picture (e.g., the current frame), and the L-shaped template of the best prediction block matches the current template. For a predefined search range, the encoder can search for the template that is most similar to the current template in the reconstructed part of the current frame, and can use the corresponding block as the prediction block. The encoder can signal the use of this mode, and the same prediction operation can be performed on the decoder side.

[0152] This article provides an example of template-based intra mode derivation (TIMD) based on fusion. TIMD can be performed in GDR refresh pictures. For intra prediction modes in MPM (e.g., each intra prediction mode), the SATD between the prediction samples and the reconstructed samples of the template can be calculated. The intra prediction mode with the smallest SATD (e.g., the first two intra prediction modes) can be selected as the TIMD mode. The TIMD mode (e.g., these two TIMD modes) can be fused with weights, and such weighted intra prediction can be used to decode the current CU. Position-dependent intra prediction combination (PDPC) can be included in the derivation of the TIMD mode.

[0153] The costs of the two selected modes can be compared to a threshold, and in the test, a cost factor of 2 is applied as follows: costMode2 < 2*costMode1. If this condition is true, fusion can be applied, otherwise only mode 1 can be used. The weights of these modes can be calculated based on their SATD costs as follows:

[0154] weight1=costMode2 / (costMode1+costMode2)

[0155] weight2=1-weight1

[0156] Position-dependent intra prediction combination can be performed in GDR refresh pictures. The results of intra prediction for DC, plane, and several angle modes can be modified (e.g., further modified) by a position-dependent intra prediction combination (PDPC) method. PDPC is an intra prediction method that calls a combination of boundary reference samples and intra prediction styles with filtered boundary reference samples. PDPC can be applied to at least one of the following intra modes without signaling: plane, DC, intra angle less than or equal to horizontal, or intra angle greater than or equal to vertical and less than or equal to 80. If the current block is in block differential pulse coding modulation (BDPCM) mode or the MRL index is greater than 0, PDPC may not be applied.

[0157] The prediction sample pred(x',y') can be predicted using a linear combination of reference samples and the intra prediction mode (DC, planar, angular) according to the following equation:

[0158] pred(x',y')=Clip(0,(1< <BitDepth)–1,(wL×R-1,y'+wT×Rx',-1+(64-wL-

[0159] wT)×pred(x',y')+32)>>6)

[0160] Wherein Rx,-1 and R-1,y may represent reference samples located at the upper boundary and the left boundary of the current sample (x,y), respectively.

[0161] If PDPC is applied to DC, planar, horizontal and vertical intra modes, boundary filters (e.g., additional boundary) filters may not be needed, as may be needed in some cases of DC mode boundary filters or horizontal / vertical mode edge filters. The PDPC process for DC mode and planar mode may be the same. For angular mode, if the current angular mode is HOR_IDX or VER_IDX, the left or top reference samples may not be used accordingly. PDPC weights and scaling factors may depend on the prediction mode and block size. PDPC may be applied to blocks with width and height greater than or equal to 4.

[0162] Fig. 9 An example definition of samples used by PDPC applied to diagonal and adjacent-corner intra modes is illustrated. Fig. 9 The definition of reference samples (Rx, -1 and R-1, y) of PDPC applied to various prediction modes is illustrated. The prediction sample pred(x', y') may be located at (x', y') within the prediction block. In the example, for the diagonal mode, the coordinate x of the reference sample Rx, -1 is given by: x = x' + y' + 1, and the coordinate y of the reference sample R-1, y may be given by: y = x' + y' + 1. For other angular modes, the reference samples Rx, -1 and R-1, y may be located in fractional sample positions, and the sample value of the nearest integer sample position may be used.

[0163] Fig.10 An example matrix-weighted intra prediction (MIP) process is illustrated. To predict samples of a rectangular block of width W and height H, MIP takes as input a row of H reconstructed neighboring boundary samples to the left of the block and a row of W reconstructed neighboring boundary samples above the block. If reconstructed samples are not available, neighboring boundary samples may be generated based on intra prediction. MIP prediction factors for a block may be generated based on averaging; matrix-vector multiplication; and / or linear interpolation (e.g., as Fig.10 ).

[0164] Fig.11 An example of derivation of an MPM list for a current luma coding block (CB) belonging to an intra slice is illustrated. Examples of signaling based on an MPM list may be provided herein. If the prediction mode (e.g., an intra prediction mode) selected to predict the current luma CB is neither a matrix-based intra prediction (MIP) mode, nor a DIMD, nor a TIMD (e.g., it is one of the 67 intra prediction modes), then the MPM list for this CB may be used to signal its index. The MPM list may be decomposed into a list of 6 primary MPMs and a list of 22 secondary MPMs (e.g., as Fig.11 ). An example MPM list may be established by adding (eg, successively adding) candidate prediction mode indexes from the candidate prediction mode index that is most likely to be the selected prediction mode for predicting the current luma CB to the least likely candidate prediction mode index. Fig.11 From left to right, successive additions of candidate intra prediction mode indices are shown if the current luma CB belongs to an intra slice. The example list of MPMs may not include the same prediction mode indices. Fig.11 An example is illustrated in which each candidate prediction mode index (e.g., intra-frame prediction mode index) may be different from each other. In the example, the time slots of indexes 0 to i-1 included in the MPM list may have been filled. If the current candidate prediction mode index already exists in the current example list of the MPM, this candidate can be skipped, and if the next candidate prediction mode does not exist in the MPM list, the next candidate prediction mode can be inserted at the time slot of index i. If the current prediction mode index does not exist in the MPM list, the current prediction mode index can be inserted at the time slot of index i, and the next candidate prediction mode can be inserted at the time slot of index i+1.

[0165] Fig.12 An example is illustrated of signaling (e.g., MPM list-based signaling) of an index of a prediction mode (e.g., an intra-frame prediction mode) for predicting a current luma CB (e.g., after signaling a multiple reference line (MRL) index and, if necessary, signaling an intra subpartitioning (ISP) mode, if the selected prediction mode is neither DIMD, MIP, nor TIMD). Fig.12 It is illustrated that MPM list-based signaling can implement hierarchical entropy coding of the index of the intra prediction mode selected to predict the current luma CB.

[0166] An example of intra-mode propagation may be provided. Intra-mode propagation may be performed in the case of a GDR refresh. The intra-mode used to encode an intra-CU may be stored in a buffer (IPM buffer) that may be associated with a current picture (e.g., a current frame). The intra-mode may be stored with a reference picture (e.g., similar to a decoder picture buffer (DPB)). An intra-mode that may be used to decode some samples in a reference picture (e.g., then used) may be used for the current picture. Both the IPM and MI buffers may be combined (e.g., a buffer that includes both intra- and inter-frame information). In order to reduce storage, information may be stored at a coarser resolution than the current picture (e.g., 4x4 resolution). In the example, if the ratio between the current picture size and the motion information is si=4, the "MI" parameters of the block (or sub-block) at (x, y) may be stored in the motion information buffer as mi(x / 4; y / 4).

[0167] If the current CU is coded in inter unidirectional mode, the intra mode associated with the reference block (available through the IPM buffer associated with the reference picture) may be copied into the IPM buffer of the current CU. If the current CU is coded in inter bidirectional prediction mode, at least the following rules may allow the intra mode to be selected from the IPM buffer associated with the reference frame of list 0 (ref_0 from ipm0) or the reference frame of list 1 (ref_1 from ipm1):

[0168] If ref_0 is intra-coded and ref_1 is inter-coded: ipm0(510)

[0169] Otherwise if ref_0 is inter-coded and ref_1 is intra-coded: ipm1(520)

[0170] else if (ipm0>DC_IDX&&ipm1<=DC_IDX):ipm0(530)

[0171] else if (ipm0<=DC_IDX&&ipm1>DC_IDX):ipm1(540)

[0172] else if (pocDiff0 <pocDiff1):ipm0(550)

[0173] else if (pocDiff1 <pocDiff0):ipm1(560)

[0174] else if (QP-ref0>QP-ref1): ipm1(570)

[0175] Otherwise: ipm0

[0176] Wherein: pocDiffX=pocRefX−pocCur, DC_IDX may indicate the intra-frame mode DC.

[0177] Intra mode information may be propagated (e.g., propagated in time) and may be available with the reconstructed CU. For an intra-coded current CU, at least the following information may be used to build a list of most probable modes (MPMs) with neighboring reconstructed CUs, even if the neighboring reconstructed CUs are coded in inter mode. If the CU neighbor is intra-coded, the intra mode may be used to build the MPM list. If the CU neighbor is inter-coded, the intra mode stored in the IPM buffer of the CU neighbor may be used to build the MPM list.

[0178] Fig.13 Example geometric partition mode (GPM) prediction is illustrated. Examples of intra-mode propagation of GPM with inter- and intra-frame prediction can be provided. As depicted in some examples (e.g., as Fig.13 ), GPM may allow prediction of a CU with two non-rectangular partitions. The partitions (e.g., each partition) may be inter or intra. The samples of the inter partitions may be predicted using a conventional inter prediction process. An example inter prediction process may be motion compensated reference samples picked from one (unidirectional prediction) or two (bidirectional prediction) reference pictures. The samples of the intra partitions may be predicted using a conventional intra prediction mode (IPM) and prediction process, where the available IPM candidates may be at least one of a parallel angle mode (parallel mode) relative to the GPM block boundary, a vertical angle mode (vertical mode) relative to the GPM block boundary, or a planar mode.

[0179] The motion vectors used to reconstruct the inter-prediction part and the IPMs used to reconstruct the intra partitions can be stored in the MI and IPM buffers, respectively. In the case of GPM, since the partitions can be non-rectangular, for sub-blocks shared by two partitions, the stored information can correspond to the partitions occupying a larger area.

[0180] FIG. 14A to FIG. 14B An example of two GPM predictions and coarser stored parameters moving into a buffer is illustrated. In the example (e.g., Fig.14A ), a partition inter and a partition intra may be used to predict a CU. Fig. 14B ), the corresponding inter-frame and intra-frame parameters can be stored in the MI and IPM buffers with a 4x4 resolution.

[0181] Fig.15 An example of storing the intra mode information of the current CU decoding in the IPM buffer with sub-block precision is illustrated. This information can be used to decode the CU in the current picture (e.g., the subsequent CU) and the CU in the picture (e.g., the subsequent picture (in decoding order)) to predict the motion or IPM to be used. Given a sub-block (x, y), if more samples are predicted intra than inter, the intra parameters can be stored in the MI buffer. If more samples are used inter than intra prediction, the intra parameters can be retrieved from the reference MI buffer, which can be the MI buffer associated with the reference picture used for inter prediction. The location of the intra parameters can be mi((x+mvX) / si,(y+mvY) / si), where (mvX,mvY) is the motion vector of the inter prediction, and si is the ratio between the current picture size and the motion information buffer size.

[0182] Sub-block based temporal motion vector prediction (SbTMVP) can be performed in GDR pictures. In SbTMVP (also known as ATMVP mode), sub-block based motion vector predictions can be created. Similar to temporal motion vector prediction (TMVP), SbTMVP can use motion fields in collocated pictures to improve motion vector prediction and merge modes for CUs in the current picture. The same collocated pictures used by TMVP can be used for SbTMVP. TMVP predicts motion at the CU (e.g., block) level. SbTMVP predicts motion at the sub-CU (e.g., sub-block) level. TMVP can obtain a temporal motion vector from a collocated block in a collocated picture (e.g., a collocated block is a lower right block or a center block relative to the current CU). SbTMVP can apply a motion offset before obtaining temporal motion information from the collocated picture, where the motion offset can be obtained from a motion vector of one of the spatially neighboring blocks from the current CU.

[0183] Fig.16 An example of a spatial neighboring block used by SbTMVP is illustrated. SbTMVP can be used to predict the motion vector of a sub-CU within the current CU. It can be checked (e.g., first checked) Fig.16 If this spatial neighbor block is identified, which has a motion vector that uses the collocated picture as its reference picture, this motion vector can be selected as the motion offset to be applied; if no such motion is identified from the spatial neighbors, the motion offset can be set to (0,0).

[0184] Fig.17 An example of deriving a sub-CU motion field by applying motion offsets from spatial neighbors and scaling motion information from corresponding collocated sub-CUs is illustrated. Fig.16 The motion offset (previously identified as shown in ) can be applied (e.g., added to the coordinates of the current block) to obtain the sub-CU level motion information (motion vector and reference index) from the collocated picture (e.g., as shown in Fig.16 ). For a sub-CU (e.g., each sub-CU), the motion information of its corresponding block (the minimum motion grid covering the center sample) in the collocated picture can be used to derive the motion information at the translation position of the sub-CU. If the motion information of the collocated sub-CU is identified (e.g., after the motion information of the collocated sub-CU is identified), the collocated sub-CU can be converted to the motion vector and reference index of the current sub-CU in a manner similar to the TMVP process, where temporal motion scaling can be applied to align the reference picture of the temporal motion vector with the reference picture of the current CU.

[0185] The combined sub-block based merge list may include both SbTMVP candidates and affine merge candidates. The combined sub-block based merge list may be used for signaling of sub-block based merge mode. The SbTMVP mode may be enabled / disabled by a sequence parameter set (SPS) flag. If the SbTMVP mode is enabled, the SbTMVP predictor may be added as the first entry of the list of sub-block based merge candidates, followed by the affine merge candidate. The size of the sub-block based merge list may be signaled in the SPS, and the maximum allowed size of the sub-block based merge list may be 5.

[0186] The sub-CU size used in SbTMVP may be fixed to 8×8, and as done for affine merge mode. If both width and height are greater than or equal to 8, the SbTMVP mode may be applied to (e.g., only to) a CU. The encoding logic of the SbTMVP (e.g., additional SbTMVP) merge candidate may be the same as other merge candidates, i.e., for a CU (e.g., each CU) in a P or B slice, an RD check (e.g., additional RD check) may be performed to decide whether to use the SbTMVP candidate.

[0187] Adaptive reordering of merge candidates with template matching (ARMC-TM) may be performed by an encoder or decoder. The merge candidates may be reordered (e.g., adaptively reordered) with template matching (TM). The reordering may be applied to at least: a normal merge mode, a TM merge mode, and / or an affine merge mode (excluding SbTMVP candidates). For the TM merge mode, the merge candidates may be reordered before the refinement process.

[0188] If a merge list is constructed (e.g., after a merge candidate list is constructed), the merge candidates may be divided into subgroups. For the normal merge mode and the TM merge mode, the subgroup size may be set to 5. For the affine merge mode, the subgroup size may be set to 3. The merge candidates in the subgroups (e.g., each subgroup) may be reordered (e.g., incrementally reordered) according to the cost value based on template matching. In one example, the merge candidates in the last but not the first subgroup may not be reordered.

[0189] The template matching cost of the merge candidate can be measured by the sum of absolute differences (SAD) between the samples of the template of the current block and its corresponding reference samples. The template can include a set of reconstructed samples adjacent to the current block. The reference samples of the template can be located based on the motion information of the merge candidate.

[0190] Fig.18 An example of a reference sample of a template and a reference picture of a template is illustrated. If the merge candidate utilizes bidirectional prediction, the reference sample of the template of the merge candidate can be generated by bidirectional prediction (e.g., Fig.18 ).

[0191] For sub-block based merge candidates with sub-block size equal to Wsub×Hsub, the above template may include a sub-template (e.g., several sub-templates) of size Wsub×1, and the left template may include a sub-template (e.g., several sub-templates) of size 1×Hsub.

[0192] Fig.19 An example of a template for a block having sub-block motion using motion information of a sub-block of a current block and a reference sample of the template is illustrated. Fig.19 As shown, the motion information of the sub-blocks in the first row and the first column of the current block can be used to derive the reference samples of each sub-template.

[0193] Various decoding tools can be used in GDR pictures. A reference picture (e.g., a reference frame) associated with a current picture (e.g., a current frame) can be obtained (e.g., by a video encoding device). The reference picture may include clean areas and dirty areas. The clean area and the dirty area may be divided by a boundary (e.g., a virtual boundary). A motion compensation block associated with a current block in a reference picture may be obtained (e.g., based on a motion vector of the current block). Based on the motion compensation block, an associated intra-coded block may be obtained. For propagation of intra-modes, intra-mode propagation information may be propagated from a reference picture to a current picture for an inter-coded block. An intra-mode (e.g., as provided by the intra-propagation information) may be used as a candidate in an MPM list. Intra-mode propagation information for encoding a current block may be determined based on the position of the intra-coded block relative to the boundary. In an example, if the motion compensation block is outside the current CTU (e.g., the motion vector of the current block points to the outside of the current CTU), the position in the CU where the intra-mode propagation information is propagated may be cropped inside the current CTU.

[0194] For MPM list construction, spatial positions (e.g., including the upper right position that may be in a dirty area) may be checked to construct the MPM list. If the upper right position is dirty, an encoder using GDR may remove this candidate and may ignore the following candidate (e.g., due to the non-redundant rule in MPM list construction). Since the first candidate may be dirty, the first candidate may be determined to be invalid and ignored by the encoder. In addition, if the first candidate is compared to the second candidate in the MPM list, the second candidate may be contaminated and therefore invalid. Based on the encoder's determination of the invalidity of the second candidate, the second candidate may be removed. This possible contamination may cause some CUs to not have a single intra mode available.

[0195] For ARMC contamination of candidates, the motion vector candidates may be divided into subgroups, which may then be classified depending on the candidate's template cost. If one of the motion vector candidates in a subgroup is dirty, this motion vector candidate may contaminate other candidates within the subgroup, since the candidates may be classified depending on the candidate's template cost.

[0196] In the GDR example, for the current block in the clean area of ​​the current picture, the reconstructed pixels in the dirty areas of the current picture and the reference picture may be considered "unavailable". If necessary, the reconstructed pixels may be set to 2^(BD-1), where BD is the bit depth, which may give more degrees of freedom to the prediction of the current block in the clean area of ​​the current picture than the current picture and the reference picture. In the GDR example, the blocks in the clean area of ​​the current picture, the decoding information in the dirty areas of the current picture and the reference picture may be considered "unavailable". This may prevent the current block in the clean area of ​​the current picture from using the decoding information in the dirty areas of the current picture and the reference picture. The blocks in the dirty areas of the current picture may be allowed to use the reconstructed pixels and decoding information of both the clean and dirty areas of the current picture and the reference picture.

[0197] The validity of intra-mode propagation information associated with an intra-mode may be determined. The MPM list validity may be checked based on candidates potentially located in dirty regions (e.g., and DIMD candidates may contaminate the MPM list). A default mode may be added (e.g., as a propagated intra-mode, replacing a propagated intra-mode) as an escape candidate in the MPM list. Merge candidate list derivation may take into account contamination of candidates due to ARMC.

[0198] Fig. 20 An example of intra-mode propagation is shown. Fig. 20 As shown in , a reference picture 2002 associated with a current picture 2004 may be obtained (e.g., by a video encoding device). The reference picture 2002 may include a clean area 2006 and a dirty area 2008. The clean area 2006 and the dirty area 2008 may be divided by a boundary 2010 (e.g., a virtual boundary). Fig. 20As shown in FIG. 2 , a motion compensation block 2012 associated with a current block 2014 (e.g., associated with a current motion vector 2016 of the current block 2014) may be included in a reference picture 2002. The motion compensation block 2012 may be obtained based on motion information associated with the current block 2014. Based on the motion compensation block 2012, an associated intra-coded block 2020 may be obtained by a video encoding device. Intra-mode propagation information (e.g., intra-mode) may be propagated from the reference picture 2002 to the current picture 2004 for inter-coded blocks. The intra-mode (e.g., as provided by the intra-propagation information) may be used as a candidate in the MPM list. The intra-mode propagation information for encoding the current block 2014 may be determined based on the position of the intra-coded block 2020 relative to the boundary 2010. If the motion compensation block 2012 is outside the current CTU 2018 (e.g., the motion vector 2016 of the current block 2014 points to the outside of the current CTU 2018), the intra-coded block 2020 associated with the current block 2014 may be cropped inside the current CTU 2018 (e.g., similar to what is done for SbTMVP). If the motion compensation block 2012 is inside the current CTU 2018 (e.g., the motion vector 2022 of the current block 2014 points to the inside of the current CTU 2018), the motion compensation block 2012 and the intra-coded block 2020 may be the same block. This may imply that the motion compensation block 2012 is inside the clean region 2006 (e.g., the current MV 2016 may point to the clean region 2006), and the intra-mode propagation information may be propagated from the intra-coded block 2020 located in the dirty region 2008. If the motion compensated block 2012 is inside the current CTU 2018 (eg, the motion vector 2016 of the current block 2014 points inside the current CTU 2018), the motion compensated block 2012 and the intra-coded block 2020 may be the same block.

[0199] In an example, an indication of validity (e.g., an intra-mode propagation validity indication) may be propagated together with (e.g., or included in) the intra-mode propagation information. The indication of validity may be configured to indicate whether intra-mode propagation for the current block is valid. The validity of intra-mode propagation is determined based on the position of the intra-coded block relative to the boundary. If intra-mode propagation is used during MPM list construction, the encoder may use the validity information to determine whether to remove the motion vector candidate associated with the current block. At the end of the GDR cycle, the encoder may check the validity of the propagated intra-mode, since the motion vector and the validity of the intra-mode may no longer be relevant. In an example, the determination of whether the decoding mode is available (e.g., whether intra-mode propagation for the current block is valid) may be determined by comparing a first area to which the current motion vector is pointing with a second area from which the decoding mode information (e.g., intra-mode propagation information) is propagated.

[0200] In an example, if the motion vector is valid (e.g., points to a clean area) and the propagated coding mode (e.g., intra coding mode) is taken from a dirty area, the motion vector candidate may be removed by the encoder (e.g., considered unavailable). In an example, if the motion vector is valid (e.g., points to a clean area) but the propagated coding mode (e.g., intra coding mode) is taken from a clean area, the motion vector candidate may be considered by the encoder (e.g., considered available).

[0201] If the position of the intra-coded block is in a clean area of ​​the reference picture, the encoder may include an indication of the intra-prediction mode with the intra-mode propagation information, and may set the intra-mode propagation validity indication to indicate that the intra-mode propagation information of the current block is valid. If the position of the intra-coded block is in a dirty area of ​​the reference picture, the encoder may include a default intra-prediction mode with the intra-mode propagation information, and may set the intra-mode propagation validity indication to indicate that the intra-mode propagation information of the current block is valid. In an example, if the position where the intra-mode is obtained from the propagation is cropped, the coding mode (e.g., intra-mode) may be set to a default value (e.g., planar mode).

[0202] In an example, the video decoding device may obtain an indication of validity (eg, an intra-mode propagation validity indication). Based on the intra-mode propagation validity indication, the decoder may determine whether intra-mode propagation information for the current block is invalid.

[0203] In an example, the decoder may obtain a boundary (eg, a virtual boundary) that may separate clean and dirty regions within a reference picture (eg, as shown in FIG. 1 ). Fig. 20 ). The decoder may determine intra-mode propagation validity based on the position of the intra-coded block relative to the boundary (e.g., as described herein). If the position of the intra-coded block is in a clean region, the intra-mode propagation information of the current block may be valid. If the position of the intra-coded block is in a dirty region, the intra-mode propagation information of the current block may be invalid.

[0204] The MPM list may be constructed by the encoder. The encoder may construct an MPM list including at least one candidate mode corresponding to the current block. The MPM list may be constructed for another block (e.g., a second block). Candidate modes may be removed or considered for MPM list construction based on whether intra-mode propagation information for the current block is valid (e.g., it may be based on the location of intra-coded blocks associated with a boundary, as described herein). If the candidate mode is invalid, the encoder may ignore it. If the candidate mode is valid, the encoder may consider it.

[0205] In an example, the reference template sample may correspond to a template of the current block. The validity of the candidate motion vector for candidate sorting may be determined based on the position of the reference sample relative to the boundary. More spatial positions of the reference sample (e.g., including the upper right position that may be in a dirty area) may be checked to construct a candidate mode for the MPM list. If the upper right position is dirty, the GDR encoder may determine that the candidate motion vector is invalid for reordering and may remove the merge candidate subgroup associated with the candidate motion vector. Due to the non-redundant rule in the MPM list construction, the GDR encoder may ignore the following candidates in the subgroup. In an example, if the first candidate is in a dirty area, the other candidates in the subgroup may be contaminated whenever the first candidate is compared with another candidate in the subgroup. Based on the candidate being contaminated, they may be determined to be invalid and may also be removed. In an example, if the first candidate is in a dirty area, the merge candidate associated with the first candidate motion vector may be placed at the end of the candidate list within the merge candidate subgroup. In an example, the decoder may skip the subgroup based on receiving an indication that the subgroup is invalid (e.g., based on the position of the reference sample in a dirty area).

[0206] In an example, the MPM list may (e.g., may only) use reference samples with clean spatial positions (e.g., left and top), and if at least one of the reference samples is invalid for the current block, the MPM list may be constructed in the same way. In an example, a reference sample located in the top right position may be dirty, and the value of the intra mode at the top right position may be invalid. Since this mode can be compared with the previously added mode, the following mode may be contaminated and may be removed by the GDR encoder.

[0207] In an example, for a current block to the left of a virtual boundary between a clean area and a dirty area, the first mode may be planar. This mode may be invalid because the PDPC process may use extra samples to the right of the virtual boundary. Spatial positions may be checked and may be invalid depending on their direction. The propagated intra modes may be checked, and if one of the intra propagation modes is in a dirty area, the following intra modes in the MPM list may be removed, which may result in not having a single mode available to the encoder.

[0208] In an example, if GDR is enabled, MIP mode may be enabled because MIP mode may use (e.g., may only use) top and left reference samples for prediction. Therefore, the MIP direction (e.g., via MIP mode / coding mode) may be available (e.g., always available). In an example, PDPC may be disabled for the current block in the intra refresh area (e.g., via an encoder by indication) (e.g., because the reference sample in the upper right position may be in a dirty area). This may ensure that a coding mode (e.g., plane mode) (always the first in the MPM list) may be available at the encoder. In an example, an escape mode may be added at the end of the intra coding mode even if this mode is redundant with one of the previous modes. This escape mode may be at least one of a horizontal mode, a DC without PDPC, or a plane without PDPC. In an example, the encoder may enable MIP via an indication. In an example, if the decoder receives an indication that GDR is enabled, the decoder may enable MIP.

[0209] Adaptive reordering of merge candidates (ARMC) may be performed by an encoder or a decoder. In ARMC, motion vector candidates may be divided into subgroups. Candidates may be classified depending on the template cost of the candidates. In some examples, if one of the motion vector candidates in the subgroup is dirty, the motion vector candidate may contaminate the candidates within the subgroup because the candidates may be classified depending on the template cost of the candidates.

[0210] In an example, if one of the motion vector candidates is invalid (e.g., dirty) in a sub-group, the candidates in this sub-group may be removed. In an example, the encoder and / or decoder may detect whether one motion vector candidate is valid, and may place the invalid candidate at the end of the sub-group. In an example, the encoder and decoder may detect whether one motion vector candidate is valid, and may place the valid and invalid candidates in different sub-groups.

[0211] Although features and elements are described above in specific combinations, it will be understood by those of ordinary skill in the art that each feature or element may be used alone or in any combination with other features and elements. In addition, the methods described herein may be implemented in a computer program, software, or firmware incorporated in a computer-readable medium for execution by a computer or processor. Examples of computer-readable media include electronic signals (sent via a wired or wireless connection) and computer-readable storage media. Examples of computer-readable storage media include, but are not limited to, read-only memory (ROM), random access memory (RAM), registers, cache memory, semiconductor memory devices, magnetic media (such as built-in hard disks and removable disks), magneto-optical media, and optical media (such as CD-ROM disks and digital versatile disks (DVDs)). A processor associated with software may be used to implement a radio frequency transceiver for a WTRU, UE, terminal, base station, RNC, or any host computer.

Claims

1. A method for video encoding, the method comprising: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Obtaining a motion compensated block associated with a current block in the reference picture; Obtaining an associated intra-coded block based on the motion compensation block; determining intra-mode propagation information for the current block based on a position of the intra-coded block relative to the boundary; as well as The current picture is encoded based on the intra-mode propagation information.

2. The method according to claim 1, wherein the intra mode propagation information comprises an intra mode propagation validity indication, the intra mode propagation validity indication being configured to indicate whether the intra mode propagation for the current block is valid, and the method further comprises: Whether the intra-mode propagation for the current block is valid is determined based on the position of the intra-coded block relative to the boundary.

3. The method according to claim 1, further comprising: Based on the position of the intra-coding block in the clean area of ​​the reference picture, the intra-mode propagation information for the current block is set to include an indication of the intra-prediction mode of the associated intra-coding block and an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is valid.

4. The method according to claim 1, further comprising: The intra-mode propagation information for the current block is set to include an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is invalid based on the location of the intra-coded block in the dirty region of the reference picture.

5. The method according to claim 1, wherein the intra mode propagation information is configured to indicate whether intra mode propagation for the current block is valid, and encoding the current picture based on the intra mode propagation information further comprises: For a second block in the current picture, construct a most probable mode list including candidate modes corresponding to the current block; as well as Determining whether to remove the candidate mode corresponding to the current block is determined based on the intra-mode propagation information, wherein the candidate mode is removed based on the intra-mode propagation information indicating that the intra-mode propagation of the current block is invalid.

6. The method according to claim 1, further comprising: The intra-mode propagation information for the current block is set to indicate an intra-prediction mode of the associated intra-coded block based on the location of the intra-coded block in the clean area of ​​the reference picture.

7. The method according to claim 1, further comprising: The intra-mode propagation information for the current block is set to indicate a default intra-prediction mode based on the location of the intra-coded block being in the dirty region of the reference picture.

8. The method of claim 1, wherein the intra-coded block associated with the motion compensation block is pruned inside a coding tree unit associated with the current block.

9. The method of claim 1, wherein the motion compensated block and the associated intra-coded block are the same block.

10. A device for video encoding, the device comprising: A processor, the processor being configured to: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Obtaining a motion compensated block associated with a current block in the reference picture; Obtaining an associated intra-coded block based on the motion compensation block; determining intra mode propagation information of the current block based on a position of the intra-coded block relative to the boundary; as well as The current picture is encoded based on the intra-mode propagation information.

11. The apparatus according to claim 10, wherein the intra-mode propagation information comprises an intra-mode propagation validity indication configured to indicate whether intra-mode propagation for the current block is valid, and the processor is further configured to: Whether the intra-mode propagation for the current block is valid is determined based on the position of the intra-coded block relative to the boundary.

12. The apparatus of claim 10, wherein the processor is further configured to: Based on the position of the intra-coding block in the clean area of ​​the reference picture, the intra-mode propagation information for the current block is set to include an indication of the intra-prediction mode of the associated intra-coding block and an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is valid.

13. The apparatus of claim 10, wherein the processor is further configured to: The intra-mode propagation information for the current block is set to include an intra-mode propagation validity indication configured to indicate that the intra-mode propagation information for the current block is invalid based on the location of the intra-coded block in the dirty region of the reference picture.

14. The apparatus according to claim 10, wherein the intra-mode propagation information is configured to indicate whether intra-mode propagation for the current block is valid, and wherein the current picture is encoded by the processor based on the intra-mode propagation information, the processor being further configured to: For a second block in the current picture, construct a most probable mode list including candidate modes corresponding to the current block; and Determining whether to remove the candidate mode corresponding to the current block is determined based on the intra-mode propagation information, wherein the candidate mode is removed based on the intra-mode propagation information indicating that the intra-mode propagation of the current block is invalid.

15. The apparatus of claim 10, wherein the processor is further configured to: The intra-mode propagation information for the current block is set in the clean area of ​​the reference picture based on the position of the intra-coded block to indicate an intra-prediction mode of the associated intra-coded block.

16. The apparatus of claim 10, wherein the processor is further configured to: The intra-mode propagation information for the current block is set to indicate a default intra-prediction mode based on the location of the intra-coded block being in the dirty region of the reference picture.

17. The apparatus of claim 10, wherein the intra-coded block associated with the motion compensation block is pruned inside a coding tree unit associated with the current block.

18. The apparatus of claim 10, wherein the motion compensated block and the associated intra-coded block are the same block.

19. A method for video encoding, the method comprising: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Based on the candidate motion vector, obtaining a motion compensation block associated with the current block in the reference picture; Obtaining an associated intra-coded block based on the motion compensation block; determining whether to remove the candidate motion vector of the current block based on a position of the intra-coded block relative to the boundary; as well as The current block is encoded based on the determination.

20. The method according to claim 19, further comprising: The candidate motion vectors for encoding the current block are considered based on the location of the intra-coded block in the clean area of ​​the reference picture.

21. The method according to claim 19, further comprising: The candidate motion of a vector for encoding the current block is removed in the dirty region of the reference picture based on the location of the intra-coded block.

22. A device for video encoding, the device comprising: A processor, the processor being configured to: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Based on the candidate motion vector, obtaining a motion compensation block associated with the current block in the reference picture; Obtaining an associated intra-coded block based on the motion compensation block; determining whether to remove the candidate motion vector of the current block based on a position of the intra-coded block relative to the boundary; as well as The current block is encoded based on the determination.

23. The apparatus of claim 22, wherein the processor is further configured to: The candidate motion vectors for encoding the current block are considered based on the location of the intra-coded block in the clean area of ​​the reference picture.

24. The device according to claim 22, further comprising: The candidate motion of a vector for encoding the current block is removed in the dirty region of the reference picture based on the location of the intra-coded block.

25. A method for video encoding, the method comprising: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Based on the candidate motion vector, obtaining a motion compensation block associated with the current block in the reference picture; Based on the motion compensation block, obtaining a reference template sample of a template corresponding to the current block; determining whether the candidate motion vector is valid for candidate reordering based on the position of the reference sample relative to the boundary; as well as The current block is encoded based on the determination.

26. The method according to claim 25, further comprising: determining, based on the location of the reference sample being in the dirty region of the reference picture, that the candidate motion vector is invalid for candidate reordering; as well as Based on determining that the candidate motion vector is invalid for candidate reordering, removing a merge candidate subgroup including the candidate motion vector.

27. The method according to claim 25, further comprising: determining, based on the location of the reference sample being in the dirty region of the reference picture, that the candidate motion vector is invalid for candidate reordering; as well as Based on determining that the candidate motion vector is invalid for candidate reordering, placing the candidate motion vector at an end of a merge candidate subgroup that includes the candidate motion vector.

28. A device for video encoding, the device comprising: A processor, the processor being configured to: Obtain a reference picture of the current picture, wherein the reference picture includes a clean area and a dirty area divided by a boundary; Based on the candidate motion vector, obtaining a motion compensation block associated with the current block in the reference picture; Based on the motion compensation block, obtaining a reference template sample of a template corresponding to the current block; determining whether the candidate motion vector is valid for candidate reordering based on the position of the reference sample relative to the boundary; as well as The current block is encoded based on the determination.

29. The apparatus of claim 28, wherein the processor is further configured to: determining that the candidate motion vector is invalid for candidate reordering based on the location of the reference sample being in the dirty region of the reference picture; and Based on determining that the candidate motion vector is invalid for candidate reordering, removing a merge candidate subgroup including the candidate motion vector.

30. The apparatus of claim 28, wherein the processor is further configured to: determining that the candidate motion vector is invalid for candidate reordering based on the location of the reference sample being in the dirty region of the reference picture; and Based on determining that the candidate motion vector is invalid for candidate reordering, placing the candidate motion vector at an end of a merge candidate subgroup that includes the candidate motion vector.

31. A computer program product stored on a non-transitory computer readable medium and comprising program code instructions for implementing the steps of the method according to at least one of claims 1 to 9, 19 to 21 or 25 to 27 when executed by a processor.

32. A computer program comprising program code instructions for implementing the steps of the method according to at least one of claims 1 to 9, 19 to 21 or 25 to 27 when executed by a processor.

33. A bitstream comprising information representing an encoded output generated according to a method according to any one of claims 1 to 9, 19 to 21 or 25 to 27.

Images