Motion information candidate reordering

Abstract

Systems, methods, and instrumentalities are disclosed for performing motion information candidate reordering. A device may be configured to obtain motion information, for example, including motion information candidates. The device may obtain a video block comprising one or more sub-blocks. The device may determine a motion model (e.g., a global motion model and / or a local motion model) associated with the sub-block. The device may calculate scores associated with motion information candidates, for example, based on the motion model. The score may be determined based on a determined consistency between the motion model and the motion information candidate. The device may perform a correction on the motion information candidate. The score may be calculated based on the modified motion information candidates. The device may determine an order associated with the motion information candidate, for example, based on the score. The ranking may be ranked from a low score to a high score.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of European Patent Application No. 22305506.2 filed on April 8, 2022, the contents of which are incorporated herein by reference in their 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 are systems, methods, and means for performing motion information candidate reordering. A device (e.g., a video decoding device, a video encoding device) may reorder motion information candidates. The device may obtain motion information candidates associated with a block. The device may determine motion information associated with the block (e.g., reference motion information, ambient motion information). The motion information may be global motion information, local motion information, neighboring motion information, and the like. For example, global motion information may be indicated (e.g., signaled via a slice header) and / or derived (e.g., based on a time scale associated with a reference picture). For example, local motion information may be derived based on motion information candidates associated with neighboring blocks of the block. The device may determine an ordering associated with the motion information candidates, for example, based on comparing the corresponding motion information candidates with the motion information. The device may perform a coding operation (e.g., decoding, encoding) based on the determined ordering associated with the motion information candidates.

[0005] In an example, the device may determine the order of the motion information candidates based on whether the template-based coding tool is enabled for the block. The device may obtain an indication indicating whether the template-based coding tool is enabled for the block. The device may order the motion information candidates based on a determination that the template-based coding tool is disabled (e.g., not enabled) for the block. The ordering of the motion information candidates may be performed independently of the reconstructed template samples (e.g., if the template-based coding tool is disabled for the block).

[0006] In an example, to rank the motion information candidates, the device may determine consistency values ​​associated with the respective motion information candidates (e.g., relative to the obtained motion information). For example, the device may determine a first consistency value associated with a first motion information candidate and determine a second consistency value associated with a second motion information candidate. The device may rank the motion information candidates based on the consistency values. For example, based on determining that the first motion information candidate is associated with a higher consistency value than the second motion information candidate, the first motion information candidate may be ranked higher than the second motion information candidate.

[0007] In an example, the device may rank the motion information candidates based on a threshold. For example, the device may determine a difference between a first motion information candidate and a second motion information candidate. The device may determine that the difference between the first motion information candidate and the second motion information candidate is below a threshold. The device may remove the second motion information candidate (e.g., because it is too similar to the first motion information candidate) (e.g., based on a determination that the difference is below a threshold).

[0008] The device may be configured to obtain motion information, for example, including motion information candidates. The device may obtain a video block including one or more sub-blocks. The device may determine a motion model (e.g., a global motion model and / or a local motion model) associated with the sub-block. The device may, for example, calculate a score associated with the motion information candidate based on the motion model. The score may be determined based on a determined consistency between the motion model and the motion information candidate. The device may perform a correction on the motion information candidate. The score may be calculated based on the corrected motion information candidate. The device may, for example, determine a ranking associated with the motion information candidate based on the score. The ranking may be arranged from low score to high score.

[0009] The device may obtain a video block including a sub-block. The device may determine to use a motion model associated with the sub-block. The motion model may be a global motion model and / or a local motion model. The device may determine motion information associated with the sub-block using the determined motion model. The motion information may include motion information candidates. The device may generate a bitstream including an indication of the motion information and an indication of the determined motion model. The bitstream may include an indication of global motion model parameters (e.g., if the motion model is a global motion model).

[0010] 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

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

[0012] 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.

[0013] 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.

[0014] 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.

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

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

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

[0018] Figure 5 An example decoding pipeline for inter blocks is illustrated.

[0019] Figure 6 An example template matching based decoding pipeline is illustrated.

[0020] Figure 7 An example control point based affine motion model is illustrated.

[0021] Figure 8 Example affine motion vectors for each sub-block are illustrated.

[0022] Fig. 9 Example positions of inherited affine motion predictors are illustrated.

[0023] Fig.10 Example control point motion vector inheritance is illustrated.

[0024] Fig.11 Examples of candidate positions of constructed affine merge patterns are illustrated.

[0025] Fig.12 Example positions of spatial and temporal motion vector predictors used in merge mode are illustrated.

[0026] Fig.13 Example motion scaling of temporal merging candidates is illustrated.

[0027] Fig.14 An example sub-block based temporal motion vector prediction (SbTMVP) process is illustrated.

[0028] Fig.15 An example of template matching performed on a search area around an initial MV is illustrated.

[0029] Fig.16 An example of a diamond-shaped area in the search area is illustrated.

[0030] Fig.17 Reference samples of templates in example templates and reference pictures are illustrated.

[0031] Fig.18 An example 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 are illustrated.

[0032] Fig.19 An example of spatially neighboring blocks for deriving spatial merging candidates is illustrated.

[0033] Fig. 20 An example symmetric motion vector difference pattern is illustrated.

[0034] Fig.21 An example local motion model calculation is illustrated.

[0035] Fig. 22 An example time buffer construction is illustrated.

[0036] Fig.23 An example symmetric temporal candidate process is illustrated.

[0037] Fig.24 Example motion candidate consistency is illustrated. DETAILED DESCRIPTION

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

[0039] 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.

[0040] like Figure 1AAs 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.

[0041] 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.

[0042] 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.

[0043] 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).

[0044] 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).

[0045] 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-A Pro).

[0046] In an 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).

[0047] 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).

[0048] 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.

[0049] Figure 1AThe 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.

[0050] 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 1A Although 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.

[0051] 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.

[0052] 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.

[0053] 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.

[0054] 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. 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.

[0055] 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.

[0056] 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.

[0057] 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.

[0058] 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).

[0059] 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.

[0060] 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.

[0061] 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.

[0062] 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.

[0063] 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.

[0064] 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.

[0065] 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.

[0066] 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.

[0067] 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.

[0068] 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.

[0069] 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.

[0070] 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.

[0071] 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.

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

[0073] 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.

[0074] 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.

[0075] 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.

[0076] 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).

[0077] 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).

[0078] 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.

[0079] 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.

[0080] 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.

[0081] 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).

[0082] 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 transmit time intervals (TTIs) of varying or scalable lengths (e.g., containing different numbers of OFDM symbols and / or varying absolute time lengths over time).

[0083] 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.

[0084] 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.

[0085] 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.

[0086] 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.

[0087] 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 implementation and QoS, providing downlink data notification, etc. The PDU session type may be IP-based, non-IP-based, Ethernet-based, etc.

[0088] 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.

[0089] 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 an N3 interface to the UPF 184a, 184b and an N6 interface between the UPF 184a, 184b and the DN 185a, 185b.

[0090] 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.

[0091] 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.

[0092] 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 circuits (e.g., which may include one or more antennas) can be used by the simulation device to send and / or receive data.

[0093] 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.

[0094] The aspects described and contemplated in this application can be implemented in many different forms. Figures 5 to 24 Some examples may be provided, but others are also contemplated. Figures 5 to 24 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.

[0095] 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.

[0096] 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.

[0097] 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.

[0098] Various numerical values ​​are used in the examples described in this application. These and other specific values ​​are for the purpose of describing the examples, and the aspects are not limited to these specific values.

[0099] Figure 2 is a schematic 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.

[0100] 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.

[0101] 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.

[0102] 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.

[0103] 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).

[0104] Figure 3 is a schematic 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.

[0105] 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).

[0106] 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.

[0107] Figure 4 4 is a schematic 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.

[0108] 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.

[0109] 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.

[0110] 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.

[0111] 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.

[0112] 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.

[0113] 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.

[0114] 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.

[0115] 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).

[0116] 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.

[0117] 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.

[0118] 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.

[0119] 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.

[0120] 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.

[0121] 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.

[0122] Various implementations involve decoding. As used in this application, "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 or alternatively include processes performed by decoders of various implementations described in this application, such as obtaining motion information (e.g., motion information candidates), determining a motion model associated with a first sub-block, calculating a score associated with a motion information candidate (e.g., based on a motion model), determining a ranking associated with a motion information candidate based on the score, and the like.

[0123] 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.

[0124] 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 encoding, transforms, quantization, and entropy encoding. In various examples, such processes also or alternatively include processes performed by encoders of various implementations described in this application, such as determining to use a motion model associated with a sub-block, determining motion information associated with a sub-block using the determined motion model (e.g., where the motion information includes a motion information candidate), indicating motion information and the determined motion model, and the like.

[0125] 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.

[0126] It should be noted that the syntax elements (eg, coding syntax) used herein are descriptive terms. Therefore, they do not exclude the use of other syntax element names.

[0127] 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.

[0128] 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.

[0129] 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.

[0130] 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.

[0131] 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.

[0132] 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.

[0133] 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.

[0134] Moreover, as used herein, the term "signaling" means (among other things) indicating something to a corresponding decoder. The encoder signal may include, for example, motion information (e.g., motion information candidates), motion models, motion model parameters, and the like. 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 of the term "signaling" is mentioned above, the term "signal" may also be used as a noun in this article.

[0135] 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.

[0136] 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) a result 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.

[0137] In inter-frame or intra-frame, the reconstruction of the block can be divided into several stages (e.g., several stages), such as one or more of the following: mode decoding (e.g., prediction type, transform type, etc.), prediction itself, residual decoding (e.g., if any), and / or block reconstruction (e.g., final block reconstruction). For example (e.g., for inter-frame blocks), the encoder can select a block in a reference frame (e.g., the best block), for example, after applying a motion model (e.g., translation or sub-block based motion).

[0138] Figure 5 An example decoding pipeline for an inter-frame block is illustrated. An example decoding pipeline for an inter-frame block may involve processing stages and dependencies between processing stages (e.g., Figure 5 ). As shown, a box can correspond to a specific block. The width of the block can emphasize the duration of the process.

[0139] For example, the syntax parsing of block 1 may be performed (e.g., as Figure 5 For example, decoding of the information may be performed after parsing (e.g., as shown in (1) in FIG. Figure 5 For example, during this phase, parsing of blocks may be performed in parallel.

[0140] For example, reconstruction of the block may be performed after decoding (e.g., as Figure 5 For example, since there is a dependency between the reconstructions of the blocks, the reconstruction of block 2 may be performed (e.g., as shown in (1”) in FIG. Figure 5(2") in (for example, Figure 5 As shown in (2') in the figure, it is executed immediately after decoding is completed).

[0141] Operations involving templates surrounding the current block may be performed to infer or reduce signaling costs, such as TM or ARMC-TM (eg, as described herein). Figure 6 An example TM-based decoding pipeline is illustrated. As shown, changes to the decoding pipeline may be provided. For example, if there is a dependency between the reconstruction of block 1 and the decoding of block 2, then the reconstruction of the blocks may be avoided (e.g., not performed) in parallel (e.g., such as Figure 6 ). The constraints may impose a burden (e.g., a heavy burden) on the decoder (e.g., the decoder may no longer perform the most computationally intensive stages (e.g., reconstruction) in parallel).

[0142] Affine motion compensated prediction may be performed. A translational motion model (e.g., only a translational motion model) may be applied to motion compensated prediction (MCP). In the real world, motion may include and / or refer to, for example, zoom-in / zoom-out, rotation, perspective motion, and / or other irregular motion. Block-based affine transform motion compensated prediction may be applied. Figure 7 An example control point based affine motion model is illustrated. As shown, the affine motion field of a block can be described by motion information of multiple control point motion vectors, such as two control points (eg, 4 parameters) or three control point motion vectors (eg, 6 parameters).

[0143] For a 4-parameter affine motion model, the motion vector for a sample position (x, y) in a block can be derived according to Equation 1.

[0144]

[0145] For the 6-parameter affine motion model, the motion vector of the sample position (x, y) in the block can be derived according to Equation 2.

[0146]

[0147] Among them, (mv0x, mv0y) can be the motion vector of the upper left corner control point, (mv1x, mv1y) can be the motion vector of the upper right corner control point, and (mv2x, mv2y) can be the motion vector of the lower left corner control point.

[0148] For example, block-based affine transform prediction is applied to simplify motion compensated prediction. Figure 8 An example affine MVF for each sub-block is illustrated. The sub-block (e.g., as Figure 8) and may be rounded (e.g., to 1 / 16 fractional accuracy), for example, to derive a motion vector for (e.g., each) 4×4 luma subblock. A motion compensated interpolation filter may be applied to generate a prediction for (e.g., each) subblock with the derived motion vector. The subblock size of the chroma component may be set to 4×4. The MV of the 4×4 chroma subblock may be calculated as the average of the MVs of the top left and bottom right luma subblocks in the collocated 8×8 luma region.

[0149] As with translational motion inter prediction, affine motion inter prediction modes may include affine merge mode and / or affine AMVP mode.

[0150] Affine merge prediction can be performed. For example, AF_MERGE mode can be applied for CUs whose width and height are both greater than or equal to 8. In AF_MERGE mode, the CPMV of the current CU can be generated, for example, based on motion information (for example, of spatially neighboring CUs). Multiple CPMVP candidates can be provided (for example, there can be up to five motion model candidates). For example, an index can be signaled to indicate the motion model candidate to be used for the current CU. The affine merge candidate list can be formed by one or more of the following motion model candidate types: an inherited affine merge candidate extrapolated from the CPMV of a neighboring CU; a constructed affine merge candidate CPMVP derived using the translation MV of a neighboring CU; a zero MV; and the like.

[0151] Multiple (eg, at most two) inherited affine candidates may be derived from the affine motion models of neighboring blocks, eg, one from the neighboring CU on the left and one from the neighboring CU above. Fig. 9 An example position of an inherited affine motion predictor is illustrated. Fig. 9 The candidate blocks are shown in . For the predictor on the left, the scanning order may be A0->A1. For the predictor above, the scanning order may be B0->B1->B2. The first inherited candidate from (e.g., each) side (e.g., only the first inherited candidate) may be selected. Pruning check between multiple (e.g., two) inherited candidates may be skipped (e.g., pruning check is not performed). If (e.g., when) a neighboring affine CU is identified, its control point motion vector may be used to derive the CPMVP candidate in the affine merge list of the current CU. Fig.10 Example control point motion vector inheritance is illustrated. Fig.10As shown in , for example, if the adjacent lower left block A is decoded in the affine mode, the motion vectors v_2, v_3, and v_4 of the upper left corner and the motion vectors of the upper right corner and the lower left corner of the CU (for example, which includes block A) can be obtained. For example, if (for example, when) block A is decoded using the 4-parameter affine mode, multiple (for example, two) CPMVs of the current CU can be calculated based on v_2 and v_3. For example, if block A is decoded using the 6-parameter affine mode, multiple (for example, three) CPMVs of the current CU can be calculated based on v_2, v_3, and v_4.

[0152] The constructed affine candidates may include candidates constructed by combining adjacent translation motion information of (eg, each) control point. Fig.11 An example of candidate positions of constructed affine merge patterns is illustrated. Motion information of control points can be derived from the specified spatial and temporal neighborhoods (e.g., Fig.11 ). CPMVk (k=1,2,3,4) may represent the kth control point. For CPMV1, the B2->B3->A2 block may be checked, and the MV of the (e.g., first) available block may be used. For CPMV2, the B1->B0 block may be checked. For CPMV3, the A1->A0 block may be checked. For example, TMVP may be used as CPMV4, depending on availability (e.g., if TMVP is available).

[0153] After obtaining the MVs of multiple (e.g., four) control points, an affine merge candidate can be constructed based on the motion information (e.g., control points). The control point MVs (e.g., combinations thereof) can be used to construct the following: {CPMV1, CPMV2, CPMV3}, {CPMV1, CPMV2, CPMV4}, {CPMV1, CPMV3, CPMV4}, {CPMV2, CPMV3, CPMV4}, {CPMV1, CPMV2}, {CPMV1, CPMV3}.

[0154] A combination of multiple (e.g., three) CPMVs can construct a 6-parameter affine merge candidate. A combination of multiple (e.g., two) CPMVs can construct a 4-parameter affine merge candidate. For example, if the reference indexes of the control points are different, the relevant combination of control point MVs can be discarded (e.g., to avoid motion scaling process).

[0155] For example, if the list is not full, zero MVs may be inserted at the end of the list (eg, after checking inherited affine merge candidates and constructed affine merge candidates).

[0156] Temporal motion vector prediction may be applied and / or provided.

[0157] Fig.12Example locations of spatial and temporal motion vector predictors used in merge mode are illustrated. Fig.12 The left side of shows the spatial merge candidates. Fig.12 The temporal merge candidates are shown on the right side of FIG. In conventional merging, TMVP may use the collocated motion vector H in the lower right corner of the block under consideration (or the center position C in the block under consideration is not available), e.g. Fig.12 The collocated motion vector may be a motion vector in a collocated reference picture (e.g., a reference picture in a reference picture buffer signaled at the slice level), collocated at position H or C. The motion vector may be rescaled to use the first reference picture in the reference picture buffer of the L0 or L1 list. Fig.13 Example motion scaling of temporal merge candidates is illustrated. Fig.13 As shown in , Curr_pic can be the current picture, Col_pic can be the co-located picture, Col_ref can be the reference picture used by the motion vector in Col_pic, and Curr_ref can be the reference picture used by the current block in curr_pic. The scaling process can be as follows Fig.13 as shown in .

[0158] Sub-block based temporal motion vector prediction (SbTMVP) may be applied and / or provided.

[0159] Sub-block based temporal motion vector prediction (SbTMVP) operation may be supported. SbTMVP may use motion fields in collocated pictures to improve motion vector prediction and merge modes for CUs in the current picture (e.g., similar to temporal motion vector prediction (TMVP)). The collocated pictures used by TMVP (e.g., the same collocated pictures) may be used for SbTMVP. SbTMVP may differ from TMVP in one or more of the following aspects: TMVP may predict motion at the CU level and SbTMVP may predict motion at the sub-CU level; TMVP may obtain temporal motion vectors from collocated blocks in collocated pictures (e.g., the collocated blocks are the lower right corner or center blocks relative to the current CU), and SbTMVP may apply motion shifts before obtaining temporal motion information from collocated pictures (e.g., where the motion shifts are obtained from the motion vectors of one of the spatially neighboring blocks of the current CU).

[0160] Fig.14 An example of an SbTMVP process is illustrated. SbTMVP may predict a motion vector of a sub-CU, for example, within the current CU (eg, in multiple (eg, two) steps). For example, a spatial neighborhood A1 (eg, such as Fig.14(shown in (a)). If A1 has a motion vector that uses the collocated picture as its reference picture, then that motion vector may be selected as the motion shift to be applied. If no such motion is identified, then the motion shift may be set to (0,0).

[0161] A motion shift (e.g., a motion shift identified in the first step as described herein) may be applied (e.g., added to the coordinates of the current block) to obtain sub-CU level motion information (e.g., motion vectors and reference indices) from a collocated picture (e.g., Fig.14 (b)), for example in the (second) step. It can be assumed that the motion shift is set to prevent the motion of block A1' (for example, as Fig.14 (b)). The motion information of the sub-CU (e.g., each) sub-CU may be derived using the motion information of the corresponding block (e.g., the minimum motion grid covering the center sample) of the (e.g., each) sub-CU in the collocated picture. After the motion information of the collocated sub-CU is identified, the motion information may be converted to a motion vector and a reference index of the current sub-CU (e.g., in a manner similar to the TMVP process), where, for example, temporal motion scaling may be applied to align the reference picture of the temporal vector with the reference picture of the current CU.

[0162] Fig.14 (a) illustrates the spatial neighboring blocks used by SbTMVP. Fig.14 (b) illustrates the derivation of a sub-CU motion field by applying a motion shift from a spatial neighborhood and scaling the motion information from the corresponding co-located sub-CU.

[0163] A combined sub-block based merge list (e.g., which may include SbTMVP candidates and affine merge candidates) may be used to signal a sub-block based merge mode. The SbTMVP mode may be enabled or disabled by a flag (e.g., a sequence parameter set (SPS) flag). For example, if the SbTMVP mode is enabled, the SbTMVP predictor may be added as an entry (e.g., the first entry) of a list of sub-block based merge candidates (e.g., followed by affine merge candidates). The size of the sub-block based merge list may be signaled in the SPS. The allowed size (e.g., the maximum allowed size) of the sub-block based merge list may be 5.

[0164] The sub-CU size used in SbTMVP may be fixed to 8×8. The SbTMVP mode may be applicable to (eg, only applicable to) CUs whose width and height are both greater than or equal to 8 (eg, like the affine merge mode).

[0165] The encoding logic of the additional SbTMVP merge candidates may be similar and / or the same as other merge candidates (eg, for (eg, each) CU in a P or B slice, an additional RD check may be performed to decide whether to use the SbTMVP candidate).

[0166] Template matching may be performed and / or provided. Template matching (TM) may be a derivation operation (e.g., a motion vector (MV) derivation operation, a decoder-side MV derivation operation). TM may enable correction of motion information of a CU (e.g., a current CU), for example, by finding a match (e.g., the closest match) between a template (e.g., a top and / or left neighboring block of the current CU) in a picture (e.g., a current picture) and a block (e.g., the same size as the template) in a reference picture. Fig.15 An example of template matching performed on a search area around an initial MV is illustrated. Fig.15 As shown, the MV (e.g., a better MV) is searched around the initial motion of the current CU within the [-8, +8] pixel search range. The template matching method can be used with one or more of the following modifications: the search step size is determined based on the adaptive motion vector resolution correction (AMVR) mode; and / or the TM can be cascaded with the bilateral matching process in the merge mode.

[0167] In AMVP (Advanced Motion Vector Prediction) mode, a motion vector predictor (MVP) candidate may be determined, for example, based on a template matching error. The template matching error may include an error in selecting an MVP candidate that achieves a difference (e.g., a minimum difference) between a current block template and a reference block template, and then TM is performed only for the selected MVP candidate (e.g., a specific MVP candidate) to achieve MV correction. For example, TM may correct this MVP candidate starting from full-pixel motion vector difference (MVD) accuracy or from 4 pixels for a 4-pixel AMVR mode within a [–8, +8] pixel search range (e.g., by using an iterative diamond search). The AMVP candidate may be further corrected, for example, by using a cross search with full-pixel MVD accuracy or with 4 pixels for a 4-pixel AMVR mode followed by half-pixel MVD accuracy and quarter-pixel MVD accuracy, depending on the AMVR mode (e.g., as shown in Table 1). This search process may ensure that the MVP candidate maintains the same MV accuracy (e.g., as indicated by the AMVR mode) after the TM process. During the search process, for example, if the difference between the previous minimum cost and the current minimum cost in the interaction is smaller than a threshold value equal to the area of ​​the block, the search process may terminate.

[0168]

[0169] Table 1. Search patterns of AMVR and merge mode and AMVR.

[0170] In merge mode, the search operation may be applied to merge candidates (e.g., merge candidates indicated by a merge index). As shown in Table 1, TM may perform precision up to 1 / 8 pixel MVD precision (e.g., always up to 1 / 8 pixel MVD precision) or skip precisions exceeding half-pixel MVD precision, for example, depending on whether an alternative interpolation filter is used based on merged motion information (e.g., an interpolation filter used when AMVR uses half-pixel mode). For example, TM may operate as an independent process and / or an additional MV correction process between a block-based bilateral matching (BM) operation and a sub-block-based BM operation. Template matching may operate as an independent process or an additional MV correction process between a block-based bilateral matching (BM) method and a sub-block-based BM method (e.g., if / when TM mode is enabled), for example, depending on whether BM may be enabled (e.g., based on its enabling condition check).

[0171] Multiple passes of motion vector correction may be performed and / or provided. Multiple passes of decoder-side motion vector correction may be performed and / or provided.

[0172] Multiple passes of vector correction (e.g., multiple passes of decoder-side motion vector correction) may be applied. In a first pass, bilateral matching (BM) may be applied to the coding block. In a second pass, BM may be applied to (e.g., each) sub-block (e.g., 16×16 sub-block) within the coding block. In a third pass, MVs in (e.g., each) sub-block (e.g., 8×8 sub-block) may be corrected, e.g., by applying bidirectional optical flow (BDOF). The corrected MVs may be stored for spatial and / or temporal motion vector prediction.

[0173] In a first pass, block-based bilateral matching MV modification may be applied. In the first pass, modified MVs may be derived by applying BM to the coded blocks. Similar to motion vector modification (e.g., such as decoder-side motion vector modification (DMVR)), in a bidirectional prediction operation, modified MVs may be searched around (e.g., two) initial MVs (e.g., MV0 and MV1) in reference picture lists L0 and L1. For example, based on a bilateral matching cost (e.g., a minimum bilateral matching cost) between (e.g., two) reference blocks in L0 and L1, modified MVs (e.g., MV0_pass1 and MV1_pass1) may be derived around the initial MVs.

[0174] BM may include performing a search (e.g., a local search) to derive integer sample precision intDeltaMV. The local search may apply a search pattern (e.g., a 3×3 square search pattern), for example, to cycle through a search range [–sHor, sHor] in the horizontal direction and [–sVer, sVer] in the vertical direction. The values ​​of sHor and sVer may be determined (e.g., by block dimensions). The maximum values ​​of sHor and sVer may be 8.

[0175] For example, the bilateral matching cost may be optimally calculated as: bilCost=mvDistanceCost+sadCost. For example, if (e.g., when) the block size cbW*cbH is greater than 64, the MRSAD cost function may be applied to remove the DC effect of the distortion between the reference blocks. For example, if (e.g., when) the bilCost at the center point of the 3×3 search pattern has a specified cost (e.g., a minimum cost), the intDeltaMV local search may terminate. The current minimum cost search point may become a second center point (e.g., a new center point) of the 3×3 search pattern, and the search for the minimum cost may continue, e.g., until the search reaches the end of the search range.

[0176] For example, the existing fractional sample correction can be further applied to derive the final deltaMV. The corrected MV after the first pass can be derived based on equations 1 and 2.

[0177] MV0_pass1=MV0+deltaMV Equation 3

[0178] MV1_pass1=MV1–deltaMV Equation 4

[0179] For example, in the second pass, subblock-based bilateral matching MV correction may be applied. For example, a corrected MV (e.g., in the second pass) may be derived by applying BM to a subblock (e.g., a 16×16 grid subblock). For a subblock (e.g., each subblock), a corrected MV may be searched around (e.g., two) MVs (e.g., MV0_pass1 and MV1_pass1) in reference picture lists L0 and L1, which may be obtained on the first pass. Based on a bilateral matching cost (e.g., a minimum bilateral matching cost) between two reference subblocks in L0 and L1, a corrected MV (e.g., MV0_pass2(sbIdx2) and MV1_pass2(sbIdx2)) may be derived.

[0180] For a subblock (e.g., each subblock), BM may include performing a search (e.g., a full search) to derive integer sample precision intDeltaMV. The full search may have a search range of [-sHor, sHor] in the horizontal direction and a search range of [-sVer, sVer] in the vertical direction. The values ​​of sHor and sVer may be determined by the block dimension. The maximum values ​​of sHor and sVer may be 8.

[0181] For example, the bilateral matching cost may be calculated by applying a cost factor to the SATD cost between (eg, two) reference sub-blocks, such as: bilCost=satdCost*costFactor. Fig.16 An example of a diamond-shaped area in the search area is illustrated. The search area (2*sHor+1)*(2*sVer+1) can be divided into (eg, up to five) diamond-shaped search areas (eg, Fig.16 . As shown in FIG. 1 ). A costFactor may be assigned to a search region (e.g., each search region). The costFactor may be determined by a distance (e.g., intDeltaMV) between (e.g., each) search point and a start MV. For example, diamond-shaped regions (e.g., each diamond-shaped region) may be processed in an order starting from the center of the search area. In (e.g., each) region, the search points may be processed in a raster scan order, for example, starting from the upper left corner to the lower right corner of the region. For example, if (e.g., when) the minimum bilCost within the current search region is less than a threshold value (e.g., a threshold value equal to sbW*sbH), the integer pixel full search may terminate. Otherwise, the integer pixel full search may continue to the next search region, for example, until (e.g., all) search points are checked. For example, if the difference between the previous minimum cost and the current minimum cost in an iteration is less than a threshold value equal to the area of ​​the block, the search process may terminate.

[0182] The DMVR fractional sample correction can be further applied to derive the final deltaMV (sbIdx2). The corrected MV at the second pass can be derived based on Equations 3 and 4.

[0183] MV0_pass2(sbIdx2)=MV0_pass1+deltaMV(sbIdx2) Equation 5

[0184] MV1_pass2(sbIdx2)=MV1_pass1–deltaMV(sbIdx2) Equation 6

[0185] For example, in the third pass, a sub-block based MV correction (e.g., bidirectional optical flow MV correction) may be applied. In the third pass, a corrected MV may be derived by applying bidirectional optical flow (BDOF) to a sub-block (e.g., an 8×8 grid sub-block). For (e.g., each) sub-block (e.g., an 8×8 sub-block), the BDOF correction may be applied to derive scaled Vx and Vy, for example, without clipping (e.g., starting from the corrected MV of the mother sub-block of the second pass). The derived bioMv(Vx, Vy) may be rounded (e.g., to 1 / 16 sample precision) and clipped (e.g., to between -32 and 32).

[0186] The modified MVs at the third pass (MV0_pass3(sbIdx3) and MV1_pass3(sbIdx3)) can be derived using Equations 5 and 6.

[0187] MV0_pass3(sbIdx3)=MV0_pass2(sbIdx2)+bioMv Equation 7

[0188] MV1_pass3(sbIdx3)=MV0_pass2(sbIdx2)–bioMv Equation 8

[0189] Adaptive motion vector correction (e.g., decoder-side motion vector correction) may be performed. The adaptive motion vector correction operation (e.g., adaptive decoder-side motion vector correction operation) may be an extension of multi-pass DMVR, which may include (e.g., two new) merge modes to correct the MV in the direction of bi-directional prediction (e.g., only in one direction, such as, for example, L0 or L1) of the merge candidate (e.g., satisfying the DMVR condition). The multi-pass DMVR process may be applied to the selected merge candidate, for example, to correct the motion vector. MVD0 or MVD1 may be set to zero in the first pass (e.g., PU level) DMVR.

[0190] Merge candidates for the (e.g., new) merge mode may be derived from spatially neighboring coded blocks, TMVPs, non-neighboring blocks, history-based motion vector predictors (HMVPs), paired candidates, etc. (e.g., similar to in a conventional merge mode). Merge candidates determined to satisfy the DMVR condition may be added to a candidate list. The same merge candidate list may be used by (e.g., two new) merge modes. Merge indexes may be coded as in a conventional merge mode.

[0191] Adaptive merge candidate reordering and template matching (ARMC-TM) may be performed. The merge candidates may be adaptively reordered, for example, using template matching (TM). The reordering operation may be applied to one or more merge modes, such as, for example, a regular merge mode, a template matching (TM) merge mode, and / or an affine merge mode (e.g., which may exclude SbTMVP candidates). The merge candidates may be reordered before the correction process, for example, for the TM merge mode.

[0192] For example, after constructing the merge candidate list, the merge candidates may be divided into subgroups. The subgroup size may be set. The subgroup size may be set for the regular merge mode and the TM merge mode (e.g., set to 5 for the regular merge mode and the TM merge mode). The subgroup size is set for the affine merge mode (e.g., set to 3 for the affine merge mode). For example, the merge candidates in (e.g., each) subgroup may be reordered in ascending order according to the cost value (e.g., based on template matching). For example, for simplicity, reordering of the merge candidates in the last subgroup rather than the first subgroup may be avoided (e.g., may not be reordered).

[0193] The template matching cost of the merge candidate can be measured, for example, by the sum of absolute differences (SAD) between the samples of the template of the current block and its corresponding reference samples. The template may include a set of reconstructed samples adjacent to the current block. The reference sample of the template may be located by merging the motion information of the candidate.

[0194] Fig.17 The example template and the reference sample of the template in the reference picture are illustrated. For example, if (e.g., when) the merge candidate utilizes bidirectional prediction, the reference sample of the template of the merge candidate can be (e.g., additionally) generated by bidirectional prediction (e.g., as Fig.17 shown).

[0195] Fig.18 An example template for a block with sub-block motion using motion information of a sub-block of a current block and a reference sample of the template are illustrated. For example, for a sub-block-based merge candidate with a sub-block size equal to Wsub×Hsub, the upper template may include several sub-templates of size Wsub×1, and the left template may include several sub-templates of size 1×Hsub. Fig.18 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.

[0196] A bilateral matching AMVP merge mode may be applied. A bidirectional predictor may include an AMVP predictor in (e.g., one) direction and a merge predictor in another direction. For example, this mode may be enabled for a coding block if (e.g., when) the selected merge predictor and AMVP predictor satisfy a DMVR condition (e.g., where there is at least one reference picture from the past and one reference picture from the future relative to the current picture and the distances from the two reference pictures to the current picture are the same). A bilateral matching MV correction may be applied to the merge MV candidates and the AMVP MVP as a starting point. For example, if template matching functionality is enabled, the template matching MV correction may be applied to the merge predictor or the AMVP predictor (e.g., which has a higher template matching cost).

[0197] The AMVP portion of the pattern may be signaled as a conventional unidirectional AMVP (eg, reference index and MVD are signaled). For example, the AMVP portion of the pattern may have a derived MVP index if template matching is used or the MVP index is signaled when template matching is disabled.

[0198] For example, for the AMVP direction LX, X may be 0 or 1. The merge portion in the other direction (1-LX) may be implicitly derived, for example, by minimizing the bilateral matching cost between the AMVP predictor and the merge predictor (e.g., for a pair of AMVP and merge motion vectors). For example, for each merge candidate in the merge candidate list having the other direction (1-LX) motion vector, the bilateral matching cost may be calculated using the merge candidate MV and the AMVP MV. The merge candidate may be selected, for example, based on the cost (e.g., the merge candidate with the minimum cost may be selected). The bilateral matching correction may be applied to the coding block using the selected merge candidate MV and the AMVP MV as a starting point.

[0199] A third pass of multi-pass DMVR may be enabled for AMVP merge mode coding blocks (eg, it may be an 8x8 sub-PU BDOF correction of multi-pass DMVR).

[0200] This mode may be indicated by a flag. For example, if this mode is enabled, the AMVP direction LX may be indicated by a flag (eg, an additional flag).

[0201] Non-adjacent spatial candidates may be considered, inserted, and / or provided. For example, non-adjacent spatial merge candidates may be inserted into a regular merge candidate list (eg, after TMVP). Fig.19 An example of spatial neighboring blocks for deriving spatial merge candidates is illustrated. The pattern of spatial merge candidates can be as follows: Fig.19As shown. The distance between non-adjacent spatial candidates and the current decoding block may be based on the width and height of the current decoding block. The line buffer limit may not apply.

[0202] Symmetric MVD coding may be performed. For example, in addition to normal uni-prediction and bi-prediction mode MVD signaling, a symmetric MVD mode may be applied (e.g., for bi-prediction MVD signaling). Motion information (e.g., including reference picture indices for both list 0 and list 1 and the MVD for list 1) may be derived (e.g., instead of signaled), for example, in symmetric MVD mode.

[0203] The decoding process of the symmetric MVD mode may include one or more of the following. The variables BiDirPredFlag, RefIdxSymL0, and RefIdxSymL1 may be derived (e.g., at a slice level), for example, based on one or more of the following: For example, if mvd_l1_zero_flag is 1, BiDirPredFlag may be set equal to 0; For example, if the nearest reference picture in list 0 and the nearest reference picture in list 1 form a pair of forward and backward reference pictures or a pair of backward and forward reference pictures, BiDirPredFlag is set to 1, and both list 0 and list 1 reference pictures are short-term reference pictures (e.g., otherwise BiDirPredFlag is set to 0).

[0204] For example, if the CU is bidirectionally predictively coded and BiDirPredFlag is equal to 1 (e.g., at the CU level), a symmetric mode flag indicating whether the symmetric mode is used may be signaled (e.g., explicitly signaled).

[0205] If (e.g., when) the symmetric mode flag is true, then (e.g., only) mvp_l0_flag, mvp_l1_flag, and MVD0 may be signaled (e.g., explicitly signaled). The reference indexes of list 0 and list 1 may be set equal to the reference picture pair, respectively. MVD1 may be set equal to (-MVD0). The final motion vector may be as shown in Equation 9.

[0206]

[0207] Fig. 20 An example symmetric MVD mode is illustrated. Symmetric MVD motion estimation may start, for example, in an encoder with MC evaluation (e.g., initial MV evaluation). The initial MV candidate set may include (e.g., contain) MVs obtained from unidirectional prediction search, MVs obtained from bidirectional prediction search, and / or MVs from an AMVP list. The MV candidate with the lowest rate-distortion cost may be selected as the initial MV for the symmetric MVD motion search.

[0208] The motion information candidates may be reordered using, for example, an operation that may not rely on reconstructed samples. Sorting (e.g., ranking) may be performed on scores calculated from the motion information. A later stage of motion information modification (e.g., at the decoder side) may be used to reorder the motion information candidates (e.g., modify the first ordering of the motion information candidates).

[0209] Motion model extraction may be performed to obtain motion information associated with the current block for use in classifying motion candidates. For (e.g., each) block, (e.g., one or more) motion models may be extracted, e.g., for later comparison with motion information of a candidate. For example, motion model extraction may be performed to determine motion information associated with a block (e.g., a sub-block).

[0210] A global motion model may be obtained. For example, global motion information may be sent at a slice level. A global motion model (e.g., at least one global motion model) may be calculated (e.g., at an encoder) and may be sent in the video data (e.g., in a slide header or a picture header).

[0211] Operations associated with computing global motion may include one or more of: performing block matching between a reference frame and a current frame and extracting dominant motion; extracting salient points (e.g., Harris corners or SIFT points) and matching them (e.g., robustly) according to a common motion model (e.g., using RANSAC); and the like.

[0212] For example, the motion model may be an affine 4, affine 6, or homography model. Models (e.g., several models) may be transmitted. Model parameters may be sent as motion of frame corners, differentially coded, e.g., top left (e.g., (e.g., sent as motion vector using MVD encoding of the codec); top right (e.g., sending MVD of the difference between the decoded top right motion and top left motion); bottom left (e.g., same as top right); bottom right (e.g., MVD of the difference between bottom right motion and the average of the top left motion vector and the bottom left motion vector); etc.

[0213] According to the global motion model, the motion of the current block can be calculated using, for example, the motion of the center of the block. The motion of the block can be calculated using the top left corner or other positions.

[0214] For example, if multiple (e.g., several) models are available, the index of the global model to be used may be signaled for the block using the mode. Context-based coding may use neighboring blocks. Context-based coding (using neighboring blocks (e.g., top and left blocks)) may be used to reduce the cost of signaling the index.

[0215] In an example, a collocated frame used as a reference frame for a motion vector may be signaled (e.g., in a slice header). An index to a global motion model may be signaled at a block level, e.g., in a manner similar or identical to how a reference frame index is signaled in an inter-coded block.

[0216] A local motion model may be obtained, derived and / or provided. In an example, a motion model (eg, one or several motion models) that is later used for a particular block may be extracted from the candidates.

[0217] Fig.21 An example local motion model calculation is illustrated. Candidates (e.g., several candidates) can be used to calculate a local motion model. As shown, multiple (e.g., three) local models can be calculated: model A can be calculated using motion information in candidates 9, 10, 11; model B can be calculated using motion information in candidates 4, 5, 6; and / or model C can be calculated using motion information in candidates 8, 3, and 7.

[0218] For example, computation of the local motion model may be performed using the same or similar process as construction of affine inheritance candidates (eg, as described herein).

[0219] The motion model may be obtained using a global temporal motion vector buffer.A motion model (eg, a complete motion model) may be created on the current frame, for example, using past motion information and creating a buffer filled with motion vector predictors.

[0220] Fig. 22 An example time buffer construction is illustrated. For example, Fig. 22 As shown, a buffer of temporal motion information candidates can be constructed. For example, an empty buffer can be created before decoding the current frame C. The motion information can be (e.g., assumed) to be calculated using a reference frame R. The reference frame R can be a (e.g., first) reference frame corresponding to a (e.g., first) index in a reference frame list. In the case of multiple reference frame candidates, several buffers can be constructed in the same manner. The motion information can be used to calculate the motion information of the current frame, for example, calculating the motion information of (e.g., each) reference frame P in the reference picture buffer list. For a block of frame P, a rescaled motion vector can be calculated (e.g., using the same or similar process as used to construct a temporal motion vector predictor), for example, it includes motion information. The rescaled motion vector allows the block to be calculated to fill the buffer. For example, if the block does not yet have motion information, a rescaled motion vector using reference frame R and original frame C can be calculated and stored in the block.

[0221] The reference frame P can be selected. In an example, the frame with the picture order count (POC) closest to the current frame can be examined (e.g., first). The sorting can be determined based on the temporal distance between the reference frame and the current frame.

[0222] The motion information of (e.g., each) block can be selected. In an example, symmetric candidates can be selected based on the POC distance (e.g., as described herein). Symmetric candidates can be considered, applied, selected, and / or provided. For example, the symmetric form of the TMVP vector can be added. For example, the temporal motion vector can be replaced by the symmetric form of the TMVP vector (e.g., if / when possible).

[0223] Fig.23 An example symmetric temporal candidate process is illustrated. A process of extracting symmetric temporal motion vector candidates can be performed. For example, the position of the collocated motion can be extracted by testing whether the bottom right corner outside the CU is valid, and if not, testing whether the center position is valid (e.g., as in the default temporal motion process). Other positions can be tested (e.g., additionally or alternatively). For example, if the current slice is a bi-predictive slice and there are symmetric reference frames in the L0 and L1 reference lists, the symmetric motion candidate process can be used (e.g., otherwise the default motion temporal process is used). The symmetric reference pictures can be referred to as ref0 and ref1. The symmetric reference pictures can be symmetric in the past and future of the current frame (e.g., in the same or similar manner as in the symmetric MVD decoding process). For example, if the collocated motion is unidirectional, the collocated motion can be used as the rescaled motion. The motion cmv can be referred to as cref, for example, representing the motion vector and the associated reference picture index. If the collocated motion vector is bi-predictive: cPOC can refer to the POC of the current frame; cPOC0 can refer to the POC of the reference frame corresponding to the reference index in list L0 of the collocated motion vector. cPOC1 can refer to the POC of the reference frame corresponding to the reference index in list L1 of the collocated motion vector. For example, if abs(cPOC - cPOC0) < abs(cPOC - cPOC1), the motion in list 0 can be selected for rescaling (e.g., otherwise the motion in list 1 can be selected). The selected motion can be rescaled, for example, using (e.g., the default) temporal motion rescaling process, to point to the reference frame ref0 in list L0 and the reference frame ref1 in list L1.

[0224] Reordering based on motion consistency can be applied, performed, and / or provided. For example, the motion information candidates can be sorted based on comparing the motion information candidates with the motion information associated with the current decoded block. The motion information can include motion models.

[0225] Consistency with a motion model (e.g., as described herein) may be used to calculate a cost for (e.g., each) candidate (e.g., instead of using a template and reference samples to calculate the cost of the candidate). For example, a device (e.g., a decoding device or an encoding device) may obtain an indication (e.g., a signal) indicating whether a template-based coding tool is enabled for a coding block (e.g., a sub-block). For example, if the device determines that the template-based coding tool is disabled, the motion information candidates may be ranked based on comparing the motion information candidates with the consistency-based motion information. This operation may avoid performing (e.g., not performing, not requiring) reconstruction of neighboring blocks to decode the motion information of the current block.

[0226] The motion information (e.g., motion model, motion vector difference) associated with the current block may be obtained from one or more of the following: one or more global motion models as described herein (e.g., indicated in the video data, transmitted to the decoder); one or more local motion models calculated from (e.g., decoded) motion information (e.g., at the decoder); a global temporal motion information buffer as described herein. The motion information associated with the block for reordering motion candidates may include co-located motion information in the temporal buffer.

[0227] A motion candidate consistency score may be calculated for the motion candidates of the block. Fig.24 An example of motion vector candidates and global motion field is shown (e.g., when decoding block 4): candidates c, f, d, e can be spatial motion candidates in the light and dark line; candidates a and b can be non-adjacent candidates in the light and dark line; and / or the motion vector of the gray dashed line can be derived from the global motion model. The motion vector can be calculated by applying the motion model at the center of the block. In the example, a position can be selected at a corner of the block (e.g., the upper left corner).

[0228] Table 2 shows the ranking of the original motion vector candidates:

[0229] index Candidate 0 f 1 e 2 d 3 c 4 a 5 b

[0230] Table 2

[0231] Based on the candidate vectors and the global model vector, a score may be calculated for (eg, each) motion vector candidate, eg, as shown in Table 3.

[0232] Candidate Fraction a 2 b 40 c 3 d 30 e 45 f 5

[0233] Table 3: Score table

[0234] The score of each candidate may be calculated, for example, using the L1 paradigm as the difference between the candidate motion vector and the global motion vector: score = |mv_x-g_x| + |mv_y-g_y|. The L2 paradigm may (e.g., alternatively) be used. For example, the score may indicate a consistency value. The consistency value of the first motion information candidate may be determined based on motion information associated with the block (e.g., a global motion model, a local motion model, motion information collocated in a temporal buffer). The device may indicate an index associated with the candidate and the calculated score. The index may indicate the order of the candidate.

[0235] For example, a rescaling process of a temporal motion vector predictor (TMVP) may be applied to compare motion vectors pointing to different reference frames. For example, a motion vector may be rescaled to point to the first reference frame (e.g., index 0) of a (e.g., each) list. Temporal motion vector candidates may be checked (e.g., in the same or similar manner as described herein).

[0236] In an example, the reordering may be performed based on the motion vector difference. For example, as shown in Table 4, the candidates may be ordered from lowest to highest score (e.g., motion information candidates with lower scores may be associated with higher consistency with respect to motion information (e.g., global motion model, local motion model)).

[0237] Candidate Fraction Ranking a 2 0 b 40 4 c 3 1 d 30 3 e 45 5 f 5 2

[0238] Table 4

[0239] Partial reordering may be performed. In an example, the reordering may be partial. In an example, N candidates (e.g., only the first N candidates) may be reordered. In an example, the candidates may be reordered in groups. For example, N candidates (e.g., the first N candidates) may be reordered, and then the following M candidates may be reordered together.

[0240] A global motion compensation (GMC) candidate may be determined and / or provided. For example, there may be multiple spatial candidates (e.g., Fig.24 The candidates f, c, e in ). The candidates may be replaced by motion vectors generated by the motion model (e.g., at the center of the block).

[0241] In an example, multiple motion models (e.g., global motion models or local motion models) may be used. In this case, for example, except for the local model when the candidate is used to calculate the model (e.g., because the score will be 0), the score can be calculated by taking the lowest score of the candidate in the model (e.g., all models).

[0242] An affine mode may be applied and / or provided. In an example, the current block may use a sub-block mode, such as an affine mode. In an example, the score may be calculated as the average of the differences between the control points (CPMVs) of the model and the motion vectors inferred at the CPMV positions (e.g., using a motion model).

[0243] A sub-block based mode may be applied and / or provided. In an example, the current block may use a sub-block mode, such as an SbTMVP mode. In this case, the score may be calculated as the average of the differences between the motion vector of (e.g., each) sub-block and the motion from the motion model.

[0244] The reordering may be performed by a motion correction step. For example, the reordering by the motion correction step may be performed using the determined order (e.g., an order determined based on consistency with the motion information). The reordering may generate a second ordering of the motion information candidates. The second ordering of the motion information candidates may be a correction of the first ordering of the motion information candidates. The decoding and / or encoding device may be instructed to perform the reordering by motion correction.

[0245] Constraints on reordering can be applied. For example, in the case where the mode uses a motion correction step (e.g., TM or DMVR), constraints on reordering can be applied. After correction, candidates that are close to each other may end up with the same final motion vector.

[0246] A motion model (eg, local motion model, global motion model) may be used to check whether multiple motion vector candidates are close to each other. In an example, motion vector candidates that are consistent with a given motion model in the original list ordering may be retained (eg, only the first motion vector candidate).

[0247] For example, given the score table in Table 3 and a threshold value of six (eg, which may be indicated), the motion vectors are considered consistent with a given motion model, and the following ranking may be obtained (eg, as shown in Table 5).

[0248] Candidate Fraction Ranking a 2 0 b 40 2 c 3 Remove d 30 1 e 45 3 f 5 Remove

[0249] Table 5

[0250] As shown, candidates c and f may be removed, for example, because their scores are below a threshold, and candidate a, which is ranked higher in the list, may have been retained. For example, a candidate with a score below a threshold may be too similar to the first candidate (e.g., not changed enough). In the example, the discarded candidates may be placed at the end of the list.

[0251] One or more global motion models may be signaled (eg, in the video data, in the bitstream). For example, signaling may be performed at the slice level.

[0252] Global motion model parameters may be transmitted. For example, if (e.g., when) a (e.g., at least one) global motion model is used, the global motion model parameters are also transmitted (e.g., at a slice / picture / sequence level). For example, the global motion model parameters may be transmitted using the syntax shown in Table 6.

[0253]

[0254] Table 6

[0255] model_order may be an integer between 0 and 3, for example, to control the ordering of the motion model (eg, translation, affine4, affine6, or homography).

[0256] In an example, cpmv may be differentially encoded, for example, by predicting (eg, each) corner using already available corners and associated models.

[0257] 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 video decoding device, the video decoding device comprising: A processor, the processor being configured to: obtaining a plurality of motion information candidates associated with the block; determining motion information associated with the block; determining an ordering associated with the plurality of motion information candidates based on comparing the corresponding motion information candidates with the determined motion information; as well as The block is decoded based on the determined ordering associated with the plurality of motion information candidates.

2. The video decoding device according to claim 1, wherein the processor is further configured to: An indication is obtained indicating whether a template based coding tool is enabled for the block, wherein the determining of the ordering associated with the plurality of motion information candidates is performed based on the indication indicating that the template based coding tool is not enabled for the block and is performed independently of reconstructed samples.

3. The video decoding device according to claim 1, wherein the processor is further configured to: Determine neighboring motion information associated with a neighboring block of the block, wherein the motion information associated with the block is determined based on the neighboring motion information, and the order associated with the plurality of motion information candidates is determined based on comparing the corresponding motion information candidate with the neighboring motion information.

4. The video decoding device according to claim 1, wherein the processor is further configured to: obtaining global motion information associated with a slice including the block, wherein the motion information associated with the block includes the global motion information associated with the slice, and the ordering associated with the plurality of motion information candidates is determined based on comparing the corresponding motion information candidates with the global motion information associated with the slice. 5 . The video decoding apparatus of claim 4 , wherein the global motion information associated with the slice is obtained via a slice header.

6. The video decoding device according to claim 1, wherein the processor is further configured to: Obtaining a temporal motion information candidate associated with a reference picture; scaling the temporal motion information candidate based on a temporal distance between the reference picture and a current picture including the block; and Global motion information associated with the current picture is determined based on the scaled temporal motion information candidates, wherein the motion information associated with the block includes the global motion information.

7. The video decoding device according to claim 1, wherein the processor is further configured to: Local motion information is derived based on motion information candidates associated with neighboring blocks of the block, wherein the motion information associated with the block includes the derived local motion information.

8. The video decoding apparatus according to claim 1, wherein determining the ranking associated with the plurality of motion information candidates further comprises: determining, for a first motion information candidate of the plurality of motion information candidates, a first consistency value relative to the obtained motion information; determining, for a second motion information candidate among the plurality of motion information candidates, a second consistency value relative to the obtained motion information; The first motion information candidate is ranked higher than the second motion information candidate based on the first motion information candidate being associated with a higher consistency value than the second motion information candidate.

9. The video decoding apparatus according to claim 1, wherein determining the ranking associated with the plurality of motion information candidates further comprises: determining, for a first motion information candidate of the plurality of motion information candidates, a first consistency value relative to the obtained motion information; determining, for a second motion information candidate among the plurality of motion information candidates, a second consistency value relative to the obtained motion information; as well as The first motion information candidate is ranked lower than the second motion information candidate based on the first motion information candidate being associated with a higher consistency value than the second motion information candidate.

10. The video decoding apparatus according to claim 1, wherein determining the ranking associated with the plurality of motion information candidates further comprises: Obtaining a difference between a first motion information candidate and a second motion information candidate among the plurality of motion information candidates; as well as Based on a difference between the first motion information candidate and the second motion information candidate being lower than a threshold, the second motion information candidate is removed.

11. A video encoding device, the video encoding device comprising: A processor, the processor being configured to: obtaining a plurality of motion information candidates associated with the block; obtaining motion information associated with the block; determining an ordering associated with the plurality of motion information candidates based on comparing the corresponding motion information candidates with the obtained motion information; as well as The block is encoded based on the determined ordering associated with the plurality of motion information candidates.

12. The video encoding device according to claim 11, wherein the processor is further configured to: determining whether to perform candidate sorting based on motion information; and Based on the determination, motion information based candidate ordering is performed on the block, including an indication indicating enabling of motion information based candidate ordering. 13 . The video encoding apparatus of claim 12 , wherein the indication further indicates that the encoded block is to be decoded based on motion information associated with neighboring blocks of the block.

14. The video encoding device of claim 12, wherein the motion information of the block comprises global motion information, and wherein the processor is further configured to: calculating global motion information associated with a slice including the block, wherein the motion information for the block includes the calculated global motion; and An indication of the global motion information is included in the video data.

15. The video encoding apparatus of claim 12, wherein the indication further indicates deriving the global motion information based on rescaling the temporal motion information candidates associated with the temporal reference frame, and wherein the indication further indicates rescaling based on temporal distance. 16 . The video encoding apparatus according to claim 12 , wherein the motion information of the block is local motion information, and wherein the indication further indicates that the local motion information is derived based on motion information candidates associated with neighboring blocks.

17. A video encoding device according to claim 12, wherein the indication also indicates determining a corresponding consistency value associated with the motion information candidate and each of the neighboring blocks, and wherein the indication also indicates determining a ranking of the motion information candidates based on the consistency values, wherein higher consistency values ​​are ranked higher than lower consistency values. 18 . The video encoding apparatus according to claim 11 , wherein the instruction further instructs determination of a first ranking of motion information candidates and a second ranking of motion information candidates, wherein the second ranking of motion information candidates is a correction of the first ranking of motion information candidates. 19 . The video encoding apparatus according to claim 18 , wherein the instruction further indicates that the second ordering of the motion information candidates is determined based on the first ordering of the motion information candidates and a threshold value.

20. The video encoding device according to claim 11, wherein the processor is further configured to: selecting a motion predictor for the block from among the plurality of motion information candidates; determining an index of the selected motion predictor based on the ranking associated with the plurality of motion information candidates; and An indication indicating the index is included in the video data.

21. The video encoding device according to claim 10, wherein the processor is further configured to: determining whether to encode the block using a template-based decoding tool; encoding the block based on determining that encoding the block using a template-based coding tool is prohibited; and An indication is included to indicate that the encoded block is to be decoded independently of the template samples.

22. A method comprising: obtaining a plurality of motion information candidates associated with the block; determining motion information associated with the block; determining an ordering associated with the plurality of motion information candidates based on comparing the corresponding motion information candidates with the determined motion information; as well as The block is decoded based on the determined ordering associated with the plurality of motion information candidates.

23. The method according to claim 22, further comprising: An indication is obtained indicating whether a template based coding tool is enabled for the block, wherein the determining of the ordering associated with the plurality of motion information candidates is performed based on the indication indicating that the template based coding tool is not enabled for the block and is performed independently of reconstructed samples.

24. The method according to claim 22, further comprising: Determine neighboring motion information associated with a neighboring block of the block, wherein the motion information associated with the block is determined based on the neighboring motion information, and the order associated with the plurality of motion information candidates is determined based on comparing the corresponding motion information candidate with the neighboring motion information.

25. The method according to claim 22, further comprising: obtaining global motion information associated with a slice including the block, wherein the motion information associated with the block includes the global motion information associated with the slice, and the ordering associated with the plurality of motion information candidates is determined based on comparing the corresponding motion information candidates with the global motion information associated with the slice.

26. The method of claim 25, wherein the global motion information associated with the slice is obtained via a slice header.

27. The method according to claim 22, further comprising: Obtaining a temporal motion information candidate associated with a reference picture; scaling the temporal motion information candidate based on a temporal distance between the reference picture and a current picture including the block; as well as Global motion information associated with the current picture is determined based on the scaled temporal motion information candidates, wherein the motion information associated with the block includes the global motion information.

28. The method of claim 22, further comprising: Local motion information is derived based on motion information candidates associated with neighboring blocks of the block, wherein the motion information associated with the block includes the derived local motion information.

29. The method of claim 22, wherein determining the ranking associated with the plurality of motion information candidates further comprises: determining, for a first motion information candidate of the plurality of motion information candidates, a first consistency value relative to the obtained motion information; determining, for a second motion information candidate among the plurality of motion information candidates, a second consistency value relative to the obtained motion information; as well as The first motion information candidate is ranked higher than the second motion information candidate based on the first motion information candidate being associated with a higher consistency value than the second motion information candidate.

30. The method of claim 22, wherein determining the ranking associated with the plurality of motion information candidates further comprises: determining, for a first motion information candidate of the plurality of motion information candidates, a first consistency value relative to the obtained motion information; determining, for a second motion information candidate among the plurality of motion information candidates, a second consistency value relative to the obtained motion information; as well as The first motion information candidate is ranked lower than the second motion information candidate based on the first motion information candidate being associated with a higher consistency value than the second motion information candidate.

31. The method of claim 22, wherein determining the ranking associated with the plurality of motion information candidates further comprises: Obtaining a difference between a first motion information candidate and a second motion information candidate among the plurality of motion information candidates; as well as Based on a difference between the first motion information candidate and the second motion information candidate being lower than a threshold, the second motion information candidate is removed.

32. A method comprising: obtaining a plurality of motion information candidates associated with the block; obtaining motion information associated with the block; determining an ordering associated with the plurality of motion information candidates based on comparing the corresponding motion information candidates with the obtained motion information; as well as The block is encoded based on the determined ordering associated with the plurality of motion information candidates.

33. The method of claim 32, wherein the method further comprises: determining whether to perform candidate sorting based on motion information; Based on the determination, motion information based candidate ordering is performed on the block, including an indication indicating enabling of motion information based candidate ordering.

34. The method of claim 33, wherein the indication further indicates that the encoded block is to be decoded based on motion information associated with neighboring blocks of the block.

35. The method of claim 33, wherein the motion information of the block comprises global motion information, and wherein the method further comprises: calculating global motion information associated with a slice including the block, wherein the motion information of the block includes the calculated global motion; as well as An indication of the global motion information is included in the video data.

36. The method of claim 33, wherein the indication further indicates deriving the global motion information based on rescaling the temporal motion information candidates associated with the temporal reference frame, and wherein the indication further indicates rescaling based on temporal distance.

37. The method of claim 33, wherein the motion information of the block is local motion information, and wherein the indication further indicates that the local motion information is derived based on motion information candidates associated with neighboring blocks.

38. A method according to claim 33, wherein the indication also indicates determining a corresponding consistency value associated with the motion information candidate and each of the neighboring blocks, and wherein the indication also indicates determining a ranking of the motion information candidates based on the consistency values, wherein higher consistency values ​​are ranked higher than lower consistency values.

39. The method of claim 32, wherein the indication further indicates determining a first ranking of motion information candidates and a second ranking of motion information candidates, wherein the second ranking of motion information candidates is a revision of the first ranking of motion information candidates. 40 . The method of claim 39 , wherein the indication further indicates that the second ordering of motion information candidates is determined based on the first ordering of motion information candidates and a threshold.

41. The method of claim 33, wherein the method further comprises: selecting a motion predictor for the block from among the plurality of motion information candidates; determining an index of the selected motion predictor based on the ranking associated with the plurality of motion information candidates; and An indication indicating the index is included in the video data.

42. The method of claim 32, wherein the method further comprises: determining whether to encode the block using a template-based decoding tool; encoding the block based on determining that encoding the block using a template-based decoding tool is prohibited; as well as An indication is included to indicate that the encoded block is to be decoded independently of the template samples.

43. A computer readable medium comprising instructions for causing one or more processors to perform the method of any one of claims 22 to 42.

44. A device, comprising: The device according to any one of claims 1 to 21; and At least one of: (i) an antenna configured to receive a signal, the signal comprising data representing an image; (ii) a band limiter configured to limit the received signal to a frequency band comprising the data representing the image; or (iii) a display configured to display the image.

45. Video data comprising data generated by the method according to any one of claims 32 to 42.

46. ​​The device of any one of claims 1 to 21, wherein the device comprises a memory.

Images