EP4736435A1 - Intra block copy geometric partitioning mode (ibc-gpm) with bi-predictive block vectors - Google Patents

Abstract

Systems, devices, and methods are described herein for intra block copy geometric partitioning mode (IBC-GPM) with bi-predictive block vectors. An example device may identify a first block vector (BV) and a second BV associated with a geometry partition of a coding block. The device may generate a prediction sample of the geometry partition based on the first BV and the second BV. The device may decode the coding block based on the prediction sample.

Description

INTRA BLOCK COPY GEOMETRIC PARTITIONING MODE (IBC-GPM) WITH BI-PREDICTIVE BLOCK VECTORS CROSS-REFERENCE TO RELATED APPLICATIONS [0001] This application claims the benefit of European Provisional Patent Application No. EP23306095.3, filed June 30, 2023, the contents of which are hereby incorporated by reference herein. BACKGROUND [0002] Video coding systems may be used to compress digital video signals, e.g., to reduce the storage and/or transmission bandwidth needed for such signals. Video coding systems may include, for example, block-based, wavelet-based, and/or object-based systems. SUMMARY [0003] Systems, devices, and methods are described herein for intra block copy geometric partitioning mode (IBC-GPM) with bi-predictive block vectors. [0004] An example video decoding device may identify a first block vector (BV) and a second BV associated with a geometry partition of a coding block. The device may generate a prediction sample of the geometry partition based on the first BV and the second BV. The device may decode the coding block based on the prediction sample. [0005] The geometry partition may be a first geometry partition. The prediction sample may be a first prediction sample. The device may identify a third BV and a fourth BV associated with a second geometry partition of the coding block. The device may generate a second prediction sample of the second geometry partition based on the third BV and the fourth BV. [0006] The device may decode the coding block based on the first prediction sample and the second prediction sample. [0007] The device may generate a merge candidate list comprising a plurality of bi-predictive merge candidates. The device may receive an indication of a merge index of a bi-predictive merge candidate in the plurality of bi-predictive merge candidates. The first BV and the second BV may be identified based on the indication of the merge index. [0008] The coding block may be a first coding block. The device may determine that a bi-predictive intra prediction mode is enabled for a second coding block. The device may derive a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block. The device may decode the second coding block based on the bi-predictive intra prediction. [0009] The geometry partition may be coded using intra block copy (IBC). [0010] The geometry partition may be a first geometry partition. The first BV and the second BV may be stored in a block field. The device may identify a third BV and a fourth BV associated with a second geometry partition of the coding block. On a condition that the block field is associated with the first geometry partition, the device may store a first combined bi-predictive BV in the block field. The first combined bi-predictive BV may include a combination of the first BV and the second BV. On a condition that the block field is associated with a blended part, the device may store a second combined bi-predictive BV in the block field. The second combined bi-predictive BV may include a combination of the first BV, the second BV, the third BV, and the fourth BV. [0011] The device may generate a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values. The device may store the combined bi-predictive BV. [0012] A method for video decoding may include identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block. The method may include generating a prediction sample of the geometry partition based on the first BV and the second BV. The method may include decoding the coding block based on the prediction sample. [0013] The geometry partition may be a first geometry partition. The prediction sample may be a first prediction sample. The method may include identifying a third BV and a fourth BV associated with a second geometry partition of the coding block. The method may include generating a second prediction sample of the second geometry partition based on the third BV and the fourth BV. [0014] The method may include decoding the coding block based on the first prediction sample and the second prediction sample. [0015] The method may include generating a merge candidate list comprising a plurality of bi-predictive merge candidates. The method may include receiving an indication of a merge index of a bi-predictive merge candidate in the plurality of bi-predictive merge candidates. The first BV and the second BV may be identified based on the indication of the merge index. [0016] The coding block may be a first coding block. The method may include determining that a bi- predictive intra prediction mode is enabled for a second coding block. The method may include deriving a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block. The method may include decoding the second coding block based on the bi-predictive intra prediction. [0017] The geometry partition may be coded using intra block copy (IBC). [0018] The geometry partition may be a first geometry partition. The first BV and the second BV may be stored in a block field. The method may include identifying a third BV and a fourth BV associated with a second geometry partition of the coding block. On a condition that the block field is associated with the first geometry partition, the method may include storing a first combined bi-predictive BV in the block field. The first combined bi-predictive BV may include a combination of the first BV and the second BV. On a condition that the block field is associated with a blended part, the method may include storing a second combined bi-predictive BV in the block field. The second combined bi-predictive BV may include a combination of the first BV, the second BV, the third BV, and the fourth BV. [0019] The method may include generating a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values. The method may include storing the combined bi-predictive BV. [0020] A device for video encoding may identify a first block vector (BV) and a second BV associated with a geometry partition of a coding block. The device may generate a prediction sample of the geometry partition based on the first BV and the second BV. The device may encode the coding block based on the prediction sample. [0021] The geometry partition may be a first geometry partition. The prediction sample may be a first prediction sample. The device may identify a third BV and a fourth BV associated with a second geometry partition of the coding block. The device may generate a second prediction sample of the second geometry partition based on the third BV and the fourth BV. [0022] The device may encode the coding block based on the first prediction sample and the second prediction sample. [0023] The device may generate a merge candidate list comprising a plurality of bi-predictive merge candidates. The device may include, in video data, an indication of a merge index of a bi-predictive merge candidate in the plurality of bi-predictive merge candidates. The first BV and the second BV may be identified based on the indication of the merge index. [0024] The coding block may be a first coding block. The device may determine that a bi-predictive intra prediction mode is enabled for a second coding block. The device may derive a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block. The device may encode the second coding block based on the bi-predictive intra prediction. [0025] The geometry partition may be coded using intra block copy (IBC). [0026] The geometry partition may be a first geometry partition. The first BV and the second BV may be stored in a block field. The device may identify a third BV and a fourth BV associated with a second geometry partition of the coding block. On a condition that the block field is associated with the first geometry partition, the device may store a first combined bi-predictive BV in the block field. The first combined bi-predictive BV may include a combination of the first BV and the second BV. On a condition that the block field is associated with a blended part, the device may store a second combined bi-predictive BV in the block field. The second combined bi-predictive BV may include a combination of the first BV, the second BV, the third BV, and the fourth BV. [0027] The device may generate a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values. The device may store the combined bi-predictive BV. [0028] A method for video encoding may include identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block. The method may include generating a prediction sample of the geometry partition based on the first BV and the second BV. The method may include encoding the coding block based on the prediction sample. [0029] The geometry partition may be a first geometry partition. The prediction sample may be a first prediction sample. The method may include identifying a third BV and a fourth BV associated with a second geometry partition of the coding block. The method may include generating a second prediction sample of the second geometry partition based on the third BV and the fourth BV. [0030] The method may include encoding the coding block based on the first prediction sample and the second prediction sample. [0031] The method may include generating a merge candidate list comprising a plurality of bi-predictive merge candidates. The method may include including, in video data, an indication of a merge index of a bi- predictive merge candidate in the plurality of bi-predictive merge candidates. The first BV and the second BV may be identified based on the indication of the merge index. [0032] The coding block may be a first coding block. The method may include determining that a bi- predictive intra prediction mode is enabled for a second coding block. The method may include deriving a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block. The method may include encoding the second coding block based on the bi-predictive intra prediction. [0033] The geometry partition may be coded using intra block copy (IBC). [0034] The geometry partition may be a first geometry partition. The first BV and the second BV may be stored in a block field. The method may include identifying a third BV and a fourth BV associated with a second geometry partition of the coding block. On a condition that the block field is associated with the first geometry partition, the method may include storing a first combined bi-predictive BV in the block field. The first combined bi-predictive BV may include a combination of the first BV and the second BV. On a condition that the block field is associated with a blended part, the method may include storing a second combined bi-predictive BV in the block field. The second combined bi-predictive BV may include a combination of the first BV, the second BV, the third BV, and the fourth BV. [0035] The method may include generating a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values. The method may include storing the combined bi-predictive BV. [0036] A computer program product which is stored on a non-transitory computer readable medium may include program code instructions for implementing the steps of any one of the methods described herein. [0037] Video data may include information representative of the encoded coding block generated according to any one of the methods described herein. BRIEF DESCRIPTION OF THE DRAWINGS [0038] FIG.1A is a system diagram illustrating an example communications system in which one or more disclosed embodiments may be implemented. [0039] FIG.1B is a system diagram illustrating an example wireless transmit/receive unit (WTRU) that may be used within the communications system illustrated in FIG.1A according to an embodiment. [0040] FIG.1C is a system diagram illustrating an example radio access network (RAN) and an example core network (CN) that may be used within the communications system illustrated in FIG.1A according to an embodiment. [0041] FIG.1D is a system diagram illustrating a further example RAN and a further example CN that may be used within the communications system illustrated in FIG.1A according to an embodiment. [0042] FIG.2 is a diagram showing an example block-based video encoder. [0043] FIG.3 is a diagram showing an example video decoder. [0044] FIG.4 is a diagram showing an example of a system in which various aspects and examples may be implemented. [0045] FIG.5 illustrates a coding unit (CU) being split into partitions by a geometrically located straight line. [0046] FIG.6 illustrates an example weight, ^^^^₀. [0047] FIG.7 illustrates example motion vectors and their respective indices. [0048] FIG.8 illustrates example intra prediction mode (IPM) candidates. [0049] FIG.9A illustrates an example of spatial GPM (SGPM) with one partition mode and two associated IPMs. [0050] FIG.9B illustrates candidates being used to derive a combination of a partition mode and two intra prediction modes. [0051] FIG.10 illustrates an example of reducing the number of possible partition modes and intra prediction modes used in SGPM. [0052] FIG.11 illustrates an example syntax design of intra block copy geometric partitioning mode (IBC-GPM). [0053] FIG.12 illustrates an example modified syntax design of the IBC-GPM. [0054] FIG.13 illustrates example candidate location in a reference region. [0055] FIG.14 illustrates example GPM prediction generation. [0056] FIG.15 illustrates example signaling of merge indices (e.g., from an encoder to a decoder). [0057] FIG.16 illustrates a modified technique for constructing an IBC merge candidate list with a combined bi-predictive merge candidate. DETAILED DESCRIPTION [0058] A detailed description of illustrative embodiments will now be described with reference to the various Figures. Although this description provides a detailed example of possible implementations, it should be noted that the details are intended to be exemplary and in no way limit the scope of the application. [0059] FIG.1A is a diagram illustrating an example communications system 100 in which one or more disclosed embodiments may be implemented. The communications system 100 may be a multiple access system that provides content, such as voice, data, video, messaging, broadcast, etc., to multiple wireless users. The communications system 100 may enable multiple wireless users to access such content through the sharing of system resources, including wireless bandwidth. For example, the communications systems 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 multicarrier (FBMC), and the like. [0060] As shown in FIG.1A, the communications system 100 may include wireless transmit/receive units (WTRUs) 102a, 102b, 102c, 102d, a RAN 104/113, a CN 106/115, a public switched telephone network (PSTN) 108, the Internet 110, and other networks 112, though it will be appreciated 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 a “STA”, may be configured to transmit and/or receive wireless signals and may include a user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a cellular telephone, a personal digital assistant (PDA), a smartphone, 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, a head-mounted display (HMD), a vehicle, a drone, a medical device and applications (e.g., remote surgery), an industrial device and applications (e.g., a robot and/or other wireless devices operating in an industrial and/or an automated processing chain contexts), a consumer electronics device, a device operating on commercial and/or industrial wireless networks, and the like. Any of the WTRUs 102a, 102b, 102c and 102d may be interchangeably referred to as a UE. [0061] The communications systems 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 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 the 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, a NR NodeB, 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. [0062] 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), relay nodes, etc. The base station 114a and/or the base station 114b may be configured to transmit and/or receive wireless signals on one or more carrier frequencies, which may be referred to as a cell (not shown). These frequencies may be in licensed spectrum, unlicensed spectrum, or a combination of licensed and unlicensed spectrum. A cell may provide coverage for a wireless service to a specific geographical area that may be relatively fixed or that may change over time. The cell may further be divided into cell sectors. For example, the cell associated with the base station 114a may be divided into three sectors. Thus, in one embodiment, the base station 114a may include three transceivers, i.e., one 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 transmit and/or receive signals in desired spatial directions. [0063] 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). [0064] More specifically, as noted above, the communications 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, and the like. 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 establish the air interface 115/116/117 using wideband CDMA (WCDMA). 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). [0065] 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), which may establish the air interface 116 using Long Term Evolution (LTE) and/or LTE-Advanced (LTE-A) and/or LTE-Advanced Pro (LTE-A Pro). [0066] 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). [0067] 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 implement LTE radio access and NR radio access together, for instance using dual connectivity (DC) principles. Thus, the air interface utilized by WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and/or transmissions sent to/from multiple types of base stations (e.g., a eNB and a gNB). [0068] 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, CDMA20001X, 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), and the like. [0069] The base station 114b in FIG.1A may be a wireless router, Home Node B, Home eNode B, or access point, for example, and may utilize any suitable RAT for facilitating wireless connectivity in a localized area, such as a place of business, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a roadway, 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 femtocell. As shown in FIG.1A, the base station 114b may have a direct connection to the Internet 110. Thus, the base station 114b may not be required to access the Internet 110 via the CN 106/115. [0070] 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 varying quality of service (QoS) requirements, such as differing throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, and the like. The CN 106/115 may provide call control, billing services, mobile location-based services, pre-paid calling, Internet connectivity, video distribution, etc., and/or perform high-level security functions, such as user authentication. Although not shown in FIG.1A, 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 be utilizing a NR radio technology, the CN 106/115 may also be in communication with another RAN (not shown) employing a GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology. [0071] 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 the other networks 112. The PSTN 108 may include circuit- switched telephone networks that provide 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), user datagram protocol (UDP) and/or the internet protocol (IP) in the TCP/IP internet protocol suite. The networks 112 may include wired and/or wireless communications 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. [0072] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communications 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 over different wireless links). For example, the WTRU 102c shown in FIG.1A 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. [0073] FIG.1B is a system diagram illustrating an example WTRU 102. As shown in FIG.1B, the WTRU 102 may include 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, among others. It will be appreciated that the WTRU 102 may include any sub-combination of the foregoing elements while remaining consistent with an embodiment. [0074] 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 in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) circuits, any other type of integrated circuit (IC), a state machine, and the like. The processor 118 may perform signal coding, 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. While FIG.1B depicts the processor 118 and the transceiver 120 as separate components, it will be appreciated that the processor 118 and the transceiver 120 may be integrated together in an electronic package or chip. [0075] The transmit/receive element 122 may be configured to transmit signals to, or receive signals from, a base station (e.g., the base station 114a) over the air interface 116. For example, in one embodiment, the transmit/receive element 122 may be an antenna configured to transmit and/or receive RF signals. In an embodiment, the transmit/receive element 122 may be an emitter/detector configured to transmit and/or receive IR, UV, or visible light signals, for example. In yet another embodiment, the transmit/receive element 122 may be configured to transmit and/or receive both RF and light signals. It will be appreciated that the transmit/receive element 122 may be configured to transmit and/or receive any combination of wireless signals. [0076] Although the transmit/receive element 122 is depicted in FIG.1B 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. [0077] The transceiver 120 may be configured to modulate the signals that are to be transmitted by the transmit/receive element 122 and to demodulate the signals that are received by the transmit/receive element 122. As noted above, the WTRU 102 may have multi-mode capabilities. Thus, the transceiver 120 may include multiple transceivers for enabling the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11, for example. [0078] The processor 118 of the WTRU 102 may be coupled to, and may receive user input data from, the speaker/microphone 124, the keypad 126, and/or the display/touchpad 128 (e.g., a liquid crystal display (LCD) display unit or 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 the non-removable memory 130 and/or the removable memory 132. The non-removable memory 130 may include random-access memory (RAM), 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, memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown). [0079] The processor 118 may receive power from the power source 134, and may be configured to distribute and/or control the power to the 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, and the like. [0080] 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 over the air interface 116 from a base station (e.g., base stations 114a, 114b) and/or determine its location based on the timing of the signals being received from two or more nearby base stations. It will be appreciated that the WTRU 102 may acquire location information by way of any suitable location- determination method while remaining consistent with an embodiment. [0081] The processor 118 may further be coupled to other peripherals 138, which may include one or more software 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 e-compass, a satellite transceiver, a digital camera (for photographs and/or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands free headset, a Bluetooth® module, a frequency modulated (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, and the like. The peripherals 138 may include one or more sensors, the sensors may be one or more of 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. [0082] The WTRU 102 may include a full duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for both the 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 to reduce and or substantially eliminate self-interference via either hardware (e.g., a choke) or signal processing via a processor (e.g., a separate processor (not shown) or via processor 118). In an embodiment, the WRTU 102 may include a half-duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for either the UL (e.g., for transmission) or the downlink (e.g., for reception)). [0083] FIG.1C is a system diagram illustrating the RAN 104 and the CN 106 according to 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. [0084] The RAN 104 may include eNode-Bs 160a, 160b, 160c, though it will be appreciated that the RAN 104 may include any number of eNode-Bs while remaining consistent with an embodiment. The eNode-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 eNode-Bs 160a, 160b, 160c may implement MIMO technology. Thus, the eNode-B 160a, for example, may use multiple antennas to transmit wireless signals to, and/or receive wireless signals from, the WTRU 102a. [0085] Each of the eNode-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 the UL and/or DL, and the like. As shown in FIG.1C, the eNode-Bs 160a, 160b, 160c may communicate with one another over an X2 interface. [0086] The CN 106 shown in FIG.1C 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 are depicted as part of the CN 106, it will be appreciated that any of these elements may be owned and/or operated by an entity other than the CN operator. [0087] The MME 162 may be connected to each of the eNode-Bs 160a, 160b, 160c 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, and the like. 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. [0088] The SGW 164 may be connected to each of the eNode Bs 160a, 160b, 160c in the RAN 104 via the 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 user planes during inter- eNode B handovers, triggering paging when DL data is available for the WTRUs 102a, 102b, 102c, managing and storing contexts of the WTRUs 102a, 102b, 102c, and the like. [0089] 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. [0090] 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 communicate with, an IP gateway (e.g., an IP multimedia subsystem (IMS) server) that serves 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 the other networks 112, which may include other wired and/or wireless networks that are owned and/or operated by other service providers. [0091] Although the WTRU is described in FIGS.1A-1D as a wireless terminal, it is contemplated that in certain representative embodiments that such a terminal may use (e.g., temporarily or permanently) wired communication interfaces with the communication network. [0092] In representative embodiments, the other network 112 may be a WLAN. [0093] A WLAN in Infrastructure Basic Service Set (BSS) mode may have an Access Point (AP) for the BSS and one or more stations (STAs) associated with the AP. The AP may have an access or an interface to a Distribution System (DS) or another type of wired/wireless network that carries traffic in to and/or out of the BSS. Traffic to STAs that originates from outside the BSS may arrive through the AP and may be delivered to the STAs. Traffic originating from STAs to destinations outside the BSS may be sent to the AP to be delivered to respective destinations. Traffic between STAs within the BSS may be sent through the AP, for example, where the source STA may send traffic to the AP and the AP may deliver the traffic to the destination STA. The traffic between STAs within a BSS may be considered and/or referred to as peer-to- peer traffic. The peer-to-peer traffic may be sent between (e.g., directly between) the source and destination STAs with a direct link setup (DLS). In certain representative embodiments, the DLS may use an 802.11e DLS or an 802.11z tunneled DLS (TDLS). A WLAN using an Independent BSS (IBSS) mode may not have an AP, and the STAs (e.g., all of the STAs) within or using the IBSS may communicate directly with each other. The IBSS mode of communication may sometimes be referred to herein as an “ad- hoc” mode of communication. [0094] When using the 802.11ac infrastructure mode of operation or a similar mode of operations, the AP may transmit a beacon on a fixed channel, such as a primary channel. The primary channel may be a fixed width (e.g., 20 MHz wide bandwidth) or a dynamically set width via signaling. The primary channel may be the operating channel of the BSS and may be used by the STAs to establish a connection with the AP. In certain representative embodiments, Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) may be implemented, for example in in 802.11 systems. For CSMA/CA, the STAs (e.g., every STA), including the AP, may sense the primary channel. If the primary channel is sensed/detected and/or determined to be busy by a particular STA, the particular STA may back off. One STA (e.g., only one station) may transmit at any given time in a given BSS. [0095] High Throughput (HT) STAs may use a 40 MHz wide channel for communication, for example, via a combination of the primary 20 MHz channel with an adjacent or nonadjacent 20 MHz channel to form a 40 MHz wide channel. [0096] Very High Throughput (VHT) STAs may support 20MHz, 40 MHz, 80 MHz, and/or 160 MHz wide channels. The 40 MHz, and/or 80 MHz, channels may be formed by combining contiguous 20 MHz channels. A 160 MHz channel may be formed by combining 8 contiguous 20 MHz channels, or by combining two non-contiguous 80 MHz channels, which may be referred to as an 80+80 configuration. For the 80+80 configuration, the data, after channel encoding, may be passed through a segment parser that may divide the data into two streams. Inverse Fast Fourier Transform (IFFT) processing, and time domain processing, may be done on each stream separately. The streams may be mapped on to the two 80 MHz channels, and the data may be transmitted by a transmitting STA. At the receiver of the receiving STA, the above described operation for the 80+80 configuration may be reversed, and the combined data may be sent to the Medium Access Control (MAC). [0097] Sub 1 GHz modes of operation are supported by 802.11af and 802.11ah. The 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 5 MHz, 10 MHz and 20 MHz bandwidths in the TV White Space (TVWS) spectrum, and 802.11ah supports 1 MHz, 2 MHz, 4 MHz, 8 MHz, and 16 MHz bandwidths using non- TVWS spectrum. According to a representative embodiment, 802.11ah may support Meter Type Control/Machine-Type Communications, such as MTC devices in a macro coverage area. MTC devices may have certain capabilities, for example, limited capabilities including support for (e.g., only support for) certain and/or limited bandwidths. The MTC devices may include a battery with a battery life above a threshold (e.g., to maintain a very long battery life). [0098] WLAN systems, which may support multiple channels, and channel bandwidths, such as 802.11n, 802.11ac, 802.11af, and 802.11ah, include a channel which may be designated as the primary channel. The primary channel may have a bandwidth equal to the largest 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, from among all STAs in operating in a BSS, which supports the smallest bandwidth operating mode. In the example of 802.11ah, the primary channel may be 1 MHz wide for STAs (e.g., MTC type devices) that support (e.g., only support) a 1 MHz mode, even if the AP, and other STAs in the BSS support 2 MHz, 4 MHz, 8 MHz, 16 MHz, and/or other channel bandwidth operating modes. Carrier sensing and/or Network Allocation Vector (NAV) settings may depend on the status of the primary channel. If the primary channel is busy, for example, due to a STA (which supports only a 1 MHz operating mode), transmitting to the AP, the entire available frequency bands may be considered busy even though a majority of the frequency bands remains idle and may be available. [0099] In the United States, the available frequency bands, which may be used by 802.11ah, are from 902 MHz to 928 MHz. In Korea, the available frequency bands are from 917.5 MHz to 923.5 MHz. In Japan, the available frequency bands are from 916.5 MHz to 927.5 MHz. The total bandwidth available for 802.11ah is 6 MHz to 26 MHz depending on the country code. [0100] FIG.1D is a system diagram illustrating the RAN 113 and the CN 115 according to an embodiment. As noted above, the RAN 113 may employ an 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. [0101] 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, gNBs 180a, 108b may utilize beamforming to transmit signals to and/or receive signals from the gNBs 180a, 180b, 180c. Thus, the gNB 180a, for example, may use multiple antennas to transmit 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, the gNB 180a may transmit multiple component carriers to the 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, the 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). [0102] The WTRUs 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c using transmissions associated with a scalable numerology. For example, the 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 gNBs 180a, 180b, 180c using subframe or transmission time intervals (TTIs) of various or scalable lengths (e.g., containing varying number of OFDM symbols and/or lasting varying lengths of absolute time). [0103] 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 the standalone configuration, WTRUs 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c without also accessing other RANs (e.g., such as eNode-Bs 160a, 160b, 160c). In the standalone configuration, WTRUs 102a, 102b, 102c may utilize one or more of gNBs 180a, 180b, 180c as a mobility anchor point. In the standalone configuration, WTRUs 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c using signals in an unlicensed band. In a non-standalone configuration WTRUs 102a, 102b, 102c may communicate with/connect to gNBs 180a, 180b, 180c while also communicating with/connecting to another RAN such as eNode-Bs 160a, 160b, 160c. For example, WTRUs 102a, 102b, 102c may implement DC principles to communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c substantially simultaneously. In the non-standalone configuration, eNode-Bs 160a, 160b, 160c may serve as a mobility anchor for WTRUs 102a, 102b, 102c and gNBs 180a, 180b, 180c may provide additional coverage and/or throughput for servicing WTRUs 102a, 102b, 102c. [0104] 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 the UL and/or DL, support of network slicing, dual connectivity, interworking between NR and E- UTRA, routing of user plane data towards User Plane Function (UPF) 184a, 184b, routing of control plane information towards Access and Mobility Management Function (AMF) 182a, 182b and the like. As shown in FIG.1D, the gNBs 180a, 180b, 180c may communicate with one another over an Xn interface. [0105] The CN 115 shown in FIG.1D may include at least one AMF 182a, 182b, at least one UPF 184a,184b, at least one Session Management Function (SMF) 183a, 183b, and possibly a Data Network (DN) 185a, 185b. While each of the foregoing elements are depicted as part of the CN 115, it will be appreciated that any of these elements may be owned and/or operated by an entity other than the CN operator. [0106] The AMF 182a, 182b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via an N2 interface and may serve as a control node. For example, the AMF 182a, 182b may be responsible for authenticating users of the WTRUs 102a, 102b, 102c, support for network slicing (e.g., handling of different PDU sessions with different requirements), selecting a particular SMF 183a, 183b, management of the registration area, termination of NAS signaling, mobility management, and the like. Network slicing may be used by the AMF 182a, 182b to customize CN support for WTRUs 102a, 102b, 102c based on the types of services being utilized WTRUs 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 massive mobile broadband (eMBB) access, services for machine type communication (MTC) access, and/or the like. 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. [0107] The SMF 183a, 183b may be connected to an AMF 182a, 182b in the CN 115 via an N11 interface. The SMF 183a, 183b may also be connected to a UPF 184a, 184b in the CN 115 via an N4 interface. The SMF 183a, 183b may select and control the UPF 184a, 184b and configure the routing of traffic through the UPF 184a, 184b. The SMF 183a, 183b may perform other functions, such as managing and allocating UE IP address, managing PDU sessions, controlling policy enforcement and QoS, providing downlink data notifications, and the like. A PDU session type may be IP-based, non-IP based, Ethernet- based, and the like. [0108] The UPF 184a, 184b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via an 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, and the like. [0109] 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 serves 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 the other networks 112, which may include other wired and/or wireless networks that are owned and/or operated by other service providers. In one embodiment, the WTRUs 102a, 102b, 102c may be connected to a local Data Network (DN) 185a, 185b through the UPF 184a, 184b via the N3 interface to the UPF 184a, 184b and an N6 interface between the UPF 184a, 184b and the DN 185a, 185b. [0110] In view of Figures 1A-1D, and the corresponding description of Figures 1A-1D, one or more, or all, of the functions described herein with regard to one or more of: WTRU 102a-d, Base Station 114a-b, eNode-B 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF 182a-b, UPF 184a-b, SMF 183a-b, DN 185a-b, and/or any other device(s) described herein, may be performed by one or more emulation devices (not shown). The emulation devices may be one or more devices configured to emulate one or more, or all, of the functions described herein. For example, the emulation devices may be used to test other devices and/or to simulate network and/or WTRU functions. [0111] The emulation devices may be designed to implement one or more tests of other devices in a lab environment and/or in an operator network environment. For example, the one or more emulation devices may perform the one or more, 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. The one or more emulation devices may perform the one or more, or all, functions while being temporarily implemented/deployed as part of a wired and/or wireless communication network. The emulation device may be directly coupled to another device for purposes of testing and/or may perform testing using over-the-air wireless communications. [0112] The one or more emulation devices may perform the one or more, including all, functions while not being implemented/deployed as part of a wired and/or wireless communication network. For example, the emulation devices may be utilized in a testing scenario in a testing laboratory and/or a non-deployed (e.g., testing) wired and/or wireless communication network in order to implement testing of one or more components. The one or more emulation devices may be test equipment. Direct RF coupling and/or wireless communications via RF circuitry (e.g., which may include one or more antennas) may be used by the emulation devices to transmit and/or receive data. [0113] This application describes a variety of aspects, including tools, features, examples or embodiments, models, approaches, etc. Many of these aspects are described with specificity and, at least to show the individual characteristics, are often described in a manner that may sound limiting. However, this is for purposes of clarity in description, and does not limit the application or scope of those aspects. Indeed, all of the different aspects may be combined and interchanged to provide further aspects. Moreover, the aspects may be combined and interchanged with aspects described in earlier filings as well. [0114] The aspects described and contemplated in this application may be implemented in many different forms. FIGS.5-16 described herein may provide some embodiments, but other embodiments are contemplated. The discussion of FIGS.5-16 does not limit the breadth of the implementations. At least one of the aspects generally relates to video encoding and decoding, and at least one other aspect generally relates to transmitting a bitstream generated or encoded. These and other aspects may be implemented as a method, an apparatus, a computer readable storage medium having stored thereon instructions for encoding or decoding video data according to any of the methods described, and/or a computer readable storage medium having stored thereon a bitstream generated according to any of the methods described. [0115] In the present application, the terms “reconstructed” and “decoded” may be used interchangeably, the terms “pixel” and “sample” may be used interchangeably, the terms “image,” “picture” and “frame” may be used interchangeably. [0116] The terms HDR (high dynamic range) and SDR (standard dynamic range) may be used in this disclosure. Those terms often convey specific values of dynamic range to those of ordinary skill in the art. However, additional embodiments are also intended in which a reference to HDR is understood to mean “higher dynamic range” and a reference to SDR is understood to mean “lower dynamic range.” Such additional embodiments are not constrained by any specific values of dynamic range that might often be associated with the terms “high dynamic range” and “standard dynamic range.” [0117] Various methods are described herein, and each of the methods comprises one or more steps or actions for achieving the described method. Unless a specific order of steps or actions is required for proper operation of the method, the order and/or use of specific steps and/or actions may be modified or combined. Additionally, terms such as “first”, “second”, etc. may be used in various embodiments to modify an element, component, step, operation, etc., such as, for example, a “first decoding” and a “second decoding”. Use of such terms does not imply an ordering to the modified operations unless specifically required. So, in this example, the first decoding need not be performed before the second decoding, and may occur, for example, before, during, or in an overlapping time period with the second decoding. [0118] Various methods and other aspects described in this application may be used to modify modules, for example, intra prediction modules (260 and 360), of a video encoder 200 and decoder 300 as shown in FIG.2 and FIG.3, respectively. Moreover, the subject matter disclosed herein presents aspects that are not limited to VVC or HEVC, and may be applied, for example, to any type, format or version of video coding, whether described in a standard or a recommendation, whether pre-existing or future-developed, and extensions of any such standards and recommendations (e.g., including VVC and HEVC). Unless indicated otherwise, or technically precluded, the aspects described in this application may be used individually or in combination. [0119] Various numeric values are used in examples described the present application, such as table sizes, block sizes, pixel precision, indices, etc. These and other specific values are for purposes of describing examples and the aspects described are not limited to these specific values. [0120] FIG.2 is a diagram showing an example video encoder (e.g., an example block-based hybrid video encoder) 200. Variations of example encoder 200 are contemplated, but the encoder 200 is described below for purposes of clarity without describing all expected variations. [0121] Before being encoded, the video sequence may go through pre-encoding processing (201), for example, applying a color transform to the input color picture (e.g., conversion from RGB 4:4:4 to YCbCr 4:2:0), or performing a remapping of the input picture components in order to get a signal distribution more resilient to compression (for instance using a histogram equalization of one of the color components). Metadata may be associated with the pre-processing, and attached to the bitstream. [0122] In the encoder 200, a picture is encoded by the encoder elements as described below. The picture to be encoded is partitioned (202) and processed in units of, for example, coding units (CUs). Each unit is encoded using, for example, either an intra or inter mode. When a unit is encoded in an intra mode, it performs intra prediction (260). In an inter mode, motion estimation (275) and compensation (270) are performed. The encoder decides (205) which one of the intra mode or inter mode to use for encoding the unit, and indicates the intra/inter decision by, for example, a prediction mode flag. Prediction residuals are calculated, for example, by subtracting (210) the predicted block from the original image block. [0123] The prediction residuals are then transformed (225) and quantized (230). The quantized transform coefficients, as well as motion vectors and other syntax elements, are entropy coded (245) to output a bitstream. The encoder can skip the transform and apply quantization directly to the non- transformed residual signal. The encoder can bypass both transform and quantization, i.e., the residual is coded directly without the application of the transform or quantization processes. [0124] The encoder decodes an encoded block to provide a reference for further predictions. The quantized transform coefficients are de-quantized (240) and inverse transformed (250) to decode prediction residuals. Combining (255) the decoded prediction residuals and the predicted block, an image block is reconstructed. In-loop filters (265) are applied to the reconstructed picture to perform, for example, deblocking/SAO (Sample Adaptive Offset) filtering to reduce encoding artifacts. The filtered image is stored at a reference picture buffer (280). [0125] FIG.3 is a diagram showing an example of a video decoder 300. In example decoder 300, a bitstream is decoded by the decoder elements as described below. Video decoder 300 generally performs a decoding pass reciprocal to the encoding pass as described in FIG.2. The encoder 200 also generally performs video decoding as part of encoding video data. [0126] In particular, the input of the decoder includes a video bitstream, which may be generated by video encoder 200. The bitstream is first entropy decoded (330) to obtain transform coefficients, motion vectors, and other coded information. The picture partition information indicates how the picture is partitioned. The decoder may therefore divide (335) the picture according to the decoded picture partitioning information. The transform coefficients are de-quantized (340) and inverse transformed (350) to decode the prediction residuals. Combining (355) the decoded prediction residuals and the predicted block, an image block is reconstructed. The predicted block may be obtained (370) from intra prediction (360) or motion-compensated prediction (i.e., inter prediction) (375). In-loop filters (365) are applied to the reconstructed image. The filtered image is stored at a reference picture buffer (380). For a given picture, the contents of the reference picture buffer 380 on the decoder 300 side may be identical to the contents of the reference picture buffer 280 on the encoder 200 side for the same picture. [0127] The decoded picture can further go through post-decoding processing (385), for example, an inverse color transform (e.g., conversion from YCbCr 4:2:0 to RGB 4:4:4) or an inverse remapping performing the inverse of the remapping process performed in the pre-encoding processing (201). The post-decoding processing can use metadata derived in the pre-encoding processing and signaled in the bitstream. [0128] FIG.4 is a diagram showing an example of a system in which various aspects and embodiments described herein may be implemented. System 400 may be embodied as a device including the various components described below and is configured to perform one or more 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, smartphones, tablet computers, digital multimedia set top boxes, digital television receivers, personal video recording systems, connected home appliances, and servers. Elements of system 400, singly or in combination, may be embodied in a single integrated circuit (IC), multiple ICs, and/or discrete components. For example, in at least one example, the processing and encoder/decoder elements of system 400 are distributed across multiple ICs and/or discrete components. In various embodiments, the system 400 is communicatively coupled to one or more other systems, or other electronic devices, via, for example, a communications bus or through dedicated input and/or output ports. In various embodiments, the system 400 is configured to implement one or more of the aspects described in this document. [0129] The system 400 includes at least one processor 410 configured to execute instructions loaded therein for implementing, for example, the various aspects described in this document. Processor 410 can include embedded memory, input output interface, and various other circuitries 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). System 400 includes a storage device 440, which can include non-volatile memory and/or volatile memory, including, but not limited to, Electrically Erasable Programmable Read-Only Memory (EEPROM), Read-Only Memory (ROM), Programmable Read-Only Memory (PROM), Random Access Memory (RAM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), flash, magnetic disk drive, and/or optical disk drive. The storage device 440 can include an internal storage device, an attached storage device (including detachable and non-detachable storage devices), and/or a network accessible storage device, as non-limiting examples. [0130] System 400 includes an encoder/decoder module 430 configured, for example, to process data to provide an encoded video or decoded video, and the encoder/decoder module 430 can include its own processor and memory. The encoder/decoder module 430 represents module(s) that may be included in a device to perform the encoding and/or decoding functions. As is known, a device can include one or both of the encoding and decoding modules. Additionally, encoder/decoder module 430 may be implemented as a separate element of system 400 or may be incorporated within processor 410 as a combination of hardware and software as known to those skilled in the art. [0131] Program code to be loaded onto processor 410 or encoder/decoder 430 to perform the various aspects described in this document may be stored in storage device 440 and subsequently loaded onto memory 420 for execution by processor 410. In accordance with various embodiments, one or more of processor 410, memory 420, storage device 440, and encoder/decoder module 430 can store one or more of various items during the performance of the processes described in this document. Such stored items can include, but are not limited to, the input video, the decoded video or portions of the decoded video, the bitstream, matrices, variables, and intermediate or final results from the processing of equations, formulas, operations, and operational logic. [0132] In some embodiments, memory inside of the processor 410 and/or the encoder/decoder module 430 is used to store instructions and to provide working memory for processing that is needed during encoding or decoding. In other embodiments, however, a memory external to the processing device (for example, the processing device may be either the processor 410 or the encoder/decoder module 430) is used for one or more of these functions. The external memory may be the memory 420 and/or the storage device 440, for example, a dynamic volatile memory and/or a non-volatile flash memory. In several embodiments, an external non-volatile flash memory is used to store the operating system of, for example, a television. In at least one embodiment, a fast external dynamic volatile memory such as a RAM is used as working memory for video coding and decoding operations, such as, for example, MPEG-2 (MPEG refers to the Moving Picture Experts Group, MPEG-2 is also referred to as ISO/IEC 13818, and 13818-1 is also known as H.222, and 13818-2 is also known as H.262), HEVC (HEVC refers to High Efficiency Video Coding, also known as H.265 and MPEG-H Part 2), or VVC (Versatile Video Coding, a new standard being developed by JVET, the Joint Video Experts Team). [0133] The input 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) portion that receives an RF signal transmitted, for example, 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, not shown in FIG. 4, include composite video. [0134] In various embodiments, the input devices of block 445 have associated respective input processing elements as known in the art. For example, the RF portion may be associated with elements suitable for (i) selecting a desired frequency (also referred to as selecting a signal, or band-limiting a signal to a band of frequencies), (ii) down-converting the selected signal, (iii) band-limiting again to a narrower band of frequencies to select (for example) a signal frequency band which may be referred to as a channel in certain embodiments, (iv) demodulating the down-converted and band-limited signal, (v) performing error correction, and (vi) demultiplexing to select the desired stream of data packets. The RF portion of various embodiments includes one or more elements to perform these functions, for example, frequency selectors, signal selectors, band-limiters, channel selectors, filters, downconverters, demodulators, error correctors, and demultiplexers. The RF portion can include a tuner that performs various of these functions, including, for example, down-converting the received signal to a lower frequency (for example, an intermediate frequency or a near-baseband frequency) or to baseband. In one set-top box embodiment, the RF portion and its associated input processing element receives an RF signal transmitted over a wired (for example, cable) medium, and performs frequency selection by filtering, down-converting, and filtering again to a desired frequency band. Various embodiments rearrange the order of the above-described (and other) elements, remove some of these elements, and/or add other elements performing similar or different functions. Adding elements can include inserting elements in between existing elements, such as, for example, inserting amplifiers and an analog-to-digital converter. In various embodiments, the RF portion includes an antenna. [0135] Additionally, the USB and/or HDMI terminals can include respective interface processors for connecting system 400 to other electronic devices across USB and/or HDMI connections. It is to be understood that various aspects of input processing, for example, Reed-Solomon error correction, may be implemented, for example, within a separate input processing IC or within processor 410 as necessary. Similarly, aspects of USB or HDMI interface processing may be implemented within separate interface ICs or within processor 410 as necessary. The demodulated, error corrected, and demultiplexed stream is provided to various processing elements, including, for example, processor 410, and encoder/decoder 430 operating in combination with the memory and storage elements to process the data stream as necessary for presentation on an output device. [0136] Various elements of system 400 may be provided within an integrated housing, Within the integrated housing, the various elements may be interconnected and transmit data therebetween using suitable connection arrangement 425, for example, an internal bus as known in the art, including the Inter- IC (I2C) bus, wiring, and printed circuit boards. [0137] The system 400 includes communication interface 450 that enables communication with other devices via communication channel 460. The communication interface 450 can include, but is not limited to, a transceiver configured to transmit and to receive data over communication channel 460. The communication interface 450 can include, but is not limited to, a modem or network card and the communication channel 460 may be implemented, for example, within a wired and/or a wireless medium. [0138] Data is streamed, or otherwise provided, to the system 400, in various embodiments, using a wireless network such as a Wi-Fi network, for example IEEE 802.11 (IEEE refers to the Institute of Electrical and Electronics Engineers). The Wi-Fi signal of these examples is received over the communications channel 460 and the communications interface 450 which are adapted for Wi-Fi communications. The communications channel 460 of these embodiments is typically connected to an access point or router that provides access to external networks including the Internet for allowing streaming applications and other over-the-top communications. Other embodiments provide streamed data to the system 400 using a set-top box that delivers the data over the HDMI connection of the input block 445. Still other embodiments provide streamed data to the system 400 using the RF connection of the input block 445. As indicated above, various embodiments provide data in a non-streaming manner. Additionally, various embodiments use wireless networks other than Wi-Fi, for example a cellular network or a Bluetooth network. [0139] The system 400 can provide an output signal to various output devices, including a display 475, speakers 485, and other peripheral devices 495. The display 475 of various embodiments includes one or more of, for example, a touchscreen display, an organic light-emitting diode (OLED) display, a curved display, and/or a foldable display. The display 475 may be for a television, a tablet, a laptop, a cell phone (mobile phone), or other device. The display 475 can also be integrated with other components (for example, as in a smart phone), or separate (for example, an external monitor for a laptop). The other peripheral devices 495 include, in various examples of embodiments, one or more of a stand-alone digital video disc (or digital versatile disc) (DVR, for both terms), a disk player, a stereo system, and/or a lighting system. Various embodiments use one or more peripheral devices 495 that provide a function based on the output of the system 400. For example, a disk player performs the function of playing the output of the system 400. [0140] In various embodiments, control signals are communicated between the system 400 and the display 475, speakers 485, or other peripheral devices 495 using signaling such as AV.Link, Consumer Electronics Control (CEC), or other communications protocols that enable device-to-device control with or without user intervention. The output devices may be communicatively coupled to system 400 via dedicated connections through respective interfaces 470, 480, and 490. Alternatively, the output devices may be connected to system 400 using the communications channel 460 via the communications interface 450. The display 475 and speakers 485 may be integrated in a single unit with the other components of system 400 in an electronic device such as, for example, a television. In various embodiments, the display interface 470 includes a display driver, such as, for example, a timing controller (T Con) chip. [0141] The display 475 and speakers 485 can alternatively be separate from one or more of the other components, for example, if the RF portion of input 445 is part of a separate set-top box. In various embodiments in which the display 475 and speakers 485 are external components, the output signal may be provided via dedicated output connections, including, for example, HDMI ports, USB ports, or COMP outputs. [0142] The embodiments may be carried out by computer software implemented by the processor 410 or by hardware, or by a combination of hardware and software. As a non-limiting example, the embodiments may be implemented by one or more integrated circuits. The memory 420 may be of any type appropriate to the technical environment and may be implemented using any appropriate data storage technology, such as optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memory, and removable memory, as non-limiting examples. The processor 410 may be of any type appropriate to the technical environment, and can encompass one or more of microprocessors, general purpose computers, special purpose computers, and processors based on a multi-core architecture, as non-limiting examples. [0143] Various implementations involve decoding. “Decoding”, as used in this application, can encompass all or part of the processes performed, for example, on a received encoded sequence in order to produce a final output suitable for display. In various embodiments, such processes include one or more of the processes typically performed by a decoder, for example, entropy decoding, inverse quantization, inverse transformation, and differential decoding. In various embodiments, such processes also, or alternatively, include processes performed by a decoder of various implementations described in this application, for example, identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generating a prediction sample of the geometry partition based on the first BV and the second BV; decoding the coding block based on the prediction sample, etc. [0144] As further embodiments, in one example “decoding” refers only to entropy decoding, in another embodiment “decoding” refers only to differential decoding, and in another embodiment “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 generally to the broader decoding process will be clear based on the context of the specific descriptions and is believed to be well understood by those skilled in the art. [0145] Various implementations involve encoding. In an analogous way to the above discussion about “decoding”, “encoding” as used in this application can encompass all or part of the processes performed, for example, on an input video sequence in order to produce an encoded bitstream. In various embodiments, such processes include one or more of the processes typically performed by an encoder, for example, partitioning, differential encoding, transformation, quantization, and entropy encoding. In various embodiments, such processes also, or alternatively, include processes performed by an encoder of various implementations described in this application, for example, identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generating a prediction sample of the geometry partition based on the first BV and the second BV; encoding the coding block based on the prediction sample, etc. [0146] As further examples, in one embodiment “encoding” refers only to entropy encoding, in another embodiment “encoding” refers only to differential encoding, and in another embodiment “encoding” refers to a combination of differential encoding and entropy encoding. Whether the phrase “encoding process” is intended to refer specifically to a subset of operations or generally to the broader encoding process will be clear based on the context of the specific descriptions and is believed to be well understood by those skilled in the art. [0147] Note that syntax elements as used herein, for example, IBC_GPM_flag, pic_fpel_mmvd_enabled_flag, ibc_gpm_partition_idx, angleIdx, distanceIdx, etc., are descriptive terms. As such, they do not preclude the use of other syntax element names. [0148] When a figure is presented as a flow diagram, it should be understood that it also provides a block diagram of a corresponding apparatus. Similarly, when a figure is presented as a block diagram, it should be understood that it also provides a flow diagram of a corresponding method/process. [0149] Various embodiments refer to rate distortion optimization. In particular, during the encoding process, the balance or trade-off between the rate and distortion is usually considered, often given the constraints of computational complexity. The rate distortion optimization is usually formulated as minimizing a rate distortion function, which is a weighted sum of the rate and of the distortion. There are different approaches to solve the rate distortion optimization problem. For example, the approaches may be based on an extensive testing of all encoding options, including all considered modes or coding parameters values, with a complete evaluation of their coding cost and related distortion of the reconstructed signal after coding and decoding. Faster approaches may also be used, to save encoding complexity, in particular with computation of an approximated distortion based on the prediction or the prediction residual signal, not the reconstructed one. Mix of these two approaches can also be used, such as by using an approximated distortion for only some of the possible encoding options, and a complete distortion for other encoding options. Other approaches only evaluate a subset of the possible encoding options. More generally, many approaches employ any of a variety of techniques to perform the optimization, but the optimization is not necessarily a complete evaluation of both the coding cost and related distortion. [0150] The implementations and aspects described herein may be implemented in, for example, a method or a process, an apparatus, a software program, a data stream, or a signal. Even if only discussed in the context of a single form of implementation (for example, discussed only as a method), the implementation of features discussed can also be implemented in other forms (for example, an apparatus or program). An apparatus may be implemented in, for example, appropriate hardware, software, and firmware. The methods may be implemented in, for example, a processor, which refers to processing devices in general, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. Processors also include communication devices, such as, for example, computers, cell phones, portable/personal digital assistants ("PDAs"), and other devices that facilitate communication of information between end-users. [0151] Reference to “one embodiment,” “an embodiment,” “an example,” “one implementation” or “an implementation,” as well as other variations thereof, means that a particular feature, structure, characteristic, and so forth described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrase “in one embodiment,” “in an embodiment,” “in an example,” “in one implementation,” or “in an implementation”, as well any other variations, appearing in various places throughout this application are not necessarily all referring to the same embodiment or example. [0152] Additionally, this application may refer to “determining” various pieces of information. Determining the information can include one or more of, for example, estimating the information, calculating the information, predicting the information, or retrieving the information from memory. Obtaining may include receiving, retrieving, constructing, generating, and/or determining. [0153] Further, this application may refer to “accessing” various pieces of information. Accessing the information can include one or more of, for example, receiving the information, retrieving the information (for example, from memory), storing the information, moving the information, copying the information, calculating the information, determining the information, predicting the information, or estimating the information. [0154] Additionally, this application may refer to “receiving” various pieces of information. Receiving is, as with “accessing”, intended to be a broad term. Receiving the information can include one or more of, for example, accessing the information, or retrieving the information (for example, from memory). Further, “receiving” is typically involved, in one way or another, during operations such as, for example, storing the information, processing the information, transmitting the information, moving the information, copying the information, erasing the information, calculating the information, determining the information, predicting the information, or estimating the information. [0155] It is to be appreciated that the use of any of the following “/”, “and/or”, and “at least one of”, for example, in the cases of “A/B”, “A and/or B” and “at least one of A and B”, is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of both options (A and B). As a further example, in the cases of “A, B, and/or C” and “at least one of A, B, and C”, such phrasing is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of the third listed option (C) only, or the selection of the first and the second listed options (A and B) only, or the selection of the first and third listed options (A and C) only, or the selection of the second and third listed options (B and C) only, or the selection of all three options (A and B and C). This may be extended, as is clear to one of ordinary skill in this and related arts, for as many items as are listed. [0156] Also, as used herein, the word “signal” refers to, among other things, indicating something to a corresponding decoder. For example, in some embodiments the encoder signals (e.g., to a decoder) a size index of a filter or set of filters, etc. In this way, in an embodiment the same parameter is used at both the encoder side and the decoder side. Thus, for example, an encoder can transmit (explicit signaling) a particular parameter to the decoder so that the decoder can use the same particular parameter. Conversely, if the decoder already has the particular parameter as well as others, then signaling may be used without transmitting (implicit signaling) to simply allow the decoder to know and select the particular parameter. By avoiding transmission of any actual functions, a bit savings is realized in various embodiments. It is to be appreciated that signaling may be accomplished in a variety of ways. For example, one or more syntax elements, flags, and so forth are used to signal information to a corresponding decoder in various embodiments. While the preceding relates to the verb form of the word “signal”, the word “signal” can also be used herein as a noun. [0157] As will be evident to one of ordinary skill in the art, implementations may produce a variety of signals formatted to carry information that may be, for example, stored or transmitted. The information can include, for example, instructions for performing a method, or data produced by one of the described implementations. For example, a signal may be formatted to carry the bitstream of a described embodiment. Such a signal may be formatted, for example, as an electromagnetic wave (for example, using a radio frequency portion of spectrum) or as a baseband signal. The formatting may include, for example, encoding a data stream and modulating a carrier with the encoded data stream. The information that the signal carries may be, for example, analog or digital information. The signal may be transmitted over a variety of different wired or wireless links, as is known. The signal may be stored on a processor- readable medium. [0158] Many embodiments are described herein. Features of embodiments may be provided alone or in any combination, across various claim categories and types. Further, embodiments may include one or more of the features, devices, or aspects described herein, alone or in any combination, across various claim categories and types. For example, features described herein can be implemented in a bitstream or signal that includes information generated as described herein. The information can allow a decoder to decode a bitstream, the encoder, bitstream, and/or decoder according to any of the embodiments described. For example, features described herein can be implemented by creating and/or transmitting and/or receiving and/or decoding a bitstream or signal. For example, features described herein can be implemented a method, process, apparatus, medium storing instructions, medium storing data, or signal. For example, features described herein can be implemented by a TV, set-top box, cell phone, tablet, or other electronic device that performs decoding. The TV, set-top box, cell phone, tablet, or other electronic device can display (e.g., using a monitor, screen, or other type of display) a resulting image (e.g., an image from residual reconstruction of the video bitstream). The TV, set-top box, cell phone, tablet, or other electronic device can receive a signal including an encoded image and perform decoding. [0159] Feature(s) associated with geometric partition mode (GPM) (e.g., also sometimes referred to as geometric merge mode (GEO)) are provided herein. [0160] A GPM (e.g., with 64 partitions in total) may be used for inter prediction. If the GPM is used, a block (e.g., a coding unit (CU)) may be split into partitions (e.g., two partitions) by a geometrically located straight line, as illustrated in FIG.5). The location of the splitting line may be derived (e.g., mathematically derived) from the angle ^^^^ _^^^^ and distance offset ^^^^ _^^^^ of a specific partition. A partition (e.g., each partition) in the CU may be inter-predicted using its own motion parameters. Uni-prediction (e.g., only uni-prediction) may be allowed for a partition (e.g., each partition). For example, a partition (e.g., each partition) may have a (e.g., one) motion vector and a (e.g., one) reference index. The sample values along the splitting edge may be adjusted (e.g., after predicting each of the partitions). For example, the sample values along the splitting edge may be adjusted using a blending process with adaptive weights. [0161] The blending weight for a position (e.g., each position) of the CU may be derived based on the ^{distance between the position (e.g., individual position) and the partition edge. The distance for a position} _{( ^^^^, ^^^^) to the partition edge may be derived as follows: ^^^^} ⁽ _{^^^^, ^^^^} ⁾ ₌ ⁽ _{2 ^^^^ + 1 − ^^^^} ⁾ _cos ⁽ _{^^^^ ^^^^} ⁾ ₊ ⁽ _{2 ^^^^ + 1 − ℎ} ⁾ _sin ⁽ _{^^^^ ^^^^} ⁾ _{− ^^^^ ^^^^ (1)} [0162] The weights for a part (e.g., each part) of a geometric partition may be derived as follows: ^_{^^^ ^^^^ ^^^^ ^^^^ ^^^^} ⁽ _{^^^^, ^^^^} ⁾ _{= ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ ? 32 + ^^^^} ⁽ _{^^^^, ^^^^} ⁾ _{∶ 32 − ^^^^} ⁽ _{^^^^, ^^^^} ⁾ ₍₂₎ ^^^^₁( ^^^^, ^^^^) = 1 − ^^^^₀( ^^^^, ^^^^) (4) where ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ ^^^^ depends on the angle index ^^^^. FIG.6 illustrates an example weight, ^^^^₀. [0163] Feature(s) associated with uni-prediction candidate list construction for GPM are provided herein. [0164] The GPM uni-prediction candidate list may be derived (e.g., directly) from a merge candidate list (e.g., the merge candidate list constructed according to the extended merge prediction process). The index of the uni-prediction motion in the GPM uni-prediction candidate list may be denoted as ^^^^. The LX motion vector of the ^^^^-th extended merge candidate (e.g., with X equal to the parity of ^^^^) may be used as the ^^^^-th uni-prediction motion vector for GPM partition mode. FIG.7 illustrates example motion vectors (e.g., marked with an “x” in FIG.7) and their respective indices. If a corresponding LX motion vector of the ^^^^-th extended merge candidate does not exist, the L(1-X) motion vector of the candidate (e.g., the same candidate) may be used (e.g., instead) as the uni-prediction motion vector for the GPM candidate. [0165] Up to five uni-prediction candidates may be used. An encoder may test combinations of candidates (e.g., one combination for each partition) with the splitting directions and offsets. [0166] Feature(s) associated with motion field storage for geometric partitioning mode are provided herein. [0167] MV1 may be from the first part of the geometric partition. MV2 may be from the second part of the geometric partition. A combined MV may be generated from MV1 and MV2. MV1, MV2, and the combined MV may be stored in the motion field of a geometric partitioning mode coded CU. [0168] If the motion field is part of partition 0 (white part of FIG.6) or 1 (black part of FIG.6), MV1 or MV2 may be stored in the corresponding motion field. Otherwise, if the motion field belongs to the blended part (grey part of FIG.6), a combined MV from MV1 and MV2 may be stored. The combined MV may be generated. If MV1 and MV2 are from different reference picture lists (e.g., one from L0 and the other from L1), then MV1 and MV2 may be combined to form the bi-prediction motion vectors; or (e.g., otherwise) if MV1 and MV2 are from the same list, MV2 (e.g., only uni-prediction motion MV2) may be stored. [0169] Feature(s) associated with GPM with merge motion vector differences (GPM-MMVD) are provided herein. [0170] GPM may be extended by applying motion vector refinement (e.g., on top of the existing GPM uni-directional MVs). A flag may be signaled (e.g., first signaled) for a GPM CU. The flag may specify whether the GPM-MMVD mode is used. If the GPM-MMVD mode is used, a geometric partition (e.g., each geometric partition) of a GPM CU may decide (e.g., further decide) whether to signal MVD or not. If MVD is signaled for a geometric partition (e.g., after a GPM merge candidate is selected) the motion of the partition may be refined (e.g., further refined) by the signaled MVD’s information. Other processes (e.g., all other procedures) may be kept the same as, or similar to, those in GPM. [0171] The MVD may be signaled as a pair of distance and direction (e.g., which may be similar to what is signaled in merge motion vector differences (MMVD)). One or more (e.g., nine) candidate distances (e.g., ¼-pel, ½-pel, 1-pel, 2-pel, 3-pel, 4-pel, 6-pel, 8-pel, 16-pel), and one or more (e.g., eight) candidate directions (e.g., four horizontal/vertical directions and four diagonal directions) may be involved in GPM- MMVD. If an MMVD enabling flag (e.g., pic_fpel_mmvd_enabled_flag) is equal to 1, the MVD may be left- shifted by 2 (e.g., as in MMVD). [0172] Feature(s) associated with GPM with template matching (GPM-TM) are provided herein. [0173] Template matching (TM) may be applied to GPM. If GPM mode is enabled for a CU, a CU-level flag may be signaled to indicate whether TM is applied to one or more (e.g., both) geometric partitions. Motion information for a geometric partition (e.g., each geometric partition) may be refined using TM. If TM is chosen, a template may be constructed using left, above, or left and above neighboring samples (e.g., according to partition angle), as shown in Table 1. The motion may be refined. For example, the motion may be refined by minimizing the difference between the current template and the template in the reference picture. For example, the motion may be refined by minimizing the difference between the current template and the template in the reference picture, using the same search pattern of merge mode with half-pel interpolation filter disabled. Partition angle 0 2 3 4 5 8 11 12 13 14 1st partition A A A A L+A L+A L+A L+A A A 2nd partition L+A L+A L+A L L L L L+A L+A L+A Partition angle 16 18 19 20 21 24 27 28 29 30 1st partition A A A A L+A L+A L+A L+A A A 2nd partition L+A L+A L+A L L L L L+A L+A L+A Table 1. Template for the 1st and 2nd geometric partitions, where A represents using above samples, L represents using left samples, and L+A represents using both left and above samples. [0174] A GPM candidate list may be constructed as follows. Interleaved List-0 MV candidates and List-1 MV candidates may be derived (e.g., directly) from the regular merge candidate list. List-0 MV candidates may be higher priority than List-1 MV candidates. Pruning (e.g., a pruning method) with an adaptive threshold based on the current CU size may be applied. The pruning may remove redundant MV candidates. [0175] Interleaved List-1 MV candidates and List-0 MV candidates may be derived (e.g., directly) from the regular merge candidate list. List-1 MV candidates may be higher priority than List-0 MV candidates. Pruning (e.g., a pruning method) with an adaptive threshold based on the current CU size may be applied. The pruning may remove redundant MV candidates. [0176] Zero MV candidates may be padded (e.g., until the GPM candidate list is full). [0177] The GPM-MMVD and GPM-TM may be enabled (e.g., exclusively enabled) to a (e.g., one) GPM CU. The GPM-MMVD and GPM-TM may be enabled by signaling the GPM-MMVD syntax. If two (e.g., both) GPM-MMVD control flags are equal to false (e.g., the GPM-MMVD are disabled for two GPM partitions), the GPM-TM flag may be signaled to indicate whether the template matching is applied to the two GPM partitions. Otherwise (e.g., at least one GPM-MMVD flag is equal to true), the value of the GPM- TM flag may be inferred to be false. [0178] Feature(s) associated with GPM with inter and intra prediction (GPM-Intra) are provided herein. [0179] Intra modes may be added to GPM to combine an inter prediction with an intra prediction. [0180] In GPM with inter and intra prediction (GPM-Intra), the prediction samples (e.g., the final prediction samples) may be generated by weighting inter predicted samples and intra predicted samples for a GPM-separated region (each GPM-separated region). The inter predicted samples may be derived in the same or similar manner as the GPM. The intra predicted samples may be derived by an intra prediction mode (IPM) candidate list and an index signaled (e.g., from the encoder). The IPM candidate list size may be pre-defined (e.g., pre-defined as 3). As illustrated in FIG.8, the available IPM candidates may include the parallel angular mode against the GPM block boundary (Parallel mode), the perpendicular angular mode against the GPM block boundary (Perpendicular mode), and the Planar mode. [0181] In decoder-side intra mode derivation (DIMD) and neighboring mode based IPM derivation, Parallel mode may be registered first. One or more (e.g., up to a maximum of two) IPM candidates derived from the DIMD method and/or the neighboring blocks may be registered (e.g., if the derived candidate is not the same as an IPM candidate already in the list). For the neighboring mode derivation, one or more (e.g., up to five) positions may exist for available neighboring blocks. The positions may depend on (e.g., be restricted by) the angle of GPM block boundary (e.g., as shown in Table 1). The angle of GPM block boundary may be used for GPM-TM. [0182] GPM-Intra may be combined with GPM-MMVD. Template-based intra mode derivation (TIMD) may be used (e.g., on IPM candidates of GPM-Intra) to further improve the coding performance. The Parallel mode may be registered first. Then IPM candidates of TIMD, DIMD, and neighboring blocks may be registered. [0183] Feature(s) associated with spatial GPM (SGPM) are provided herein. [0184] SGPM may extend GPM to intra prediction. [0185] As illustrated in FIG.9A, SGPM may include one partition mode and two associated IPMs. A candidate list may be employed. A candidate index (e.g., only the candidate index) may be signaled in the bit-stream. A candidate (e.g., each candidate) in the list may derive a combination of a (e.g., one) partition mode and one or more (e.g., two) intra prediction modes, as shown in FIG.9B. The number of possible partition modes and intra prediction modes may be reduced (e.g., to reduce the complexity in building the candidate list). For example, 26 (e.g., only 26) out of 64 partition modes may be used. The selected partition mode candidates for SGPM are surrounded by a gray dashed box in FIG.10. An IPM candidate list with one or more (e.g., three) entries may be constructed using the same or similar method as GPM intra. [0186] Feature(s) associated with intra block copy with geometry partitioning mode (IBC-GPM) are provided herein. [0187] IBC-GPM is a coding tool that divides an IBC-predicted CU into two sub-partitions geometrically. A CU-level flag (e.g., IBC_GPM_flag) may be signaled to indicate the use of IBC-GPM. The prediction signals of the two sub-partitions may be generated using IBC and intra prediction. An IPM candidate list (e.g., with three entries) may be constructed using the same or a similar method as GPM-Intra. There may be 48 geometry partitioning modes (e.g., in total). The geometry partitioning modes may be divided into two geometry partitioning mode sets, as shown in Table 2 and Table 3. ibc_gpm_partition_idx 0 1 2 3 4 5 6 7 angleIdx 0 0 8 8 16 16 24 24 distanceIdx 1 3 1 3 1 3 1 3 Table 2 – Geometry partitioning modes in a first geometry partitioning mode set ibc_gpm_partition_idx 0 1 2 3 4 5 6 7 8 9 angleIdx 2 2 2 3 3 3 4 4 4 5 distanceIdx 0 1 3 0 1 3 0 1 3 0 ibc_gpm_partition_idx 10 11 12 13 14 15 16 17 18 19 angleIdx 5 5 11 11 11 12 12 12 13 13 distanceIdx 1 3 0 1 3 0 1 3 0 1 ibc_gpm_partition_idx 20 21 22 23 24 25 26 27 28 29 angleIdx 13 14 14 14 18 18 19 19 20 20 distanceIdx 3 0 1 3 1 3 1 3 1 3 ibc_gpm_partition_idx 30 31 32 33 34 35 36 37 38 39 angleIdx 21 21 27 27 28 28 29 29 30 30 distanceIdx 1 3 1 3 1 3 1 3 1 3 Table 3 – Geometry partitioning modes in a second geometry partitioning mode set [0188] If IBC-GPM is used, an IBC-GPM geometry partitioning mode set flag (e.g., split_mode_set_flag) may be signaled to indicate whether the first or the second geometry partitioning mode set is selected. The signaling may include a geometry partitioning mode index (e.g., split_mode_set_index). An IBC-GPM intra flag (e.g., intra_prediction_flag) may be signaled to indicate whether intra prediction is used for the first sub-partition. If intra prediction is used for a sub-partition, an intra prediction mode index (e.g., intra_mode_index) may be signaled. If IBC is used for a sub-partition, a merge index (e.g., merge_index) may be signaled. FIG.11 illustrates an example syntax of IBC-GPM. [0189] IBC-GPM may be performed by allowing the generation of the prediction samples of both partitions using the IBC. For example, the core IBC-GPM design (e.g., 48 GPM modes, the IBC merge candidate list, the IPM list, etc.) may be kept the same. The signaling (e.g., only the signaling) of the IBC- GPM may enable the IBC-IBC combination. For example, two flags may be signaled to indicate the prediction modes of two partitions. A first flag (e.g., intra_prediction_flag_0) may be signaled (e.g., always signaled) to indicate whether the first partition is intra predicted. A second flag (e.g., intra_prediction_flag_1) may be signaled (e.g., only needs to be signaled) if the first flag is false (e.g., the first partition is IBC predicted) to indicate whether intra prediction is applied to the second partition. If both flags are false (e.g., indicating that both partitions are generated using the IBC), the maximum codeword of the second partition may be reduced (e.g., by 1). The maximum codeword of the second partition may be reduced because the merge indices of two partitions cannot be identical. FIG.12 illustrates an example modified syntax design of the IBC-GPM. [0190] Feature(s) associated with bi-predictive GPM are provided herein. [0191] An example GPM may use uni-predictive motion vectors to generate motion compensated prediction samples for an inter partition (e.g., each inter partition). The generation of GPM merge candidate list may involve one or more (e.g., two) steps. For example, an initial list may be generated (e.g., where the list generation process is the same as the normal merge list generation process). Uni-predictive motion vectors may be extracted, from the initial list, and entered into the GPM merge candidate list. A bi- predictive GPM may allow bi-predictive motion vectors to be used. The bi-predictive motion vectors may include modifications of one or more elements, as described herein. [0192] For example, a first element may conditionally invoke extraction of the uni-predictive motion vectors from the initial list. The extraction may be invoked for (e.g., only for) small blocks (e.g., blocks of size 8x8, 16x8, and/or 8x16). For larger blocks, the extraction may be bypassed. The generation of the initial list may be the same as described herein (e.g., the merge list generation without any candidate reordering). If the initial list is being generated for larger blocks (e.g., blocks for which the extraction is bypassed), a motion vector difference threshold (e.g., for controlling whether a candidate can be added into the initial list) may be increased. For example, the motion vector difference threshold may be increased to be one full sample distance. [0193] A second element may modify GPM-MMVD to support bi-predictive motion vector as the base vector. For low-delay pictures, the signaled MVD may be applied on top of the L0 and L1 motion vector. For non-low-delay pictures, the bi-predictive motion vector may be converted into a uni-predictive motion vector. The MVD may be applied on top (e.g., after the bi-predictive motion vector is converted into a uni- predictive motion vector). [0194] A third element may modify GPM-TM to support bi-predictive motion vectors. If the picture is a non-low-delay picture and the best template cost from using bi-prediction exceeds a threshold (e.g., 75% of the best template cost from using uni-prediction), the refined uni-predictive motion vector may be determined to be the final refined motion vector. Otherwise (e.g., the best template cost from using bi- prediction does not exceed the threshold), the refined bi-predictive motion vectors may be determined to be the final refined motion vectors. [0195] A fourth element may enable 8x8 bi-directional optical flow (BDOF). For example, the 8x8 BDOF may be enabled on top of the associated bi-predictive motion vectors for an inter partition (e.g., each inter partition). [0196] Feature(s) associated with Intra block copy (IBC) coding are provided herein. [0197] IBC may be used for screen content coding (SCC). IBC may improve the coding efficiency of screen content materials. IBC mode may be implemented as a block level coding mode. Block matching (BM) may be performed at the encoder to find the optimal block vector (BV) (or motion vector) for a CU (e.g., each CU). A block vector may indicate the displacement from the current block to a reference block (e.g., which may already be reconstructed inside the current picture). The luma block vector of an IBC- coded CU may be in integer precision. The chroma block vector of an IBC-coded CU may be in integer precision (e.g., may be rounded to integer precision). If combined with adaptive motion vector resolution (AMVR), the IBC mode may switch between 1-pel and 4-pel (e.g., 1-pixel and 4-pixel) motion vector precisions. An IBC-coded CU may be treated as the third prediction mode other than intra or inter prediction modes. The IBC mode may be applicable to CUs with a width and height (e.g., both width and height) smaller than or equal to 64 luma samples. [0198] At the CU level, IBC mode may be signaled with a flag. The IBC mode may be signaled as IBC advanced motion vector prediction (AMVP) mode or IBC skip/merge mode. [0199] For IBC skip/merge mode, a merge candidate index may be used to indicate which block vector(s) (e.g., of the block vectors in the list from neighboring candidate IBC coded blocks) is to be used to predict the current block. The merge list may include spatial, history-based motion vector predictor (HMVP), and/or pairwise candidates. [0200] For IBC AMVP mode, block vector difference may be coded in the same, or similar, way as a motion vector difference. The block vector prediction may use one or more (e.g., two) candidates as predictors. The candidates may be picked from the merge list (e.g., with minimal cost, if IBC coded). If a neighbor (e.g., either neighbor) is not available, a default block vector may be used as a predictor. A flag may be signaled to indicate the block vector predictor index. [0201] Feature(s) associated with IBC merge/AMVP list construction are provided herein. [0202] The IBC merge/AMVP list may be constructed. For example, if (e.g., only if) an IBC merge/AMVP candidate is valid, the candidate may be inserted into the IBC merge/AMVP candidate list; above-right, bottom-left, and above-left spatial candidates, and a (e.g., one) pairwise average candidate may be added into the IBC merge/AMVP candidate list; template based adaptive reordering (ARMC-TM) may be applied to the IBC/AMVP merge list. [0203] The HMVP table size for IBC may be increased (e.g., to 25 entries). IBC merge candidate(s) (e.g., up to 20 IBC merge candidates) may be derived. The IBC merge candidate(s) may be derived with pruning (e.g., full pruning). The IBC merge candidate(s) may be reordered together (e.g., after derivation and pruning). One or more candidates (e.g., the first 6 candidates) with the lowest template matching costs may be selected (e.g., after reordering) as the final candidates in the IBC merge list. [0204] The candidates from zero vectors to pad the IBC merge/AMVP list may be replaced with a set of block vector prediction (BVP) candidates (e.g., located in the IBC reference region). A zero vector may be invalid as a block vector in IBC merge mode. The zero vector may be discarded as a BVP candidate in the IBC candidate list. [0205] FIG.13 illustrates example candidate location in a reference region. One or more (e.g., three) candidates may be located on the nearest corners of the reference region. One or more (e.g., three) candidates may be determined in the middle of the sub-regions (e.g., three sub-regions A, B, and C in FIG. 13). The coordinates of the candidates in the middle of the sub-regions may be determined by the width and height of the current block and the ΔX and ΔY parameters. [0206] Feature(s) associated with bi-predictive IBC are provided herein. [0207] A bi-predictive IBC may be used to enhance the coding performance of IBC (e.g., for natural and screen content). IBC (e.g., uni-predictive IBC) may generate prediction samples with a BV (e.g., only one BV). The prediction accuracy of IBC may be improved. IBC with more than one (e.g., two) BVs (e.g., bi- predictive IBC) may be used (e.g., instead of uni-predictive IBC). [0208] Types (e.g., two types) of bi-predictive IBCs may exist. [0209] In a first example type (e.g., sometimes referred to as IBC BVP-merge mode), a plurality (e.g., two) BVs may be derived from IBC BVP mode and IBC merge mode (e.g., similar to the MV derivation in AMVP-merge mode). Indices (e.g., two different indices) for the IBC BVP mode and the IBC merge candidate may be signaled (e.g., from the encoder to the decoder), which may be different from the AMVP- merge mode. [0210] In a second example type (e.g., sometimes referred to as bi-predictive IBC merge mode), a plurality (e.g., two) BVs may be derived from the IBC merge candidate list. IBC merge indices (e.g., two different IBC merge indices) may be used to signal the BVs (e.g., from the encoder to the decoder). The target of the bi-predictive IBC merge mode may include IBC-regular merge and IBC merge mode with block vector difference (IBC-MBVD) and IBC-GPM. [0211] Feature(s) associated with merge candidate list construction are provided herein. IBC merge candidate list construction (e.g., the existing IBC merge candidate list construction for uni-predictive IBC merge mode) may be used. [0212] Feature(s) associated with BV refinement are provided herein. IBC with template matching may be enabled. [0213] Feature(s) associated with compensation are provided herein. Final IBC prediction samples may be generated with a simple (e.g., 1:1) average of bi-predictive IBC samples. [0214] Feature(s) associated with BV storage are provided herein. The BVs (e.g., two BVs) may be stored in BV storage if the bi-predictive IBC is enabled. [0215] Feature(s) associated with signaling are provided herein. A control flag of bi-predictive IBC (e.g., slice_bi_IBC_flag) may be signaled (e.g., at a slice level). The control flag of bi-predictive IBC may be signaled in I slices, and may not be signaled in B and/or P slices. Reconstructed-Reordered IBC may be disabled if the bi-predictive IBC is enabled. [0216] Certain features may be enabled in chroma component blocks of a coding tree (e.g., the single tree). [0217] In bi-predictive IBC merge mode, bi-predictive IBC-GPM may be enabled for (e.g., only for) screen content. The bi-predictive IBC-GPM may be applied to derive BVs (e.g., two BVs) from existing IBC merge candidate lists. The BVs may have indices (e.g., two different indices), which may be applied to generate GPM predictions (e.g., the two GPM predictions). FIG.14 illustrates example GPM prediction generation. [0218] Bi-predictive GPM may allow bi-predictive motion vectors to be used to generate motion compensated prediction samples for an inter partition (e.g., each inter partition). The BVs (e.g., two BVs) may be stored in BV storage (e.g., if bi-predictive IBC is enabled). In bi-predictive IBC merge mode, bi- predictive IBC-GPM may be applied to derive BVs (e.g., two BVs, for example, from the IBC merge candidate lists). The BVs may have indices (e.g., two different indices), which may be applied to generate GPM predictions (e.g., the two GPM predictions). [0219] Feature(s) described herein may allow usage of bi-predictive block vectors to generate bi- prediction samples for an IBC geometry partition (e.g., each IBC geometry partition). Feature(s) described herein may allow usage of bi-predictive intra prediction to generate bi-prediction samples for an intra geometry partition (e.g., each intra geometry partition). [0220] Feature(s) described herein may allow bi-predictive BVs to be used to generate bi-prediction samples for an IBC geometry partition (e.g., each IBC geometry partition) in IBC-GPM. [0221] Feature(s) described herein may support the IBC-GPM with bi-predictive block vectors. For example, bi-predictive merge candidates may be generated and added into the merge candidate list construction. One or more combined/converted bi-predictive block vector(s) may be stored in the block field storage. [0222] Bi-predictive intra prediction may be used to generate bi-prediction samples for an intra geometry partition (e.g., each intra geometry partition) in GPM Intra, SGPM, and/or IBC-GPM (e.g., in the same or a similar manner). [0223] Feature(s) associated with IBC-GPM with bi-predictive block vectors are provided herein. Bi- predictive block vectors may be used to generate bi-prediction samples (e.g., for each IBC-GPM partition). [0224] If an IBC-IBC combination is used for the IBC-GPM (e.g., both partitions are using the IBC), one or more (e.g., up to 4) BVs may be utilized for the IBC-GPM with bi-predictive BVs. In a bi-predictive IBC merge mode, a BV (e.g., each required BV) may be derived from the IBC merge candidate list (e.g., with its corresponding merge index). One or more (e.g., up to 4) merge indices may be signaled from the encoder to the decoder (e.g., as depicted in FIG.15). [0225] If intra prediction is used for a partition for the IBC-GPM, one or more (e.g., up to 2) BVs may be utilized. One or more (e.g., up to 2) corresponding merge indices might be signaled in video data (e.g., from the encoder to the decoder). [0226] For example, a CU flag may be signaled to indicate that IBC-GPM with bi-predictive block vectors is being used for a given block. [0227] For example, a PU flag may be signaled to indicate that IBC-GPM with bi-predictive block vectors is used for a partition (e.g., each partition) of a given block. [0228] Bi-prediction with bi-predictive BVs may be allowed (e.g., only allowed) for IBC-GPM if a partition (e.g., one partition) is using intra prediction. [0229] Bi-predictive BVs may be conditionally enabled (e.g., allowed). In some examples, bi-prediction with bi-predictive block vectors may be allowed (e.g., only allowed) for IBC-GPM if both partitions are using IBC prediction. In some examples, bi-prediction with bi-predictive block vectors may be allowed (e.g., only allowed) if the difference between the BVs (e.g., two BVs) satisfies one or more conditions (e.g., above, below, or equal to a threshold, for example, a predefined threshold value). In some examples, bi-prediction with bi-predictive BVs may be allowed (e.g., only allowed) if certain criteria are met (e.g., based on the block size, color components, QP, slice type, sequence class, and/or configuration). [0230] Examples of merge candidate list construction for IBC-GPM are provided herein. [0231] The BVs (e.g., two BVs) may be stored in BV storage if bi-predictive IBC is enabled. A bi- predictive candidate with one or more (e.g., two) bi-predictive BVs may be added to an IBC merge candidate list based on one or more conditions. [0232] For example, for a bi-predictive IBC block, the two BVs may be stored (e.g., in BV storage). A new bi-predictive merge candidate may be formed. The new bi-predictive merge candidate may be inserted into an IBC merge candidate list for the following bi-predictive IBC-GPM blocks. For a subsequent (e.g., next) IBC-GPM block using bi-predictive merge mode, if a (e.g., any) merge candidate (e.g., spatial or HMVP merge candidate) is a bi-predictive candidate with two BVs, the two BVs may be used to generate the bi-predictive IBC prediction samples for an IBC-GPM partition (e.g., each IBC-GPM partition). If the bi- predictive merge candidate is selected for an IBC-GPM partition (e.g., one IBC-GPM partition), one (e.g., only one) corresponding merge index may be signaled from the encoder to the decoder. [0233] In some examples, a combined bi-predictive merge candidate may be added into an IBC merge candidate list for bi-predictive IBC blocks. Combined bi-predictive merge candidates may be generated by combining a first BV referring to a first merge candidate and a second BV referring to a second merge candidate. The first and second merge candidates may be selected from available merge candidates in the merge candidate list (e.g., according to a pre-defined order). The two BVs may form a new bi-predictive merge candidate. FIG.16 illustrates a modified technique for constructing an IBC merge candidate list with the combined bi-predictive merge candidate. The technique may be used for bi-predictive IBC blocks, or IBC-GPM blocks, for example. [0234] In some examples, a bi-predictive merge candidate may be added into an IBC merge list if (e.g., only if) the difference between the two BVs satisfies one or more conditions (e.g., above, below, or equal to a threshold, for example, a predefined threshold value). [0235] In some examples, a bi-predictive merge candidate may be added into an IBC merge list if (e.g., only if) the difference between the two BVs satisfies one or more conditions (e.g., based on block size, color components, QP, slice type, sequence class, and/or configuration). [0236] In some examples, an IBC merge candidate list with bi-predictive candidate may be the IBC merge list for one or more (e.g., all) of the bi-predictive IBC merge mode, IBC-regular merge, IBC-MBVD, and/or IBC-GPM. [0237] An IBC merge candidate list with bi-predictive candidate may be (e.g., may only be) a specific IBC merge list for the uni-predictive or bi-predictive IBC-GPM mode. [0238] Feature(s) associated with block field storage for IBC-GPM with bi-predictive block vectors mode are provided herein. [0239] One or more combined/converted bi-predictive block vector(s) may be stored in the block field storage for IBC-GPM with bi-predictive block vectors. [0240] If the IBC-IBC combination is used in the IBC-GPM with bi-predictive block vectors mode, one or more (e.g., up to 4) BVs may be used, as illustrated in FIG.15. BV₁ and BV₂ from the first part of the geometric partition, BV₃ and BV₄ from the second part of the geometric partition, and/or one or more combined bi-predictive BVs of these four BVs may be stored in the block field of the IBC-GPM coded CU with bi-predictive block vectors. [0241] If the block field is part of partition 0 (e.g., left part of FIG.15) or partition 1 (e.g., right part of FIG. 15), a combined bi-predictive block vector BV_{bi_1st} of BV₁ and BV₂, or a combined bi-predictive BV_{bi_2nd} of BV₃ and BV₄ may be stored in the corresponding block field. Otherwise, if the block field belongs to the blended part (e.g., grey part of FIG.15), a combined bi-predictive block vector BV_{bi_3rd} (e.g., from all four BVs) may be stored. BV₁ and BV₂ may be converted into a uni-predictive block vector BV^′. Similarly, BV₃ and BV₄ may be converted into another uni-predictive block vector BV^′′. BV^′ and BV^′′ may be combined to form the bi-predictive block vector BV_{bi_3rd}. [0242] The combined/converted bi-predictive block vectors may be added as new bi-predictive merge candidates. [0243] For the IBC-IBC combination used in the IBC-GPM with uni-predictive block vector mode, the BVs (e.g., two BVs) in each partitioning may be combined as bi-predictive BVs. The combined bi-predictive BVs may be added as a new bi-predictive merge candidate. [0244] Feature(s) associated with GPM-Intra, SGPM, and IBC-GPM with bi-predictive intra prediction are provided herein. [0245] Bi-predictive intra prediction may be used for an intra coded geometry partition (e.g., each intra coded geometry partition) in GPM-Intra, SGPM, and/or IBC-GPM. [0246] Bi-prediction may be allowed for an inter or IBC coded geometry partition. Bi-predictive intra prediction may be extended to the intra geometry partition. [0247] For the intra geometry partition used for the GPM-Intra or the IBC-GPM, one or more (e.g., up to 2) intra predictions may be utilized for GPM-Intra and/or IBC-GPM with bi-predictive intra prediction. In a GPM-Intra/IBC-GPM mode, an intra prediction (e.g., each intra prediction) may be derived with an intra prediction mode index (e.g., from a pre-defined IPM candidate list with 3 entries). One or more (e.g., up to 2) intra prediction mode indices might be signaled from the encoder to the decoder. [0248] For the SGPM, one or more (e.g., both) geometry partitions may be intra predicted (e.g., up to 4 intra predictions may be utilized for the SGPM with bi-predictive intra prediction described herein). In the example SGPM mode, a candidate list may be employed. A candidate (e.g., each candidate) in the list may be used to derive a combination of a (e.g., one) partition mode and one or more (e.g., four instead of two) intra prediction modes. [0249] A combined bi-predictive intra candidate may be generated for the bi-predictive intra geometry partition (e.g., to reduce the signaling overhead and the coding complexity). Combined bi-predictive intra candidates may be generated by combining a first intra prediction mode (e.g., referring to a first candidate) and a second intra prediction mode (e.g., referring to a second candidate). The first and second candidates may be selected from available candidates in the IPM candidate list (e.g., according to a pre-defined order). If the bi-predictive intra candidate is selected for a (e.g., one) intra geometry partition, a (e.g., only one) corresponding IPM index may be signaled from the encoder to the decoder (e.g., for GPM-Intra/IBC-GPM with bi-predictive intra prediction). A combination (e.g., only one additional combination) may be tested at the encoder and/or decoder for SGPM with bi-predictive intra prediction. [0250] Bi-predictive intra prediction samples may be generated with an average (e.g., a simple average 1:1) of the two intra predictions. [0251] Bi-predictive intra prediction samples may be generated based on a weighted average of the two intra predictions. The weight may be fixed for one or more of (e.g., all) the bi-predictive intra geometry partitions. The weight may be adapted to a bi-predictive intra geometry partition (e.g., each bi-predictive intra geometry partition) based on one or more criteria or conditions being met. The chosen weight may be signaled (e.g., explicitly signaled) in the bitstream or be inferred (e.g., implicitly inferred). [0252] Bi-predictive intra prediction samples may be generated from two intra predictions using the same intra prediction mode but different reference lines. Bi-predictive intra prediction samples may be generated from two intra predictions using different intra modes (e.g., a fusion between DIMD and TIMD). [0253] Although features and elements are described above in particular combinations, one of ordinary skill in the art will appreciate that each feature or element can be used alone or in any combination with the 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 (transmitted over wired or wireless connections) and computer-readable storage media. Examples of computer-readable storage media include, but are not limited to, a read only memory (ROM), a random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROM disks, and digital versatile disks (DVDs). A processor in association with software may be used to implement a radio frequency transceiver for use in a WTRU, UE, terminal, base station, RNC, or any host computer.

Claims

CLAIMS 1. A device for video decoding comprising: a processor configured to: identify a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generate a prediction sample of the geometry partition based on the first BV and the second BV; and decode the coding block based on the prediction sample.

2. The device of claim 1, wherein the geometry partition is a first geometry partition, the prediction sample is a first prediction sample, and the processor is further configured to: identify a third BV and a fourth BV associated with a second geometry partition of the coding block; and generate a second prediction sample of the second geometry partition based on the third BV and the fourth BV.

3. The device of claim 2, wherein the processor being configured to decode the coding block based on the first prediction sample comprises the processor being configured to decode the coding block based on the first prediction sample and the second prediction sample.

4. The device of claim 1, wherein the processor is further configured to: generate a merge candidate list comprising a plurality of bi-predictive merge candidates; and receive an indication of a merge index of a bi-predictive merge candidate in the plurality of bi- predictive merge candidates, wherein the first BV and the second BV are identified based on the indication of the merge index.

5. The device of claim 1, wherein the coding block is a first coding block, and the processor is further configured to: determine that a bi-predictive intra prediction mode is enabled for a second coding block; derive a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block; and decode the second coding block based on the bi-predictive intra prediction.

6. The device of claim 1, wherein the geometry partition is coded using intra block copy (IBC).

7. The device of claim 1, wherein the geometry partition is a first geometry partition, the first BV and the second BV are stored in a block field, and the processor is further configured to: identify a third BV and a fourth BV associated with a second geometry partition of the coding block; on a condition that the block field is associated with the first geometry partition, store a first combined bi-predictive BV in the block field, wherein the first combined bi-predictive BV comprises a combination of the first BV and the second BV; and on a condition that the block field is associated with a blended part, store a second combined bi- predictive BV in the block field, wherein the second combined bi-predictive BV comprises a combination of the first BV, the second BV, the third BV, and the fourth BV.

8. The device of claim 1, wherein the processor is further configured to: generate a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values; and store the combined bi-predictive BV.

9. A method for video decoding, the method comprising: identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generating a prediction sample of the geometry partition based on the first BV and the second BV; and decoding the coding block based on the prediction sample.

10. The method of claim 9, wherein the geometry partition is a first geometry partition, the prediction sample is a first prediction sample, and the method further comprises: identifying a third BV and a fourth BV associated with a second geometry partition of the coding block; and generating a second prediction sample of the second geometry partition based on the third BV and the fourth BV.

11. The method of claim 10, wherein decoding the coding block based on the first prediction sample comprises decoding the coding block based on the first prediction sample and the second prediction sample.

12. The method of claim 9, wherein the method further comprises: generating a merge candidate list comprising a plurality of bi-predictive merge candidates; and receiving an indication of a merge index of a bi-predictive merge candidate in the plurality of bi- predictive merge candidates, wherein the first BV and the second BV are identified based on the indication of the merge index.

13. The method of claim 9, wherein the coding block is a first coding block, and the method further comprises: determining that a bi-predictive intra prediction mode is enabled for a second coding block; deriving a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block; and decoding the second coding block based on the bi-predictive intra prediction.

14. The method of claim 9, wherein the geometry partition is coded using intra block copy (IBC).

15. The method of claim 9, wherein the geometry partition is a first geometry partition, the first BV and the second BV are stored in a block field, and the method further comprises: identifying a third BV and a fourth BV associated with a second geometry partition of the coding block; on a condition that the block field is associated with the first geometry partition, storing a first combined bi-predictive BV in the block field, wherein the first combined bi-predictive BV comprises a combination of the first BV and the second BV; and on a condition that the block field is associated with a blended part, storing a second combined bi- predictive BV in the block field, wherein the second combined bi-predictive BV comprises a combination of the first BV, the second BV, the third BV, and the fourth BV.

16. The method of claim 9, wherein the method further comprises: generating a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values; and storing the combined bi-predictive BV.

17. A device for video encoding comprising: a processor configured to: identify a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generate a prediction sample of the geometry partition based on the first BV and the second BV; and encode the coding block based on the prediction sample.

18. The device of claim 17, wherein the geometry partition is a first geometry partition, the prediction sample is a first prediction sample, and the processor is further configured to: identify a third BV and a fourth BV associated with a second geometry partition of the coding block; and generate a second prediction sample of the second geometry partition based on the third BV and the fourth BV.

19. The device of claim 18, wherein the processor being configured to encode the coding block based on the first prediction sample comprises the processor being configured to encode the coding block based on the first prediction sample and the second prediction sample.

20. The device of claim 17, wherein the processor is further configured to: generate a merge candidate list comprising a plurality of bi-predictive merge candidates; and include, in video data, an indication of a merge index of a bi-predictive merge candidate in the plurality of bi-predictive merge candidates, wherein the first BV and the second BV are identified based on the indication of the merge index.

21. The device of claim 17, wherein the coding block is a first coding block, and the processor is further configured to: determine that a bi-predictive intra prediction mode is enabled for a second coding block; derive a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block; and encode the second coding block based on the bi-predictive intra prediction.

22. The device of claim 17, wherein the geometry partition is coded using intra block copy (IBC).

23. The device of claim 17, wherein the geometry partition is a first geometry partition, the first BV and the second BV are stored in a block field, and the processor is further configured to: identify a third BV and a fourth BV associated with a second geometry partition of the coding block; on a condition that the block field is associated with the first geometry partition, store a first combined bi-predictive BV in the block field, wherein the first combined bi-predictive BV comprises a combination of the first BV and the second BV; and on a condition that the block field is associated with a blended part, store a second combined bi- predictive BV in the block field, wherein the second combined bi-predictive BV comprises a combination of the first BV, the second BV, the third BV, and the fourth BV.

24. The device of claim 17, wherein the processor is further configured to: generate a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values; and store the combined bi-predictive BV.

25. A method for video encoding, the method comprising: identifying a first block vector (BV) and a second BV associated with a geometry partition of a coding block; generating a prediction sample of the geometry partition based on the first BV and the second BV; and encoding the coding block based on the prediction sample.

26. The method of claim 25, wherein the geometry partition is a first geometry partition, the prediction sample is a first prediction sample, and the method further comprises: identifying a third BV and a fourth BV associated with a second geometry partition of the coding block; and generating a second prediction sample of the second geometry partition based on the third BV and the fourth BV.

27. The method of claim 26, wherein encoding the coding block based on the first prediction sample comprises encoding the coding block based on the first prediction sample and the second prediction sample.

28. The method of claim 25, wherein the method further comprises: generating a merge candidate list comprising a plurality of bi-predictive merge candidates; and including, in video data, an indication of a merge index of a bi-predictive merge candidate in the plurality of bi-predictive merge candidates, wherein the first BV and the second BV are identified based on the indication of the merge index.

29. The method of claim 25, wherein the coding block is a first coding block, and the method further comprises: determining that a bi-predictive intra prediction mode is enabled for a second coding block; deriving a bi-predictive intra prediction for an intra-coded geometry partition of the second coding block; and encoding the second coding block based on the bi-predictive intra prediction.

30. The method of claim 25, wherein the geometry partition is coded using intra block copy (IBC).

31. The method of claim 25, wherein the geometry partition is a first geometry partition, the first BV and the second BV are stored in a block field, and the method further comprises: identifying a third BV and a fourth BV associated with a second geometry partition of the coding block; on a condition that the block field is associated with the first geometry partition, storing a first combined bi-predictive BV in the block field, wherein the first combined bi-predictive BV comprises a combination of the first BV and the second BV; and on a condition that the block field is associated with a blended part, storing a second combined bi- predictive BV in the block field, wherein the second combined bi-predictive BV comprises a combination of the first BV, the second BV, the third BV, and the fourth BV.

32. The method of claim 25, wherein the method further comprises: generating a combined bi-predictive BV based on the first BV, the second BV, and one or more weight values; and storing the combined bi-predictive BV.

33. A computer program product which is stored on a non-transitory computer readable medium and comprises program code instructions for implementing the steps of the method according to any one of claims 9-16 and 25-32 when executed by a processor.

34. Video data comprising information representative of the encoded coding block generated according to the method of one of claims 25-32.