Patent Publication Number: US-11025951-B2

Title: Method and apparatus for video coding

Description:
INCORPORATION BY REFERENCE 
     This present application claims the benefit of priority to U.S. Provisional Application No. 62/791,855, “Signaling for Interweaved Affine Inter Prediction” filed on Jan. 13, 2019, which is incorporated by reference herein in its entirety. 
    
    
     TECHNICAL FIELD 
     The present disclosure describes embodiments generally related to video coding. 
     BACKGROUND 
     The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure. 
     Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space. 
     One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth or storage space requirements, in some cases by two orders of magnitude or more. Both lossless and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios. 
     Motion compensation can be a lossy compression technique and can relate to techniques where a block of sample data from a previously reconstructed picture or part thereof (reference picture), after being spatially shifted in a direction indicated by a motion vector (MV henceforth), is used for the prediction of a newly reconstructed picture or picture part. In some cases, the reference picture can be the same as the picture currently under reconstruction. MVs can have two dimensions X and Y, or three dimensions, the third being an indication of the reference picture in use (the latter, indirectly, can be a time dimension). 
     In some video compression techniques, an MV applicable to a certain area of sample data can be predicted from other MVs, for example from those related to another area of sample data spatially adjacent to the area under reconstruction, and preceding that MV in decoding order. Doing so can substantially reduce the amount of data required for coding the MV, thereby removing redundancy and increasing compression. MV prediction can work effectively, for example, because when coding an input video signal derived from a camera (known as natural video) there is a statistical likelihood that areas larger than the area to which a single MV is applicable move in a similar direction and, therefore, can in some cases be predicted using a similar motion vector derived from MVs of neighboring area. That results in the MV found for a given area to be similar or the same as the MV predicted from the surrounding MVs, and that in turn can be represented, after entropy coding, in a smaller number of bits than what would be used if coding the MV directly. In some cases, MV prediction can be an example of lossless compression of a signal (namely: the MVs) derived from the original signal (namely: the sample stream). In other cases, MV prediction itself can be lossy, for example because of rounding errors when calculating a predictor from several surrounding MVs. 
     Various MV prediction mechanisms are described in H.265/HEVC (ITU-T Rec. H.265, “High Efficiency Video Coding”, December 2016). Out of the many MV prediction mechanisms that H.265 offers, described here is a technique henceforth referred to as “spatial merge”. 
     Referring to  FIG. 1 , a current block ( 101 ) comprises samples that have been found by the encoder during the motion search process to be predictable from a previous block of the same size that has been spatially shifted. Instead of coding that MV directly, the MV can be derived from metadata associated with one or more reference pictures, for example from the most recent (in decoding order) reference picture, using the MV associated with either one of five surrounding samples, denoted A 0 , A 1 , and B 0 , B 1 , B 2  ( 102  through  106 , respectively). In H.265, the MV prediction can use predictors from the same reference picture that the neighboring block is using. 
     SUMMARY 
     Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry. The processing circuitry decodes prediction information of a current block from a coded video bitstream. The prediction information is indicative of an affine prediction for the current block. Then processing circuitry determines an application of an interweaved affine prediction when the current block being within a larger region than the current block. The larger region has a flag that is indicative of enabling an interweaved affine prediction in the larger region. Then, the processing circuitry reconstructs samples of the current block according to the interweaved affine prediction. 
     In an example, the flag is signaled at a sequence level, a picture level, a tile group level, a tile level, and a slice level. In another example, the processing circuitry determines the application of the interweaved affine prediction when the prediction information is indicative of uni-prediction for the current block. 
     In some embodiments, the processing circuitry disables bi-prediction for the larger region when the flag indicates that the interweaved affine prediction is enabled in the larger region. In some examples, the processing circuitry decodes an inter prediction direction index that uses a single bit for one of two reference directions with bi-prediction being excluded. In an example, the processing circuitry receives an inter affine flag before the inter prediction direction index. Further, in an example, the processing circuitry decodes the inter prediction direction index that has the single bit when the inter affine flag is indicative of using the affine prediction for the current block. In another example, the processing circuitry decodes the inter prediction direction index that has two bits when the inter affine flag is indicative of no affine prediction for the current block. 
     Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform the method for video decoding. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which: 
         FIG. 1  is a schematic illustration of a current block and its surrounding spatial merge candidates in one example. 
         FIG. 2  is a schematic illustration of a simplified block diagram of a communication system ( 200 ) in accordance with an embodiment. 
         FIG. 3  is a schematic illustration of a simplified block diagram of a communication system ( 300 ) in accordance with an embodiment. 
         FIG. 4  is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment. 
         FIG. 5  is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment. 
         FIG. 6  shows a block diagram of an encoder in accordance with another embodiment. 
         FIG. 7  shows a block diagram of a decoder in accordance with another embodiment. 
         FIG. 8  shows a diagram illustrating redundancy check pairs for some embodiments. 
         FIG. 9  shows an example for temporal candidate derivation. 
         FIG. 10  shows an example for illustrating the position for the temporal candidate. 
         FIG. 11  shows examples for merge mode with motion vector difference (MMVD) according to an embodiment of the disclosure. 
         FIGS. 12A-12B  show the affine motion field of a block described by motion information of control points. 
         FIG. 13  shows an example of affine motion vector field per sub-block. 
         FIG. 14  shows an example for affine merge mode. 
         FIG. 15  shows an example of spatial neighbors and temporal neighbor according to some embodiments of the disclosure. 
         FIGS. 16-17  show an example of a SbTVMP process according to some embodiments of the disclosure. 
         FIG. 18  shows two CU examples ( 1810 ) and ( 1820 ) of triangular partition. 
         FIG. 19  shows an example for forming a uni-prediction candidate list for a current block. 
         FIG. 20  shows an example of using weighting factor group to derive the final prediction according to some embodiments of the disclosure. 
         FIG. 21  shows another example of using weighting factor group to derive the final prediction according to some embodiments of the disclosure 
         FIG. 22  shows examples of prediction for triangular partition. 
         FIG. 23  shows a diagram illustrating an example of interweaved affine prediction according to some embodiments of the disclosure. 
         FIG. 24  shows a diagram illustrating weights for samples in a sub-block. 
         FIG. 25  shows a diagram illustrating a region with dot pattern where the interweaved affine prediction is applied. 
         FIG. 26  shows a flow chart outlining a process example according to an embodiment of the disclosure. 
         FIG. 27  is a schematic illustration of a computer system in accordance with an embodiment. 
     
    
    
     DETAILED DESCRIPTION OF EMBODIMENTS 
       FIG. 2  illustrates a simplified block diagram of a communication system ( 200 ) according to an embodiment of the present disclosure. The communication system ( 200 ) includes a plurality of terminal devices that can communicate with each other, via, for example, a network ( 250 ). For example, the communication system ( 200 ) includes a first pair of terminal devices ( 210 ) and ( 220 ) interconnected via the network ( 250 ). In the  FIG. 2  example, the first pair of terminal devices ( 210 ) and ( 220 ) performs unidirectional transmission of data. For example, the terminal device ( 210 ) may code video data (e.g., a stream of video pictures that are captured by the terminal device ( 210 )) for transmission to the other terminal device ( 220 ) via the network ( 250 ). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device ( 220 ) may receive the coded video data from the network ( 250 ), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like. 
     In another example, the communication system ( 200 ) includes a second pair of terminal devices ( 230 ) and ( 240 ) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices ( 230 ) and ( 240 ) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices ( 230 ) and ( 240 ) via the network ( 250 ). Each terminal device of the terminal devices ( 230 ) and ( 240 ) also may receive the coded video data transmitted by the other terminal device of the terminal devices ( 230 ) and ( 240 ), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data. 
     In the  FIG. 2  example, the terminal devices ( 210 ), ( 220 ), ( 230 ) and ( 240 ) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network ( 250 ) represents any number of networks that convey coded video data among the terminal devices ( 210 ), ( 220 ), ( 230 ) and ( 240 ), including for example wireline (wired) and/or wireless communication networks. The communication network ( 250 ) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network ( 250 ) may be immaterial to the operation of the present disclosure unless explained herein below. 
       FIG. 3  illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on. 
     A streaming system may include a capture subsystem ( 313 ), that can include a video source ( 301 ), for example a digital camera, creating for example a stream of video pictures ( 302 ) that are uncompressed. In an example, the stream of video pictures ( 302 ) includes samples that are taken by the digital camera. The stream of video pictures ( 302 ), depicted as a bold line to emphasize a high data volume when compared to encoded video data ( 304 ) (or coded video bitstreams), can be processed by an electronic device ( 320 ) that includes a video encoder ( 303 ) coupled to the video source ( 301 ). The video encoder ( 303 ) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data ( 304 ) (or encoded video bitstream ( 304 )), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures ( 302 ), can be stored on a streaming server ( 305 ) for future use. One or more streaming client subsystems, such as client subsystems ( 306 ) and ( 308 ) in  FIG. 3  can access the streaming server ( 305 ) to retrieve copies ( 307 ) and ( 309 ) of the encoded video data ( 304 ). A client subsystem ( 306 ) can include a video decoder ( 310 ), for example, in an electronic device ( 330 ). The video decoder ( 310 ) decodes the incoming copy ( 307 ) of the encoded video data and creates an outgoing stream of video pictures ( 311 ) that can be rendered on a display ( 312 ) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data ( 304 ), ( 307 ), and ( 309 ) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC. 
     It is noted that the electronic devices ( 320 ) and ( 330 ) can include other components (not shown). For example, the electronic device ( 320 ) can include a video decoder (not shown) and the electronic device ( 330 ) can include a video encoder (not shown) as well. 
       FIG. 4  shows a block diagram of a video decoder ( 410 ) according to an embodiment of the present disclosure. The video decoder ( 410 ) can be included in an electronic device ( 430 ). The electronic device ( 430 ) can include a receiver ( 431 ) (e.g., receiving circuitry). The video decoder ( 410 ) can be used in the place of the video decoder ( 310 ) in the  FIG. 3  example. 
     The receiver ( 431 ) may receive one or more coded video sequences to be decoded by the video decoder ( 410 ); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel ( 401 ), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver ( 431 ) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver ( 431 ) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory ( 415 ) may be coupled in between the receiver ( 431 ) and an entropy decoder/parser ( 420 ) (“parser ( 420 )” henceforth). In certain applications, the buffer memory ( 415 ) is part of the video decoder ( 410 ). In others, it can be outside of the video decoder ( 410 ) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder ( 410 ), for example to combat network jitter, and in addition another buffer memory ( 415 ) inside the video decoder ( 410 ), for example to handle playout timing. When the receiver ( 431 ) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory ( 415 ) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory ( 415 ) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder ( 410 ). 
     The video decoder ( 410 ) may include the parser ( 420 ) to reconstruct symbols ( 421 ) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder ( 410 ), and potentially information to control a rendering device such as a render device ( 412 ) (e.g., a display screen) that is not an integral part of the electronic device ( 430 ) but can be coupled to the electronic device ( 430 ), as was shown in  FIG. 4 . The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser ( 420 ) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser ( 420 ) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser ( 420 ) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth. 
     The parser ( 420 ) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory ( 415 ), so as to create symbols ( 421 ). 
     Reconstruction of the symbols ( 421 ) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser ( 420 ). The flow of such subgroup control information between the parser ( 420 ) and the multiple units below is not depicted for clarity. 
     Beyond the functional blocks already mentioned, the video decoder ( 410 ) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate. 
     A first unit is the scaler/inverse transform unit ( 451 ). The scaler/inverse transform unit ( 451 ) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) ( 421 ) from the parser ( 420 ). The scaler/inverse transform unit ( 451 ) can output blocks comprising sample values, that can be input into aggregator ( 455 ). 
     In some cases, the output samples of the scaler/inverse transform ( 451 ) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit ( 452 ). In some cases, the intra picture prediction unit ( 452 ) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer ( 458 ). The current picture buffer ( 458 ) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator ( 455 ), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit ( 452 ) has generated to the output sample information as provided by the scaler/inverse transform unit ( 451 ). 
     In other cases, the output samples of the scaler/inverse transform unit ( 451 ) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit ( 453 ) can access reference picture memory ( 457 ) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols ( 421 ) pertaining to the block, these samples can be added by the aggregator ( 455 ) to the output of the scaler/inverse transform unit ( 451 ) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory ( 457 ) from where the motion compensation prediction unit ( 453 ) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit ( 453 ) in the form of symbols ( 421 ) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory ( 457 ) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth. 
     The output samples of the aggregator ( 455 ) can be subject to various loop filtering techniques in the loop filter unit ( 456 ). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit ( 456 ) as symbols ( 421 ) from the parser ( 420 ), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values. 
     The output of the loop filter unit ( 456 ) can be a sample stream that can be output to the render device ( 412 ) as well as stored in the reference picture memory ( 457 ) for use in future inter-picture prediction. 
     Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser ( 420 )), the current picture buffer ( 458 ) can become a part of the reference picture memory ( 457 ), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture. 
     The video decoder ( 410 ) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence. 
     In an embodiment, the receiver ( 431 ) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder ( 410 ) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on. 
       FIG. 5  shows a block diagram of a video encoder ( 503 ) according to an embodiment of the present disclosure. The video encoder ( 503 ) is included in an electronic device ( 520 ). The electronic device ( 520 ) includes a transmitter ( 540 ) (e.g., transmitting circuitry). The video encoder ( 503 ) can be used in the place of the video encoder ( 303 ) in the  FIG. 3  example. 
     The video encoder ( 503 ) may receive video samples from a video source ( 501 ) (that is not part of the electronic device ( 520 ) in the  FIG. 5  example) that may capture video image(s) to be coded by the video encoder ( 503 ). In another example, the video source ( 501 ) is a part of the electronic device ( 520 ). 
     The video source ( 501 ) may provide the source video sequence to be coded by the video encoder ( 503 ) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source ( 501 ) may be a storage device storing previously prepared video. In a videoconferencing system, the video source ( 501 ) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples. 
     According to an embodiment, the video encoder ( 503 ) may code and compress the pictures of the source video sequence into a coded video sequence ( 543 ) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller ( 550 ). In some embodiments, the controller ( 550 ) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller ( 550 ) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller ( 550 ) can be configured to have other suitable functions that pertain to the video encoder ( 503 ) optimized for a certain system design. 
     In some embodiments, the video encoder ( 503 ) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder ( 530 ) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder ( 533 ) embedded in the video encoder ( 503 ). The decoder ( 533 ) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory ( 534 ). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory ( 534 ) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well. 
     The operation of the “local” decoder ( 533 ) can be the same as of a “remote” decoder, such as the video decoder ( 410 ), which has already been described in detail above in conjunction with  FIG. 4 . Briefly referring also to  FIG. 4 , however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder ( 545 ) and the parser ( 420 ) can be lossless, the entropy decoding parts of the video decoder ( 410 ), including the buffer memory ( 415 ), and parser ( 420 ) may not be fully implemented in the local decoder ( 533 ). 
     An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below. 
     During operation, in some examples, the source coder ( 530 ) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously-coded picture from the video sequence that were designated as “reference pictures”. In this manner, the coding engine ( 532 ) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture. 
     The local video decoder ( 533 ) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder ( 530 ). Operations of the coding engine ( 532 ) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in  FIG. 5 ), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder ( 533 ) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache ( 534 ). In this manner, the video encoder ( 503 ) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors). 
     The predictor ( 535 ) may perform prediction searches for the coding engine ( 532 ). That is, for a new picture to be coded, the predictor ( 535 ) may search the reference picture memory ( 534 ) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor ( 535 ) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor ( 535 ), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory ( 534 ). 
     The controller ( 550 ) may manage coding operations of the source coder ( 530 ), including, for example, setting of parameters and subgroup parameters used for encoding the video data. 
     Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder ( 545 ). The entropy coder ( 545 ) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth. 
     The transmitter ( 540 ) may buffer the coded video sequence(s) as created by the entropy coder ( 545 ) to prepare for transmission via a communication channel ( 560 ), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter ( 540 ) may merge coded video data from the video coder ( 503 ) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown). 
     The controller ( 550 ) may manage operation of the video encoder ( 503 ). During coding, the controller ( 550 ) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types: 
     An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features. 
     A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block. 
     A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block. 
     Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks&#39; respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures. 
     The video encoder ( 503 ) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder ( 503 ) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used. 
     In an embodiment, the transmitter ( 540 ) may transmit additional data with the encoded video. The source coder ( 530 ) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on. 
     A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use. 
     In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block. 
     Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency. 
     According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like. 
       FIG. 6  shows a diagram of a video encoder ( 603 ) according to another embodiment of the disclosure. The video encoder ( 603 ) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder ( 603 ) is used in the place of the video encoder ( 303 ) in the  FIG. 3  example. 
     In an HEVC example, the video encoder ( 603 ) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder ( 603 ) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder ( 603 ) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder ( 603 ) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder ( 603 ) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks. 
     In the  FIG. 6  example, the video encoder ( 603 ) includes the inter encoder ( 630 ), an intra encoder ( 622 ), a residue calculator ( 623 ), a switch ( 626 ), a residue encoder ( 624 ), a general controller ( 621 ), and an entropy encoder ( 625 ) coupled together as shown in  FIG. 6 . 
     The inter encoder ( 630 ) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information. 
     The intra encoder ( 622 ) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder ( 622 ) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture. 
     The general controller ( 621 ) is configured to determine general control data and control other components of the video encoder ( 603 ) based on the general control data. In an example, the general controller ( 621 ) determines the mode of the block, and provides a control signal to the switch ( 626 ) based on the mode. For example, when the mode is the intra mode, the general controller ( 621 ) controls the switch ( 626 ) to select the intra mode result for use by the residue calculator ( 623 ), and controls the entropy encoder ( 625 ) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller ( 621 ) controls the switch ( 626 ) to select the inter prediction result for use by the residue calculator ( 623 ), and controls the entropy encoder ( 625 ) to select the inter prediction information and include the inter prediction information in the bitstream. 
     The residue calculator ( 623 ) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder ( 622 ) or the inter encoder ( 630 ). The residue encoder ( 624 ) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder ( 624 ) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder ( 603 ) also includes a residue decoder ( 628 ). The residue decoder ( 628 ) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder ( 622 ) and the inter encoder ( 630 ). For example, the inter encoder ( 630 ) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder ( 622 ) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples. 
     The entropy encoder ( 625 ) is configured to format the bitstream to include the encoded block. The entropy encoder ( 625 ) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder ( 625 ) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information. 
       FIG. 7  shows a diagram of a video decoder ( 710 ) according to another embodiment of the disclosure. The video decoder ( 710 ) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder ( 710 ) is used in the place of the video decoder ( 310 ) in the  FIG. 3  example. 
     In the  FIG. 7  example, the video decoder ( 710 ) includes an entropy decoder ( 771 ), an inter decoder ( 780 ), a residue decoder ( 773 ), a reconstruction module ( 774 ), and an intra decoder ( 772 ) coupled together as shown in  FIG. 7 . 
     The entropy decoder ( 771 ) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder ( 772 ) or the inter decoder ( 780 ), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder ( 780 ); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder ( 772 ). The residual information can be subject to inverse quantization and is provided to the residue decoder ( 773 ). 
     The inter decoder ( 780 ) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information. 
     The intra decoder ( 772 ) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information. 
     The residue decoder ( 773 ) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder ( 773 ) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder ( 771 ) (data path not depicted as this may be low volume control information only). 
     The reconstruction module ( 774 ) is configured to combine, in the spatial domain, the residual as output by the residue decoder ( 773 ) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality. 
     It is noted that the video encoders ( 303 ), ( 503 ), and ( 603 ), and the video decoders ( 310 ), ( 410 ), and ( 710 ) can be implemented using any suitable technique. In an embodiment, the video encoders ( 303 ), ( 503 ), and ( 603 ), and the video decoders ( 310 ), ( 410 ), and ( 710 ) can be implemented using one or more integrated circuits. In another embodiment, the video encoders ( 303 ), ( 503 ), and ( 503 ), and the video decoders ( 310 ), ( 410 ), and ( 710 ) can be implemented using one or more processors that execute software instructions. 
     Aspects of the disclosure provide signaling techniques for interweaved affine inter prediction. To be more specific, the interpretation and signaling for interweaved affine inter prediction are modified so that better compression efficiency may be achieved. 
     Various coding standards, such as HEVC, VVC and the like are developed to include new techniques. 
     In some examples of VVC, for each inter-predicted CU, motion parameters include motion vectors, reference picture indices and reference picture list usage index, and additional information needed for the new coding feature of VVC to be used for inter-predicted sample generation. The motion parameters can be signaled in an explicit or implicit manner. In an example, when a CU is coded with skip mode, the CU is associated with one PU and has no significant residual coefficients, no coded motion vector delta or reference picture index. In another example, a merge mode is specified whereby the motion parameters for the current CU are obtained from neighboring CUs, including spatial and temporal candidates, and additional schedules introduced in VVC. The merge mode can be applied to any inter-predicted CU, not only for skip mode. The alternative to merge mode is the explicit transmission of motion parameters, where motion vector, corresponding reference picture index for each reference picture list and reference picture list usage flag and other needed information are signaled explicitly per each CU. 
     Beyond the inter coding features in HEVC, the VVC test model 3 (VTM3) includes a number of new and refined inter prediction coding tools, such as extended merge prediction, merge mode with motion vector difference (MMVD), affine motion compensated prediction, subblock-based temporal motion vector predictor (SbTMVP), triangle partition prediction, combined inter and intra prediction (CIIP), and the like. Some features of the above mentioned inter prediction coding tools are described in the present disclosure. 
     In some examples, extended merge prediction is used in VTM3. Specifically, in In VTM3, the merge candidate list is constructed by including the five types of candidates in an order of: (1) spatial motion vector predictor (MVP) from spatial neighbor CUs; (2) temporal MVP from collocated CUs; (3) history-based MVP from a FIFO table; (4) pairwise average MVP; and (5) zero MVs. In some embodiments, the techniques used in merge candidate list construction include spatial candidate derivation, temporal candidate derivation, history-based merge candidate derivation and pair-wise average merge candidate derivation. 
     In an example, the size of merge list is signaled in slice header and the maximum allowed size of a merge list is 6 in VTM3. For each CU coded in merge mode, an index of the best merge candidate is encoded using truncated unary binarization (TU). The first binary of the merge index is coded with context coding, and bypass coding can be used for other binaries. 
     For spatial candidate derivation, according to an aspect of the disclosure, the derivation of spatial merge candidates in VVC is similar to that in HEVC. For example, a maximum of four merge candidates are selected among candidates located in the positions A 0 -A 1  and B 0 -B 2  depicted in  FIG. 1 . The order of derivation is A 1 , B 1 , B 0 , A 0  and B 2 . Position B 2  is considered only when any CU of position A 1 , B 1 , B 0 , A 0  is not available (e.g. belonging to another slice or tile) or is intra coded. After candidate at position Al is added, the addition of the remaining candidates is subject to a redundancy check which ensures that candidates with same motion information are excluded from the list so that coding efficiency is improved. To reduce computational complexity, not all possible candidate pairs are considered in the mentioned redundancy check. Instead only the pairs linked with an arrow in  FIG. 8  are considered and a candidate is only added to the list if the corresponding candidate used for redundancy check has not the same motion information. 
     For temporal candidate derivation, according to an aspect of the disclosure, only one candidate is added to the list. Particularly, in the derivation of the temporal merge candidate, a scaled motion vector is derived based on a co-located CU belonging to the collocated reference picture. The reference picture list to be used for derivation of the co-located CU is explicitly signaled in the slice header. 
       FIG. 9  shows an example for temporal candidate derivation.  FIG. 9  shows a sequence of pictures that includes a current picture having a current CU, a collocated picture having a col-located CU of the current CU, a reference picture of the current picture and a reference picture of the col-located picture. In an example, a picture order count (POC) distance (e.g., difference of POCs) between the reference picture of the current picture and the current picture is denoted as tb, and the POC distance between the reference picture of the col-located picture and the col-located picture is denoted as td. The scaled motion vector for temporal merge candidate is shown by  910  in  FIG. 9 , which is scaled from the motion vector  920  of the co-located CU using the POC distances, tb and td (e.g., a ratio of tb to td). The reference picture index of temporal merge candidate is set equal to zero. 
       FIG. 10  shows an example for illustrating the position for the temporal candidate that is selected between candidates C 0  and C 1 . When the CU at position C 0  is not available, or is intra coded, or is outside of the current row of CTUs, then the position C 1  can be used. Otherwise, the position C 0  is used in the derivation of the temporal merge candidate. 
     The history-based MVP (HMVP) merge candidates are added to merge list after the spatial MVP and temporal MVP (TMVP). In some examples, for history-based merge candidate derivation, the motion information of a previously coded block is stored in a table and used as MVP for the current CU. The table with multiple HMVP candidates is maintained during the encoding/decoding process. The table is reset (emptied) when a decoding of a new CTU row starts. Whenever there is a non-subblock inter-coded CU, the associated motion information is added to the last entry of the table as a new HMVP candidate. 
     In some examples, such as in VTM3, the HMVP table size S is set to be 6, which indicates up to 6 history-based MVP (HMVP) candidates may be added to the table. At a time of inserting a new motion candidate to the table, a constrained first-in-first-out (FIFO) rule is utilized wherein redundancy check is firstly applied to find whether there is an identical HMVP in the table. If an identical HMVP in the table is found, the identical HMVP is removed from the table and all the HMVP candidates afterwards can move forward. 
     HMVP candidates can be used in the merge candidate list construction process. The latest several HMVP candidates in the table are checked in order and inserted to the candidate list after the TMVP candidate. Redundancy check is applied on the HMVP candidates to the spatial or temporal merge candidate. 
     In some examples, to reduce the number of redundancy check operations, some simplifications are introduced. In an example, the number of HMPV candidates is used for merge list generation is set as (N&lt;=4) ? M: (8−N), where N denotes the number of existing candidates in the merge list and M denotes the number of available HMVP candidates in the table. 
     In another example, once the total number of available merge candidates is 1 below the maximum value for the allowed merge candidates, the merge candidate list construction process from HMVP is terminated. 
     For the pair-wise average merge candidates derivation, pair-wise average candidates are generated by averaging predefined pairs of candidates in the existing merge candidate list. In some examples, the predefined pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (2, 3)}, where the numbers denote the merge indices in the merge candidate list. The averaged motion vectors are calculated separately for each reference list. When both motion vectors are available in one reference list, these two motion vectors are averaged even when they point to different reference pictures. When only one motion vector is available in reference list, use the one motion vector directly; if no motion vector is available in the reference list, the reference list is invalid. 
     In some examples, when the merge list is not full after pair-wise average merge candidates are added, the zero MVPs are inserted in the end until the maximum merge candidate number is encountered. 
     In addition to merge mode, where the implicitly derived motion information is directly used for prediction samples generation of the current CU, the merge mode with motion vector differences (MMVD) is introduced in VVC. In some examples, a MMVD flag is signaled right after sending a skip flag and a merge flag to specify whether MMVD mode is used for a CU. 
     In MMVD, after a merge candidate is selected, the motion information is further refined by the signaled motion vector difference (MVD) information. In some examples, the information includes a merge candidate flag, an index to specify motion magnitude, and an index for indication of motion direction. In MMVD mode, one of the first two candidates in the merge list is selected to be used as MV basis. The merge candidate flag is signaled to specify which one is used. 
     In some examples, a distance index is used to specify motion magnitude information and indicate the pre-defined offset from a starting point. 
       FIG. 11  shows examples for MMVD according to an embodiment of the disclosure. For example, the starting point MV is shown by (1111) (for example according to a prediction direction IDX and base candidate IDX). The offset is added to either horizontal component or vertical component of starting MV. An example of the relation of distance index and pre-defined offset is shown in Table 1. 
     
       
         
           
               
             
               
                 TABLE 1 
               
             
            
               
                   
               
               
                 Relation Of Distance Index And Pre-Defined Offset 
               
            
           
           
               
               
               
               
               
               
               
               
               
            
               
                 Distance IDX 
                 0 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
               
               
                   
               
               
                 Offset (in unit of 
                 ¼ 
                 ½ 
                 1 
                 2 
                 4 
                 8 
                 16 
                 32 
               
               
                 luma sample) 
               
               
                   
               
            
           
         
       
     
     In some examples, direction index represents the direction of the MVD relative to the starting point. The direction index can represent of the four directions as shown in Table 2. It&#39;s noted that the meaning of MVD sign could be variant according to the information of starting MVs. When the starting MVs is an uni-prediction MV or bi-prediction MVs with both lists point to the same side of the current picture (i.e. POCs of two reference pictures are both larger than the POC of the current picture, or are both smaller than the POC of the current picture), the sign in Table 2 specifies the sign of MV offset added to the starting MV. When the starting MVs is bi-prediction MVs with the two MVs point to the different sides of the current picture (i.e. the POC of one reference picture is larger than the POC of the current picture, and the POC of the other reference picture is smaller than the POC of the current picture), the sign in Table 2 specifies the sign of MV offset added to the list0 MV component of starting MV and the sign for the list1 MV has opposite value. 
     
       
         
           
               
             
               
                 TABLE 2 
               
             
            
               
                   
               
               
                 Sign Of MV Offset Specified By Direction Index 
               
            
           
           
               
               
               
               
               
               
            
               
                   
                 Direction IDX 
                 00 
                 01 
                 10 
                 11 
               
               
                   
                   
               
               
                   
                 x-axis 
                 + 
                 − 
                 N/A 
                 N/A 
               
               
                   
                 y-axis 
                 N/A 
                 N/A 
                 + 
                 − 
               
               
                   
                   
               
            
           
         
       
     
     For affine motion compensated prediction, in HEVC, only translation motion model is applied for motion compensation prediction (MCP). The real world has many kinds of motion, e.g. zoom in/out, rotation, perspective motions and the other irregular motions. In the VTM3, a block-based affine transform motion compensation prediction is applied. 
       FIG. 12A  shows the affine motion field of the block that is described by motion information of two control points (4-parameter affine model) and  FIG. 12B  shows the affine motion field of a block that is described by three control points (6-parameter affine model). 
     In some embodiments, the 4-parameter affine motion model, motion vector at sample location (x, y) in a block can be derived as Eq. 1, and the 6-parameter affine motion model, motion vector at sample location (x, y) in a block can be derived as Eq. 2: 
                   {             m   ⁢     ν   x       =             m   ⁢     v     1   ⁢   x         -     m   ⁢     ν     0   ⁢   x           W     ⁢   x     +           m   ⁢     ν     1   ⁢   y         -     m   ⁢     ν     0   ⁢   y           W     ⁢   y     +     m   ⁢     ν     0   ⁢   x                         m   ⁢     ν   y       =             m   ⁢     v     1   ⁢   y         -     m   ⁢     v     0   ⁢   y           W     ⁢   x     +           m   ⁢     v     1   ⁢   y         -     m   ⁢     v     0   ⁢   x           W     ⁢   y     +     m   ⁢     ν     0   ⁢   y                           (     Eq   .           ⁢   1     )               {             m   ⁢     v   x       =             mv     1   ⁢   x       -     m   ⁢     v     0   ⁢   x           W     ⁢   x     +           m   ⁢     v     2   ⁢   x         -     m   ⁢     v     0   ⁢   x           H     ⁢   y     +     m   ⁢     ν     0   ⁢   x                         m   ⁢     ν   y       =             m   ⁢     v     1   ⁢   y         -     m   ⁢     v     0   ⁢   y           W     ⁢   x     +           m   ⁢     v     2   ⁢   y         -     m   ⁢     v     0   ⁢   y           H     ⁢   y     +     mv     0   ⁢   y                         (     Eq   .           ⁢   2     )               
where (mv 0x , mv 0y ) denotes the motion vector of the top-left corner control point CP 0 , (mv 1x , mv 1y ) is motion vector of the top-right corner control point CP 1 , and (mv 2x , mv 2y ) is motion vector of the bottom-left corner control point CP 2 .
 
     In order to simplify the motion compensation prediction, block based affine transform prediction is applied. 
       FIG. 13  shows an example of affine MV field per sub-block. The current CU is divided into 4×4 luma sub-blocks. To derive motion vector of each 4×4 luma sub-block, the motion vector of the center sample of each sub-block, as shown in  FIG. 13 , is calculated according to above equations, and rounded to 1/16 fraction accuracy. Then the motion compensation interpolation filters are applied to generate the prediction of each sub-block with derived motion vector. The sub-block size of chroma-components is also set to be 4×4. The MV of a 4×4 chroma sub-block is calculated as the average of the MVs of the four corresponding 4×4 luma sub-blocks in an example. 
     Two affine motion inter prediction modes, such as affine merge (AF_MERGE) mode and affine advanced MVP (AMVP) mode, can be used. 
     For affine merge prediction, in an example, AF MERGE mode can be applied for CUs with both width and height larger than or equal to 8. In the AF MERGE mode, the control point motion vectors (CPMVs) of the current CU are generated based on the motion information of the spatial neighboring CUs. In an example, there can be up to five CPMVP candidates and an index is signaled to indicate the one to be used for the current CU. In an example, three types of CPVM candidates are used to form the affine merge candidate list. The first type of CPMV candidates is inherited affine merge candidates that extrapolated from the CPMVs of the neighbour CUs. The second type of CPMV candidates are constructed affine merge candidates CPMVPs that are derived using the translational MVs of the neighbour CUs. The third type of CPMV candidates is Zero MVs. 
     In some examples, such as in VTM3, a maximum of two inherited affine candidates can be used. In an example, two inherited affine candidates are derived from affine motion models of the neighboring blocks, one from left neighboring CUs (referred to as left predictor) and one from above neighboring CUs (referred to as above predictor). In some examples, for the left predictor, the scan order is A 0 →A 1 , and for the above predictor, the scan order is B 0 →B 1 →B 2 . In an example, only the first inherited candidate from each side is selected. In some examples, no pruning check is performed between two inherited candidates. When a neighboring affine CU is identified, the control point motion vectors of the neighboring affine CU are used to derive the CPMVP candidate in the affine merge list of the current CU. 
       FIG. 14  shows an example for affine merge mode. As shown in  FIG. 14 , when the neighbour left bottom block A is coded in affine mode, the motion vectors mv 2 , mv 3  and mv 4  of the top left corner, above right corner and left bottom corner of a CU which contains the block A are attained. When block A is coded with 4-parameter affine model, the two CPMVs of the current CU are calculated according to mv 2 , and mv 3 . In case that block A is coded with 6-parameter affine model, the three CPMVs of the current CU are calculated according to mv 2 , mv 3  and mv 4 . 
     In some examples, a constructed affine candidate is constructed by combining the neighbor translational motion information of each control point. The motion information for the control points can be derived from the specified spatial neighbors and temporal neighbor. 
       FIG. 15  shows an example of spatial neighbors (e.g., A 0 -A 2  and B 0 -B 3 ) and temporal neighbor (e.g., T) according to some embodiments of the disclosure. In an example, CPMV k  (k=1, 2, 3, 4) represents the k-th control point. For CPMV 1 , the B 2 →B 3 →A 2  blocks are checked (→ is used for checking order) and the MV of the first available block is used. For CPMV 2 , the B 1 →B 0  blocks are checked and for CPMV 3 , the A 1 →A 0  blocks are checked. For TMVP, T is checked and is used as CPMV 4  if the MV of the block T is available. 
     After MVs of four control points are attained, affine merge candidates are constructed based on that motion information. The following combinations of control point MVs are used to construct in order: {CPMV 1 , CPMV 2 , CPMV 3 }, {CPMV 1 , CPMV 2 , CPMV 4 }, {CPMV 1 , CPMV 3 , CPMV 4 },{CPMV 2 , CPMV 3 , CPMV 4 }, {CPMV 1 , CPMV 2 }, {CPMV 1 , CPMV 3 }. 
     The combination of 3 CPMVs can construct a 6-parameter affine merge candidate and the combination of 2 CPMVs can construct a 4-parameter affine merge candidate. In an example, to avoid motion scaling process, when the reference indices of control points are different, the related combination of control point MVs can be discarded. 
     In an example, after inherited affine merge candidates and constructed affine merge candidate are checked, if a candidate list is still not full, zero MVs are inserted to the end of the list. 
     For affine AMVP prediction, the affine AMVP mode can be applied on CUs with both width and height larger than or equal to 16. In some examples, an affine flag at CU level is signaled in the bitstream (e.g., coded video bitstream) to indicate whether affine AMVP mode is used in the CU and then another flag is signaled to indicate whether 4-parameter affine or 6-parameter affine is used. In the affine AMVP mode, the difference of the CPMVs of current CU and their predictors CPMVPs is signaled in the bitstream. The affine AMVP candidate list size is 2 and the affine AMVP candidate list is generated by using the following four types of CPVM candidate in the order: (1) inherited affine AMVP candidates that extrapolated from the CPMVs of the neighbour CUs; (2) constructed affine AMVP candidates CPMVPs that are derived using the translational MVs of the neighbour CUs; (3) translational MVs from neighboring CUs; and (4) Zero MVs. 
     In some examples, the checking order of inherited affine AMVP candidates is the same as the checking order of inherited affine merge candidates. In an example, the only difference between the affine merge prediction and affine AMVP prediction is that, for AVMP candidate, only the affine CU that has the same reference picture as the current block is considered. In an example, no pruning process is applied when inserting an inherited affine motion predictor into the candidate list. 
     In some examples, constructed AMVP candidate can be derived from the specified spatial neighbors shown in  FIG. 15 . In an example, the same checking order is used as done in the candidate construction for the affine merge prediction. In addition, reference picture index of the neighboring block is also checked. The first block in the checking order that is inter coded and has the same reference picture as in current CUs is used. When the current CU is coded with 4-parameter affine mode, and motion vectors of two control points mv 0  and mv 1 are both available, the motion vectors of the two control points are added as one candidate in the affine AMVP list. When the current CU is coded with 6-parameter affine mode, and all three motion vectors of the control points CPMVs are available, they are added as one candidate in the affine AMVP list. Otherwise, constructed AMVP candidate is set as unavailable. 
     When the number of affine AMVP list candidates is still less than 2 after inherited affine AMVP candidates and constructed AMVP candidate are checked, mv 0 , mv 1  and mv 2  will be added, in order, as the translational MVs to predict all control point MVs of the current CU, when available. Finally, zero MVs are used to fill the affine AMVP list if the affine AMVP list is still not full. 
     In some examples, the subblock-based temporal motion vector prediction (SbTMVP) can be used in VTM. Similar to the temporal motion vector prediction (TMVP) in HEVC, SbTMVP uses the motion field in the collocated picture to improve motion vector prediction and merge mode for CUs in the current picture. In some examples, the same collocated picture used by TMVP is used for SbTVMP. SbTMVP differs from TMVP in two aspects. In the first aspect, TMVP predicts motion at CU level but SbTMVP predicts motion at sub-CU level. In the second aspect, TMVP fetches the temporal motion vectors from the collocated block in the collocated picture (the collocated block is the bottom-right or center block relative to the current CU), SbTMVP applies a motion shift before fetching the temporal motion information from the collocated picture. The motion shift is obtained from the motion vector from one of the spatial neighboring blocks of the current CU. 
       FIGS. 16-17  show an example of a SbTVMP process according to some embodiments of the disclosure. SbTMVP predicts the motion vectors of the sub-CUs within the current CU in two steps. In the first step, the spatial neighbors shown in  FIG. 16  are examined in the order of A 1 , B 1 , B 0  and A 0  to identify a first spatial neighboring block that has a motion vector using the collocated picture as its reference picture. Then, the motion vector using the collected picture as its reference picture is selected to be the motion shift to be applied. If no such motion is identified from the spatial neighbors of A 1 , B 1 , B 0  and A 0 , then the motion shift is set to (0, 0). 
     In the second step, the motion shift identified in the first step is applied (i.e. added to the current block&#39;s coordinates) to obtain sub-CU-level motion information (motion vectors and reference indices) from the collocated picture as shown in  FIG. 17 . In the  FIG. 17  example, A 1 &#39;s motion vector is set as the motion shift ( 1710 ). Then, for each sub-CU, the motion information of the corresponding block (the smallest motion grid that covers the center sample) in the collocated picture is used to derive the motion information for the sub-CU. After the motion information of the collocated sub-CU is identified, it is converted to the motion vectors and reference indices of the current sub-CU in a similar way as the TMVP process of HEVC. For example, temporal motion scaling is applied to align the reference pictures of the temporal motion vectors to those of the current CU. 
     In some examples, such as in VTM3, a combined sub-block based merge list which includes both SbTVMP candidate and affine merge candidates is used for the signaling of sub-block based merge mode. The SbTVMP mode is enabled/disabled by a sequence parameter set (SPS) flag. When the SbTMVP mode is enabled, the SbTMVP predictor is added as the first entry of the combined sub-block based merge list, and followed by the affine merge candidates. The maximum allowed size of the sub-block based merge list is 5 in VTM3. 
     In an example, the sub-CU size used in SbTMVP is fixed to be 8×8, and as done for affine merge mode, SbTMVP mode is only applicable to the CU with both width and height are larger than or equal to 8. 
     In some embodiments, the encoding logic of the additional SbTMVP merge candidate is the same as for the other merge candidates. In an example, for each CU in P or B slice, an additional rate distortion check is performed to decide whether to use the SbTMVP candidate. 
     In some examples, triangular prediction is used in VTM3 for inter prediction. The mode that uses the triangular prediction is referred to as triangle partition mode. In some examples, the triangle partition mode is only applied to CUs that satisfies certain conditions, such as have a size of 8×8 or larger and are coded in skip or merge mode. For a CU that satisfies these conditions, a CU-level flag is signaled to indicate whether the triangle partition mode is applied or not. 
     When the triangle partition mode is used, a CU is split evenly into two triangle-shaped partitions, using either the diagonal split or the anti-diagonal split. 
       FIG. 18  shows two CU examples ( 1810 ) and ( 1820 ) of triangular partition. The CU ( 1810 ) is split from top-left corner to bottom-right corner (referred to as diagonal direction) into two triangular prediction units, and the CU ( 1820 ) is split from top-right corner to bottom-left corner (referred to as inverse diagonal direction) into two triangular prediction units PU 1  and PU 2 . Each triangular prediction unit in the CU is inter-predicted using its own uni-prediction motion vector and reference frame index which are derived from a uni-prediction candidate list. Further, an adaptive weighting process is performed to the diagonal edge after predicting the triangular prediction units. Then, the transform and quantization process are applied to the whole CU. It is noted that the triangular partition is only applied to skip and merge modes. 
     In some examples, each triangle partition in the CU is inter-predicted using its own motion vector; only uni-prediction is allowed for each partition, that is, each partition has one motion vector and one reference index. The uni-prediction motion constraint is applied to ensure that same as the conventional bi-prediction, only two motion compensated predictions are used for each CU. The uni-prediction motion information for each partition is derived from a uni-prediction candidate list constructed using a process that is referred to as uni-prediction candidate list construction process. 
     In an example, when the CU-level flag indicates that the current CU is coded using the triangle partition mode, an index in the range of [0, 39] is further signaled. Using this triangle partition index, the direction of the triangle partition (diagonal or anti-diagonal), as well as the motion for each of the partitions can be obtained through a look-up table. After predicting each of the triangle partitions, the sample values along the diagonal or anti-diagonal edge are adjusted using a blending processing with adaptive weights. The result of the blending process is the prediction signal for the whole CU, and transform and quantization process can be applied to the whole CU as in other prediction modes. Finally, the motion field of a CU predicted using the triangle partition mode is stored in 4×4 units. 
     According to an aspect of the disclosure, the unit-prediction candidate list construction process constructs a uni-prediction candidate list that includes five uni-prediction motion vector candidates. 
       FIG. 19  shows an example for forming a uni-prediction candidate list for a current block ( 1910 ). In an example, the uni-prediction candidate list consists of five uni-prediction motion vector candidates. The uni-prediction candidate list is derived from seven neighboring blocks including five spatial neighboring blocks ( 1  to  5  as shown in  FIG. 19 ) and two temporal co-located blocks ( 6  to  7  as shown in  FIG. 19 ). For example, the motion vectors of the seven neighboring blocks are collected and put into the uni-prediction candidate list in certain order, such as uni-prediction motion vectors first. Then, for the bi-predicted neighboring blocks, the L0 motion vectors (that is, the L0 motion vector part of the bi-prediction MV), the L1 motion vectors (that is, the L1 motion vector part of the bi-prediction MV), and averaged motion vectors of the L0 and L1 motion vectors of the bi-prediction MVs are put into the uni-prediction candidate list. When the number of candidates is less than five, zero motion vector is added to the end of the list. 
     In some examples, 40 possible ways can be used to predict a CU coded in triangle partition mode. The 40 possible ways are determined as 5 (for partition 1 motion)×4 (for partition 2 motion)×2 (diagonal or anti-diagonal partition modes). The triangle partition index in the range of [0, 39] is used to identify which one of these possibilities is used using a look-up table, such as Table 3. In Table 3, triangle idx denotes the triangle partition index in the range of [0,39]; triangle_dir denotes the direction of the partition (e.g, diagonal or anti-diagonal partition modes); part_1_cand denotes the index of the selected candidate for partition 1, part_2_cand denotes the index of the selected candidate for partition 2. 
     
       
         
           
               
             
               
                 TABLE 3 
               
               
                   
               
               
                 Lookup Table To Derive Triangle Direction And Partition Motions Based On Triangle Index 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
               
            
               
                 triangle_idx 
                 0 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
                 8 
                 9 
                 10 
                 11 
                 12 
                 13 
                 14 
                 15 
                 16 
                 17 
                 18 
                 19 
               
               
                   
               
               
                 triangle_dir 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
                 1 
               
               
                 Part_1_cand 
                 1 
                 0 
                 0 
                 0 
                 2 
                 0 
                 0 
                 1 
                 3 
                 4 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 1 
                 2 
               
               
                 Part_2_cand 
                 0 
                 1 
                 2 
                 1 
                 0 
                 3 
                 4 
                 0 
                 0 
                 0 
                 2 
                 2 
                 2 
                 4 
                 3 
                 3 
                 4 
                 4 
                 3 
                 1 
               
               
                   
               
               
                 triangle_idx 
                 20 
                 21 
                 22 
                 23 
                 24 
                 25 
                 26 
                 27 
                 28 
                 29 
                 30 
                 31 
                 32 
                 33 
                 34 
                 35 
                 36 
                 37 
                 38 
                 39 
               
               
                   
               
               
                 triangle_dir 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 0 
                 0 
               
               
                 Part_1_cand 
                 2 
                 2 
                 4 
                 3 
                 3 
                 3 
                 4 
                 3 
                 2 
                 4 
                 4 
                 2 
                 4 
                 3 
                 4 
                 3 
                 2 
                 2 
                 4 
                 3 
               
               
                 Part_2_cand 
                 0 
                 1 
                 3 
                 0 
                 2 
                 4 
                 0 
                 1 
                 3 
                 1 
                 1 
                 3 
                 2 
                 2 
                 3 
                 1 
                 4 
                 4 
                 2 
                 4 
               
               
                   
               
            
           
         
       
     
     After the predictions of the triangle partitions using respective motion information, blending is applied to the two prediction signals to derive samples around the diagonal or anti-diagonal edge, such as illustrated in  FIG. 22  by weighted area for block ( 2210 ) and weighted area for block ( 2220 ). The blending process adaptively chooses weights depending on the motion vector difference between the two partitions. 
     In an example, two weighting factor groups are used. The first weighting factor group includes {7/8, 6/8, 4/8, 2/8, 1/8} for luminance samples and {7/8, 4/8, 1/8} for the chrominance samples, respectively. The second weighting factor group includes {7/8, 6/8, 5/8, 4/8, 3/8, 2/8, 1/8} for the luminance samples and {6/8, 4/8, 2/8} for the chrominance samples, respectively. 
       FIG. 20  shows an example of using the first weighting factor group to derive the final prediction for a CU according to some embodiments of the disclosure.  FIG. 20  shows weighting factors ( 2010 ) for luminance samples and weighting factors ( 2020 ) for chrominance samples. 
       FIG. 21  shows an example of using the second weighting factor group to derive the final prediction for a CU according to some embodiments of the disclosure.  FIG. 21  shows weighting factors ( 2110 ) for luminance samples and weighting factors ( 2120 ) for chrominance samples. 
     The second weighting factor group has more luma weights and blends more luma samples along the partition edge. In some examples, when the reference pictures of the two triangle partitions are different from each other, or when their motion vector difference is larger than 16 luma samples, the second weighting factor group is selected; otherwise, the first weighting factor group is selected. 
     For example, for a luminance sample, P 1  is the uni-prediction of PU 1 , P 2  is the uni-prediction of PU 2 . Using  FIG. 20  as an example, when the weighting factor is shown as P 1 , the final prediction is solely determined by the uni-prediction of PU 1 ; when the weighing factor is shown as P 2 , the final prediction is solely determined by the uni-prediction of PU 2 . When the weighing factor is shown as a number, the number is indicative of a weight for the uni-prediction of PU 1 . For example, when the weighting factor is 2, the final prediction is calculated according to (Eq. 3); when the weighting factor is 4, the final prediction is calculated according to (Eq. 4); and when the weighting factor is 7, the final prediction is calculated according to (Eq. 5):
 
Final Prediction=2/8 ×P 1+6/8× P 2  (Eq. 3)
 
Final Prediction=4/8 ×P 1+4/8 ×P 2  (Eq. 4)
 
Final Prediction=7/8 ×P 1+1/8 ×P 2  (Eq. 5)
 
     Combined inter and intra prediction (CIIP) is another tool that is used in VTM3 in some examples. In VTM3, when a CU is coded in merge mode, and if the CU includes at least 64 luma samples (that is, CU width times CU height is equal to or larger than 64), an additional flag is signaled to indicate if the combined inter/intra prediction (CIIP) mode is applied to the current CU. 
     In some embodiments, in order to form the CIIP prediction, an intra prediction mode is first derived from two additional syntax elements. Up to four possible intra prediction modes can be used, such as DC, planar, horizontal, or vertical. Then, the inter prediction and intra prediction signals are derived using regular intra and inter decoding processes. Finally, weighted averaging of the inter and intra prediction signals is performed to obtain the CIIP prediction. 
     In an embodiment, up to 4 intra prediction modes, including DC, planar, horizontal, and vertical, can be used to predict the luma component in the CIIP mode. When the CU shape is very wide (that is, width is more than two times of height), then the horizontal mode is not allowed. When the CU shape is very narrow (that is, height is more than two times of width), then the vertical mode is not allowed. In such cases, 3 intra prediction modes are allowed. 
     In some embodiments, the CIIP mode uses 3 most probable modes (MPM) for intra prediction. The CIIP MPM candidate list can be formed as follows. 
     In a first step to form the CIIP MPM candidate list, in an example, the left and top neighbouring blocks are set as A and B, respectively. 
     In a second step to form the CIIP MPM candidate list, the intra prediction modes of block A and block B, denoted as intraModeA and intraModeB, respectively, are derived. For example, let X be either A or B. The intraModeX is set to DC when 1) block X is not available; or 2) block X is not predicted using the CIIP mode or the intra mode; 3) block B is outside of the current CTU. Otherwise, intraModeX is set to 1) DC or planar if the intra prediction mode of block X is DC or planar; or 2) vertical if the intra prediction mode of block X is a “vertical-like” angular mode (larger than 34), or 3) horizontal if the intra prediction mode of block X is a “horizontal-like” angular mode (smaller than or equal to 34). 
     In a third step, when intraModeA and intraModeB are the same, if intraModeA is planar or DC, then the three MPMs are set to {planar, DC, vertical} in that order; otherwise, the three MPMs are set to {intraModeA, planar, DC} in that order. 
     In the third step, when intraModeA and intraModeB are different, the first two MPMs are set to {intraModeA, intraModeB} in that order. For the third MPM, the uniqueness of planar, DC and vertical is checked in that order against the first two MPM candidate modes (e.g., intraModeA and intraModeB); and as soon as a unique mode is found, the unique mode is added to as the third MPM. 
     In some examples, the CU shape is very wide or very narrow as defined above (one side is more than twice of the other side), the MPM flag is inferred to be 1 without signaling. Otherwise, an MPM flag is signaled to indicate if the CIIP intra prediction mode is one of the CIIP MPM candidate modes. 
     When the MPM flag is 1, an MPM index is further signaled to indicate which one of the MPM candidate modes is used in CIIP intra prediction. Otherwise, if the MPM flag is 0, the intra prediction mode is set to the “missing” mode in the MPM candidate list. For example, if the planar mode is not in the MPM candidate list, then planar is the missing mode, and the intra prediction mode is set to planar. Since 4 possible intra prediction modes are allowed in CIIP, and the MPM candidate list contains only 3 intra prediction modes, one of the 4 possible modes can be determined to be the missing mode. 
     In an example, for the chroma components, the derived mode (DM) mode is always applied without additional signaling; that is, chroma uses the same prediction mode as luma. 
     In some examples, the intra prediction mode of a CIIP-coded CU will be saved and used in the intra mode coding of the future neighbouring CUs. 
     After the inter prediction signal and the intra prediction signal are derived, the inter prediction signal and the intra prediction signal are combined. For example, the inter prediction signal in the CIIP mode P inter  is derived using the same inter prediction process applied to regular merge mode; and the intra prediction signal P intra  is derived using the CIIP intra prediction mode following the regular intra prediction process. Then, the intra and inter prediction signals are combined using weighted averaging. In some examples, the weight value depends on the intra prediction mode and the location of the sample in the coding block. In an example, when the intra prediction mode is the DC or planar mode, or when the block width or height is smaller than 4, then equal weights are applied to the intra prediction and the inter prediction signals. 
     In another example, when the intra prediction mode is either horizontal mode or vertical mode, the weights are determined based on the intra prediction mode and the sample location in the block. Taking the horizontal prediction mode for example (the weights for the vertical mode can be derived similarly but in the orthogonal direction), W denotes the width of the block and H denotes the height of the block. The coding block is first split into four equal-area parts, each of the dimension is (W/4)×H. Starting from the part closest to the intra prediction reference samples and ending at the part farthest away from the intra prediction reference samples, the weight wt for each of the 4 regions is set to 6, 5, 3, and 2, respectively. The final CIIP prediction signal is derived using (Eq. 6):
 
 P   CIIP =((8−wt)× P   inter +wt× P   intra +4)&gt;&gt;3  (Eq. 6)
 
     In some embodiments of the disclosure, a method that is referred to as interweaved affine prediction can be used in video codec. 
       FIG. 23  shows a diagram illustrating an example of interweaved affine prediction according to some embodiments of the disclosure. 
     When the interweaved affine prediction is used, a coding block is divided into sub-blocks with two different dividing patterns that are referred to as a first dividing pattern and a second dividing pattern. In an example, the first dividing pattern is the same as that in VTM that divides a coding block into 4×4 sub-blocks, such as the pattern  0  shown in  FIG. 23 . The second dividing pattern also divides the coding-block into 4×4 sub-blocks but with a 2×2 offset such as pattern  1  shown in  FIG. 23 . Subsequently, two auxiliary predictions are generated by affine motion compensation (AMC) with the two dividing patterns. The MV for each sub-block in the first dividing pattern and the second dividing pattern can be derived from CPMVs using an suitable affine model. 
     The final prediction is calculated as a weighted-sum of the two auxiliary predictions, for example according to (Eq. 7): 
                   {               P   =     (       P   0     +     P   1       )       &gt;&gt;   1     ,       if   ⁢           ⁢     ω   0       =     ω   1                     P   =     (         ω   0     ⁢     P   0       +       ω   1     ⁢     P   1         )       &gt;&gt;     2   ⁢           ⁢   Otherwise                     (     Eq   .           ⁢   7     )               
where P 0  is the prediction from the first dividing pattern, P 1  denotes the prediction from the second dividing pattern, ω 0  denotes the weight for P 0 , and ω 1  denotes the weight for P 1 , and P denotes the final prediction.
 
       FIG. 24  shows a diagram illustrating weights for samples in a 4×4 sub-block. As shown in  FIG. 24 , an auxiliary prediction sample located at the center of a sub-block is associated with a weighting value 3, while an auxiliary prediction sample located at the boundary of a sub-block is associated with a weighting value 1. 
     In some embodiments, to avoid tiny block motion compensation, the interweaved affine prediction is only applied on regions where the size of sub-blocks is 4×4 for both the first and second dividing patterns. 
       FIG. 25  shows a diagram illustrating a region with dot pattern where the interweaved affine prediction is applied. In an example, the interweaved affine prediction is not applied in the region with the diamond pattern. 
     In some examples, such as in VTM-3.0, the size of sub-blocks is also 4×4 on the chroma components, so interweaved prediction is applied on chroma components as well as the luma component. 
     According to an aspect of the disclosure, the bandwidth is not increased by interweaved prediction since the area used to do motion compensation for all sub-blocks is fetched together as a whole in affine motion compensation (AMC). 
     In an embodiment, for flexibility, a flag is signaled in slice header to indicate whether interweaved prediction is used or not. In an example, when the flag is “1”, interweaved prediction is used. 
     In some embodiments, interweaved affine prediction is applied only on un-predicted affine blocks. In some other embodiments, interweaved affine prediction is applied on both uni-predicted and bi-predicted affine blocks. 
     Table 4 shows an example of the inter prediction related syntax elements at coding unit (CU) level according to some embodiments of the disclosure. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture; cbWidth and cbHeight denotes the width and height in luma samples of the current coding block, respectively. 
     
       
         
           
               
             
               
                 TABLE 4 
               
               
                   
               
               
                 Inter Prediction Related Syntax Elements 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
            
               
                 ... 
               
            
           
           
               
               
            
               
                   
                 } 
               
            
           
           
               
               
            
               
                   
                 } else if( treeType != DUAL_TREE_CHROMA ) { /* MODE_INTER */ 
               
            
           
           
               
               
            
               
                   
                 if( cu_skip_flag[ x0 ][ y0 ] = = 0 ) { 
               
            
           
           
               
               
            
               
                   
                 merge_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( merge_flag[ x0 ][ y0 ] ) { 
               
            
           
           
               
               
            
               
                   
                 merge_data( x0, y0, cbWidth, cbHeight ) 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 if( slice_type = = B ) 
               
            
           
           
               
               
            
               
                   
                 inter_pred_idc[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( sps_affine_enabled_flag &amp;&amp; cbWidth &gt;= 16 &amp;&amp; cbHeight &gt;= 16 ) { 
               
            
           
           
               
               
            
               
                   
                 inter_affine_flag[ x0 ][ y0 ] 
               
               
                   
                 if( sps_affine_type_flag &amp;&amp; inter_affine_flag[ x0 ][ y0 ] ) 
               
            
           
           
               
               
            
               
                   
                 cu_affine_type_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                 if( inter_pred_idc[ x0 ][ y0 ] != PRED_L1 ) { 
               
            
           
           
               
               
            
               
                   
                 if( num_ref_idx_l0_active_minus1 &gt; 0 ) 
               
            
           
           
               
               
            
               
                   
                 ref_idx_l0[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 0, 0 ) 
               
               
                   
                 if( MotionModelIdc[ x0 ][ y0 ] &gt; 0 ) 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 0, 1 ) 
               
            
           
           
               
               
            
               
                   
                 if(MotionModelIdc[ x0 ][ y0 ] &gt; 1 ) 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 0, 2 ) 
               
            
           
           
               
               
            
               
                   
                 mvp_l0_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 MvdL0[ x0 ][ y0 ][ 0 ] = 0 
               
               
                   
                 MvdL0[ x0 ][ y0 ][ 1 ] = 0 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                 if( inter_pred_idc[ x0 ][ y0 ] != PRED_L0 ) { 
               
            
           
           
               
               
            
               
                   
                 if( num_ref_idx_l1_active_minus1 &gt; 0 ) 
               
            
           
           
               
               
            
               
                   
                 ref_idx_l1[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( mvd_l1_zero_flag &amp;&amp; inter_pred_idc[ x0 ][ y0 ] = = PRED_BI ) { 
               
            
           
           
               
               
            
               
                   
                 MvdL1[ x0 ][ y0 ][ 0 ] = 0 
               
               
                   
                 MvdL1[ x0 ][ y0 ][ 1 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 0 ][ 0 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 0 ][ 1 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 1 ][ 0 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 1 ][ 1 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 2 ][ 0 ] = 0 
               
               
                   
                 MvdCpL1[ x0 ][ y0 ][ 2 ][ 1 ] = 0 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 1, 0 ) 
               
            
           
           
               
               
            
               
                   
                 if( MotionModelIdc[ x0 ][ y0 ] &gt; 0 ) 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 1, 1 ) 
               
            
           
           
               
               
            
               
                   
                 if(MotionModelIdc[ x0 ][ y0 ] &gt; 1 ) 
               
            
           
           
               
               
            
               
                   
                 mvd_coding( x0, y0, 1, 2 ) 
               
            
           
           
               
               
            
               
                   
                 mvp_l1_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 MvdL1[ x0 ][ y0 ][ 0 ] = 0 
               
               
                   
                 MvdL1[ x0 ][ y0 ][ 1 ] = 0 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                 if( sps_amvr_enabled_flag &amp;&amp; inter_affine_flag = = 0 &amp;&amp; 
               
            
           
           
               
               
            
               
                   
                 ( MvdL0[ x0 ][ y0 ][ 0 ] != 0 | | MvdL0[ x0 ][ y0 ][ 1 ] != 0 | | 
               
               
                   
                  MvdL1[ x0 ][ y0 ][ 0 ] != 0 | | MvdL1[ x0 ][ y0 ][ 1 ] != 0 ) ) { 
               
               
                   
                 if( !sps_cpr_enabled_flag | | !( inter_pred_idc[ x0 ][ y0 ] = = PRED_L0 &amp;&amp; 
               
            
           
           
               
               
            
               
                   
                 ref_idx_l0[ x0 ][y0 ] = = num_ref_idx_l0_active_minus1 ) ) 
               
               
                   
                 amvr_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( amvr_flag[ x0 ][ y0 ] ) 
               
            
           
           
               
               
            
               
                   
                 amvr_4pel_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                  if( sps_gbi_enabled_flag &amp;&amp; inter_pred_idc[ x0 ][ y0 ] = = PRED_BI &amp;&amp; 
               
            
           
           
               
               
            
               
                   
                  cbWidth * cbHeight &gt;= 256 ) 
               
               
                   
                 gbi_idx[ x0 ] [ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } 
               
            
           
           
               
               
            
               
                   
                 } 
               
            
           
           
               
            
               
                 ... 
               
               
                   
               
            
           
         
       
     
     In an example, inter_pred_idc[x0][y0] is used to specify whether list0 (PRED_L0), list1 (PRED_L1), or bi-prediction (PRED_BI) is used for the current coding unit according to Table 5. 
     
       
         
           
               
             
               
                 TABLE 5 
               
             
            
               
                   
               
               
                 Name Association To Inter Prediction Mode 
               
            
           
           
               
               
               
            
               
                   
                 Name of inter_pred_idc 
                   
               
            
           
           
               
               
               
            
               
                   
                 ( cbWidth + 
                 ( cbWidth + 
               
               
                 inter_pred_idc 
                 cbHeight ) != 8 
                 cbHeight ) = = 8 
               
               
                   
               
            
           
           
               
               
               
            
               
                 0 
                 PRED_L0 
                 PRED_L0 
               
               
                 1 
                 PRED_L1 
                 PRED_L1 
               
               
                 2 
                 PRED_BI 
                 n.a. 
               
               
                   
               
            
           
         
       
     
     In an example, when inter_pred_idc[x0][y0] is not present, inter_pred_idc[x0][y0] can be inferred to be equal to PRED_L0. 
     In some examples, the binarization for the syntax element inter_pred_idc can be specified according to Table 6. 
     
       
         
           
               
             
               
                 TABLE 6 
               
             
            
               
                   
               
               
                 Binarization for inter_pred_idc 
               
            
           
           
               
               
            
               
                   
                 Bin string 
               
            
           
           
               
               
               
               
            
               
                 Value of 
                 Name of 
                 ( cbWidth + 
                 ( cbWidth + 
               
               
                 inter_pred_idc 
                 inter_pred_idc 
                 cbHeight ) != 8 
                 cbHeight ) = = 8 
               
               
                   
               
            
           
           
               
               
               
               
            
               
                 0 
                 PRED_L0 
                 00 
                 0 
               
               
                 1 
                 PRED_L1 
                 01 
                 1 
               
               
                 2 
                 PRED_BI 
                 1 
                 — 
               
               
                   
               
            
           
         
       
     
     In the Table 5 example, red_idx_10[x0][y0] specifies the list 0 reference picture index for the current coding unit, and red_idx_11[x0][y0] specifies the list 1 reference picture index for the current coding unit. When red_idx_10[x0][y0] is not present, ref_idx_10[x0][y0] can be inferred to be equal to 0. 
     In an example, it is a requirement of bitstream conformance that when the current decoded picture is a reference picture for the current coding unit, inter_pred_idc[x0][y0] shall be equal to 0. 
     According to some aspects of the disclosure, when a flag is used in higher level (such as slice, tile, tile group, picture, sequence, etc.) to enable interweaved affine prediction, the interweaved affine prediction is allowed on uni-predicted affine blocks and is not allowed on bi-prediction affine blocks. Further, the inter prediction related signaling methods can be improved for better coding efficiency. 
     The disclosed methods may be used separately or combined in any order. Further, each of the methods (or embodiments), encoder, and decoder may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium. In the present disclosure, the term block may be interpreted as a prediction block, a coding block, or a coding unit, i.e. CU. 
     The disclosed methods propose to modify the decoding process of a video codec so that the parsing and interpretation of inter-prediction related signaling methods are modified. 
     In some embodiments, a flag, for example named as interweaved affine flag, can be signaled at high-level (e.g., but not limited to, slice level, tile level, tile-group level, picture level, sequence level, etc.), to indicate whether interweaved affine prediction is enable at the associated level. For example, when the flag interweaved_affine_flag is true at a slice level for a slice, the interweaved affine prediction is enabled and can be used in a block in the slice when other suitable conditions for interweaved affine prediction are satisfied by the block. 
     In an embodiment, a flag, in sequence parameter set (SPS), for example named as sps_interweaved_affine_flag, is signaled. When the flag sps_interweaved_affine_flag is true, in some examples, a picture level flag (or tile group level flag) picture_interweaved_affine_flag may be signaled to indicate whether the interweaved affine prediction can be used for the current decoded picture (or tile group). 
     In another embodiment, the flag interweaved_affine_flag is signaled at a level which is lower than sequence level, such as picture level, tile group level, tile level, block level, etc. In such case, in an example, the affine prediction enable flag signaled at sequence level is true, then the flag interweaved_affine_flag may be signaled. When the affine prediction enable flag is false at sequence level, the flag interweaved_affine_flag does not need to be signaled and can be inferred as false based on the affine prediction enable flag being false. 
     In another embodiment, interweaved affine prediction may be enabled by other methods, such as predefined default setting, user configuration, etc., and may not necessarily be signaled. 
     According to some aspects of the disclosure, the computation cost for a combination of interweaved affine prediction and affine bi-prediction can be too large, thus, in some embodiments, interweaved affine prediction is enabled only on affine uni-predictions, and not affine bi-prediction. 
     In an embodiment, when interweaved affine prediction is enabled for a coding region (such as a picture or a tile group), as indicated by the corresponding high level enable flag, only uni-predicted affine blocks are coded using interweaved affine prediction, and bi-predicted affine blocks are coded using regular affine bi-prediction. In such case, the CU level syntax elements are not modified, and the semantic and/or the binarization of inter prediction direction index is also not modified. Then, when the CU level syntax elements indicate that the CU is bi-prediction affine block, the CU is reconstructed using regular affine bi-prediction; and when the CU level syntax elements indicate that the CU is uni-prediction affine block, the interweaved affine prediction is used to reconstruct samples of the CU. 
     In another embodiment, when interweaved affine prediction is enabled for a coding region (such as a picture or a tile group), as indicated by the corresponding high level enable flag, only uni-prediction is allowed for affine coded blocks and bi-prediction is disabled for affine coded blocks for the same coding region. Because the bi-prediction is disabled for affine coded blocks in such case, in some examples, the semantic of inter_pred_idc may be changed to save bits. In the following description, the array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture, cbWidth denotes the width in luma samples of the current coding block and cbHeight denotes the height in luma samples of the current coding block. 
     In some examples, the inter affine flag (inter_affine_flag[x0][y0]) and affine type flag (cu_affine_type_flag[x0][y0]) may be signaled before inter prediction direction index (inter_pred_idc). The inter affine flag for a CU indicates whether the inter prediction of the CU is based on block-based affine transformation motion compensation prediction. The affine type flag for a CU indicates the specific type of affine transformation for the CU. The inter prediction index for a CU specifies whether list0 (reference L0), list1 (reference L1), or bi-prediction is used for the CU. 
     Usually, two bits are used by the inter prediction index. However, in the embodiment that bi-prediction is disabled for affine coded blocks, one bit may be used for the inter prediction index to save bits. Table 7 shows CU level syntax elements in a related example, and Table 8 shows CU level syntax elements according to the present disclosure. According to the present disclosure, the inter affine flag (inter_affine_flag[x0][y0]) and affine type flag (cu_affine_type_flag[x0][y0]) are signaled before inter prediction direction index (inter_pred_idc), and the inter prediction direction index (inter_pred_idc) can use one bit when the inter affine flag and affine type flag indicate the current CU is affine coded and the interweaved affine prediction is enabled at a higher level. 
     
       
         
           
               
             
               
                 TABLE 7 
               
               
                   
               
               
                 CU Level Syntax Elements In A Related Example 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
            
               
                 ... 
               
            
           
           
               
               
            
               
                   
                 if( merge_flag[ x0 ][ y0 ] ) { 
               
            
           
           
               
               
            
               
                   
                 merge_data( x0, y0, cbWidth, cbHeight ) 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 if( slice_type = = B ) 
               
            
           
           
               
               
            
               
                   
                 inter_pred_idc[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( sps_affine_enabled_flag &amp;&amp; cbWidth &gt;= 16 &amp;&amp; cbHeight &gt;= 16 ) { 
               
            
           
           
               
               
            
               
                   
                 inter_affine_flag[ x0 ][ y0 ] 
               
               
                   
                 if( sps_affine_type_flag &amp;&amp; inter_affine_flag[ x0 ][ y0 ] ) 
               
            
           
           
               
               
            
               
                   
                 cu_affine_type_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                 if( inter_pred_idc[ x0 ][ y0 ] != PRED_L1 ) { 
               
            
           
           
               
            
               
                 ... 
               
               
                   
               
            
           
         
       
     
     
       
         
           
               
             
               
                 TABLE 8 
               
               
                   
               
               
                 CU Level Syntax Elements Modifications 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
            
               
                 ... 
               
            
           
           
               
               
            
               
                   
                 if( merge_flag[ x0 ][ y0 ] ) { 
               
            
           
           
               
               
            
               
                   
                 merge_data( x0, y0, cbWidth, cbHeight ) 
               
            
           
           
               
               
            
               
                   
                 } else { 
               
            
           
           
               
               
            
               
                   
                 if( sps_affine_enabled_flag &amp;&amp; cbWidth &gt;= 16 &amp;&amp; cbHeight &gt;= 16 ) { 
               
            
           
           
               
               
            
               
                   
                 inter_affine_flag[ x0 ][ y0 ] 
               
               
                   
                 if( sps_affine_type_flag &amp;&amp; inter_affine_flag[ x0 ][ y0 ] ) 
               
            
           
           
               
               
            
               
                   
                 cu_affine_type_flag[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 } 
               
               
                   
                 if( slice_type = = B) 
               
            
           
           
               
               
            
               
                   
                 inter_pred_idc[ x0 ][ y0 ] 
               
            
           
           
               
               
            
               
                   
                 if( inter_pred_idc[ x0 ][ y0 ] != PRED_L1 ) { 
               
            
           
           
               
            
               
                 ... 
               
               
                   
               
            
           
         
       
     
     In some examples, when inter affine flag is true, which indicates that the current block is coded with inter affine prediction, and since interweaved affine prediction is enabled and only uni-prediction is allowed for affine coded blocks, only 1 binary bit may be signaled for inter_pred_idc[x0][y0] to indicate the inter prediction direction. It is noted that when the inter affine flag is false, up to 2 bits may be signaled for inter_pred_idc[x0][y0]. 
       FIG. 26  shows a flow chart outlining a process ( 2600 ) according to an embodiment of the disclosure. The process ( 2600 ) can be used in the reconstruction of a block coded in intra mode, so to generate a prediction block for the block under reconstruction. In various embodiments, the process ( 2600 ) are executed by processing circuitry, such as the processing circuitry in the terminal devices ( 210 ), ( 220 ), ( 230 ) and ( 240 ), the processing circuitry that performs functions of the video encoder ( 303 ), the processing circuitry that performs functions of the video decoder ( 310 ), the processing circuitry that performs functions of the video decoder ( 410 ), the processing circuitry that performs functions of the video encoder ( 503 ), and the like. In some embodiments, the process ( 2600 ) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process ( 2600 ). The process starts at (S 2601 ) and proceeds to (S 2610 ). 
     At (S 2610 ), prediction information of a current block is decoded. The prediction information is indicative of an affine prediction for the current block. 
     At (S 2620 ), an application of an interweaved affine prediction is determined when the current block is within a region with a flag that indicates enabling of interweaved affine prediction. 
     At (S 2630 ), samples of the current block are reconstructed according to the interweaved affine prediction. Then the process proceeds to (S 2699 ) and terminates. 
     The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example,  FIG. 27  shows a computer system ( 2700 ) suitable for implementing certain embodiments of the disclosed subject matter. 
     The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like. 
     The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like. 
     The components shown in  FIG. 27  for computer system ( 2700 ) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system ( 2700 ). 
     Computer system ( 2700 ) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video). 
     Input human interface devices may include one or more of (only one of each depicted): keyboard ( 2701 ), mouse ( 2702 ), trackpad ( 2703 ), touch screen ( 2710 ), data-glove (not shown), joystick ( 2705 ), microphone ( 2706 ), scanner ( 2707 ), camera ( 2708 ). 
     Computer system ( 2700 ) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen ( 2710 ), data-glove (not shown), or joystick ( 2705 ), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers ( 2709 ), headphones (not depicted)), visual output devices (such as screens ( 2710 ) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted). 
     Computer system ( 2700 ) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW ( 2720 ) with CD/DVD or the like media ( 2721 ), thumb-drive ( 2722 ), removable hard drive or solid state drive ( 2723 ), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like. 
     Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals. 
     Computer system ( 2700 ) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses ( 2749 ) (such as, for example USB ports of the computer system ( 2700 )); others are commonly integrated into the core of the computer system ( 2700 ) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system ( 2700 ) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above. 
     Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core ( 2740 ) of the computer system ( 2700 ). 
     The core ( 2740 ) can include one or more Central Processing Units (CPU) ( 2741 ), Graphics Processing Units (GPU) ( 2742 ), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) ( 2743 ), hardware accelerators for certain tasks ( 2744 ), and so forth. These devices, along with Read-only memory (ROM) ( 2745 ), Random-access memory ( 2746 ), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like ( 2747 ), may be connected through a system bus ( 2748 ). In some computer systems, the system bus ( 2748 ) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core&#39;s system bus ( 2748 ), or through a peripheral bus ( 2749 ). Architectures for a peripheral bus include PCI, USB, and the like. 
     CPUs ( 2741 ), GPUs ( 2742 ), FPGAs ( 2743 ), and accelerators ( 2744 ) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM ( 2745 ) or RAM ( 2746 ). Transitional data can be also be stored in RAM ( 2746 ), whereas permanent data can be stored for example, in the internal mass storage ( 2747 ). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU ( 2741 ), GPU ( 2742 ), mass storage ( 2747 ), ROM ( 2745 ), RAM ( 2746 ), and the like. 
     The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts. 
     As an example and not by way of limitation, the computer system having architecture ( 2700 ), and specifically the core ( 2740 ) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core ( 2740 ) that are of non-transitory nature, such as core-internal mass storage ( 2747 ) or ROM ( 2745 ). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core ( 2740 ). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core ( 2740 ) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM ( 2746 ) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator ( 2744 )), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software. 
     APPENDIX A: ACRONYMS 
     
         
         JEM: joint exploration model 
         VVC: versatile video coding 
         BMS: benchmark set 
         MV: Motion Vector 
         HEVC: High Efficiency Video Coding 
         SEI: Supplementary Enhancement Information 
         VUI: Video Usability Information 
         GOPs: Groups of Pictures 
         TUs: Transform Units, 
         PUs: Prediction Units 
         CTUs: Coding Tree Units 
         CTBs: Coding Tree Blocks 
         PBs: Prediction Blocks 
         HRD: Hypothetical Reference Decoder 
         SNR: Signal Noise Ratio 
         CPUs: Central Processing Units 
         GPUs: Graphics Processing Units 
         CRT: Cathode Ray Tube 
         LCD: Liquid-Crystal Display 
         OLED: Organic Light-Emitting Diode 
         CD: Compact Disc 
         DVD: Digital Video Disc 
         ROM: Read-Only Memory 
         RAM: Random Access Memory 
         ASIC: Application-Specific Integrated Circuit 
         PLD: Programmable Logic Device 
         LAN: Local Area Network 
         GSM: Global System for Mobile communications 
         LTE: Long-Term Evolution 
         CANBus: Controller Area Network Bus 
         USB: Universal Serial Bus 
         PCI: Peripheral Component Interconnect 
         FPGA: Field Programmable Gate Areas 
         SSD: solid-state drive 
         IC: Integrated Circuit 
         CU: Coding Unit 
       
    
     While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof.