Method and apparatus of signaling the number of candidates for merge mode

Abstract

A method of obtaining a maximum number of geometric partitioning merge mode candidates for video decoding and a video decoding apparatus are disclosed, wherein the method comprises: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; obtaining a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator.

Description

TITLE METHOD AND APPARATUS OF SIGNALING THE NUMBER OF CANDIDATES FOR MERGE MODE CROSS-REFERENCE TO RELATED APPLICATIONS This patent application claims the priority to US62 / 961,159, filed on January 14, 2020. The disclosure of the aforementioned patent application is hereby incorporated by reference in its entirety. TECHNICAL FIELD Embodiments of the present application generally relate to the field of moving picture coding and more particularly to signaling the number of merge mode candidates. BACKGROUND Video coding (video encoding and decoding) is used in a wide range of digital video applications, for example broadcast digital TV, video transmission over internet and mobile networks, real-time conversational applications such as video chat, video conferencing, DVD and Blu-ray discs, video content acquisition and editing systems, and camcorders of security applications. The amount of video data needed to depict even a relatively short video can be substantial, which may result in difficulties when the data is to be streamed or otherwise communicated across a communications network with limited bandwidth capacity. Thus, video data is generally compressed before being communicated across modern day telecommunications networks. The size of a video could also be an issue when the video is stored on a storage device because memory resources may be limited. Video compression devices often use software and / or hardware at the source to code the video data prior to transmission or storage, thereby decreasing the quantity of data needed to represent digital video images. The compressed data is then received at the destination by a video decompression device that decodes the video data. With limited network resources and ever increasing demands of higher video quality, improved compression and decompression techniques that improve compression ratio with little to no sacrifice in picture quality are desirable. SUMMARY Embodiments of the present application provide apparatuses and methods for encoding and decoding according to the independent claims. The foregoing and other objects are achieved by the subject matter of the independent claims. Further implementation forms are apparent from the dependent claims, the description and the figures. Particular embodiments are outlined in the attached independent claims, with other embodiments in the dependent claims. The first aspect of the present invention provides a method of obtaining a maximum number of geometric partitioning merger mode candidates for video decoding, the method comprise: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; obtaining a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; parsing a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. According to embodiments of the present invention, a signaling scheme of indicator of number of merge mode candidates is disclosed. The maximum number of geometric partitioning merge mode candidates is conditionally signaled. Hence, the bitstream utilization and decoding efficiency have been improved. In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value. In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In one implementation, wherein the threshold is 2. In one implementation, wherein the preset value is 1. In one implementation, wherein the step of obtaining a value of a second indicator is performed after the step of obtaining a value of a first indicator. In one implementation, the first indicator is obtained according to a syntax element coded in the bitstream. In one implementation, wherein the value of the second indicator is parsed from sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. E.g. parsing a syntax element in the sequence parameter set, SPS of the bitstream to obtain the value of the second indicator. In one implementation, wherein the value of the second indicator is obtained from sequence parameter set, SPS, of the bitstream. E.g. parsing a syntax element in the sequence parameter set, SPS of the bitstream to obtain the value of the second indicator. In one implementation, wherein the value of the third indicator is obtained from sequence parameter set, SPS, of the bitstream. E.g. parsing a syntax element in the sequence parameter set, SPS of the bitstream to obtain the value of the second indicator. The second aspect of the present invention provides a video decoding apparatus, the video decoding apparatus comprise: a receiving module, which is configured to obtain a bitstream for a video sequence; a obtaining module, which is configured to obtain a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; the obtaining module is configured to obtain a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; a parsing module, which is configured to parse a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator The method according to the first aspect of the invention can be performed by the apparatus according to the second aspect of the invention. Further features and implementation forms of the method according to the first aspect of the invention correspond to the features and implementation forms of the apparatus according to the second aspect of the invention. In one implementation, wherein the obtaining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value. In one implementation, wherein the obtaining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In one implementation, wherein the threshold is 2. In one implementation, wherein the preset value is 1. In one implementation, wherein the step of obtaining a value of a second indicator is performed after the step of obtaining a value of a first indicator. In one implementation, wherein the value of the second indicator is parsed from sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. In one implementation, wherein the value of the second indicator is obtained from sequence parameter set, SPS, of the bitstream. In one implementation, wherein the value of the third indicator is obtained from sequence parameter set, SPS, of the bitstream. In one implementation, a method of obtaining a maximum number of geometric partitioning merge mode candidates for video decoding is disclosed, wherein the method comprises: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; and only if the obtained value of the first indicator is equal to or greater than a threshold: obtaining a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream, only when the value of the first indicator is greater than the threshold and the value of the second indicator is equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. The third aspect of the present invention provides a method of encoding a maximum number of geometric partitioning merger mode candidates, the method comprise: determining a value of a first indicator, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; determining a value of a second indicator, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for a video sequence; encoding a value of a third indicator into a bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. According to embodiments of the present invention, a signaling scheme of indicator of number of merge mode candidates is disclosed. The maximum number of geometric partitioning merge mode candidates is conditionally signaled. Hence, the bitstream utilization and decoding efficiency have been improved. In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In one implementation, wherein the threshold is 2. In one implementation, wherein the preset value is 1. In one implementation, wherein the step of determining a value of a second indicator is performed after the step of determining a value of a first indicator. In one implementation, wherein the value of the second indicator is encoded in sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. In one implementation, wherein the value of the second indicator is encoded in sequence parameter set, SPS, of the bitstream. In one implementation, wherein the value of the third indicator is encoded in sequence parameter set, SPS, of the bitstream. The fourth aspect of the present invention provides a video encoding apparatus, the video encoding apparatus comprise: a determining module, which is configured to determine a value of a first indicator, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; the determining module is configured to determine a value of a second indicator, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for a video sequence; an encoding module, which is configured to encode a value of a third indicator into a bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. The method according to the third aspect of the invention can be performed by the apparatus according to the fourth aspect of the invention. Further features and implementation forms of the method according to the third aspect of the invention correspond to the features and implementation forms of the apparatus according to the fourth aspect of the invention. In one implementation, wherein the determining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value. In one implementation, wherein the determining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In one implementation, wherein the threshold is 2. In one implementation, wherein the preset value is 1. In one implementation, wherein the step of determining a value of a second indicator is performed after the step of determining a value of a first indicator. In one implementation, wherein the value of the second indicator is encoded in sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. In one implementation, wherein the value of the second indicator is encoded in sequence parameter set, SPS, of the bitstream. In one implementation, wherein the value of the third indicator is encoded in sequence parameter set, SPS, of the bitstream. The fifth aspect of the present invention provides a decoder comprising processing circuitry for carrying out the method according to the first aspect and any one of implementation of the first aspect. The sixth aspect of the present invention provides an encoder comprising processing circuitry for carrying out the method according to the third aspect and any one of implementation of the third aspect. The seventh aspect of the present invention provides a computer program product comprising program code for performing the method according to the first aspect, the third aspect and any one of implementation of the first aspect, the third aspect when executed on a computer or a Processor. The eighth aspect of the present invention provides a decoder, comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the processors and storing programming for execution by the processors, wherein the programming, when executed by the processors, configures the decoder to carry out the method according to any one of the first aspect, the third aspect and any one of implementation of the first aspect, the third aspect. The ninth aspect of the present invention provides a non-transitory computer-readable medium carrying a program code which, when executed by a computer device, causes the computer device to perform the method according to any one of the first aspect, the third aspect and any one of implementation of the first aspect, the third aspect. The tenth aspect of the present invention provides an encoder comprising processing circuitry for carrying out the method according to the third aspect and any one of implementation of the third aspect. The eleventh aspect of the present invention provides an encoder, comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the processors and storing programming for execution by the processors, wherein the programming, when executed by the processors, configures the decoder to carry out the method according to any one of the third aspect and any one of implementation of the third aspect. The twelfth aspect of the present invention provides a non-transitory storage medium comprising a bitstream encoded / decoded by the method of any one of the above embodiments. The thirteenth aspect of the present invention provides an encoded bitstream for the video signal by including a plurality of syntax elements, wherein the plurality of syntax elements comprises a second indicator (such as sps_geo_enabled_flag), and wherein a third indicator sps_max_num_merge_cand_minus_max_num_geo_cand is conditionally signaled at least based on a value of the sps_geo enabled flag. The fourteenth aspect of the present invention provides a non-transitory storage medium which includes an encoded bitstream decoded by an image decoding device, the bit stream being generated by dividing a frame of a video signal or an image signal into a plurality blocks, and including a plurality of syntax elements, wherein the plurality of syntax elements comprises a third indicator (such as sps_max_num_merge_cand_minus_max_num_geo_cand) according to any one of the preceding claims. The fifteenth aspect of the present invention provides a method for video decoding, the method comprises: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; obtaining a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; parsing a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator; constructing a merge candidates list for a current coding block, according to motion vectors of neighbor blocks of the current coding block; obtaining a merge index according to the value of the third indicator; obtaining a motion vector of the current coding block according to the merge index and the merger candidates list; reconstructing the current coding block according to the motion vector of the current coding block. The sixteenth aspect of the present invention provides a video decoding apparatus, the video decoding apparatus comprise: a receiving module, which is configured to obtain a bitstream for a video sequence; a obtaining module, which is configured to obtain a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; the obtaining module is configured to obtain a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; a parsing module, which is configured to parse a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator; a merge candidates list constructing module, which is configured to construct a merge candidates list for a current coding block, according to motion vectors of neighbor blocks of the current coding block; the obtaining module is configured to obtain a merge index according to the value of the third indicator; a motion vector obtaining module, which is configured to obtain a motion vector of the current coding block according to the merge index and the merger candidates list; a pixel reconstructing module, which is configured to reconstruct the current coding block according to the motion vector of the current coding block. The details or examples about the fifteen aspect of the present invention and sixteen aspect of the present invention could refer to the above examples disclosed in the first aspect to fourteen aspect of the present invention. The foregoing and other objects are achieved by the subject matter of the independent claims. Further implementation forms are apparent from the dependent claims, the description and the figures. Details of one or more embodiments are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description, drawings, and claims. BRIEF DESCRIPTION OF THE DRAWINGS In the following embodiments of the invention are described in more detail with reference to the attached figures and drawings, in which: FIG. 1A is a block diagram showing an example of a video coding system configured to implement embodiments of the invention; FIG. 1B is a block diagram showing another example of a video coding system configured to implement embodiments of the invention; FIG.2 is ablock diagram showing an example of a video encoder configured to implement embodiments of the invention; FIG.3 is ablock diagram showing an example structure of a video decoder configured to implement embodiments of the invention; FIG. 4 isa block diagram illustrating an example of an encoding apparatus or a decoding apparatus; FIG. 5 isa block diagram illustrating another example of an encoding apparatus or a decoding apparatus; FIG. 6 isa flowchart for weighted prediction encoder-side decision making and parameter estimation; FIG.7 illustrates an example of a triangle prediction mode; FIG. 8 illustrates an example of a geometric prediction mode; FIG. 9 illustrates another example of a geometric prediction mode; FIG. 10 is a block diagram showing an example structure of a content supply system 3100 which realizes a content delivery service; FIG. 11 is a block diagram showing a structure of an example of a terminal device; FIG. 12 is a block diagram illustrating an example of an inter prediction method according to the present application; FIG. 13 is a block diagram illustrating an example of an apparatus for inter prediction according to the present application; FIG. 14 is a block diagram illustrating another example of an apparatus for inter prediction according to the present application; FIG. 15 is a flowchart showing a method embodiment according to the present invention; FIG. 16 is a block diagram showing an apparatus embodiment according to the present invention. In the following identical reference signs refer to identical or at least functionally equivalent features if not explicitly specified otherwise. DETAILED DESCRIPTION OF THE EMBODIMENTS In the following description, reference is made to the accompanying figures, which form part of the disclosure, and which show, by way of illustration, specific aspects of embodiments of the invention or specific aspects in which embodiments of the present invention may be used. It is understood that embodiments of the invention may be used in other aspects and comprise structural or logical changes not depicted in the figures. The following detailed description, therefore, is not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims. For instance, it is understood that a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa. For example, if one or a plurality of specific method steps are described, a corresponding device may include one or a plurality of units, e.g. functional units, to perform the described one or plurality of method steps (e.g. one unit performing the one or plurality of steps, or a plurality of units each performing one or more of the plurality of steps), even if such one or more units are not explicitly described or illustrated in the figures. On the other hand, for example, if a specific apparatus is described based on one or a plurality of units, e.g. functional units, a corresponding method may include one step to perform the functionality of the one or plurality of units (e.g. one step performing the functionality of the one or plurality of units, or a plurality of steps each performing the functionality of one or more of the plurality of units), even if such one or plurality of steps are not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary embodiments and / or aspects described herein may be combined with each other, unless specifically noted otherwise. Video coding typically refers to the processing of a sequence of pictures, which form the video or video sequence. Instead of the term “picture” the term “frame” or “image” may be used as synonyms in the field of video coding. Video coding (or coding in general) comprises two parts video encoding and video decoding. Video encoding is performed at the source side, typically comprising processing (e.g. by compression) the original video pictures to reduce the amount of data required for representing the video pictures (for more efficient storage and / or transmission). Video decoding is performed at the destination side and typically comprises the inverse processing compared to the encoder to reconstruct the video pictures. Embodiments referring to “coding” of video pictures (or pictures in general) shall be understood to relate to “encoding” or “decoding” of video pictures or respective video sequences. The combination of the encoding part and the decoding part is also referred to as CODEC (Coding and Decoding). In case of lossless video coding, the original video pictures can be reconstructed, i.e. the reconstructed video pictures have the same quality as the original video pictures (assuming no transmission loss or other data loss during storage or transmission). In case of lossy video coding, further compression, e.g. by quantization, is performed, to reduce the amount of data representing the video pictures, which cannot be completely reconstructed at the decoder, i.e. the quality of the reconstructed video pictures is lower or worse compared to the quality of the original video pictures. Several video coding standards belong to the group of “lossy hybrid video codecs” (i.e. combine spatial and temporal prediction in the sample domain and 2D transform coding for applying quantization in the transform domain). Each picture of a video sequence is typically partitioned into a set of non-overlapping blocks and the coding is typically performed on a block level. In other words, at the encoder the video is typically processed, i.e. encoded, on a block (video block) level, e.g. by using spatial (intra picture) prediction and / or temporal (inter picture) prediction to generate a prediction block, subtracting the prediction block from the current block (block currently processed / to be processed) to obtain a residual block, transforming the residual block and quantizing the residual block in the transform domain to reduce the amount of data to be transmitted (compression), whereas at the decoder the inverse processing compared to the encoder is applied to the encoded or compressed block to reconstruct the current block for representation. Furthermore, the encoder duplicates the decoder processing loop such that both will generate identical predictions (e.g. intra- and inter predictions) and / or re-constructions for processing, i.e. coding, the subsequent blocks. In the following embodiments of a video coding system 10, a video encoder 20 and a video decoder 30 are described based on Figs. 1 to 3. Fig. 1A is a schematic block diagram illustrating an example coding system 10, e.g. a video coding system 10 (or short coding system 10) that may utilize techniques of this present application. Video encoder 20 (or short encoder 20) and video decoder 30 (or short decoder 30) of video coding system 10 represent examples of devices that may be configured to perform techniques in accordance with various examples described in the present application. As shown in FIG. 1A, the coding system 10 comprises a source device 12 configured to provide encoded picture data 21 e.g. to a destination device 14 for decoding the encoded picture data 13. The source device 12 comprises an encoder 20, and may additionally, i.e. optionally, comprise a picture source 16, a pre-processor (or pre-processing unit) 18, e.g. a picture pre- processor 18, and a communication interface or communication unit 22. The picture source 16 may comprise or be any kind of picture capturing device, for example a camera for capturing a real-world picture, and / or any kind of a picture generating device, for example a computer-graphics processor for generating a computer animated picture, or any kind of other device for obtaining and / or providing a real-world picture, a computer generated picture (e.g. a screen content, a virtual reality (VR) picture) and / or any combination thereof (e.g. an augmented reality (AR) picture). The picture source may be any kind of memory or storage storing any of the aforementioned pictures. In distinction to the pre-processor 18 and the processing performed by the pre-processing unit 18, the picture or picture data 17 may also be referred to as raw picture or raw picture data 17. Pre-processor 18 is configured to receive the (raw) picture data 17 and to perform pre- processing on the picture data 17 to obtain a pre-processed picture 19 or pre-processed picture data 19. Pre-processing performed by the pre-processor 18 may, e.g., comprise trimming, color format conversion (e.g. from RGB to YCbCr), color correction, or de- noising. It can be understood that the pre-processing unit 18 may be optional component. The video encoder 20 is configured to receive the pre-processed picture data 19 and provide encoded picture data 21 (further details will be described below, e.g., based on Fig. 2). Communication interface 22 of the source device 12 may be configured to receive the encoded picture data 21 and to transmit the encoded picture data 21 (or any further processed version thereof) over communication channel 13 to another device, e.g. the destination device 14 or any other device, for storage or direct reconstruction. The destination device 14 comprises a decoder 30 (e.g. a video decoder 30), and may additionally, i.e. optionally, comprise a communication interface or communication unit 28, a post-processor 32 (or post-processing unit 32) and a display device 34. The communication interface 28 of the destination device 14 is configured receive the encoded picture data 21 (or any further processed version thereof), e.g. directly from the source device 12 or from any other source, e.g. a storage device, e.g. an encoded picture data storage device, and provide the encoded picture data 21 to the decoder 30. The communication interface 22 and the communication interface 28 may be configured to transmit or receive the encoded picture data 21 or encoded data 13 via a direct communication link between the source device 12 and the destination device 14, e.g. a direct wired or wireless connection, or via any kind of network, e.g. a wired or wireless network or any combination thereof, or any kind of private and public network, or any kind of combination thereof The communication interface 22 may be, e.g., configured to package the encoded picture data 21 into an appropriate format, e.g. packets, and / or process the encoded picture data using any kind of transmission encoding or processing for transmission over a communication link or communication network. The communication interface 28, forming the counterpart of the communication interface 22, may be, e.g., configured to receive the transmitted data and process the transmission data using any kind of corresponding transmission decoding or processing and / or de-packaging to obtain the encoded picture data 21. Both, communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces as indicated by the arrow for the communication channel 13 in Fig. 1A pointing from the source device 12 to the destination device 14, or bi- directional communication interfaces, and may be configured, e.g. to send and receive messages, e.g. to set up a connection, to acknowledge and exchange any other information related to the communication link and / or data transmission, e.g. encoded picture data transmission. The decoder 30 is configured to receive the encoded picture data 21 and provide decoded picture data 31 or a decoded picture 31 (further details will be described below, e.g., based on Fig. 3 or Fig. 5). The post-processor 32 of destination device 14 is configured to post-process the decoded picture data 31 (also called reconstructed picture data), e.g. the decoded picture 31, to obtain post-processed picture data 33, e.g. a post-processed picture 33. The post-processing performed by the post-processing unit 32 may comprise, e.g. color format conversion (e.g. from YCbCr to RGB), color correction, trimming, or re-sampling, or any other processing, e.g. for preparing the decoded picture data 31 for display, e.g. by display device 34. The display device 34 of the destination device 14 is configured to receive the post-processed picture data 33 for displaying the picture, e.g. to a user or viewer. The display device 34 may be or comprise any kind of display for representing the reconstructed picture, e.g. an integrated or external display or monitor. The displays may, e.g. comprise liquid crystal displays (LCD), organic light emitting diodes (OLED) displays, plasma displays, projectors , micro LED displays, liquid crystal on silicon (LCoS), digital light processor (DLP) or any kind of other display. Although Fig. 1A depicts the source device 12 and the destination device 14 as separate devices, embodiments of devices may also comprise both or both functionalities, the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality. In such embodiments the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality may be implemented using the same hardware and / or software or by separate hardware and / or software or any combination thereof. As will be apparent for the skilled person based on the description, the existence and (exact) split of functionalities of the different units or functionalities within the source device 12 and / or destination device 14 as shown in Fig. 1A may vary depending on the actual device and application. The encoder 20 (e.g. a video encoder 20) or the decoder 30 (e.g. a video decoder 30) or both encoder 20 and decoder 30 may be implemented via processing circuitry as shown in Fig. 1B, such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, hardware, video coding dedicated or any combinations thereof. The encoder 20 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to encoder 200f FIG. 2 and / or any other encoder system or subsystem described herein. The decoder 30 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to decoder 30 of FIG. 3 and / or any other decoder system or subsystem described herein. The processing circuitry may be configured to perform the various operations as discussed later. As shown in Fig. 5, if the techniques are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer-readable storage medium and may execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Either of video encoder 20 and video decoder 30 may be integrated as part of a combined encoder / decoder (CODEC) in a single device, for example, as shown in Fig. 1B. Source device 12 and destination device 14 may comprise any of a wide range of devices, including any kind of handheld or stationary devices, e.g. notebook or laptop computers, mobile phones, smart phones, tablets or tablet computers, cameras, desktop computers, set- top boxes, televisions, display devices, digital media players, video gaming consoles, video streaming devices(such as content services servers or content delivery servers), broadcast receiver device, broadcast transmitter device, or the like and may use no or any kind of operating system. In some cases, the source device 12 and the destination device 14 may be equipped for wireless communication. Thus, the source device 12 and the destination device 14 may be wireless communication devices. In some cases, video coding system 10 illustrated in Fig. 1A is merely an example and the techniques of the present application may apply to video coding settings (e.g., video encoding or video decoding) that do not necessarily include any data communication between the encoding and decoding devices. In other examples, data is retrieved from a local memory, streamed over a network, or the like. A video encoding device may encode and store data to memory, and / or a video decoding device may retrieve and decode data from memory. In some examples, the encoding and decoding is performed by devices that do not communicate with one another, but simply encode data to memory and / or retrieve and decode data from memory. For convenience of description, embodiments of the invention are described herein, for example, by reference to High-Efficiency Video Coding (HEVC) or to the reference software of Versatile Video coding (VVC), the next generation video coding standard developed by the Joint Collaboration Team on Video Coding (JCT-VC) of ITU-T Video Coding Experts Group (VCEG) and ISO / IEC Motion Picture Experts Group (MPEG). One of ordinary skill in the art will understand that embodiments of the invention are not limited to HEVC or VVC. Encoder and Encoding Method Fig. 2 shows a schematic block diagram of an example video encoder 20 that is configured to implement the techniques of the present application. In the example of Fig. 2, the video encoder 20 comprises an input 201 (or input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, and inverse transform processing unit 212, a reconstruction unit 214, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy encoding unit 270 and an output 272 (or output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254 and a partitioning unit 262. Inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). A video encoder 20 as shown in Fig. 2 may also be referred to as hybrid video encoder or a video encoder according to a hybrid video codec. The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the mode selection unit 260 may be referred to as forming a forward signal path of the encoder 20, whereas the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20, wherein the backward signal path of the video encoder 20 corresponds to the signal path of the decoder (see video decoder 30 in Fig. 3). The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 are also referred to forming the “built-in decoder’ of video encoder 20. Pictures & Picture Partitioning (Pictures & Blocks) The encoder 20 may be configured to receive, e.g. via input 201, a picture 17 (or picture data 17), e.g. picture of a sequence of pictures forming a video or video sequence. The received picture or picture data may also be a pre-processed picture 19 (or pre-processed picture data 19). For sake of simplicity the following description refers to the picture 17. The picture 17 may also be referred to as current picture or picture to be coded (in particular in video coding to distinguish the current picture from other pictures, e.g. previously encoded and / or decoded pictures of the same video sequence, i.e. the video sequence which also comprises the current picture). A (digital) picture is or can be regarded as a two-dimensional array or matrix of samples with intensity values. A sample in the array may also be referred to as pixel (short form of picture element) or a pel. The number of samples in horizontal and vertical direction (or axis) of the array or picture define the size and / or resolution of the picture. For representation of color, typically three color components are employed, i.e. the picture may be represented or include three sample arrays. In RBG format or color space a picture comprises a corresponding red, green and blue sample array. However, in video coding each pixel is typically represented in a luminance and chrominance format or color space, e.g. YCbCr, which comprises a luminance component indicated by Y (sometimes also L is used instead) and two chrominance components indicated by Cb and Cr. The luminance (or short luma) component Y represents the brightness or grey level intensity (e.g. like in a grey-scale picture), while the two chrominance (or short chroma) components Cb and Cr represent the chromaticity or color information components. Accordingly, a picture in YCbCr format comprises a luminance sample array of luminance sample values (Y), and two chrominance sample arrays of chrominance values (Cb and Cr). Pictures in RGB format may be converted or transformed into YCbCr format and vice versa, the process is also known as color transformation or conversion. If a picture is monochrome, the picture may comprise only a luminance sample array. Accordingly, a picture may be, for example, an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2 and 4:4:4 colour format. Embodiments of the video encoder 20 may comprise a picture partitioning unit (not depicted in Fig. 2) configured to partition the picture 17 into a plurality of (typically non-overlapping) picture blocks 203. These blocks may also be referred to as root blocks, macro blocks (H.264 / AVC) or coding tree blocks (CTB) or coding tree units (CTU) (H.265 / HEVC and VVC). The picture partitioning unit may be configured to use the same block size for all pictures of a video sequence and the corresponding grid defining the block size, or to change the block size between pictures or subsets or groups of pictures, and partition each picture into the corresponding blocks. In further embodiments, the video encoder may be configured to receive directly a block 203 of the picture 17, e.g. one, several or all blocks forming the picture 17. The picture block 203 may also be referred to as current picture block or picture block to be coded. Like the picture 17, the picture block 203 again is or can be regarded as a two-dimensional array or matrix of samples with intensity values (sample values), although of smaller dimension than the picture 17. In other words, the block 203 may comprise, e.g., one sample array (e.g. a luma array in case of a monochrome picture 17, or a luma or chroma array in case of a color picture) or three sample arrays (e.g. a luma and two chroma arrays in case of a color picture 17) or any other number and / or kind of arrays depending on the color format applied. The number of samples in horizontal and vertical direction (or axis) of the block 203 define the size of block 203. Accordingly, a block may, for example, an MxN (M-column by N-row) array of samples, or an MxN array of transform coefficients. Embodiments of the video encoder 20 as shown in Fig. 2 may be configured to encode the picture 17 block by block, e.g. the encoding and prediction is performed per block 203. Embodiments of the video encoder 20 as shown in Fig. 2 may be further configured to partition and / or encode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or encoded using one or more slices (typically non- overlapping), and each slice may comprise one or more blocks (e.g. CTUs). Embodiments of the video encoder 20 as shown in Fig. 2 may be further configured to partition and / or encode the picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), wherein a picture may be partitioned into or encoded using one or more tile groups (typically non-overlapping), and each tile group may comprise, e.g. one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile, e.g. may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks. Residual Calculation The residual calculation unit 204 may be configured to calculate a residual block 205 (also referred to as residual 205) based on the picture block 203 and a prediction block 265 (further details about the prediction block 265 are provided later), e.g. by subtracting sample values of the prediction block 265 from sample values of the picture block 203, sample by sample (pixel by pixel) to obtain the residual block 205 in the sample domain. Transform The transform processing unit 206 may be configured to apply a transform, e.g. a discrete cosine transform (DCT) or discrete sine transform (DST), on the sample values of the residual block 205 to obtain transform coefficients 207 in a transform domain. The transform coefficients 207 may also be referred to as transform residual coefficients and represent the residual block 205 in the transform domain. The transform processing unit 206 may be configured to apply integer approximations of DCT / DST, such as the transforms specified for H.265 / HEVC. Compared to an orthogonal DCT transform, such integer approximations are typically scaled by a certain factor. In order to preserve the norm of the residual block which is processed by forward and inverse transforms, additional scaling factors are applied as part of the transform process. The scaling factors are typically chosen based on certain constraints like scaling factors being a power of two for shift operations, bit depth of the transform coefficients, tradeoff between accuracy and implementation costs, etc. Specific scaling factors are, for example, specified for the inverse transform, e.g. by inverse transform processing unit 212 (and the corresponding inverse transform, e.g. by inverse transform processing unit 312 at video decoder 30) and corresponding scaling factors for the forward transform, e.g. by transform processing unit 206, at an encoder 20 may be specified accordingly. Embodiments of the video encoder 20 (respectively transform processing unit 206) may be configured to output transform parameters, e.g. a type of transform or transforms, e.g. directly or encoded or compressed via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and use the transform parameters for decoding. Quantization The quantization unit 208 may be configured to quantize the transform coefficients 207 to obtain quantized coefficients 209, e.g. by applying scalar quantization or vector quantization. The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209. The quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be rounded down to an m-bit Transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a quantization parameter (QP). For example for scalar quantization, different scaling may be applied to achieve finer or coarser quantization. Smaller quantization step sizes correspond to finer quantization, whereas larger quantization step sizes correspond to coarser quantization. The applicable quantization step size may be indicated by a quantization parameter (QP). The quantization parameter may for example be an index to a predefined set of applicable quantization step sizes. For example, small quantization parameters may correspond to fine quantization (small quantization step sizes) and large quantization parameters may correspond to coarse quantization (large quantization step sizes) or vice versa. The quantization may include division by a quantization step size and a corresponding and / or the inverse dequantization, e.g. by inverse quantization unit 210, may include multiplication by the quantization step size. Embodiments according to some standards, e.g. HEVC, may be configured to use a quantization parameter to determine the quantization step size. Generally, the quantization step size may be calculated based on a quantization parameter using a fixed point approximation of an equation including division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which might get modified because of the scaling used in the fixed point approximation of the equation for quantization step size and quantization parameter. In one example implementation, the scaling of the inverse transform and dequantization might be combined. Alternatively, customized quantization tables may be used and signaled from an encoder to a decoder, e.g. in a bitstream. The quantization is a lossy operation, wherein the loss increases with increasing quantization step sizes. Embodiments of the video encoder 20 (respectively quantization unit 208) may be configured to output quantization parameters (QP), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and apply the quantization parameters for decoding. Inverse Quantization The inverse quantization unit 210 is configured to apply the inverse quantization of the quantization unit 208 on the quantized coefficients to obtain dequantized coefficients 211, e.g. by applying the inverse of the quantization scheme applied by the quantization unit 208 based on or using the same quantization step size as the quantization unit 208. The dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211 and correspond - although typically not identical to the transform coefficients due to the loss by quantization - to the transform coefficients 207. Inverse Transform The inverse transform processing unit 212 is configured to apply the inverse transform of the transform applied by the transform processing unit 206, e.g. an inverse discrete cosine transform (DCT) or inverse discrete sine transform (DST) or other inverse transforms, to obtain a reconstructed residual block 213 (or corresponding dequantized coefficients 213) in the sample domain. The reconstructed residual block 213 may also be referred to as transform block 213. Reconstruction The reconstruction unit 214 (e.g. adder or summer 214) is configured to add the transform block 213 (i.e. reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in the sample domain, e.g. by adding — sample by sample - the sample values of the reconstructed residual block 213 and the sample values of the prediction block 265. Filtering The loop filter unit 220 (or short “loop filter” 220), is configured to filter the reconstructed block 215 to obtain a filtered block 221, or in general, to filter reconstructed samples to obtain filtered samples. The loop filter unit is, e.g., configured to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 220 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, e.g. a bilateral filter, an adaptive loop filter (ALF), a sharpening, a smoothing filters or a collaborative filters, or any combination thereof. Although the loop filter unit 220 is shown in FIG. 2 as being an in loop filter, in other configurations, the loop filter unit 220 may be implemented as a post loop filter. The filtered block 221 may also be referred to as filtered reconstructed block 221. Embodiments of the video encoder 20 (respectively loop filter unit 220) may be configured to output loop filter parameters (such as sample adaptive offset information), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., a decoder 30 may receive and apply the same loop filter parameters or respective loop filters for decoding. Decoded Picture Buffer The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or in general reference picture data, for encoding video data by video encoder 20. The DPB 230 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may be further configured to store other previously filtered blocks, e.g. previously reconstructed and filtered blocks 221, of the same current picture or of different pictures, e.g. previously reconstructed pictures, and may provide complete previously reconstructed, i.e. decoded, pictures (and corresponding reference blocks and samples) and / or a partially reconstructed current picture (and corresponding reference blocks and samples), for example for inter prediction. The decoded picture buffer (DPB) 230 may be also configured to store one or more unfiltered reconstructed blocks 215, or in general unfiltered reconstructed samples, e.g. if the reconstructed block 215 is not filtered by loop filter unit 220, or any other further processed version of the reconstructed blocks or samples. Mode Selection (Partitioning & Prediction) The mode selection unit 260 comprises partitioning unit 262, inter-prediction unit 244 and intra-prediction unit 254, and is configured to receive or obtain original picture data, e.g. an original block 203 (current block 203 of the current picture 17), and reconstructed picture data, e.g. filtered and / or unfiltered reconstructed samples or blocks of the same (current) picture and / or from one or a plurality of previously decoded pictures, e.g. from decoded picture buffer 230 or other buffers (e.g. line buffer, not shown).. The reconstructed picture data is used as reference picture data for prediction, e.g. inter-prediction or intra-prediction, to obtain a prediction block 265 or predictor 265. Mode selection unit 260 may be configured to determine or select a partitioning for a current block prediction mode (including no partitioning) and a prediction mode (e.g. an intra or inter prediction mode) and generate a corresponding prediction block 265, which is used for the calculation of the residual block 205 and for the reconstruction of the reconstructed block 215. Embodiments of the mode selection unit 260 may be configured to select the partitioning and the prediction mode (e.g. from those supported by or available for mode selection unit 260), which provide the best match or in other words the minimum residual (minimum residual means better compression for transmission or storage), or a minimum signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which considers or balances both. The mode selection unit 260 may be configured to determine the partitioning and prediction mode based on rate distortion optimization (RDO), i.e. select the prediction mode which provides a minimum rate distortion. Terms like “best”, “minimum”, “optimum” etc. in this context do not necessarily refer to an overall “best”, “minimum”, “optimum”, etc. but may also refer to the fulfillment of a termination or selection criterion like a value exceeding or falling below a threshold or other constraints leading potentially to a “sub-optimum selection” but reducing complexity and processing time. In other words, the partitioning unit 262 may be configured to partition the block 203 into smaller block partitions or sub-blocks (which form again blocks), e.g. iteratively using quad- tree-partitioning (QT), binary partitioning (BT) or triple-tree-partitioning (TT) or any combination thereof, and to perform, e.g., the prediction for each of the block partitions or sub-blocks, wherein the mode selection comprises the selection of the tree-structure of the partitioned block 203 and the prediction modes are applied to each of the block partitions or sub-blocks. In the following the partitioning (e.g. by partitioning unit 260) and prediction processing (by inter-prediction unit 244 and intra-prediction unit 254) performed by an example video encoder 20 will be explained in more detail. Partitioning The partitioning unit 262 may partition (or split) a current block 203 into smaller partitions, e.g. smaller blocks of square or rectangular size. These smaller blocks (which may also be referred to as sub-blocks) may be further partitioned into even smaller partitions. This is also referred to tree-partitioning or hierarchical tree-partitioning, wherein a root block, e.g. at root tree-level O (hierarchy-level 0, depth 0), may be recursively partitioned, e.g. partitioned into two or more blocks of a next lower tree-level, e.g. nodes at tree-level 1 (hierarchy-level 1, depth 1), wherein these blocks may be again partitioned into two or more blocks of a next lower level, e.g. tree-level 2 (hierarchy-level 2, depth 2), etc. until the partitioning is terminated, e.g. because a termination criterion is fulfilled, e.g. a maximum tree depth or minimum block size is reached. Blocks which are not further partitioned are also referred to as leaf-blocks or leaf nodes of the tree. A tree using partitioning into two partitions is referred to as binary-tree (BT), a tree using partitioning into three partitions is referred to as ternary- tree (TT), and a tree using partitioning into four partitions is referred to as quad-tree (QT). As mentioned before, the term “block” as used herein may be a portion, in particular a square or rectangular portion, of a picture. With reference, for example, to HEVC and VVC, the block may be or correspond to a coding tree unit (CTU), a coding unit (CU), prediction unit (PU), and transform unit (TU) and / or to the corresponding blocks, e.g. a coding tree block (CTB), a coding block (CB), a transform block (TB) or prediction block (PB). For example, a coding tree unit (CTU) may be or comprise a CTB of luma samples, two corresponding CTBs of chroma samples of a picture that has three sample arrays, or a CTB of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly, a coding tree block (CTB) may be an NxN block of samples for some value of N such that the division of a component into CTBs is a partitioning. A coding unit (CU) may be or comprise a coding block of luma samples, two corresponding coding blocks of chroma samples of a picture that has three sample arrays, or a coding block of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly a coding block (CB) may be an MxN block of samples for some values of M and N such that the division of a CTB into coding blocks is a partitioning. In embodiments, e.g, according to HEVC, a coding tree unit (CTU) may be split into CUs by using a quad-tree structure denoted as coding tree. The decision whether to code a picture area using inter-picture (temporal) or intra-picture (spatial) prediction is made at the CU level. Each CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU. In embodiments, e.g., according to the latest video coding standard currently in development, which is referred to as Versatile Video Coding (VVC), a combined Quad-tree and binary tree (QTBT) partitioning is for example used to partition a coding block. In the QTBT block structure, a CU can have either a square or rectangular shape. For example, a coding tree unit (CTU) is first partitioned by a quadtree structure. The quadtree leaf nodes are further partitioned by a binary tree or ternary (or triple) tree structure. The partitioning tree leaf nodes are called coding units (CUs), and that segmentation is used for prediction and transform processing without any further partitioning. This means that the CU, PU and TU have the same block size in the QTBT coding block structure. In parallel, multiple partition, for example, triple tree partition may be used together with the QTBT block structure. In one example, the mode selection unit 260 of video encoder 20 may be configured to perform any combination of the partitioning techniques described herein. As described above, the video encoder 20 is configured to determine or select the best or an optimum prediction mode from a set of (e.g. pre-determined) prediction modes. The set of prediction modes may comprise, e.g., intra-prediction modes and / or inter-prediction modes. Intra-Prediction The set of intra-prediction modes may comprise 35 different intra-prediction modes, e.g. non- directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined in HEVC, or may comprise 67 different intra-prediction modes, e.g. non-directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined for VVC. The intra-prediction unit 254 is configured to use reconstructed samples of neighboring blocks of the same current picture to generate an intra-prediction block 265 according to an intra-prediction mode of the set of intra-prediction modes. The intra prediction unit 254 (or in general the mode selection unit 260) is further configured to output intra-prediction parameters (or in general information indicative of the selected intra prediction mode for the block) to the entropy encoding unit 270 in form of syntax elements 266 for inclusion into the encoded picture data 21, so that, e.g, the video decoder 30 may receive and use the prediction parameters for decoding. Inter-Prediction The set of (or possible) inter-prediction modes depends on the available reference pictures (i.e. previous at least partially decoded pictures, e.g. stored in DBP 230) and other inter- prediction parameters, e.g. whether the whole reference picture or only a part, e.g. a search window area around the area of the current block, of the reference picture is used for searching for a best matching reference block, and / or e.g. whether pixel interpolation is applied, e.g. half / semi-pel and / or quarter-pel interpolation, or not. Additional to the above prediction modes, skip mode and / or direct mode may be applied. The inter prediction unit 244 may include a motion estimation (ME) unit and a motion compensation (MC) unit (both not shown in Fig.2). The motion estimation unit may be configured to receive or obtain the picture block 203 (current picture block 203 of the current picture 17) and a decoded picture 231, or at least one or a plurality of previously reconstructed blocks, e.g. reconstructed blocks of one or a plurality of other / different previously decoded pictures 231, for motion estimation. E.g. a video sequence may comprise the current picture and the previously decoded pictures 231, or in other words, the current picture and the previously decoded pictures 231 may be part of or form a sequence of pictures forming a video sequence. The encoder 20 may, e.g., be configured to select a reference block from a plurality of reference blocks of the same or different pictures of the plurality of other pictures and provide a reference picture (or reference picture index) and / or an offset (spatial offset) between the position (x, y coordinates) of the reference block and the position of the current block as inter prediction parameters to the motion estimation unit. This offset is also called motion vector (MV). The motion compensation unit is configured to obtain, e.g. receive, an inter prediction parameter and to perform inter prediction based on or using the inter prediction parameter to obtain an inter prediction block 265. Motion compensation, performed by the motion compensation unit, may involve fetching or generating the prediction block based on the motion / block vector determined by motion estimation, possibly performing interpolations to sub-pixel precision. Interpolation filtering may generate additional pixel samples from known pixel samples, thus potentially increasing the number of candidate prediction blocks that may be used to code a picture block. Upon receiving the motion vector for the PU of the current picture block, the motion compensation unit may locate the prediction block to which the motion vector points in one of the reference picture lists. The motion compensation unit may also generate syntax elements associated with the blocks and video slices for use by video decoder 30 in decoding the picture blocks of the video slice. In addition or as an alternative to slices and respective syntax elements, tile groups and / or tiles and respective syntax elements may be generated or used. Entropy Coding The entropy encoding unit 270 is configured to apply, for example, an entropy encoding algorithm or scheme (e.g. a variable length coding (VLC) scheme, an context adaptive VLC scheme (CAVLC), an arithmetic coding scheme, a binarization, a context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique) or bypass (no compression) on the quantized coefficients 209, inter prediction parameters, intra prediction parameters, loop filter parameters and / or other syntax elements to obtain encoded picture data 21 which can be output via the output 272, e.g. in the form of an encoded bitstream 21, so that, e.g., the video decoder 30 may receive and use the parameters for decoding. The encoded bitstream 21 may be transmitted to video decoder 30, or stored in a memory for later transmission or retrieval by video decoder 30. Other structural variations of the video encoder 20 can be used to encode the video stream. For example, a non-transform based encoder 20 can quantize the residual signal directly without the transform processing unit 206 for certain blocks or frames. In another implementation, an encoder 20 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit. Decoder and Decoding Method Fig. 3 shows an example of a video decoder 30 that is configured to implement the techniques of this present application. The video decoder 30 is configured to receive encoded picture data 21 (e.g. encoded bitstream 21), e.g. encoded by encoder 20, to obtain a decoded picture 331. The encoded picture data or bitstream comprises information for decoding the encoded picture data, e.g. data that represents picture blocks of an encoded video slice (and / or tile groups or tiles) and associated syntax elements. In the example of Fig. 3, the decoder 30 comprises an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g. a summer 314), a loop filter 320, a decoded picture buffer (DBP) 330, a mode application unit 360, an inter prediction unit 344 and an intra prediction unit 354. Inter prediction unit 344 may be or include a motion compensation unit. Video decoder 30 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 100 from FIG. 2. As explained with regard to the encoder 20, the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214 the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 344 and the intra prediction unit 354 are also referred to as forming the “built-in decoder” of video encoder 20. Accordingly, the inverse quantization unit 310 may be identical in function to the inverse quantization unit 110, the inverse transform processing unit 312 may be identical in function to the inverse transform processing unit 212, the reconstruction unit 314 may be identical in function to reconstruction unit 214, the loop filter 320 may be identical in function to the loop filter 220, and the decoded picture buffer 330 may be identical in function to the decoded picture buffer 230. Therefore, the explanations provided for the respective units and functions of the video 20 encoder apply correspondingly to the respective units and functions of the video decoder 30. Entropy Decoding The entropy decoding unit 304 is configured to parse the bitstream 21 (or in general encoded picture data 21) and perform, for example, entropy decoding to the encoded picture data 21 to obtain, e.g., quantized coefficients 309 and / or decoded coding parameters (not shown in Fig. 3), e.g. any or all of inter prediction parameters (e.g. reference picture index and motion vector), intra prediction parameter (e.g. intra prediction mode or index), transform parameters, quantization parameters, loop filter parameters, and / or other syntax elements. Entropy decoding unit 304 maybe configured to apply the decoding algorithms or schemes corresponding to the encoding schemes as described with regard to the entropy encoding unit 270 of the encoder 20. Entropy decoding unit 304 may be further configured to provide inter prediction parameters, intra prediction parameter and / or other syntax elements to the mode application unit 360 and other parameters to other units of the decoder 30. Video decoder 30 may receive the syntax elements at the video slice level and / or the video block level. In addition or as an alternative to slices and respective syntax elements, tile groups and / or tiles and respective syntax elements may be received and / or used. Inverse Quantization The inverse quantization unit 310 may be configured to receive quantization parameters (QP) (or in general information related to the inverse quantization) and quantized coefficients from the encoded picture data 21 (e.g. by parsing and / or decoding, e.g. by entropy decoding unit 304) and to apply based on the quantization parameters an inverse quantization on the decoded quantized coefficients 309 to obtain dequantized coefficients 311, which may also be referred to as transform coefficients 311. The inverse quantization process may include use of a quantization parameter determined by video encoder 20 for each video block in the video slice (or tile or tile group) to determine a degree of quantization and, likewise, a degree of inverse quantization that should be applied. Inverse Transform Inverse transform processing unit 312 may be configured to receive dequantized coefficients 311, also referred to as transform coefficients 311, and to apply a transform to the dequantized coefficients 311 in order to obtain reconstructed residual blocks 213 in the sample domain. The reconstructed residual blocks 213 may also be referred to as transform blocks 313. The transform may be an inverse transform, e.g., an inverse DCT, an inverse DST, an inverse integer transform, or a conceptually similar inverse transform process. The inverse transform processing unit 312 may be further configured to receive transform parameters or corresponding information from the encoded picture data 21 (e.g. by parsing and / or decoding, e.g. by entropy decoding unit 304) to determine the transform to be applied to the dequantized coefficients 311. Reconstruction The reconstruction unit 314 (e.g. adder or summer 314) may be configured to add the reconstructed residual block 313, to the prediction block 365 to obtain a reconstructed block 315 in the sample domain, e.g. by adding the sample values of the reconstructed residual block 313 and the sample values of the prediction block 365. Filtering The loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter the reconstructed block 315 to obtain a filtered block 321, e.g. to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 320 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, e.g. a bilateral filter, an adaptive loop filter (ALF), a sharpening, a smoothing filters or a collaborative filters, or any combination thereof. Although the loop filter unit 320 is shown in FIG. 3 as being an in loop filter, in other configurations, the loop filter unit 320 may be implemented as a post loop filter. Decoded Picture Buffer The decoded video blocks 321 of a picture are then stored in decoded picture buffer 330, which stores the decoded pictures 331 as reference pictures for subsequent motion compensation for other pictures and / or for output respectively display. The decoder 30 is configured to output the decoded picture 311, e.g. via output 312, for presentation or viewing to a user. Prediction The inter prediction unit 344 may be identical to the inter prediction unit 244 (in particular to the motion compensation unit) and the intra prediction unit 354 may be identical to the inter prediction unit 254 in function, and performs split or partitioning decisions and prediction based on the partitioning and / or prediction parameters or respective information received from the encoded picture data 21 (e.g. by parsing and / or decoding, e.g. by entropy decoding unit 304). Mode application unit 360 may be configured to perform the prediction (intra or inter prediction) per block based on reconstructed pictures, blocks or respective samples (filtered or unfiltered) to obtain the prediction block 365. When the video slice is coded as an intra coded (I) slice, intra prediction unit 354 of mode application unit 360 is configured to generate prediction block 365 for a picture block of the current video slice based on a signaled intra prediction mode and data from previously decoded blocks of the current picture. When the video picture is coded as an inter coded (i.e., B, or P) slice, inter prediction unit 344 (e.g. motion compensation unit) of mode application unit 360 is configured to produce prediction blocks 365 for a video block of the current video slice based on the motion vectors and other syntax elements received from entropy decoding unit 304. For inter prediction, the prediction blocks may be produced from one of the reference pictures within one of the reference picture lists. Video decoder 30 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference pictures stored in DPB 330. The same or similar may be applied for or by embodiments using tile groups (e.g. video tile groups) and / or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and / or tiles. Mode application unit 360 is configured to determine the prediction information for a video block of the current video slice by parsing the motion vectors or related information and other syntax elements, and uses the prediction information to produce the prediction blocks for the current video block being decoded. For example, the mode application unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code the video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for the slice, motion vectors for each inter encoded video block of the slice, inter prediction status for each inter coded video block of the slice, and other information to decode the video blocks in the current video slice. The same or similar may be applied for or by embodiments using tile groups (e.g. video tile groups) and / or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and / or tiles. Embodiments of the video decoder 30 as shown in Fig. 3 may be configured to partition and / or decode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or decoded using one or more slices (typically non-overlapping), and each slice may comprise one or more blocks (e.g. CTUs). Embodiments of the video decoder 30 as shown in Fig. 3 may be configured to partition and / or decode the picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), wherein a picture may be partitioned into or decoded using one or more tile groups (typically non-overlapping), and each tile group may comprise, e.g. one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile, e.g. may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks. Other variations of the video decoder 30 can be used to decode the encoded picture data 21. For example, the decoder 30 can produce the output video stream without the loop filtering unit 320. For example, a non-transform based decoder 30 can inverse-quantize the residual signal directly without the inverse-transform processing unit 312 for certain blocks or frames. In another implementation, the video decoder 30 can have the inverse-quantization unit 310 and the inverse-transform processing unit 312 combined into a single unit. It should be understood that, in the encoder 20 and the decoder 30, a processing result of a current step may be further processed and then output to the next step. For example, after interpolation filtering, motion vector derivation or loop filtering, a further operation, such as Clip or shift, may be performed on the processing result of the interpolation filtering, motion vector derivation or loop filtering. It should be noted that further operations may be applied to the derived motion vectors of current block (including but not limit to control point motion vectors of affine mode, sub- block motion vectors in affine, planar, ATMVP modes, temporal motion vectors, and so on). For example, the value of motion vector is constrained to a predefined range according to its representing bit. If the representing bit of motion vector is bitDepth, then the range is - 2 / (bitDepth-1) ~ 2"\(bitDepth-1)-1, where “~” means exponentiation. For example, if bitDepth is set equal to 16, the range is -32768 ~ 32767; if bitDepth is set equal to 18, the range is -131072~131071. For example, the value of the derived motion vector (e.g. the MVs of four 4x4 sub-blocks within one 8x8 block) is constrained such that the max difference between integer parts of the four 4x4 sub-block MVs is no more than N pixels, such as no more than 1 pixel. Here provides two methods for constraining the motion vector according to the bitDepth. Method 1: remove the overflow MSB (most significant bit) by flowing operations ux= ( myx+2bitDepth ) 0 HbitDepth 1) mvx = (ux >= 2biDept-l y 9 (yy — obitDepth y . yy 2) uy= ( myy-+2PiDepth ) 0 obitDepth 3) myy = (uy >= 280Ph1 y 9 (gy — oiDepthy ; yy 4) where mvx is a horizontal component of a motion vector of an image block or a sub-block, mvy is a vertical component of a motion vector of an image block or a sub-block, and ux and uy indicates an intermediate value; For example, if the value of mvx is -32769, after applying formula (1) and (2), the resulting value is 32767. In computer system, decimal numbers are stored as two's complement. The two’s complement of -32769 is 1,0111,1111,1111,1111 (17 bits), then the MSB is discarded, so the resulting two’s complement is 0111,1111,1111,1111 (decimal number is 32767), which is same as the output by applying formula (1) and (2). ux= ( mvpx + mvdx +20itDepth ) oj bitDepth (5) mvx = (ux >= 20iDepthl y 9 (yy — obitDepth y yy (6) uy= ( mvpy + mvdy +20itDepth } oj SbitDepth 7 mvy = (uy >= 2biDepth-l y 9 (yyy — PbitDepth y » yy ®) The operations may be applied during the sum of mvp and mvd, as shown in formula (5) to (8). Method 2: remove the overflow MSB by clipping the value vx = Clip3(-2bitDeptil pbitDepthel 1 yey vy = Clip3(-2bitPeptil bitDeptel 1 yoy where vx is a horizontal component of a motion vector of an image block or a sub-block, vy is a vertical component of a motion vector of an image block or a sub-block; x, y and z respectively correspond to three input value of the MV clipping process, and the definition of function Clip3 is as follow: <x z>y otherwise X Clip3(x,y,z)= b z FIG. 4 is a schematic diagram of a video coding device 400 according to an embodiment of the disclosure. The video coding device 400 is suitable for implementing the disclosed embodiments as described herein. In an embodiment, the video coding device 400 may be a decoder such as video decoder 30 of FIG. 1A or an encoder such as video encoder 20 of FIG. 1A. The video coding device 400 comprises ingress ports 410 (or input ports 410) and receiver units (Rx) 420 for receiving data; a processor, logic unit, or central processing unit (CPU) 430 to process the data; transmitter units (Tx) 440 and egress ports 450 (or output ports 450) for transmitting the data; and a memory 460 for storing the data. The video coding device 400 may also comprise optical-to-electrical (OE) components and electrical-to-optical (EO) components coupled to the ingress ports 410, the receiver units 420, the transmitter units 440, and the egress ports 450 for egress or ingress of optical or electrical signals. The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGAs, ASICs, and DSPs. The processor 430 is in communication with the ingress ports 410, receiver units 420, transmitter units 440, egress ports 450, and memory 460. The processor 430 comprises a coding module 470. The coding module 470 implements the disclosed embodiments described above. For instance, the coding module 470 implements, processes, prepares, or provides the various coding operations. The inclusion of the coding module 470 therefore provides a substantial improvement to the functionality of the video coding device 400 and effects a transformation of the video coding device 400 to a different state. Alternatively, the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430. The memory 460 may comprise one or more disks, tape drives, and solid-state drives and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution. The memory 460 may be, for example, volatile and / or non-volatile and may be a read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and / or static random-access memory (SRAM). Fig. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of the source device 12 and the destination device 14 from Fig. 1 according to an exemplary embodiment. A processor 502 in the apparatus 500 can be a central processing unit. Alternatively, the processor 502 can be any other type of device, or multiple devices, capable of manipulating or processing information now-existing or hereafter developed. Although the disclosed implementations can be practiced with a single processor as shown, e.g., the processor 502, advantages in speed and efficiency can be achieved using more than one processor. A memory 504 in the apparatus 500 can be a read only memory (ROM) device or a random access memory (RAM) device in an implementation. Any other suitable type of storage device can be used as the memory 504. The memory 504 can include code and data 506 that is accessed by the processor 502 using a bus 512. The memory 504 can further include an operating system 508 and application programs 510, the application programs 510 including at least one program that permits the processor 502 to perform the methods described here. For example, the application programs 510 can include applications 1 through N, which further include a video coding application that performs the methods described here. The apparatus 500 can also include one or more output devices, such as a display 518. The display 518 may be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs. The display 518 can be coupled to the processor 502 via the bus 512. Although depicted here as a single bus, the bus 512 of the apparatus 500 can be composed of multiple buses. Further, the secondary storage 514 can be directly coupled to the other components of the apparatus 500 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards. The apparatus 500 can thus be implemented in a wide variety of configurations. Triangular partitioning mode (TPM) and geometric motion partitioning (GEO) also known as triangular merge mode and geometric merge mode, respectively, are partitioning techniques that enable non-horizontal and non-vertical boundaries between prediction partitions, where prediction unit PUI and prediction unit PUI are combined in a region using a weighted averaging procedure of subsets of their samples related to different color components. TPM enables boundaries between prediction partitions along a rectangular block diagonals, whereas boundaries according to GEO may be located at arbitrary positions. In a region that a weighted averaging procedure is applied to, integer numbers within squares denote weights Weu1 applied to luma component of prediction unit PUI. In an example, weights Weu2 applied to luma component of prediction unit PU2 are calculated as follows: Weuz = 8 — Weul. Weights applied to chroma components of corresponding prediction units may differ from weights applied to luma components of corresponding prediction units. Details on the syntax for TPM are presented in Table 1, where 4 syntax elements are used to signal information on TPM: MergeTriangleFlag is a flag that identifies whether TPM is selected or not (“0” means that TPM is not selected; otherwise, TPM is chosen); merge _triangle_split_dir is a split direction flag for TPM (“0” means the split direction from top-left corner to the below-right corner; otherwise, the split direction is from top-right corner to the below-left corner); merge _triangle_idx0 and merge_triangle_idx1 are indices of merge candidates 0 and 1 used for TPM. Table 1. Merge data syntax including syntax for TPM merge_data( x0, y0, cbWidth, cbHeight ) { if (CuPredMode[ x0 [v0] == MODE _IBC){ if MaxNumMergeCand > 1) merge_idx[ x0 ][y0 | ae(v) }else { if( sps_ mmvd enabled flag || cbWidth * cbHeight !=32) regular_merge_flag[ x0 ][ v0 | ae(v) if ( regular merge flag[ x0 ][v0]==1){ if( MaxNumMergeCand > 1 ) ae(v) merge _idx[ x0 ][ v0] Yelse { if( sps_mmvd enabled flag && cbWidth * cbHeight |= 32) mmvd_merge_flag[ x0 ][ v0] ae(v) if( mmvd merge flag[ x0][y0]==1){ if MaxNumMergeCand > 1) mmvd_cand_flag[ x0 ][ v0] ae(v) mmvd_distance_idx[ x0 ][ v0] ae(v) mmvd_direction_idx[ x0 ][ v0 ] ae(v) Yelse { if( MaxNumSubblockMergeCand > 0 && cbWidth>=8 && cbHeight>=8 merge _subblock_flag[ x0 ][ v0] ae(v) if( merge subblock flag[ x0 J[v0] == 1){ if( MaxNumSubblockMergeCand > 1 ) merge_subblock_idx[ x0 ][ v0] ae(v) Yelse { if( sps_ciip enabled flag && cu skip flag[x0][v0] == 0 && SASL VW iY Seite lag 0. LLL SAM) Tiel AM LT To MM kl ( cbWidth * cbHeight ) >= 64 && cbWidth<128 && cbHeight<128){ : ae(v) ciip_flag[ x0 ][ v0 ] if( ciip_flag[ x0 [v0] && MaxNumMergeCand>1) ae(v) merge_idx[ x0 ][ v0] if( MergeTriangleFlag[ x0 ][v0 ]) { merge_triangle_split_dir[ x0 ][ v0] ae(v) merge_triangle idx0[ x0 [v0] ae(v) merge_triangle idx1[ x0][y0] ae(v) 0 In an example, TPM is described in the following proposal: R-L. Liao and C.S. Lim “CE10.3.1.b: Triangular prediction unit mode,” contribution JVET-L0124 to the 12% JVET meeting, Macao, China, October 2018. GEO is explained in the following paper: S. Esenlik, H. Gao, A. Filippov, V. Rufitskiy, A. M. Kotra, B. Wang, E. Alshina, M. Blaser, and J. Sauer, “Non-CE4: Geometrical partitioning for inter blocks,” contribution JVET-00489 to the 15% JVET meeting, Gothenburg, Sweden, July 2019. An disclosed way to harmonize TPM and / or GEO with WP is to disable them when WP is applied. The 1% implementation is shown in Table2, whether the value of the weightedPredFlag variable is equal to O for a coding unit is checked. The variable weightedPredFlag is derived as follows: If slice type is equal to P, weightedPredFlag is set equal to pps weighted pred flag. Otherwise (slice_type is equal to B), weightedPredFlag is set equal to pps_weighted bipred flag. Weighted prediction process may be switched at picture level and slice level, using pps_weighted_pred_flag and sps_weighted_pred_flag syntax elements, respectively. As disclosed above, the variable weightedPredFlag indicates whether slice-level weighted prediction should be used, when obtaining inter predicted samples of the slice. Table 2. The disclosed merge data syntax to harmonize TPM with WP merge_data( x0, y0, cbWidth, cbHeight, chType ) { Descriptor if ( CuPredMode[ chTyvpe |[ x0 ][v0] == MODE IBC) { if( MaxNumlIbcMergeCand > 1) merge_idx[ x0 ][y0 | ae(v) Yelse { if MaxNumSubblockMergeCand >0 && cbWidth>=8 && cbHeight>=8 if( merge subblock flag[ x0 ][y0] == 1){ — if( MaxNumSubblockMergeCand > 1) merge_subblock_idx[ x0 ][ y0 | ae(v) Yelse { if( ( cbWidth * cbHeight ) >= 64 && ((sps_ciip_enabled flag && cu skip flag[x0][v0]==0 && cbWidth<128 && cbHeight<128)|| (sps triangle enabled flag && MaxNumTriangleMergeCand > 1 && slice ttpe==B))) regular merge flag[ x0][v0 |] ae(v) if ( regular merge flag[ x0 [v0 ]==1){ if( sps_mmvd enabled flag ) mmvd_merge flag] x0 ][ v0] ae(v) if mmvd_merge flag[ x0 ][y0]==1){ if( MaxNumMergeCand > 1 ) mmvd_cand_flag[ x0 [v0] ae(v) mmvd_distance_idx[ x0 ][ v0 ] ae(v) mmvd_direction_idx[ x0 ][ v0 ] ae(v) }else { if( MaxNumMergeCand > 1 ) ae(v) merge_idx[ x0 ][ v0] Yelse { if( sps_ciip enabled flag && sps triangle enabled flag && MaxNumTriangleMergeCand > 1 && weightedPredFlag==0 && slice type==B && cu_skip flag[x0][v0] == 0 && ( cbWidth * cbHeight ) >= 64 && cbWidth<128 && cbHeight<128)§ ae(v) ciip_flag[ x0 ][ v0] if( ciip_flag[ x0][v0] && MaxNumMergeCand>1) ae(v) merge _idx[ x0 ][ v0] if( Iciip flag[ x0 |[ vO ] && MaxNumTriangleMergeCand > 1) { merge _triangle_split_dir[ x0 ][y0 ] ae(v) merge triangle idx0[ x0 ][ v0] ae(v) merge_triangle idx1[ x0 ][y0] ae(v) 0 ciip_flag[x0][ yO] specifies whether the combined inter-picture merge and intra-picture prediction is applied for the current coding unit. The array indices x0, yO specify the location (x0, yO ) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture. When ciip_flag[x0][ yO ] is not present, it is inferred as follows: If all the following conditions are true, ciip_flag[ x0 ][ yO ] is inferred to be equal to 1: sps_ciip_ enabled flag is equal to 1. general merge flag[x0][ yO ] is equal to 1. merge subblock flag[x0][ yO ] is equal to 0. regular merge flag[x0][ yO ] is equal to 0. cbWidth is less than 128. cbHeight is less than 128. cbWidth * cbHeight is greater than or equal to 64. Otherwise, ciip_flag[x0][y0] is inferred to be equal to 0. When ciip_flag[ x0 ][ yO] is equal to 1, the variable IntraPredModeY[x][y] with x=x0.x0+cbWidth—1 and y=y0.y0+cbHeight—1 is set to be equal to INTRA PLANAR. The variable MergeTriangleFlag[ x0 ][ yO ], which specifies whether triangular shape based motion compensation is used to generate the prediction samples of the current coding unit, when decoding a B slice, is derived as follows: If all the following conditions are true, MergeTriangleFlag[ x0 ][ yO ] is set equal to 1: sps triangle enabled flag is equal to 1. slice type is equal to B. general merge flag[ x0 ][ yO ]is equal to 1. MaxNumTriangleMergeCand is greater than or equal to 2. cbWidth * cbHeight is greater than or equal to 64. regular merge flag[ x0 ][ yO ] is equal to 0. merge subblock flag[ x0 ][ yO ] is equal to 0. ciip_flag[ x0 ][ yO ] is equal to 0. weightedPredFlag is equal to 0. Otherwise, MergeTriangleFlag[ x0 J[ yO ] is set equal to 0. The 2™ implementation is presented in Table 3. If weightedPredFlag is equal to 1, the syntax element max_num_merge_cand_minus_max_num_triangle_cand is not present and inferred with such a value that MaxNumTriangleMergeCand becomes less than 2. Table 3. The disclosed general slice header syntax to harmonize TPM with WP slice_header( ) { [ Descriptor | slice_pic_parameter_set_id ue(v) if( rect_slice flag || NumBricksInPic > 1) slice_address u(v) if( lrect_slice flag && single brick per slice flag) num_bricks_in_slice_minus1 ue(v) non_reference_picture_flag u(l) slice_type ue(v) if( separate_colour plane flag==1) colour_plane_id u(2) slice_pic_order_cnt_lsb uv) if( nal unit type == GDR_NUT) recovery_poc_cnt ue(v) if( nal unit type == [DR_W RADL || nal unit type == IDR N LP || ‘nal unit type == CRA _NUT || NalUnitType == GDR NUT) no_output_of_prior_pics_flag u(l) if( output flag present flag ) pic_output_flag u(l) if( (nal_unit_type != IDR_W_RADL && nal_unit type != IDR_N_LP) || sps_idr rpl present flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll_idx present flag))) ref_pic_list_sps_flag[i | ud) if( ref pic list sps_flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == : && rpll idx present flag))) ref_pic_list_idx[ i] uv) } else ref pic list_struct( i, num_ref pic lists in sps[i]) for( j = 0; j < NumLtrpEntries[ i ][ RplsIdx[ i] ]: j++) { if(Itrp in slice header flag[i ][ Rplsldx[i]]) slice_poc_Isb_M[i][j] _um ~delta_poc_msb_present_flagli1[j] _ un if( delta_poc_msb_present_flag[i][j]) delta_poc_msb_cycle It[i][j] ue(v) if( (slice type != 1 && num ref entries[ 0 ][Rplsldx[0]]>1) || (slice type == B && num_ref entries[ 1 J[Rplsldx[1]]>1))§ num_ref idx active override flag if num_ref idx active override flag) for(i=0;i<(slice type == B?2:1).i++) if( num_ref entries[ i J[ RplsIdx[i]]>1) num_ref _idx_ active minusi[i] if( partition_constraints_ override enabled flag) { partition_constraints_override flag if( partition constraints override flag) { slice_log2_diff min_qt_min_cb luma slice_max_mtt_hierarchy_depth_luma if( slice_max_mtt_hierarchy depth luma !=0) slice_log2_diff max_bt _min_qt_luma slice_log2 diff max_tt_min_qt luma if( slice type==1 && qtbtt dual tree intra flag) { slice_log2_diff min_qt_min_cb_chroma slice_max_mtt_hierarchy_depth_chroma if( slice_max_mtt_hierarchy depth chroma !=0) slice_log2 diff max_bt_min_qt chroma slice_log2_diff max_tt_min_qt_chroma if (slice type = I){ if( sps_temporal mvp enabled flag && !pps temporal mvp enabled _idc) slice_temporal_mvp_enabled_flag if( slice type == B && !pps_mvd 11_zero_idc) mvd 11 zero flag if( cabac init present flag ) cabac_init_flag if( slice temporal _mvp_ enabled flag) { if( slice_type == B && !pps_collocated from 10_idc) collocated from 10 flag if( ( collocated from 10 flag && NumRefldxActive[0]>1) |] ( Icollocated_from 10 flag && NumRefldxActive[1]>1)) collocated ref idx if( ( pps_weighted pred flag && slice type == P) |] ( pps_weighted_bipred_flag && slice_type =n B)) pred weight _table( ) if( !pps_six_minus max num merge cand plusl ) six_minus_max_num_merge_cand if( sps_affine_ enabled flag && ~Ipps_five_minus_max_num_subblock merge cand_plusl ) five_minus_max_num_subblock merge cand if( sps_fpel mmvd enabled flag) slice_fpel_ mmvd_enabled flag if( sps_bdof dmvr slice present flag ) slice_disable_bdof dmvr flag ~if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && slice_type == B && IweightedPredFlag && Ipps_max_num_merge cand minus max num triangle cand minus] ) { max_num_merge_cand_minus_max_num_triangle cand if ( sps_ibc_ enabled flag ) slice six_minus_max_num_ibc_merge cand if( sps_joint_cbcr enabled flag ) slice_joint_cber sign _flag slice_qp_delta if( pps_slice_chroma_qp offsets _present_flag ) { slice_cb_qp_offset slice_cr_qp_offset if( sps_joint_cbcr enabled flag ) slice_joint_chcr_qp_offset if( sps_sao_enabled flag) { slice_sao_luma_flag if( ChromaAmayType |= 0) slice sao chroma flag if( sps_alf enabled flag) { slice_alf enabled flag ~if( slice alf enabled flag) § slice num _alf aps ids luma for(i=0;i < slice num_alf aps ids luma; i++) slice_alf aps_id_lumali] if( ChromaArrayType !'= 0) slice alf chroma idc if( slice alf chroma idc) slice_alf aps_id_chroma if ( !pps_dep_ quant enabled flag ) dep quant enabled flag if( !dep_quant enabled flag) sign_data_hiding_enabled flag if( deblocking_filter override enabled flag) deblocking_filter_override_flag u(l) if( deblocking_filter override flag) { slice_deblocking filter disabled flag u(l) if( !slice_deblocking filter disabled flag) { slice beta offset div2 se(v) slice tc offset div2 se(v) if( sps_Imcs_enabled flag ) { slice_Imcs_enabled_flag u(l) if( slice _Imcs enabled flag) { slice_Imes_aps_id u2) if( ChromaArrayType |=0) slice_chroma_residual_scale flag u(l) if( sps_scaling_list_enabled flag) { slice scaling list present flag u(l) if( slice scaling_list present flag ) slice_scaling list_aps_id u3) if( entry point offsets present flag && NumEntryPoints>0) { offset len minusl ue(v) for( i= 0; i < NumEntrvPoints; i++) entry_point_offset_minusl1[i] uv) if( slice header extension present flag ) { slice_header_extension_length ue(v) for( i= 0; i<slice header extension length; i++) slice_header extension_data_byte[ i] u(8) byte_alignment( ) SEA NE 2 SME 0 PAN 0 In particular, the following semantics can be used for the 2° implementation: max_num_merge_cand_minus_max_num_triangle_cand specifies the maximum number of triangular merge mode candidates supported in the slice subtracted from MaxNumMergeCand. When max_num_merge_cand_minus_max_num_triangle_ cand is not present, and sps_triangle_enabled_flag is equal to 1, slice_type is equal to B, weightedPredFlag is equal to 0, and MaxNumMergeCand greater than or equal to 2, max_num_merge_cand_minus_max_num_triangle_cand is inferred to be equal to pps_max_num_ merge cand minus max_num triangle cand minusl + 1. When max_num_merge_cand_minus_max_num_triangle cand is not present, and sps_triangle_enabled_flag is equal to 1, slice_type is equal to B, weightedPredFlag is equal to 1, and MaxNumMergeCand greater than or equal to 2 max_num_merge_cand_minus_max_num_triangle_cand is inferred to be equal to MaxNumMergeCand or MaxNumMergeCand-1. The maximum number of triangular merge mode candidates, MaxNumTriangleMergeCand is derived as follows: MaxNumTriangleMergeCand = MaxNumMergeCand — max_num_merge cand minus max num _triangle cand When max_num_merge_cand_minus_max_num_triangle cand is present, the value of MaxNumTriangleMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive. When max _num_merge_cand_minus_max num_triangle cand is not present, and (sps_triangle_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumTriangleMergeCand is set equal to 0. When MaxNumTriangleMergeCand is equal to 0, triangle merge mode is not allowed for the current slice. The disclosed mechanisms are applicable not only TPM and GEO, but also other non- rectangular prediction and partitioning modes such as combined intra-inter prediction with triangular partitions. Since TPM and GEO is only applied in B slice, the variable weightedPredFlag in aforementioned embodiments can be replaced by the variable pps_weighted bipred_flag directly. The 3* implementation is shown in Table 6, whether the value of the weightedPredFlag variable is equal to 0 for a coding unit is checked. The variable weightedPredFlag is derived as follows: If all of the following conditions are true, weightedPredFlag is set to 0 luma_weight 10 flag[i] is equal to O for i from 0 to NumRefIdxActive[ 0 ] luma_weight 11 flag[i] is equal to O fori from 0 to NumRefldxActive[ 1 ] chroma weight 10 flag[i] is equal to O for i from 0 to NumRefIdxActive[ 0 ] chroma weight 10 flag[i] is equal to O for i from 0 to NumRefldxActive[ 1 ] Otherwise, weightedPredFlag is set to 1. The derivation process of weightedPredFlag means: if all weighted flags for luma and chroma components, and for all reference index of current slice is 0, weighted prediction is disabled in current slice; otherwise, weighted prediction may be used for current slice. As disclosed above, the variable weightedPredFlag indicates whether slice-level weighted prediction should be used when obtaining inter predicted samples of the slice. The 4" implementation is shown in Table 2, with weightedPredFlag being replaced by slice_weighted_pred_flag, which is signaled in the slice header as shown in Table 4. As disclosed above, the syntax slice weighted _pred_flag indicates whether slice-level weighted prediction should be used when obtaining inter predicted samples of the slice. Table 4. The disclosed general slice header syntax to signal slice leve weighted prediction fla; slice_header( ) { hd lice_header( ) { slice_pic_parameter_set_id ue(v) if( rect_slice flag || NumBricksInPic > 1) slice_address uv) if( lrect_slice flag && single brick per slice flag) num_bricks_in_slice_minus1 ue(v) non_reference_picture_flag u(l) slice_type ue(v) if( separate_colour plane flag==1) colour_plane_id u(2) slice_pic_order_cnt_lsb uv) if( nal unit type == GDR NUT) recovery_poc_cnt ue(v) if( nal unit type == IDR_W RADL || nal unit type == IDR N LP || ‘nal _unit type == CRA NUT || NalUnitType == GDR_NUT) no_output_of_prior_pics_flag u(l) if( output_flag present flag ) pic_output_flag u(l) if( (nal unit type != IDR _W RADL && nal unit type != IDR N LP) || sps idr rpl present flag) §{ for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) ref pic list sps flag[i] u(l) if ref pic list _sps flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == && rpll idx present flag))) ref _pic_list_idx[i] uv) 1 else ref pic list_struct( i, num_ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( Itrp_in_ slice header flag[i ][ Rplsldx[i]]) slice poc Isb It[i][j] delta_poc_msb_present flag[i][]j] if( delta_poc_msb_present_flag[i][j]) delta_poc_msb_cycle It[i][j] if( (slice_type != 1 && num_ref entries[ 0 ][Rplsldx[0]]>1) || (slice type == B && num_ref entries[ 1 J[Rplsldx[1]]>1))§ num_ref _idx_active_override_flag if num_ref idx active override flag) for(i=0;i<(slice type == B?2:1)i++) if( num_ref entries[ i J[ RplsIdx[i]]>1) num ref idx active minusi[i] if( partition_constraints_override enabled flag ) { partition_constraints_override flag if( partition _constraints override flag) { slice_log2_diff min_qt_min_cb luma slice_max_mtt_hierarchy_depth_luma if( slice_max_mtt_hierarchy depth luma !=0) slice_log2_diff max _bt_min_qt_luma slice_log2 diff max_tt_min_qt luma if( slice type==1 && qtbtt dual tree intra flag) { slice_log2_diff min_qt_min_cb_chroma slice_max_mtt_hierarchy_depth_chroma if( slice_max_mtt_hierarchy depth chroma !=0) slice_log2 diff max_bt_min_qt chroma slice_log2_diff max_tt_min_qt_chroma if (slice type = I){ if( sps_temporal mvp enabled flag && !pps temporal mvp enabled idc) slice_temporal_mvp_enabled_flag if( slice type == B && !pps_mvd 11_zero_idc) mvd 11 zero flag if( cabac init present flag ) cabac_init_flag if( slice temporal _mvp_ enabled flag) { if( slice_type == B && !pps_collocated from 10_idc) collocated from 10 flag if( (collocated from 10 flag && NumRefldxActive[0]>1) |] ( Icollocated_from 10 flag && NumRefldxActive[1]>1)) collocated ref idx if( ( pps_weighted. |_pred_flag && slice_type = Py Il ( pps_weighted_bipred_flag && slice_type == B)) slice_weighted_pred_flag if (slice_weighted pred flag) pred weight _table( ) if( !pps_six_minus_max_num_merge cand plus] ) six_minus_max_num_merge_cand if( sps_affine enabled flag && | Ipps_five minus max num subblock merge cand | plus] ) five_minus_max_num_subblock merge cand if( sps_fpel mmvd_ enabled flag ) slice_fpel mmvd_enabled_flag if( sps_bdof dmvr slice present flag) slice_disable_bdof dmvr flag if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && ~ Ipps_max_num_merge_cand_minus_max_num_triangle cand minus] ) { max_num_merge_cand_minus_max_num_triangle cand if ( sps_ibc_enabled_flag ) slice six_minus_max_num_ibc_merge cand if( sps_joint_cbcr enabled flag ) slice_joint_cber sign _flag slice_qp_delta if( pps_slice_chroma_qp offsets _present_flag ) { slice_cb_qp_offset slice_cr_qp_offset if( sps_joint_cber enabled flag ) slice_joint_chcr_qp_offset if( sps_sao_enabled flag) { slice_sao_luma_flag if( ChromaArrayType = 0) slice sao chroma flag if( sps_alf enabled flag) { slice_alf enabled flag if( slice_alf enabled flag) { slice num _alf aps ids luma for(i=0;1 < slice num _alf aps ids luma; i++) slice_alf aps_id_luma[i] if( ChromaArrayType != 0) slice alf chroma idc if( slice alf chroma idc) slice_alf aps_id_chroma if ( !pps_dep_ quant enabled flag ) dep_quant_enabled_flag u(l) if( !dep_quant enabled flag) sign_data_hiding_enabled_flag u(l) if( deblocking_filter override enabled flag ) deblocking_filter_override_flag u(l) if( deblocking filter override flag) { slice_deblocking_filter disabled flag u(l) if( Islice_deblocking_filter disabled flag) { slice beta offset div2 se(v) slice tc offset div2 se(v) if( sps_lmcs_enabled flag ) { slice_Imcs_enabled_flag u(l) if( slice _Imcs_enabled flag) { slice Imes aps id u2) if( ChromaArrayType !=0) slice_chroma_residual_scale flag u(l) if( sps_scaling_list enabled flag) { slice_scaling_list_present flag u(l) if( slice_scaling_list present flag ) slice_scaling_list_aps_id u(3) if( entry point offsets present flag && NumEntryPoints>0) { offset len minusl ue(v) for(i = 0; i < NumEntryPoints; i++ ) entry_point_offset_minusl1[i] uv) if( slice header extension present flag ) { slice_header_extension_length ue(v) for( i= 0; i<slice header extension length; i++) slice_header extension_data_byte[ i] u(8) byte alignment() oe Too Sears Go oe To Fe Fe aa slice_weighted_pred_flag equal to O specifies that weighted prediction is not applied to current slice. slice_weighted_pred_flag equal to 1 specifies that weighted prediction is applied to current slice. When not presented, the value of slice weighted pred flag is inferred to 0. The 5* implementation is to disable TPM in block level by conformance constraint. In the case of a TPM coded block, the weighing factors for the luma and chroma component of the reference pictures for inter-predictor Po 710 and P; 720 (as shown is Fig. 7) should not be present. For more details, refldxA and predListFlagA specific the reference index and reference picture list of the inter-predictor PO; refIdxB and predListFlagB specific the reference index and reference picture list of the inter-predictor P1. The varialbe lumaWeightedFlag and chromaWeightedFlag are derived as follow: lumaWeightedFlagA = predListFlagA ? luma_ weight 11 flag[ refldxA ]: luma_weight 10 flag[ refldxA ] lumaWeightedFlagB = predListFlagB ? luma weight 11 flag[ refldxB | : luma weight 10 flag[ refldxB ] chromaWeightedFlagA = predListFlagA ? chroma_weight_11_flag[ refldxA ] : chroma weight 10 flag[ refldxA ] chromaWeightedFlagB = predListFlagB ? chroma_weight_11_flag[ refldxB ] : chroma weight 10 flag[ refldxB ] lumaWeightedFlag = lumaWeightedFlagA | | lumaWeightedFlagB chromaWeightedFlag = chromaWeightedFlagA | | chromaWeightedFlagB It is a requirement of bitstream conformance that lumaWeightedFlag and chromaWeightedFlag should be equal to 0. The 6% implementation is to disable the blending weighted sample prediction process for TPM coded block when explicit weighted prediction is used. Fig. 7 and Fig. 8 illustrate the examples for TPM and GEO, respectively. It is noted that the embodiments for TPM might be also implemented for GEO mode. In the case of a TPM coded block, if the weighing factors for the luma or chroma component of the reference picture for inter-predictor Po 710 or P1 720 are present, the weighted process in accordance with the WP parameters (WP parameters 730 {wo, Oo} and WP parameters 740 {w1, O1} for Po and Pj, respectively) is used to generate the inter-predictor block; otherwise, the weighted process in accordance with the blending weighted parameter is used to generated the inter-predictor for block 750. As shown in Fig. 9, the inter-predictor 901 requires two prediction blocks PO 911 and P1 912 that have an overlapped area 921 where non-zero weights are applied to both blocks 911 and 912 to partially blend the predictors PO 911 and P1 912. Blocks neighboring to block 901 are denoted as 931, 932, 933, 934, 935, and 936 in Fig. 9. Fig. 8 illustrates some difference between TPM and GEO merge modes. In the case of GEO merge mode, the overlapped area between predictors 851 and 852 can be located not only along the diagonals of the inter-predicted block 850. Predictors PO 851 and P1 852 can be received by copying blocks 810 and 820 out of other pictures with or without applying weights and offsets {wo, Oo} 830 and {wi, O1} 840 to blocks 810 and 820, respectively. In an example, refldxA and predListFlagA specific the reference index and reference picture list of the inter-predictor PO; refIdxB and predListFlagB specific the reference index and reference picture list of the inter-predictor P1. The varialbe lumaWeightedFlag and chromaWeightedFlag are derived as follow: lumaWeightedFlagA = predListFlagA ? luma_ weight 11 flag[ refldxA ]: luma_weight 10 flag[ refldxA ] lumaWeightedFlagB = predListFlagB ? luma weight 11 flag[ refldxB | : luma weight 10 flag[ refldxB ] chromaWeightedFlagA = predListFlagA ? chroma_weight_11_flag[ refldxA ] : chroma weight 10 flag[ refldxA ] chromaWeightedFlagB = predListFlagB ? chroma_weight_11_flag[ refldxB ] : chroma weight 10 flag[ refldxB ] lumaWeightedFlag = lumaWeightedFlagA | | lumaWeightedFlagB chromaWeightedFlag = chromaWeightedFlagA | | chromaWeightedFlagB Then if lumaWeightedFlag is true, the explicit weighted process is invoked; if lumaWeightedFlag is false, the blending weighted process is invoked. As well, the chroma component is decided by chromaWeightedFlag. For an alternative implementation, the weighted flag for all components are considered jointly. If one of lumaWeightedFlag or chromaWeightedFlag is true, the explicit weighted process is invoked; if both lumaWeightedFlag and chromaWeightedFalg are false, the blending weighted process is invoked. The explicit weighted process for a rectangular block predicted using bi-prediction mechanism, is performed as described below. Inputs to this process are: two variables nCbW and nCbH specifying the width and the height of the current coding block, two (nCbW)x(nCbH) arrays predSamplesA and predSamplesB, the prediction list flags, predListFlagA and predListFlagB, the reference indices, refldxA and refIdxB, the variable cIdx specifying the colour component index, the sample bit depth, bitDepth. Output of this process is the (n"CbW)x(nCbH) array pbSamples of prediction sample values. The variable shift] is set equal to Max( 2, 14 — bitDepth ). The variables log2Wd, 00, ol, w0 and w1 are derived as follows: If cIdx is equal to O for luma samples, the following applies: log2Wd = luma_log2 weight denom + shift] wO0 = predListFlagA ? LumaWeightL1[ refIldxA ] : LumaWeightLO[ refldxA ] wl = predListFlagB ? LumaWeightL1[ refldxB ] : LumaWeightLO[ refldxB ] 00 = ( predListFlagA ? luma_ offset 11[ refldxA ] : luma_ offset 10[ refldxA ]) << ( BitDepthy — 8) ol = ( predListFlagB ? luma_ offset 11[ refldxB ] : luma offset 10] refldxB |) << ( BitDepthy — 8) Otherwise (cIdx is not equal to 0 for chroma samples), the following applies: log2Wd = ChromaLog2WeightDenom + shiftl wO0 = predListFlagA ? ChromaWeightL1[ refldxA J[cldx— 11]: ChromaWeightLO[ refIldxA ][ cldx — 1] wl = predListFlagA ? ChromaWeightL1[ refldxB J[ cIdx — 11]: ChromaWeightLO[ refIldxB ][ cldx — 1] 00 = ( predListFlagA ? ChromaOffsetL1[ refldxA J[ cIdx — 1]: ChromaOffsetLO[ refldxA J[ cldx —1]) << (BitDepthc—8) ol = ( predListFlagB ? ChromaOffsetL1[ refldxB J[ cldx— 1]: ChromaOffsetLO[ refldxB J[cldx—1]) << (BitDepthc—8) The prediction sample pbSamples[ x ][ y] with x=0.nCbW —1 and y=0.nCbH 1 are derived as follows: pbSamples[ x ][ y ]=Clip3( 0, (1 << bitDepth ) — 1,( predSamplesA[ x J[y ] * w0 + predSamplesB[ x ]J[y]* wl +((00+0l1+1) << log2Wd)) >> (log2Wd+1)) Parameters of the slice-level weighted prediction could be represented as a set of variables, assigned for each element of a reference picture list. Index of the element is denoted further as “i”. These parameters may comprise: - LumaWeightLO[ / ] - luma_offset_10[ 7 ] is the additive offset applied to the luma prediction value for list 0 prediction using RefPicList[ 0 ][ i ]. The value of luma_offset 10[ i ] shall be in the range of —128 to 127, inclusive. When luma_weight_10_flag][ i ] is equal to 0, luma_offset_10[i] is inferred to be equal to 0. The variable LumaWeightLO[ i ] is derived to be equal to (1 << luma_log2 weight _denom ) + delta_luma_weight _[10[i]. When luma_weight 10_flag[ i] is equal to 1, the value of delta luma_weight _10[ i] shall be in the range of —128 to 127, inclusive. When luma_ weight 10 flag[i] is equal to O, LumaWeightLO[ i ] is inferred to be equal to 2!uma log? eight denom The blending weighted process for a rectangular block predicted using bi-prediction mechanism, the following process is performed as described below. Inputs to this process are: two variables nCbW and nCbH specifying the width and the height of the current coding block, two (nCbW)x(nCbH) arrays predSamplesLA and predSamplesLB, a variable triangleDir specifying the partition direction, a variable cldx specifying colour component index. Output of this process is the (nCbW)x(nCbH) array pbSamples of prediction sample values. The variable nCbR is derived as follows: nCbR =(nCbW >nCbH) ? (nCbW / nCbH) (nCbH / nCbW ) The variable bitDepth is derived as follows: If cldx is equal to 0, bitDepth is set equal to BitDepthy. - Otherwise, bitDepth is set equal to BitDepthc. Variables shift] and offset] are derived as follows: The variable shift] is set equal to Max( 5, 17 — bitDepth). The variable offset] is set equal to 1 << ( shifil — 1). Depending on the values of triangleDir, wS and cIdx, the prediction samples pbSamples[ x ][ y ] with x =0..nCbW — 1 and y = 0..nCbH — 1 are derived as follows: The variable wldx is derived as follows: If cldx is equal to 0 and triangleDir is equal to 0, the following applies: wldx = (nCbW >nCbH ) ? (Clip3( 0, 8, (x / nCbR—y)+4)) 1 (Clip3(0,8,(x—y / nCbR)+4)) Otherwise, if cIdx is equal to O and triangleDir is equal to 1, the following applies: wldx = (nCbW > nCbH ) ? ( Clip3( 0, 8, (nCbH-1-x / nCbR-y)+4)) (Clip3( 0,8, (nCbW—-1-x—-y / nCbR)+4)) Otherwise, if cIdx is greater than 0 and triangleDir is equal to 0, the following applies: wldx = (nCbW >nCbH ) ? (Clip3( 0,4, (x / nCbR—y)+2)) 1 (Clip3(0,4,(x—y / nCbR)+2)) Otherwise (if cIdx is greater than 0 and triangleDir is equal to 1), the following applies: wldx = (nCbW > nCbH ) ? ( Clip3( 0, 4, (nCbH-1-x / nCbR-y)+2)) (Clip3(0,4,(nCbW—-1-x-y / nCbR)+2)) The variable wValue specifying the weight of the prediction sample is derived using wldx and cldx as follows: wValue=(cldx==0) ? Clip3(0, 8, wldx) Clip3( 0, 8, wldx * 2) The prediction sample values are derived as follows: pbSamples[ x ][ y]=Clip3( 0, (1 << bitDepth )— 1, ( predSamplesLA[ x ][ y ] * wValue + predSamplesLB[ x ][ vy ] * ( 8 — wValue ) + offset] ) >> shift] ) For geometric mode, the blending weighted process for a rectangular block predicted using bi-prediction mechanism, the following process is performed as described below. Inputs to this process are: two variables nCbW and nCbH specifying the width and the height of the current coding block, two (nCbW)x(nCbH) arrays predSamplesLA and predSamplesLB, a variable angleldx specifying the angle index of the geometric partition, a variable distanceldx specizing the distance idx of the geometric partition, a variable cIdx specifying colour component index. Output of this process are the (nCbW)x(nCbH) array pbSamples of prediction sample values and the variable partldx. The variable bitDepth is derived as follows: If cldx is equal to 0, bitDepth is set equal to BitDepthy. - Otherwise, bitDepth is set equal to BitDepthc. Variables shift] and offset] are derived as follows: The variable shift] is set equal to Max( 5, 17 — bitDepth). The variable offset] is set equal to 1 << ( shifil — 1). The weights array sampleWeightr[ x ][ y ] for luma and sampleWeightc[ x ][ y ] for chroma with x =0..nCbW — 1 and y = 0..nCbH — 1 are derived as follows: The value of the following variables are set; hwRatio is set to nCbH / nCbW displacementX is set to angleIdx displacement is set to (displacementX + 8)%32 partldx is set to angleldx >=13 && angleldx <=27?1:0 tho is set to the following value using the look-up tables denoted as Dis, specified in Table 8-12: tho = (Dis[displacementX]<< 8) + (Dis[displacementY] << 8) If one of the following conditons is true, variable shiftHor is set equal to 0: angleldx % 16 is equal to 8, angleldx % 16 is not equal to 0 and hwRatio = 1 Otherwise, shiftHor is set equal to 1. If shiftHor is equal to 0, offsetX and offsetY are derived as follows: offsetX = (256 —nCbW ) >> 1, offsetY = ( 256 — nCbH ) >> 1 + angleldx < 16 ? (distanceldx * nCbH) >> 3 : —((distanceldx * nCbH) >> 3) Otherwise, if shiftHor is equal to 1, offsetX and offsetY are derived as follows: offsetX = (256 — nCbW ) >> 1 + angleldx < 16 ? (distanceldx * nCbW) >> 3 : —((distanceldx * nCbW) >> 3) offsetY = (256 —nCbH )>> 1 The variable weightldx and weightIldxAbs are calculated using the look-up table Table 9 with x =0..nCbW — 1 and y = 0.nCbH — 1 as following; weightIdx = (((x + offsetX)<<1) + 1)*Dis[displacementX] + (((y + offsetY )<<1) + 1))*Dis[displacementY] — rho. weightldxAbs = Clip3(0, 26, abs(weightldx)). The value of sampleWeightr[ x ]J[ v] with x=0..nCbW —1 and y=0..nCbH -1 is set according to Table 10 denoted as GeoFilter: sampleWeightr[ x ][y ] weightldx <= 0 ? GeoFilter[weightldxAbs] 8 GeoFilter[weightldxAbs] The value sampleWeightc[ x ][ y ] withx = 0..0CbW — 1 and y = 0..nCbH - 1 is set as follows: sampleWeightc[ x ][ y ] = sampleWeight[ (x<< (SubWidthC - 1) ) ][ (y<< (SubHeightC — 1)1] NOTE -- The value of sample sampleWeight [x ][y] can also be derived from sampleWeightr[ x -shiftX][ y-shiftY ]. If the angleldx is larger than 4 and smaller than 12, or angleldx is larger than 20 and smaller than 24, shiftX is the tangent of the split angle and shiftY is 1, otherwise shiftX is 1 of the split angle and shiftY is cotangent of the split angle. If tangent (resp. cotangent) value is infinity, shiftX is 1 (resp. 0) or shift Y is O (reps. 1). The prediction sample values are derived as follows with X denoted as L or C with cldx is equal to 0 or not equal to 0 : pbSamples[ x ][ y ] = partldx ? Clip3( 0, (1 << bitDepth)— 1, ( predSamplesLA[ x ][ y] * ( 8 — sampleWeightx[ x [vy ]) + predSamplesLB[ x ][ y | * sampleWeightx [ x ][ y ] + offset] ) >> shift] ) 1 Clip3( 0, (1 << bitDepth ) — 1, ( predSamplesLA[ x ][ y ] * sampleWeightx [x ][y ] + predSamplesLB[ x ][ y ] * ( 8 — sampleWeightx[ x ][ y ]) + offset] ) >> shift] ) Table 5 - Look-up table Dis for derivation of geometric partitioning distance. idx idx 0 214167189 |10|12]|14|15 mo [SJ 3 [TI 3

[712] a [5] idx 16 | 17 | 18 | 20 | 22 | 23 | 24 | 25 | 26 | 28 | 30 | 31 Dis[idx] | 8 | 8 | 8| 8 | 4|-2]0]2|48]8]38 Table 6- Filter weight look-up table GeoFilter for derivation of geometric partitioning filter weights. idx 0 2 (34567189 23 |4|S5|6 [718910 11|12]13 6 idx GeoFilter[idx] | 4 | 4 | 4 | 4 | 55155] 5[5]5]6]6]6 idx 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 GeoFilter[idx]

[666] cl717T71 717171717713 In VVC specification Draft 7 (document JVET-P2001-vE: B. Bross, J. Chen, S. Liu, Y.- K. Wang, “Versatile Video Coding (Draft 7),” output document JVET-P2001 of the 16th JVET meeting, Geneva, Switzerland; this document is contained in file JVET-P2001-v14: http: / / phenix.it-sudparis.eu / jvet / doc_end_user / documents / 16_Geneva / wg11 / JVET-P2001- v14.zip), the concept of picture header (PH) was introduced by moving a part of syntax elements out of slice header (SH) to PH to reduce signaling overhead caused by assigning equal or similar values to same syntax elements in each SH associated with the PH. As presented in Table 7, syntax elements to control the maximum number of merge candidates for TPM merge mode are signaled in PH, whereas weighted prediction parameters are still in SH as shown in Table 8 and Table 10. The semantics of syntax elements used in Table 8 and Table 9 is described below. Table 7 - Picture header RBSP syntax picture_header_rbsp( ) { non_reference_picture_flag u(l) gdr_pic_flag u(l) no_output_of prior pics flag u(l) if( gdr pic flag) recovery_poc_cnt ue(v) ph_pic_parameter_set_id ue(v) if( sps_poc_msb flag) { ph_poc_msb_present flag u(l) if( ph_poc_msb present flag ) poc_msb_val uv) if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && “Ipps_max_num_merge_cand_minus_max_num_triangle cand plusl ) pic_max_num_merge_cand_minus_max_num_triangle_cand ue(v) tbsp trailing bits( ) } = = Picture header RBSP semantics The PH contains information that is common for all slices of the coded picture associated with the PH. non_reference_picture_flag equal to 1 specifies the picture associated with the PH is never used as a reference picture. non_reference_picture flag equal to O specifies the picture associated with the PH may or may not be used as a reference picture. gdr_pic_flag equal to 1 specifies the picture associated with the PH is a gradual decoding refresh (GDR) picture. gdr_pic_flag equal to 0 specifies that the picture associated with the PH is not a GDR picture. no_output_of_prior_pics_flag affects the output of previously-decoded pictures in the decoded picture buffer (DPB) after the decoding of a coded layer video sequence start (CLVSS) picture that is not the first picture in the bitstream. recovery_poc_cnt specifies the recovery point of decoded pictures in output order. If the current picture is a GDR picture that is associated with the PH and there is a picture picA that follows the current GDR picture in decoding order in the coded layer video sequence (CLVS) and that has PicOrderCntVal equal to the PicOrderCntVal of the current GDR picture plus the value of recovery_poc_cnt, the picture picA is referred to as the recovery point picture. Otherwise, the first picture in output order that has PicOrderCntVal greater than the PicOrderCntVal of the current picture plus the value of recovery poc_cnt is referred to as the recovery point picture. The recovery point picture shall not precede the current GDR picture in decoding order. The value of recovery poc_cnt shall be in the range of 0 to MaxPicOrderCntLsb — 1, inclusive. NOTE 1 — When gdr enabled flag is equal to 1 and PicOrderCntVal of the current picture is greater than or equal to RpPicOrderCntVal of the associated GDR picture, the current and subsequent decoded pictures in output order are exact match to the corresponding pictures produced by starting the decoding process from the previous intra random access point (IRAP) picture, when present, preceding the associated GDR picture in decoding order. ph_pic_parameter_set_id specifies the value of pps_pic_parameter_set_id for the PPS in use. The value of ph_pic_parameter_set_id shall be in the range of 0 to 63, inclusive. It is a requirement of bitstream conformance that the value of Temporalld of the PH shall be greater than or equal to the value of Temporalld of the Picture Parameter Set (PPS) that has pps_pic parameter set id equal to ph_pic parameter set id. sps_poc_msb_flag equal to 1 specifies that the ph_poc_msb_cycle present_flag syntax element is present in PHs referring to the Sequence Parameter Set (SPS). sps_poc_msb_flag equal to 0 specifies that the ph_poc_msb_cycle present_flag syntax element is not present in PHs referring to the SPS. ph_poc_msb_present_flag equal to 1 specifies that the syntax element poc_msb_val is present in the PH. ph_poc_msb_present_flag equal to 0 specifies that the syntax element poc_msb_val is not present in the PH. When vps_independent_layer_flag[ GeneralLayerldx[ nuh_layer_id ]] is equal to 0 and there is a picture in the current Access Unit (AU) in a reference layer of the current layer, the value of ph_poc msb_ present flag shall be equal to 0. poc_msb_val specifies the picture order count (POC) most significant bit (MSB) value of the current picture. The length of the syntax element poc_msb_val is poc_msb_len_minus1 + 1 bits. sps_triangle_enabled_flag specifies whether triangular shape based motion compensation can be used for inter prediction. sps_triangle_enabled_flag equal to O specifies that the syntax shall be constrained such that no triangular shape based motion compensation is used in the coded layer video sequence (CLVS), and merge_triangle_split_dir, merge triangle idx0, and merge_triangle idx1 are not present in coding unit syntax of the CLVS. sps_triangle_enabled_flag equal to specifies that triangular shape based motion compensation can be used in the CLVS. pps_max_num_merge_cand_minus_max_num_triangle_cand_plusl equal to 0 specifies that pic_max_num_merge_cand_minus_max_num_triangle_cand is present in PHs of slices referring to the Picture Parameter Set (PPS). pps_max_num_merge_cand_minus_max_num_triangle_cand_plus] greater than 0 specifies that pic_max_num_ merge cand minus max num triangle cand is not present in PHs pps_max_num_merge_cand_minus_max_num_triangle_cand_plus] shall be in the range of 0 to MaxNumMergeCand — 1. pps_max_num_merge_cand_minus_max_num_triangle_cand_plusl equal to 0 specifies that pic_max_num_merge _cand_minus_max_num_triangle_cand is present in PHs of slices referring to the PPS. pps max _num_merge cand _minus_max_num_triangle_cand_plusl greater than O specifies that pic_max_num_merge_cand_minus_max_num_triangle cand is not present in PHs referring to the PPS. The value of pps_max_num_merge_cand_minus_max_num_triangle_cand_plus] shall be in the range of 0 to MaxNumMergeCand — 1. pic_six_minus_max_num_merge_cand specifies the maximum number of merging motion vector prediction (MVP) candidates supported in the slices associated with the PH subtracted from 6. The maximum number of merging MVP candidates, MaxNumMergeCand is derived as follows: MaxNumMergeCand = 6 — picsix minus max num merge cand The value of MaxNumMergeCand shall be in the range of 1 to 6, inclusive. When not present, the value of pic_six_minus_max_num_merge_cand is inferred to be equal to pps_six_minus max _num_ merge cand plus] — 1. Table 8 - General slice header syntax slice_header( ) { slice_pic_order_cnt_lsh uv) if( subpics present flag ) slice_subpic_id uv) if( rect_slice flag || NumTilesInPic>1) slice_address uO) if( !rect_slice flag && NumTilesInPic>1) num_tiles_in_slice_minus1 ue(v) slice_type ue(v) if( !pic_rpl_present flag &&( (nal unit type != IDR_W_RADL && nal unit type = IDR N LP) || sps idr rpl present flag) ){ for(i=0;i<2; i++) { if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == ! && rpll idx present flag))) i 1 slice_rpl_sps_flag[i] u(l) if( slice mpl sps flag[i]) { if( num _ref pic lists in sps[i]>1 && (i == 0 || (i == 1 && rpll_idx present flag))) slice_rpl_idx[i] uv) 1 else ref pic list_struct( i, num_ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( Itrp_in_ slice header flag[i ][ Rplsldx[i]]) slice poc Isb It[i][j] uv) slice_delta_poc_msb_present flag[i][]] u(l) if( slice_delta_poc_msb_ present flag[i][j]) slice delta poc msb cycle I[i][j] ue(v) Il ((nal unit type != IDR W RADL if( pic_rpl_present flag || ((nal_unit type != IDR_W_RADL && nal unit type oo 1 | = IDR N LP) || sps idr rpl present flag) ){ if( (slice_tvpe != 1 && num_ref entries[ 0 ][ Rplsldx[0]]>1) |] ( slice_type == B && num_ref_entries| 1][Rplsldx[1]]1>1)) { num_ref idx_active override flag u(l) if( num_ref idx active override flag) for(i=0;i<(slice type == B?2:1) i++) if( num_ref entries[ i ][ Rplsldx[i]]>1) num_ref idx active minusl[i] ue(v) if( slice type = I){ if ( pps_weighted |_pred_flag T && - slice_type == P) | | x pps_weighted_bipred_flag && slice_type == B)) pred weight _table( ) byte_alignment( ) General slice header semantics When present, the value of the slice header syntax element slice_pic_order_cnt_Isb shall be the same in all slice headers of a coded picture. The variable CuQpDeltaVal, specifying the difference between a luma quantization parameter for the coding unit containing cu_qp_delta_abs and its prediction, is set equal to 0. The variables CuQpOffsetcs, CuQpOffsetcr, and CuQpOffsetcncy, specifying values to be used when determining the respective values of the Qp’ cb, Qp’ cr, and Qp’ ever quantization parameters for the coding unit containing cu_chroma_qp_offset_flag, are all set equal to 0. slice_pic_order_cnt_lsb specifies the picture order count modulo MaxPicOrderCntLsb for the current picture. The length of the slice pic order cnt Isb syntax element is log2_max_pic_order_cnt_lsb_minus4 + 4 bits. The value of the slice_pic_order_cnt_lsb shall be in the range of 0 to MaxPicOrderCntLsb — 1, inclusive. ‘When the current picture is a GDR picture, the variable RpPicOrderCntVal is derived as follows: RpPicOrderCntVal = PicOrderCntVal + recovery _poc_cnt. slice_subpic_id specifies the subpicture identifier of the subpicture that contains the slice. If slice_subpic_id is present, the value of the variable SubPicldx is derived to be such that SubpicIdList[ SubPicldx ] is equal to slice_subpic_id. Otherwise (slice_subpic_id is not present), the variable SubPicldx is derived to be equal to 0. The length of slice_subpic_id, in bits, is derived as follows: If sps_subpic id signalling present flag is equal to 1, the length of slice subpic id is equal to sps_subpic_id len minusl +1. Otherwise, if ph_subpic id signalling present_flag is equal to 1, the length of slice _subpic_id is equal to ph_subpic id len minusl + 1. Otherwise, if pps_subpic_id_signalling_present_flag is equal to 1, the length of slice _subpic_id is equal to pps_subpic_id len minusl + 1. Otherwise, the length of slice_subpic_id is equal to Ceil( Log2 ( sps_num_subpics minusl +1)). slice_address specifies the slice address of the slice. When not present, the value of slice address is inferred to be equal to 0. If rect_slice flag is equal to 0, the following applies: The slice address is the raster scan tile index. The length of slice address is Ceil( Log2 ( NumTilesInPic ) ) bits. The value of slice_address shall be in the range of 0 to NumTilesInPic — 1, inclusive. Otherwise (rect_slice flag is equal to 1), the following applies: The slice address is the slice index of the slice within the SubPicIdx-th subpicture. The length of slice address is Ceil( Log2( NumSlicesInSubpic[ SubPicIdx ] ) ) bits. The value of slice address shall be in the range of 0 to NumSlicesInSubpic[ SubPicldx ] — 1, inclusive. It is a requirement of bitstream conformance that the following constraints apply: If rect slice flag is equal to 0 or subpics present flag is equal to 0, the value of slice address shall not be equal to the value of slice address of any other coded slice Network Abstraction Layer (NAL) unit of the same coded picture. Otherwise, the pair of slice subpic id and slice address values shall not be equal to the pair of slice _subpic id and slice address values of any other coded slice NAL unit of the same coded picture. ‘When rect slice flag is equal to 0, the slices of a picture shall be in increasing order of their slice address values. The shapes of the slices of a picture shall be such that each Coding Tree Unit (CTU), when decoded, shall have its entire left boundary and entire top boundary consisting of a picture boundary or consisting of boundaries of previously decoded CTU(s). num_tiles_in_slice_minus1 plus 1, when present, specifies the number of tiles in the slice. The value of num_tiles_in_slice_minusl shall be in the range of 0 to NumTilesInPic — 1, inclusive. The variable NumCtuInCurrSlice, which specifies the number of CTUs in the current slice, and the list CtbAddrInCurrSlice[ i], for i ranging from 0 to NumCtulnCurrSlice — 1, inclusive, specifying the picture raster scan address of the i-th Coding Tree Block (CTB) within the slice, are derived as follows: if( rect slice flag) { picLevelSliceldx = SliceSubpicToPicIdx[ SubPicldx ][ slice address ] NumCtulnCurrSlice = NumCtulnSlice[ picLevelSliceldx ] for( i= 0; i<NumCtulnCurrSlice; i++) CtbAddrInCurrSlice[ i ] = CtbAddrInSlice[ picLevelSliceldx ][ i] } else { NumCtulnCurrSlice = 0 for( tileIdx = slice address; tileldx <= slice_address + num _tiles in slice minus1[i J; tileIdx++) { tileX = tileldx % NumTileColumns tileY =tileldx / NumTileColumns for( ctbY = tileRowBd[ tileY ]; ctbY < tileRowBd[ tileY + 1 ]; ctbY++) { for( ctbX = tileColBd[ tileX J; ctbX < tileColBd[ tileX + 1 J; ctbX++) { CtbAddrInCurrSlice[ NumCtulnCurrSlice | = ctbY * PicWidthInCtb + ctbX NumCtulnCurrSlice++ The variables SubPicLeftBoundaryPos, SubPicTopBoundaryPos, SubPicRightBoundaryPos, and SubPicBotBoundaryPos are derived as follows: if( subpic treated as pic flag[ SubPicldx ]) { SubPicLeftBoundaryPos = subpic_ctu top left x[ SubPicldx ] * CtbSizeY SubPicRightBoundaryPos = Min( pic width max_in luma samples — 1, ( subpic_ctu_top left x[ SubPicldx ] + subpic_width minusl1[ SubPicldx ] + 1 ) * CtbSizeY — 1) SubPicTopBoundaryPos = subpic_ctu_top left y[ SubPicldx ] *CtbSizeY SubPicBotBoundaryPos = Min( pic height max in luma samples — 1, ( subpic ctu top left y[ SubPicldx ] + subpic_height minus1[ SubPicldx ] + 1) * CtbSizeY — 1) slice_type specifies the coding type of the slice according to Table 13. Table 9 — Name association to slice_type 0 EA slice_type | Name of slice_type “0 [B(Bslice) P (P slice) 2 I(I slice) slice_rpl_sps_flag[ i ] equal to 1 specifies that reference picture list i of the current slice is derived based on one of the ref_pic_list_struct( listldx, rplsldx ) syntax structures with listldx equal to i in the SPS. slice_rpl_sps_flag[ i ] equal to 0 specifies that reference picture list i of the current slice is derived based on the ref pic_list_struct( listldx, rplsIdx ) syntax structure with listIdx equal to i that is directly included in the slice headers of the current picture. When slice _rpl sps_flag[ i ] is not present, the following applies: If pic_rpl present flag is equal to 1, the value of slice rpl sps flag[ i] is inferred to be equal to pic_rpl_sps_flag[i]. Otherwise, if num_ref pic_lists_in_sps[i] is equal to 0, the value of ref pic list sps flag[ i] is inferred to be equal to 0. Otherwise, if num_ref pic lists in sps[i]is greater than 0 and if rpl1_idx present flag is equal to O, the value of slice_rpl_sps_flag[ 1] is inferred to be equal to slice _rpl_sps flag[ 0]. slice_rpl_idx[ i] specifies the index, into the list of the ref pic_list_struct( listldx, rplsIdx ) syntax structures with listldx equal to i included in the SPS, of the ref _pic_list_struct( listldx, rplsIdx ) syntax structure with listIdx equal to i that is used for derivation of reference picture list i of the current picture. The syntax element slice rpl_idx[i] is represented by Ceil( Log2( num_ref pic_lists_in_sps[i])) bits. When not present, the value of slice_rpl_idx[ i ] is inferred to be equal to 0. The value of slice_rpl_idx[ i ] shall be in the range of 0 to num_ref pic_lists_in_sps[ i ] — 1, inclusive. When slice_rpl_sps_flag[ i ] is equal to 1 and num_ref_pic_lists_in_sps[ i] is equal to 1, the value of slice_rpl_idx[ i] is inferred to be equal to 0. When slice_rpl_sps_flag[ i] is equal to 1 and rpll_idx_present_flag is equal to 0, the value of slice rpl idx[ 1 ]is inferred to be equal to slice rpl idx[ 0]. The variable RplsIdx[ i] is derived as follows: if( pic pl present flag) Rplsldx[ i ] = PicRplsIdx[ i] else RplsIdx[ i] =slice rpl sps flag[ i]? slice rpl idx[i]: num_ref pic lists in _sps[i] slice_poc_Isb_It[i][j] specifies the value of the picture order count modulo MaxPicOrderCntLsb of the j-th LTRP entry in the i-th reference picture list. The length of the slice_poc_lsb_It[ i ][ j ] syntax element is log2_max_pic_order_cnt_lsb_minus4 + 4 bits. The variable PocLsbLt[ i ][ j ] is derived as follows: if( pic_rpl_ present flag) PocLsbLt[1][j]= PicPocLsbLt[1][]] else PocLsbLt[i][j]=Itrp in slice header flag[i][ Rplsldx[i]]? slice_poc_Isb_It[1][j]: rpls_poc_lsb_It[ listIdx ]J[ RplsIdx[i]1[j] slice_delta_poc_msb_present_flag[i][]] equal to specifies that slice_delta_poc_msb_cycle It[i][j] is present. slice_delta_poc_msb_present_flag[i][j] equal to O specifies that slice_delta_poc_msb_cycle_It[i][ j ] is not present. Let prevTidOPic be the previous picture in decoding order that has nuh_layer_id the same as the current picture, has Temporalld equal to 0, and is not a Random Access Skipped Leading (RASL) or Random Access Decodable Leading (RADL) picture. Let setOfPrevPocVals be a set consisting of the following: the PicOrderCntVal of prevTidOPic, the PicOrderCntVal of each picture that is referred to by entries in RefPicList[ 0] or RefPicList[ 1 ] of prevTidOPic and has nuh layer id the same as the current picture, the PicOrderCntVal of each picture that follows prevTidOPic in decoding order, has nuh layer id the same as the current picture, and precedes the current picture in decoding order. When pic_rpl_present_flag is equal to 0 and there is more than one value in setOfPrevPocVals for which the value modulo MaxPicOrderCntLsb is equal to PocLsbLt[1][j ], the value of slice delta poc_msb present flag[i][j] shall be equal to 1. slice_delta_poc_msb_cycle_It[ i ][ j ] specifies the value of the variable FullPocLt[i][]] as follows: if( pic_rpl present flag) FullPocLt[i][j] = PicFullPocLt[1][]] else { if(j 0) DeltaPocMsbCycleLt[ i ][ j ] = delta poc msb cycle 1t[1][j] else DeltaPocMsbCycleLt[ 1][ j ] = delta_poc_msb cycle It[i][j]+ DeltaPocMsbCycleLt[1][j— 1] FullPocLt[i][j] = PicOrderCntVal — DeltaPocMsbCycleLt[i][j] * MaxPicOrderCntLsb —( PicOrderCntVal & ( MaxPicOrderCntLsb —1)) + PocLsbLt[1][]] The value of slice delta poc_msb_cycle It[i][j] shall be in the range of 0 to (32 log2 max pic order ent Isb minus 4) inclusive, When not present, the value of slice delta poc_msb cycle It[ i ][j ] is inferred to be equal to 0. num_ref_idx_active_override_flag equal to specifies that the syntax element num_ref idx_active_minus1[ 0] is present for P and B slices and that the syntax element num_ref idx_active_minus1[ 1] is present for B slices. num_ref _idx_active_override_flag equal to O specifies that the syntax elements num_ref idx_active_minusl[ 0] and num_ref idx_active_minusl[ 1] are not present. When not present, the value of num _ref idx active override flag is inferred to be equal to 1. num_ref_idx_active_minus1[i] is used for the derivation of the variable NumRefldxActive[ i] as specified by Equation 145. The value of num_ref idx active minusl[ i] shall be in the range of 0 to 14, inclusive. For i equal to 0 or 1, when the current slice is a B slice, num_ref_idx_active_override_flag is equal to 1, and num_ref idx_active_minus1[ i ] is not present, num_ref idx_active_minus1[ i] is inferred to be equal to 0. When the current slice is a P slice, num_ref idx active_override flag is equal to 1, and num_ref idx_active_minus1[ 0 ] is not present, num_ref idx _active_minus1[ 0 ] is inferred to be equal to 0. The variable NumRefldxActive[ 1 ]is derived as follows: for(i=0;i<2; i++) { if( slice type B || (slice type P && 0)){ if( num_ref idx active override flag) NumRefldxActive[ i ] = num _ref idx active minusl[i]+ 1 (145) else { if( num ref entries[i][ Rplsldx[i]] >= num ref idx default active minusl[i]+1) NumRefldxActive[ 1] = num ref idx default active minusl[i]+ 1 else NumRefldxActive[ i ] = num _ref entries[ i ][ RplsIdx[i]] } else / * slice type || (slice type P && 1)% NumRefldxActive[i]=0 The value of NumRefIdxActive[ i] — 1 specifies the maximum reference index for reference picture list i that may be used to decode the slice. When the value of NumRefIdxActive[ i] is equal to 0, no reference index for reference picture list i may be used to decode the slice. When the current slice is a P slice, the value of NumRefIdxActive[ 0 ] shall be greater than 0. When the current slice is a B slice, both NumRefIdxActive[ 0 ] and NumRefIdxActive[ 1] shall be greater than 0. ‘Weighted prediction parameters syntax pred_weight_table( ) { luma_log2_weight_denom Co uew) if( ChromaArrayType != 0) delta_chroma_log2_weight_denom se(v) ~for(i=0:1i< NumRefldxActive[ 0 |; i++) luma_weight 10 flag[i] u(l) if( ChromaArrayType = 0) for(i=0; i < NumRefldxActive[ 0 |; i++) chroma_weight 10 flag[i |] u(l) for(i = 0; i < NumRefldxActive[ 0 ]; i++) { if( luma_weight 10 flag[i]) { delta luma_ weight 10[i] se(v) luma_offset_10[1i] se(v) if( chroma_weight 10 flag[i]) for(j=0;j<2:j++) { delta chroma weight 10[i][j] se(v) delta_chroma_offset 10[i][j] se(v) if( slice type == B){ for( i= 0; i < NumRefldxActive[ 1]; i++) luma_weight 11 _flag[i] u(l) if( ChromaArrayType != 0) for( i= 0; i < NumRefldxActive[ 1 |; i++) chroma_weight _I1_flag[i] u(l) for(i=0; i < NumRefldxActive[ 1]; i++) { if( luma weight 11 flag[i]){ delta luma weight 11[1] se(v) luma_offset 11[i] se(v) if( chroma_weight 11 flag[i]) for(j=0;j<2;j++) § delta chroma weight 11[i][j] se(v) delta_chroma_offset 11[i][j] se(v) } Weighted prediction parameters semantics luma_log2_weight_denom is the base 2 logarithm of the denominator for all luma weighting factors. The value of luma log2 weight denom shall be in the range of 0 to 7, inclusive. delta_chroma_log2_weight_denom is the difference of the base 2 logarithm of the denominator for all chroma weighting factors. When delta_chroma_log2_weight_denom is not present, it is inferred to be equal to 0. The variable ChromaLog2WeightDenom is derived to be equal to luma_log2_weight_denom + delta_chroma_log2_weight_denom and the value shall be in the range of 0 to 7, inclusive. luma_weight_10_flag[ i ] equal to 1 specifies that weighting factors for the luma component of list 0 prediction using RefPicList[ 0 ][ i] are present. luma_weight_10_flag[ i ] equal to 0 specifies that these weighting factors are not present. chroma_weight_10_flag[i] equal to 1 specifies that weighting factors for the chroma prediction values of list O prediction using RefPicList{0][i] are present. chroma_weight_10_flag][ i ] equal to O specifies that these weighting factors are not present. When chroma_weight_10_flag[ i ] is not present, it is inferred to be equal to 0. delta_luma_weight_10[ i] is the difference of the weighting factor applied to the luma prediction value for list 0 prediction using RefPicList[ 0 ][ 1]. The variable LumaWeightLO[ i] is derived to be equal to (1 << luma_log2_weight_denom ) + delta_luma_weight_10[ i]. When luma_weight_10_flag| i] is equal to 1, the value of delta_luma_weight_IO[ i ] shall be in the range of —128 to 127, inclusive. When luma_weight 10_flag[i] is equal to O, LumaWeightLO[ i ] is inferred to be equal to 2luma_log2 weight denom. luma_offset_10[ i] is the additive offset applied to the luma prediction value for list 0 prediction using RefPicList[ 0 ][ i]. The value of luma_offset_10[ i ] shall be in the range of —128 to 127, inclusive. When luma_weight_10_flag[ i] is equal to 0, luma_offset_10[i] is inferred to be equal to 0. delta_chroma_weight_10[ i ][ j] is the difference of the weighting factor applied to the chroma prediction values for list 0 prediction using RefPicList[ 0 ][ i ] with j equal to 0 for Cb and j equal to 1 for Cr. The variable ~~ ChromaWeightLO[i][j] is derived to be equal to (1 << ChromaLog2WeightDenom ) + delta_chroma_weight_10[ i ][j ]. When chroma_weight_10_flag[ i ] is equal to 1, the value of delta_chroma_weight_10[ i ][ j ] shall be in the range of —128 to 127, inclusive. When chroma_weight_10_flag[ i] is equal to O, ChromaWeightLO[ i ][ j ] is inferred to be equal to 2ChromaLog2WeightDenom. delta_chroma_offset_I0[i][ j ] is the difference of the additive offset applied to the chroma prediction values for list 0 prediction using RefPicList[ 0 ][ i ] with j equal to 0 for Cb and j equal to 1 for Cr. The variable ChromaOffsetLO[ i ][ j ] is derived as follows: ChromaOffsetLO[ i ][j ] = Clip3( —128, 127, ( 128 + delta chroma offset 10[i][j]— ( (128 * ChromaWeightLO[i][j]) >> ChromaLog2WeightDenom) )) The value of delta_chroma_offset 10[i][ j] shall be in the range of —4 * 128 to 4 * 127, inclusive. When chroma_weight_10_flag[ i] is equal to 0, ChromaOffsetL.O[ i ][ j ] is inferred to be equal to 0. luma_weight_11_flag[ i], chroma_weight 11_flag[ i], delta_luma_weight I1[i], luma_offset_l1[ i], delta_chroma_weight 11[i][j], and delta_chroma_offset 11[i][j] have the same semantics as luma_weight 10 flag[i], chroma_weight 10_flag[ i], delta_luma_weight_10[ 1], luma_offset [0[i], delta_chroma_weight 10[i][j] and delta_chroma_offset_I0[ i ][ j ], respectively, with 10, LO, list 0 and ListO replaced by 11, L1, list 1 and List], respectively. The variable sumWeightLOFlags is derived to be equal to the sum of luma_weight 10_flag[ i] +2 * chroma_weight 10_flag[ i], for i=0..NumRefldxActive[ 0] — 1. When slice_type is equal to B, the variable sumWeightL1Flags is derived to be equal to the sum of luma_weight_11_flag[i]+ 2 * chroma_weight_11_flag[ i], for 0. NumRefldxActive[ 1]— 1. It is a requirement of bitstream conformance that, when slice type is equal to P, sumWeightLOFlags shall be less than or equal to 24 and when slice_type is equal to B, the sum of sumWeightLOFlags and sumWeightL1Flags shall be less than or equal to 24. Reference picture list structure semantics The ref _pic_list_struct( listIdx, rplsIdx ) syntax structure may be present in an SPS or in a slice header. Depending on whether the syntax structure is included in a slice header or an SPS, the following applies: If present in a slice header, the ref pic list struct( listldx, rplsldx) syntax structure specifies reference picture list listldx of the current picture (the picture containing the slice). Otherwise (present in an SPS), the ref pic list struct( listldx, rplsldx ) syntax structure specifies a candidate for reference picture list listIdx, and the term "the current picture" in the semantics specified in the remainder of this clause refers to each picture that 1) has one or more slices containing ref pic list idx][ listldx ] equal to an index into the list of the ref pic list struct( listIdx, rplsldx ) syntax structures included in the SPS, and 2) is in a Coded Video Sequence (CVS) that refers to the SPS. num_ref_entries[ listldx ][ rplsldx ] specifies the number of entries in the ref _pic_list_struct( listIdx, rplsldx ) syntax structure. The value of num_ref_entries[ listldx ][ rplsIdx ] shall be in the range of 0 to MaxDecPicBuffMinus1 + 14, inclusive. Itrp_in_slice_header_flag] listIdx ][ rplsldx ] equal to O specifies that the POC LSBs of the LTRP entries in the ref _pic_list_struct( listldx, rplsldx ) syntax structure are present in the ref_pic_list_struct( listldx, rplsIdx ) syntax structure. Itrp_in_slice_header_flag[ listIdx ][ rplsIdx ] equal to 1 specifies that the POC LSBs of the Long-Term Reference Picture (LTRP) entries in the ref_pic_list_struct( listIdx, rplsIdx ) syntax structure are not present in the ref _pic_list_struct( listIdx, rplsIdx ) syntax structure. inter_layer_ref_pic_flag] listIdx ][ rplsldx ][ i ] equal to 1 specifies that the i-th entry in the ref pic_list_struct( listldx, rplsIdx ) syntax structure is an Inter-Layer Reference Picture (ILRP) entry. inter_layer_ref pic_flag[ listldx ][ rplsIdx ][ i ] equal to O specifies that the i-th entry in the ref_pic_list_struct( listldx, rplsIdx ) syntax structure is not an ILRP entry. When not present, the value of inter_layer_ref pic_flag[ listIdx ][ rplsIdx ][ i ] is inferred to be equal to 0. st_ref_pic_flag[ listldx ][ rplsldx [i] equal to 1 specifies that the i-th entry in the ref pic_list_struct(listldx, rplsldx ) ~~ syntax structure is an STRP entry. st_ref pic_flag[ listldx ][ rplsIdx ][i] equal to O specifies that the i-th entry in the ref _pic_list_struct( listldx, rplsIdx ) syntax structure is an LTRP entry. When inter_layer ref pic_flag[ listIdx ][ rplsIdx ][ i] is equal to 0 and st_ref pic_flag] listIdx J[ rplsIdx [i] is not present, the value of st_ref pic flag[ listldx ][ rplsIdx ][ i] is inferred to be equal to 1. The variable NumLtrpEntries[ listIdx ][ rplsIdx ] is derived as follows: for( i= 0, NumLtrpEntries|[ listldx ][ rplsIdx ] =0;i < num ref entries| listIdx ][ rplsIdx J; i++) if( linter layer ref pic flag[ listldx J[ rplsldx J[1] && !st_ref pic flag listldx ][ rplsI dx][i]) NumLtrpEntries[ listIdx ][ rplsIdx J++ abs_delta_poc_st[ listldx ][ rplsIdx ][1] specifies the value of the variable AbsDeltaPocSt[ listIdx ][ rplsIdx ][ i ] as follows: if( sps_weighted pred flag || sps weighted bipred flag) AbsDeltaPocSt[ listldx J[ rplsldx J[i]= abs delta poc_st[ listldx ][ rplsIdx [i] else AbsDeltaPocSt[ listIdx |[ rplsldx ][i] = abs delta poc st[ listldx J[ rplsIdx J[1] +1 The value of abs_delta_poc_st[ listIdx ][ rplsIdx ][ i] shall be in the range of 0 to 2'*—1, inclusive. strp_entry_sign_flag][ listldx ][ rplsldx ][ i] equal to 1 specifies that i-th entry in the syntax structure ref pic_list_struct( listldx, rplsldx ) has a value greater than or equal to O. strp_entry_sign_flag[ listldx ][ rplsIdx ][ i ] equal to O specifies that the i-th entry in the syntax structure ref_pic_list_struct( listIdx, rplsIdx ) has a value less than 0. When not present, the value of strp_entry_sign_flag[ listIdx ][ rplsIdx ][ i ] is inferred to be equal to 1. The list DeltaPocValSt[ listIdx ][ rplsldx ] is derived as follows: for(i=0;i<num ref entries[ listIdx ][ rplsldx ]; i++) if( linter layer ref pic flag[ listldx J[ rplsldx J[1] && st ref pic flag[ listIdx ][ rplsI dx][i]) DeltaPocValSt[ listIdx ][ rplsldx ][ i] = ( strp_entry sign flag] listIdx ][ rplsIdx ][i] )? AbsDeltaPocSt[ listIdx ][ rplsIdx ][ 1] : 0 — AbsDeltaPocSt[ listIdx ][ rplsIdx ][ i] rpls_poc_lsb_It[ listIdx ][ rplsIdx ][ i ] specifies the value of the picture order count modulo MaxPicOrderCntLsb of the picture referred to by the i-th entry in the ref pic_list_struct(listldx, rplsldx ) ~~ syntax structure. The length of the pls_poc_Isb_lt[ listIdx ][ rplsIdx ][ i] syntax element is log2 max pic order cnt Isb minus4 + 4 bits. ilrp_idx] listldx ][ rplsIdx ][ i ] specifies the index, to the list of the direct reference layers, of the ILRP of the i-th entry in the ref_pic_list_struct( listIdx, rplsldx ) syntax structure. The value of ilrp_idx[ listldx ][ rplsIdx J[i] shall be in the range of 0 to NumDirectRefLayers[ GeneralLayerIdx[ nuh layer id ]]— 1, inclusive. Thus, different mechanisms can be used to enable controlling the GEO / TPM merge modes subject to whether WP is applied to the reference pictures where reference blocks PO and P1 are taken from, namely; Moving WP parameters listed in Table 14 from SH to PH; Moving GEO / TPM parameters from PH back to SH; Changing the semantics of MaxNumTriangleMergeCand, i.e. by setting MaxNumTriangleMergeCand equal to 0 or 1 for such slices when reference pictures with WP can be used (e.g., where at least one of the flags lumaWeightedFlag or is equal to true). For TPM merge mode, exemplary reference blocks PO and P1 are denoted by 710 and 720 in Fig. 7, respectively. For GEO merge mode, exemplary reference blocks PO and P1 are denoted by 810 and 820 in Fig. 8, respectively. Thus, different mechanisms can be used to enable controlling the GEO / TPM merge modes subject to whether WP is applied to the reference pictures where reference blocks PO and P1 are taken from, namely: Moving WP parameters listed in Table 14 from SH to PH; Moving GEO / TPM parameters from PH back to SH; Changing the semantics of MaxNumTriangleMergeCand, i.e. by setting MaxNumTriangleMergeCand equal to O or 1 for such slices when reference pictures with WP can be used (e.g., where at least one of the flags lumaWeightedFlag or is equal to true). For TPM merge mode, exemplary reference blocks PO and P1 are denoted by 710 and 720 in Fig. 7, respectively. For GEO merge mode, exemplary reference blocks PO and P1 are denoted by 810 and 820 in Fig. 8, respectively. In an embodiment, when WP parameters and enabling of non-rectangular modes (e.g. GEO and TPM) are signalled in picture header, the following syntax may be used, as shown in the table below: Table Picture header RBSP syntax picture_header_rbsp( ) { non_reference picture flag u(l) gdr_pic_flag u(l) no output of prior pics flag u(l) if( gdr pic flag) recovery_poc_cnt ue(v) ph_pic_parameter_set_id ue(v) if( sps_poc_msb flag) { ph_poc_msb_present flag u(l) ~if( ph poc msb present flag) poc_msb_val u(v) pic_rpl_present flag u(l) if( pic_rpl_present flag) { for(i=0;i<2;i++)§ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == ' && rpll idx present flag))) pic_rpl_sps_flag[i] u(l) if( pic_rpl sps flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == 1 && rpll idx present flag))) pic_rpl_idx[i] uv) 1 else ref pic list _struct( i, num _ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) pic_poc_lIsb_It[i][j] uv) pic_delta_poc_msb_present flag[i][j] u(l) if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb cycle It[i][j] ue(v) if( ( pps_weighted pred flag && slice type == P) |] ( pps_weighted_bipred_flag && slice_type ld B)) pred weight _table( ) if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && HA Ss Lad iipiv Ww aUWA HE Del LY dANULEY Dad = a Alle !pps_max_num_merge_cand_minus_max_num_triangle_cand plus] && WPDisabled) pic_max_num_merge_cand_minus_max_num_triangle_cand Suey) tbsp trailing bits( ) The variable WPDisabled is set equal to 1 when all the values of luma_weight_10_flag[ i], chroma_weight_10_flag[ i], luma_weight_11_flag[ j ] and chroma_weight_11_flag[ j ] are set to zero, the value of i =0 .. NumRefldxActive[ 0 ]; and the value of j=0.. NumRefldxActive[ 1]; otherwise, the value of WPDisabled is set equal to 0. When the variable WPDisabled is set equal to 0, the value of pic_max_num_merge_cand_minus_max_num_triangle_cand is set equal to MaxNumMergeCand. In an example, signaling of WP parameters and enabling of non-rectangular modes (e.g. GEO and TPM) is performed in the slice header. Exemplary syntax is given in the table below: slice_header( ) { Descriptor slice_pic_parameter_set_id ue(v) if( rect_slice flag || NumBricksInPic > 1) slice_address uv) if( !rect slice flag && !single brick per slice flag) num_bricks_in_slice_minus1 ue(v) non_reference_picture_flag u(l) slice_type ue(v) if( separate colour plane flag==1) colour_plane_id u(2) slice_pic_order_cnt_Ish u(v) if( nal_unit type == GDR NUT) recovery_poc_cnt ue(v) if( nal unit type == IDR_W RADL || nal unit type == IDR N LP || ‘nal _unit type == CRA NUT || NalUnitType == GDR_NUT) no_output_of_prior_pics_flag u(l) if( output flag present flag ) pic_output_flag u(l) if( (nal unit type '= IDR _W RADL && nal unit type != IDR N LP) || sps_idr_rpl_present_flag ){ for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll_idx present flag))) ref _pic_list_sps_flag[i] u(l) if ref pic list _sps flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == . && rpll_idx present flag))) ref _pic_list_idx[i] uv) 1 else ref pic list_struct( i, num_ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( Itrp in slice header flag[i ][ Rplsldx[i]]) slice poc Isb I[i][j] uv) delta poc msb present flag[i][j] u(l) if delta_poc_msb present flag[i][j]) delta_poc_msb cycle It[i][j] ue(v) if( (slice_tvpe != 1 && num_ref entries[ 0 ][ Rplsldx[0]]>1) |] (slice type == B && num_ref entries[ 1 ][Rplsldx[1]]>1)){ num_ref idx active override flag u(l) if( num_ref idx active override flag) for(i=0;i<(slice type == B?2:1).i++) if( num_ref entries[ i ][ Rplsldx[i]]>1) num ref idx active minusi[i] ue(v) if( partition constraints override enabled flag) { partition_constraints_override flag if( partition_constraints_override flag) { slice_log2_diff min_qt_min_cb luma slice_max_mtt_hierarchy _depth_luma if( slice_max_mtt_hierarchy depth luma !=0) slice_log2_diff max _bt min_qt_luma slice_log2 diff max_tt_min_qt luma if( slice type==1 && qtbtt dual tree intra flag) { slice_log2_diff min_qt_min_cb_chroma slice_max_mtt_hierarchy_depth_chroma if( slice_max_mtt_ hierarchy depth chroma !=0) slice_log2 diff max_bt_min_qt chroma slice log2 diff max tt min gt chroma if (slice type = I){ if( sps_temporal mvp enabled flag && !pps temporal mvp enabled idc) slice_temporal_mvp_enabled_flag if( slice type == B && !pps_mvd 11_zero_idc) mvd_I1_zero_flag if( cabac init present flag ) cabac_init_flag if( slice temporal mvp enabled flag) { if( slice_type == B && !pps_collocated from 10_idc) collocated from 10 flag if( ( collocated from 10 flag && NumRefldxActive[0]>1) |] L Icollocated_from_10 flag && NumRefldxActive[ 1] >1¥} collocated ref idx if( ( pps_weighted. |_pred_flag && slice_type = Py Il ( pps_weighted_bipred_flag && slice_type == B)) slice_weighted_pred_flag if (slice_weighted pred flag) pred weight _table( ) if( !pps_six_minus_max_num_merge cand plus] ) six_minus_max_num_merge_cand if( sps_affine enabled flag && | pps five minus max num subblock merge cand | plusl ) five_minus_max_num_subblock merge cand if( sps_fpel mmvd_enabled flag ) slice_fpel mmvd_enabled_flag if( sps_bdof dmvr slice present flag) slice_disable_bdof dmvr flag ~if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && ~ Ipps_max_num_merge_cand_minus_max_num_triangle_cand_minusl && WPDisabled ) { max_num_merge cand _minus_max_num_triangle cand if ( sps_ibc_ enabled flag ) slice six_minus_max_num_ibc_merge cand if( sps_joint_cbcr enabled flag ) slice_joint_cber_sign_flag slice_qp_delta if( pps_slice chroma qp offsets present flag) { slice cb _qp offset slice_cr_qp_offset if( sps joint cber enabled flag) slice_joint_cher_qp_offset if( sps_sao_enabled flag) { slice_sao_luma_flag if( ChromaArrayType = 0) slice_sao_chroma_flag if( sps_alf enabled flag) { slice_alf enabled flag if( slice_alf enabled flag) { slice_num_alf aps_ids luma for(i=0;1 < slice num alf aps ids luma; i++) slice_alf aps_id_lumali] if( ChromaArrayType != 0) slice alf chroma idc if( slice alf chroma idc) slice_alf aps_id_chroma if ( !pps_dep_ quant enabled flag ) dep quant enabled flag if( !dep_quant enabled flag) sign_data_hiding_enabled flag if( deblocking_filter override enabled flag ) deblocking_filter_override_flag if( deblocking filter override flag) { slice_deblocking filter disabled flag if( Islice_deblocking_filter disabled flag) { slice beta offset div2 slice tc offset div2 if( sps_Imcs_enabled flag ) { slice_Imcs_enabled_flag u(l) if( slice _Imcs enabled flag) { slice_Imes_aps_id u2) if( ChromaArrayType |=0) slice_chroma_residual_scale flag u(l) if( sps_scaling_list_enabled flag) { slice_scaling_list_present flag u(l) if( slice scaling_list present flag ) slice_scaling list_aps_id u(3) if( entry point offsets present flag && NumEntryPoints>0) { offset len minusl ue(v) for( i= 0; i < NumEntrvPoints; i++) entry_point_offset_minusl1[i] uv) if( slice header extension present flag) { slice_header_extension_length ue(v) for(i=0;i<slice header extension length; i++) slice_header_extension_data_byte[ i] u(8) byte alignment( ) The variable WPDisabled is set equal to 1 when all the values of luma_weight_10_flag[ i], chroma_weight 10_flag[ i], luma_weight 11_flag[ j ] and chroma_weight_11_flag[ j ] are set to zero, the value of i =0 .. NumRefldxActive[ 0 ]; and the value of j=0.. NumRefldxActive[ 1]; otherwise, the value of WPDisabled is set equal to 0. When the variable WPDisabled is set equal to 0, the value of max_num_merge_cand_minus_max_num_triangle_cand is set equal to MaxNumMergeCand In the embodiment discloses above weighted prediction parameters may be signaled in either picture header or in a slice header. In an example, determination of whether a TPM or GEO is enabled is performed with consideration of the reference picture lists that a block may use for non-rectangular weighted prediction. When a merge list for a block contains elements from only one reference picture list k, a value of variable WPDisabled [k] determines whether this merge mode is enabled or not. In an example, merge list for non-rectangular inter-prediction mode is constructed in such a way that it contains only elements for which weighted prediction is not enabled. The following part of specification exemplifies this example: Inputs to this process are: a luma location ( xCb, yCb) of the top-left sample of the current luma coding block relative to the top-left luma sample of the current picture, a variable cbWidth specifying the width of the current coding block in luma samples, a variable cbHeight specifying the height of the current coding block in luma samples. Outputs of this process are as follows, with X being 0 or 1: the availability flags availableFlagAo, availableFlagA), availableFlagBo, availableFlagBi and availableFlagB; of the neighbouring coding units, the reference indices refldxLX Ag, refldxL.XA, refldxL. XB, refldxL.XB; and refldxL. XB; of the neighbouring coding units, the prediction list utilization flags predFlaglLXAo, predFlagLXA;, predFlagLXBo, predFlagl. XB; and predFlagl. XB; of the neighbouring coding units, the motion vectors in 1 / 16 fractional-sample accuracy mvLXAo, mvLXA;, mvLXBo, mvLXB; and mvLXB; of the neighbouring coding units, the half sample interpolation filter indices hpellfldxAo, hpellfldxA;, hpellfIdxBo, hpelIfIldxB1, and hpellfIdxB,, the bi-prediction weight indices bcwldxAe, bewldxA;, bewldxBo, bewldxB;, and bewldxB,. For the derivation of availableFlagB1, refldxL.XB1, predFlagLXB1, mvLXB;, hpelIfldxB; and bewldxB, the following applies: The luma location ( xXNbB;, yNbB; ) inside the neighbouring luma coding block is set equal to (xCb + cbWidth— 1, yCb—1). The derivation process for neighbouring block availability as specified in clause 6.4.4 is invoked with the current luma location ( xCurr, yCurr ) set equal to ( xCb, yCb ), the neighbouring luma location ( xNbBj, yNbB; ), checkPredModeY set equal to TRUE, and cldx set equal to O as inputs, and the output is assigned to the block availability flag availableBy. The variables availableFlagBi, refldxL.XBi, predFlagLXBi:, mvLXB,, hpellfldxB; and bewldxB; are derived as follows: If availableB, is equal to FALSE, availableFlagB; is set equal to 0, both components of mvLXB, are set equal to 0, refldxL XB; is set equal to —1 and predFlagL XB; is set equal to 0, with X being 0 or 1, hpelIfIdxB is set equal to 0, and bewIdxB; is set equal to 0. Otherwise, availableFlagB, is set equal to 1 and the following assignments are made: mvLXB, = MvLX[ xNbB; |[ ¥NbB; ] (501) refIdxL XB; = RefldxLX[ xNbB; ][ ¥NbB, ] (502) predFlagL XB; = PredFlagLX[ xNbB; ][ yNbB, | (503) hpelIfldxB; = HpelIfldx[ xNbB, ][ yNbB; ] (504) bewldxB; = Bewldx[ XNbB; ][ yNbB | (505) For the derivation of availableFlagA, refldxL XA, predFlagLXA1, mvLXAu, hpelIfldxA; and bewldxA; the following applies: The luma location ( xXNbA1, yNbA, ) inside the neighbouring luma coding block is set equal to (xCb — 1, yCb + cbHeight — 1). The derivation process for neighbouring block availability as specified in clause 6.4.4 is invoked with the current luma location ( xCurr, yCurr ) set equal to ( xCb, yCb). the neighbouring luma location ( XNbAj, yNbA; ), checkPredModeY set equal to TRUE, and cldx set equal to O as inputs, and the output is assigned to the block availability flag availableA;. The variables availableFlagA), refldxL XA, predFlagLXA;, mvLXA,, hpellfldxA; and bewldx A; are derived as follows: If one or more of the following conditions are true, availableFlagA, is set equal to 0, both components of mvLXA; are set equal to 0, refldxLXA, is set equal to —1 and predFlagL XA, is set equal to 0, with X being 0 or 1, hpelIfIdxA; is set equal to 0, and bewldxA is set equal to 0: - availableA; is equal to FALSE. - availableB; is equal to TRUE and the luma locations ( XNbAi, yNbA;) and ( xNbBj, yNbB; ) have the same motion vectors and the same reference indices. ‘WPDisabledX[ RefldxLLX[ xNbA; ][ yNbA; ] ]is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) ‘WPDisabledX[ RefldxLX[ xNbB; ][ yNbB; ] ] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) Otherwise, availableFlagA, is set equal to 1 and the following assignments are made: mvLXA; = MvLX[ xNbA, ][ YNbA; ] (506) refldxL. XA; = RefldxLX[ xNbA; ][ yNbA; | (507) predFlagLXA, = PredFlagLX[ xNbA; ][ yYNbA; ] (508) hpelIfldxA; = HpelIfldx[ xXNbA; |[ yYNbA; | (509) bewldxA; = Bewldx[ xNbA: ][ yNbA: | (510) For the derivation of availableFlagBo, refldxL.XBo, predFlagLXBo, mvLXBo, hpelIfldxBo and bewldxBo the following applies: The luma location ( xXNbBo, yNbBo ) inside the neighbouring luma coding block is set equal to ( xCb + cbWidth, yCb— 1). The derivation process for neighbouring block availability as specified in clause 6.4.4 is invoked with the current luma location ( xCurr, yCurr ) set equal to (xCb, yCb), the neighbouring luma location ( xNbBo, yNbBo ), checkPredModeY set equal to TRUE, and cldx set equal to O as inputs, and the output is assigned to the block availability flag availableBo. The variables availableFlagBo, refldxLXBo, predFlagLXBo, mvLXBo, hpellfldxBo and bewldxBg are derived as follows: If one or more of the following conditions are true, availableFlagBy is set equal to 0, both components of mvLXBy are set equal to 0, refldxLXBy is set equal to —1 and predFlaglL XBy is set equal to 0, with X being 0 or 1, hpellfIdxBo is set equal to 0, and bewldxBo is set equal to 0: - availableBy is equal to FALSE. - availableB; is equal to TRUE and the luma locations ( xXNbBi, yNbB; ) and ( xNbBo, yNbBy ) have the same motion vectors and the same reference indices. WPDisabledX[ RefldxLX[ xNbBo ][ yNbBo ] ] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) ‘WPDisabledX[ RefldxLX[ xNbB; ][ yNbB; ] ] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) Otherwise, availableFlagBo is set equal to 1 and the following assignments are made: mvLXBy = MvLX[ xNbB, ][ yNbBy | (511) refIdxL XB; = RefldXLX[ xNbBg ][ ¥NbBy | (512) predFlagLXBy = PredFlagLX[ xNbBo ][ ¥NbB; | (513) hpelIfldxBo = HpelIfldx[ xNbBy ][ vNbBq | (514) bewldxBo = Bewldx[ xXNbBo ][ yNbBy | (515) For the derivation of availableFlagAo, refldxL.XAo, predFlagLX Ao, mvLXAo, hpelIfldxAo and bewldxAo the following applies: The luma location ( XNbAo, yNbAo ) inside the neighbouring luma coding block is set equal to (xCb—1, yCb + cbWidth). The derivation process for neighbouring block availability as specified in clause 6.4.4 is invoked with the current luma location ( xCurr, yCurr ) set equal to (xCb, yCb). the neighbouring luma location ( xXNbAo, yNbAy ), checkPredModeY set equal to TRUE, and cldx set equal to O as inputs, and the output is assigned to the block availability flag availableAo. The variables availableFlagAo, refldxLXAo, predFlagLXAo, mvLXAo, hpellfldxAo and bewldxAg are derived as follows: If one or more of the following conditions are true, availableFlagAo is set equal to 0, both components of mvLXAy are set equal to 0, refl[dxLXAy is set equal to —1 and predFlagl. XA is set equal to 0, with X being 0 or 1, hpellfldxAyo is set equal to 0, and bewldxAy is set equal to 0: - availableAy is equal to FALSE. - availableA; is equal to TRUE and the luma locations ( xXNbAi, yNbA;) and ( xNbAy, yNbAg ) have the same motion vectors and the same reference indices. WPDisabledX[ RefldxLX[ xNbAg ][ yNbAo ] ] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr )) ‘WPDisabledX[ RefldxLLX[ xNbA; ][ yNbA; ] ]is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) Otherwise, availableFlagAo is set equal to 1 and the following assignments are made: mvLXAp = MvLX[ xNbA; ][ yNbAs | (516) refTdxLX Ao = RefldxLX[ xNbA ][ yNbAg | (517) predFlagL XA, = PredFlagL X[ xNbAo ][ yNbAg ] (518) hpelIfldxAq = HpelIfldx[ xXNbAg ][ ¥NbAo | (519) bewldxAo = Bewldx[ xNbAo ][ yNbA, | (520) For the derivation of availableFlagBa, refldxL. XB, predFlagLXB,, mvLXB, hpelIfldxB; and bewldxB; the following applies: The luma location ( xXNbB;, yNbB: ) inside the neighbouring luma coding block is set equal to(xCb—1,yCb—1). The derivation process for neighbouring block availability as specified in clause 6.4.4 is invoked with the current luma location ( xCurr, yCurr ) set equal to (xCb, yCb), the neighbouring luma location ( xXNbB», yNbB; ), checkPredModeY set equal to TRUE, and cldx set equal to O as inputs, and the output is assigned to the block availability flag availableB,. The variables availableFlagBa, refldxLXB,, predFlagLXBz, mvLXB,, hpellfldxB, and bewldxB; are derived as follows: If one or more of the following conditions are true, availableFlagB; is set equal to 0, both components of mvLXB; are set equal to 0, refldxLXB; is set equal to —1 and predFlagL XB; is set equal to 0, with X being 0 or 1, hpelIfIdxB; is set equal to 0, and bewldxB; is set equal to 0: - availableB; is equal to FALSE. - availableA; is equal to TRUE and the luma locations ( xNbAj, yNbA;) and ( xNbB,, yNbB; ) have the same motion vectors and the same reference indices. - availableB; is equal to TRUE and the luma locations ( xXNbBi, yNbB; ) and ( xNbB,, yNbB; ) have the same motion vectors and the same reference indices. - availableFlagA + availableFlagA; + availableFlagBo + availableFlagB; is equal to 4 WPDisabledX[ RefldxLX[ xNbB; ][ yNbB; ]] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) WPDisabledX[ RefldxLX[ xNbB; ][ yNbB; ]] is set to 0 and merge mode is non- rectangular (e.g. triangle flag is set equal to 1 for the blook in the current luma location ( xCurr, yCurr ) ) Otherwise, availableFlagB: is set equal to 1 and the following assignments are made: mvLXB, = MvLX][ xNbB; |[ yNbB; ] (521) refldxL. XB; = RefldxLX[ xNbB; ][ yNbB: ] (522) predFlagL XB, = PredFlagLX[ xNbB; ][ ¥NbB; | (523) hpelIfldxB, = HpelIfldx[ xNbB; ][ yNbB; | (524) bewldxB; = Bewldx[ xNbB; ][ yNbB; | (525) In the examples disclosed above the following variable definition is used: The variable WPDisabled0[i] is set equal to 1 when all the values of luma_weight 10_flag[ i] and chroma_weight 10 _flag[ i] are set to zero, the value of i =0 .. NumRefIdxActive[ 0] . Otherwise, the value of WPDisabledO[i] is set equal to 0. The variable WPDisabled1[i] is set equal to 1 when all the values of luma_weight_11_flag[ i] and chroma_weight_11_flag[ i] are set to zero, the value of i =0 .. NumRefldxActive[ 1] . Otherwise, the value of WPDisabled1 [1] is set equal to 0. In another example, variable SliceMaxNumTriangleMergeCand is defined at slice header in accordance with one of the following: SliceMaxNumTriangleMergeCand = (lumaWeightedFlag || chromaWeightedFlag) ? 0 : MaxNumTriangleMergeCand ; SliceMaxNumTriangleMergeCand = (lumaWeightedFlag || chromaWeightedFlag) ? 1 : MaxNumTriangleMergeCand ; SliceMaxNumTriangleMergeCand = slice weighted pred flag? 0 : MaxNumTriangleMergeCand ; or SliceMaxNumTriangleMergeCand = slice weighted pred flag? 1: MaxNumTriangleMergeCand The value of SliceMaxNumTriangleMergeCand is further used in parsing of the merge information at the block level. Exemplary syntax is given in the table below: merge_data( x0, y0, cbWidth, cbHeight, chType ) { Descriptor if ( CuPredMode[ chType J[ x0 ][¥0] == MODE IBC) { if( MaxNumIbcMergeCand > 1 ) merge_idx[ x0 ][y0 ] ae(v) Yelse { if MaxNumSubblockMergeCand >0 && cbWidth>=8 && cbHeight>=8 merge_subblock_flag[ x0 ][ v0] ae(v) if( merge _subblock flag[ x0 J[v0] == 1){ if( MaxNumSubblockMergeCand > 1) merge_subblock_idx[ x0 ][ yO] ae(v) }else { if( ( cbWidth * cbHeight ) >= 64 && ( (sps_ciip_enabled flag && cu_skip flag[x0][v0]==0 && cbWidth<128 && cbHeight<128)|| ( sps_triangle_enabled_flag && SliceMaxNumTriangleMergeCand > 1 && slice_type ==B MN) regular merge flag[ x0 [v0] ae(v) if ( regular merge flag[ x0 [v0 ]==1){ if( sps_mmvd_enabled flag ) mmvd_merge_flag[ x0][ v0] ae(v) if( mmvd_merge flag[ x0 ][y0]==1){ if( MaxNumMergeCand > 1 ) mmvd_cand_flag[ x0 ][ v0] ae(v) mmvd_distance_idx[ x0 ][v0 ] ae(v) mmvd_direction_idx[ x0 ][ v0 | ae(v) Yelse { if( MaxNumMergeCand > 1 ) merge _idx[ x0 [v0] ae(v) Yelse { if( sps_ciip enabled flag && sps_triangle enabled flag && SliceMaxNumTriangleMergeCand > | && weightedPredFlag == 0 && slice type==B && cu skip flag[x0][¥0] == 0 && ( cbWidth * cbHeight ) >= 64 && cbWidth<128 && cbHeight<128)§ ae(v) ciip_flag[ x0 [v0] if ciip_flag[ x0 [v0] && MaxNumMergeCand > 1) merge _idx[ x0 ][y0] ae(v) if( Iciip_flag[ x0 ][ vO ] && SliceMaxNumTriangleMergeCand > 1) { merge _triangle_split_dir[ x0 ][ v0 ] ae(v) merge_triangle_idx0[ x0 ][y0 | ae(v) merge triangle idx1[ x0 [v0] ae(v) Oo For the cases non-rectangular inter prediction mode is a GEO mode, the following examples are described further. Different mechanisms can be used to enable controlling the GEO / TPM merge modes, subject to whether WP is applied to the reference pictures where reference blocks PO and P1 are taken from, namely: Moving WP parameters listed in Table 14 from SH to PH; Moving GEO parameters from PH back to SH; Changing the semantics of MaxNumGeoMergeCand, e.g. by setting MaxNumGeoMergeCand equal to 0 or 1 for such slices when reference pictures with WP can be used (e.g., where at least one of the flags lumaWeightedFlag or is equal to true). For GEO merge mode, exemplary reference blocks PO and P1 are denoted by 810 and 820 in Fig. 8, respectively. In an example, when WP parameters and enabling of non-rectangular modes (e.g. GEO and TPM) are signalled in picture header, the following syntax may be used, as shown in the table below: Table - Picture header RBSP syntax picture_header_rbsp( ) { non_reference picture flag : u(l) gdr_pic_flag u(l) no_output_of prior_pics_flag u(l) if( gdr pic flag) recovery_poc_cnt ue(v) ph_pic_parameter_set_id ue(v) if( sps_poc_msb flag) { ph_poc_msb_present flag u(l) if( ph_poc_msb present flag ) poc_msb_val uv) pic_rpl_present_flag u(l) if( pic_rpl_present flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == ' && rpll idx present flag))) pic_rpl_sps_flag[i] u(l) if( pic_rpl_sps_flag[i]) { ~if( num_ref pic lists in sps[i]>1 && (i == 0 ||] (i == 1 && rpll idx present flag))) pic_rpl_idx[i] uv) } else ref pic list struct(i, num ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) pic_poc_lIsb_It[i][j] uv) pic_delta_poc_msb_present flag[i][j] u(l) if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb cycle It[i][j] ue(v) if( ( pps_weighted pred flag && slice type == P) |] ( pps_weighted_bipred_flag && slice_type =n B)) pred weight _table( ) if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && HA atm LAI EW af AR LA ALN LILLY A Dw GIL = Cl Ale: {pps_max_num_merge_cand_minus_max_num_triangle_cand_plus1 && WPDisabled) pic_max_num_merge_cand_minus_max_num_triangle_cand Cue) tbsp trailing bits( ) The variable WPDisabled is set equal to 1 when all the values of luma_weight_l10_flag[ i ], chroma_weight_10_flag[ i ], luma_weight_11_flag[ j ] and chroma_weight 11_flag[ j ] are set to zero, the value of i =0 .. NumRefIdxActive[ 0 J; and the value of j=0.. NumRefldxActive[ 1]; otherwise, the value of WPDisabled is set equal to 0. When the variable WPDisabled is set equal to 0, the value of pic_max_num_merge_cand_minus_max_num_geo_cand is set equal to MaxNumMergeCand. In another example, pic_max_num_merge_cand_minus_max_num_geo_cand is set equal to MaxNumMergeCand — 1. In an example, signaling of WP parameters and enabling of non-rectangular modes (e.g. GEO and TPM) is performed in the slice header. Exemplary syntax is given in the table below: slice_header( ) { slice_pic_order_cnt_Isb : uv) if( subpics_present_flag ) slice_subpic_id uv) if( rect_slice flag || NumTilesInPic>1) slice address uv) if( lrect_slice flag && NumTilesInPic>1) num tiles in slice minus1 ue(v) slice_type ue(v) if( Ipic_rpl_present flag &&( (nal_unit_type != IDR_W_RADL && nal unit type I= IDR N LP) || sps_ idr rpl present flag) ){ for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) slice_rpl_sps_flag[i] if( slice mpl sps flag[i]) { ~if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == . && rpll_idx present flag))) slice_rpl_idx[i] 1 else ref pic list _struct( i, num _ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) slice poc Isb I[i][j] slice_delta_poc_msb_present flag[i][]] if( slice_delta_poc_msb_ present flag[i][j]) slice_delta_poc_msb_cycle It[i][j] if( pic_rpl_present_flag || ((nal_unit type != IDR_W_RADL && nal_unit type I= IDR N LP) || sps_ idr rpl present flag)) { if( (slice_tvpe != I && num_ref entries[ 0 ][ Rplsldx[0]]>1) |] (slice type == B && num_ref entries[ 1 ][Rplsldx[1]]>1)){ num_ref idx_active override flag if num_ref idx active override flag) for(i=0;i<(slice type == B?2:1) i++) if( num_ref entries[ i J[ RplsIdx[i]]>1) num_ref idx active minusl[i] if( slice type = I){ if( cabac_init_present flag ) cabac init flag if( pic_temporal mvp enabled flag) { if( slice type == B && !pps_collocated from _10_idc) collocated from 10 flag if( ( collocated from 10 flag && NumRefldxActive[0]>1) |] { Icollocated_from_10 flag && NumRefldxActive[ 1] »1y} collocated ref idx if (slice_weighted pred flag) pred weight _table( ) if( !pps_six_minus max num merge cand plusl ) six_minus_max_num_merge cand if( sps_affine enabled flag && | pps five minus max num subblock merge cand | plusl ) five_minus_max_num_subblock merge cand if( sps_fpel mmvd_ enabled flag ) slice_fpel mmvd_enabled_flag if( sps_bdof dmvr slice present flag ) slice_disable_bdof dmvr flag if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && . Ipps_max_num_merge_cand_minus_max_num_triangle_cand_minusl && WPDisabled ) { max_num_merge_cand_minus_max_num_geo_cand slice_qp_delta if( pps slice chroma gp offsets present flag) { slice_cb_qp_offset slice_cr_qp_offset if( sps_joint_cbcr enabled _flag ) slice_joint_cher_qp_offset if( pps_cu_chroma_qp_offset_list enabled flag) cu_chroma_qp_offset_enabled_flag if( sps_sao_enabled flag && !pic_sao enabled present flag) { slice_sao_luma_flag if( ChromaAmayType |= 0) slice_sao_chroma_flag if( sps_alf enabled flag && !pic_alf enabled present flag) { slice alf enabled flag if( slice_alf enabled flag) { slice_num_alf aps_ids luma for(i=0;i<slice num alf aps ids luma; i++) slice_alf aps_id_luma[i] if( ChromaArrayType !'= 0) slice alf chroma idc if( slice alf chroma idc) slice_alf aps_id_chroma if( deblocking_filter override enabled flag && Ipic_deblocking_filter override present flag ) slice_deblocking_filter override flag if( slice_deblocking filter override flag) { slice_deblocking_filter disabled flag if( Islice_deblocking_filter disabled flag) { slice beta offset div2 slice tc offset div2 se(v) if( entry point offsets present flag && NumEntryPoints>0) { offset len minusl ue(v) for(i = 0; i < NumEntryPoints; i++ ) entry_point_offset_minusl1[i] uv) if( slice header extension present flag ) { slice_header_extension_length ue(v) for(i=0;i<slice header extension length; i++) slice_header_extension_data_byte[ i] u(8) byte_alignment( ) aS fe variable WPDisabled is set equal to 1 when all the values of luma_weight_10_flag[ i], chroma_weight_10_flag[ i ], luma_weight_11_flag[ j ] and chroma_weight_11_flag[ j ] are set to zero, the value of i =0 .. NumRefldxActive[ 0 ]; and the value of j=0.. NumRefldxActive[ 1]; otherwise, the value of WPDisabled is set equal to 0. When the variable WPDisabled is set equal to 0, the value of max_num_merge_cand_minus_max_num_geo_cand is set equal to MaxNumMergeCand. In another embodiment, when the variable WPDisabled is set equal to 0, the value of max_num_merge_cand_minus_max_num_geo_cand is set equal to MaxNumMergeCand — 1. In the above examples, weighted prediction parameters may be signaled in either picture header or in a slice header. In another embodiments, variable SliceMaxNumGeoMergeCand is defined at slice header in accordance with one of the following: SliceMaxNumGeoMergeCand = (lumaWeightedFlag || chromaWeightedFlag) ? 0 : MaxNumGeoMergeCand ; SliceMaxNumGeoMergeCand = (lumaWeightedFlag || chromaWeightedFlag) ? 1 : MaxNumGeoMergeCand ; SliceMaxNumGeoMergeCand = slice weighted pred flag ? 0 : MaxNumGeoMergeCand or SliceMaxNumGeoMergeCand = slice_weighted_pred_flag ? 1 : MaxNumGeoMergeCand Different embodiments use different cases listed above. The value of variable SliceMaxNumGeoMergeCand is further used in parsing of the merge information at the block level. Exemplary syntax is given in the table below: 7.3.9.7 Merge data syntax merge_data( x0, y0, cbWidth, cbHeight, chType ) { Descriptor if( CuPredMode[ chType ][ x0 ][¥0] == MODE_IBC){ if( MaxNumIbcMergeCand > 1 ) merge_idx[ x0 ][y0] ae(v) Yelse { if( MaxNumSubblockMergeCand >0 && cbWidth >= 8 && cbHeight 8) merge _subblock_flag[ x0 ][y0] ae(v) if( merge subblock flag[ x0 J[v0] == 1){ if( MaxNumSubblockMergeCand > 1) merge_subblock_idx[ x0 ][ v0] ae(v) Yelse { if( (sps ciip enabled flag && cu_skip_flag[x0][y0] == 0 && (cbWidth* cbHeight) >= 64 [ cowiain< 128 && cbHeight <128) || ll. NR WSEAS MOD) Ll i es sna wn a wg (sps_geo_enabled flag && SliceMaxNumGeoMergeCand > 1 && cbWidth>=8 && cbHeight >=8 && slice type == B)) regular merge flag[ x0 [v0] ae(v) if( regular merge flag[ x0 ][y0] == 1){ if( sps_mmvd_enabled flag ) mmvd_merge_flag[ x0][ v0] ae(v) iff mmvd merge flag[ x0][v0] == 1){ if( MaxNumMergeCand > 1 ) mmvd_cand_flag[ x0 ][ v0] ae(v) mmvd_distance_idx[ x0 ][v0 ] ae(v) mmvd_direction_idx[ x0 ][ v0 | ae(v) 1 else if( MaxNumMergeCand > 1 ) merge _idx[ x0 ][y0] ae(v) Yelse { if( sps_ciip enabled flag && sps geo enabled flag && SliceMaxNumGeoMergeCand > 1 && slice_type == B && cu_skip flag[x0][y0] == 0 && cbWidth >= 8 && cbHeight >= 8 && cbWidth<128 && cbHeight ae(v) ciip_flag[ x0 ][ v0] if ciip_flag[ x0 [v0] && MaxNumMergeCand > 1) ae(v) merge _idx[ x0 ][ v0] if Iciip_flag[ x0 ][v0] && SliceMaxNumGeoMergeCand> 1) §{ merge_geo_partition_idx[ x0 [v0] ae(v) merge_geo_idx0[ x0 ][ v0] ae(v) if( SliceMaxNumGeoMergeCand > 2) merge_geo_idx1[ x0 ][ v0] ae(v) 0 Related picture header semantics is as follows: pic_max_num_merge_cand_minus_max_num_geo_cand specifies the maximum number of geo merge mode candidates supported in the slices associated with the pictur header subtracted from MaxNumMergeCand. When pic_max num _merge cand _minus_max num geo_cand is not present, and sps_geo_enabled_flag is equal to 1 and MaxNumMergeCand greater than or equal to 2, pic_max_num_merge_cand_minus_max_num_geo_cand is inferred to be equal to pps_max num merge cand minus max num geo cand plusl — 1. The maximum number of geo merge mode candidates, MaxNumGeoMergeCand is derived as follows: MaxNumGeoMergeCand = MaxNumMergeCand — pic max num merge cand minus max num geo cand When pic_max num_merge cand _minus_max_num_geo_cand is present, the value of MaxNumGeoMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive. When pic_max num _merge cand _minus_max num geo_cand is not present, and (sps_geo_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumGeoMergeCand is set equal to 0. When MaxNumGeoMergeCand is equal to 0, geo merge mode is not allowed for the slices associated with the PH. In the following examples, several signaling-related aspects are considered. Namely, these aspects are as follows: syntax elements related to number of candidates for merge mode () are signaled in the sequence parameter set (SPS), that makes it possible for particular implementations to derive number of non-rectangular mode merge candidates (MaxNumGeoMergeCand) at the SPS level; PH could be signaled in SH, when a picture comprises just one slice; Define a PH / SH parameter override mechanism with the following as follow: The PPS flags that specify whether a syntax element of a related coding tool is present in either PH or SH (but not both). Particularly, reference picture list and weighted prediction table could use this mechanism the prediction weight table a fifth type of data that can be signaled either in the PH or SH (like ALF, deblocking, RPL, and SAO); when weighted prediction is enabled for a picture, all slices of the picture would be required to have the same reference picture lists; inter- and intra-related syntax elements are conditionally signaled if only certain slice types are used in the picture associated with the PH. In particular, two flags, pic_inter_slice_present_flag and pic_intra_slice_present_flag are introduced. In an example, syntax elements related to number of candidates for merge mode () are signaled in the sequence parameter set (SPS), that makes it possible for particular implementations to derive number of non-rectangular mode merge candidates (MaxNumGeoMergeCand) at the SPS level. This aspect could be implemented by an encoding or decoding process based on the following syntax. 7323 Ser parameter set RBSP syntax seq_parameter_set_rbsp( ) { sps_decoding_parameter set _id : u(4) sps_video_ parameter _set_id u(4) sps_max_sublayers_minus1 u(3) sps_reserved_zero_dbits u4) sps_ptl_dpb_hrd_params_present flag u(l) if( sps ptl dpb hrd params present flag) profile tier level( 1, sps_max_sublayers minusl ) gdr_enabled flag u(l) sps_seq_parameter_set_id u(4) sps_sbt_enabled flag u(l) sps_affine_enabled_flag u(l) if( sps_affine enabled flag) { sps_affine type flag u(l) sps_affine_amvr enabled flag u(l)y sps_affine_prof enabled flag u(l)y if( sps_affine prof enabled flag) sps_prof_pic_present_flag u(l)y if( chroma format idc == 3){ sps_palette_enabled_flag u(l)y sps_act_enabled_flag u(l)y sps_bcw_enabled_flag u(l) sps_ibc enabled flag u(l) sps_ciip_enabled flag u(l) if( sps_mmvd_enabled flag) sps_fpel_mmvd_enabled_flag u(l) sps_geo_enabled_flag u(l) sps_six_minus_max_num_merge cand_plus1 ue(v) if (sps_geo_enabled_flag) sps_max_num_merge_cand_minus_max_num_geo_cand_plusl ue(v) sps_Imes_enabled_flag u(l) sps_Ifnst enabled flag u(l) sps_ladf enabled flag u(l) Syntax described above have the following semantics. sps_six_minus_max_num_merge_cand_plusl equal to 0 specifies that pic_six_minus_max_num_merge_cand is present in PHs referring to the PPS. sps_six_minus_max_num_merge_cand_plus] greater than 0 specifies that pic_six_minus_max_num_merge_cand is not present in PHs referring to the PPS. The value of sps_six_minus_max_num_merge_cand_plus1 shall be in the range of 0 to 6, inclusive. sps_max_num_merge_cand_minus_max_num_geo_cand_plusl equal to 0 specifies that pic_max_num_merge_cand_minus_max_num_geo_cand is present in PHs of slices referring to the PPS. sps_max_num_merge cand_minus_max_num_geo_cand_plusl greater than 0 specifies that pic_max_num_merge_cand_minus_max_num_geo_cand is not present in PHs referring to the PPS. The value of sps_max_num_merge_cand_minus_max_num_geo_cand_plus] shall be in the range of 0 to MaxNumMergeCand — 1. Semantics of the corresponding elements of the PH is as follows: pic_six_minus_max_num_merge_cand specifies the maximum number of merging motion vector prediction (MVP) candidates supported in the slices associated with the PH subtracted from 6. The maximum number of merging MVP candidates, MaxNumMergeCand is derived as follows: MaxNumMergeCand = 6 — pic_six_minus max _num_merge cand The value of MaxNumMergeCand shall be in the range of 1 to 6, inclusive. When not present, the value of pic_six_minus_max_num_merge cand is inferred to be equal to sps_six_minus_max_num merge cand plusl — 1. pic_max_num_merge_cand_minus_max_num_geo_cand specifies the maximum number of geo merge mode candidates supported in the slices associated with the pictur header subtracted from MaxNumMergeCand. When sps_max_num_merge_cand_minus_max_num_geo_cand is not present, and sps_geo_enabled_flag is equal to 1 and MaxNumMergeCand greater than or equal to 2, pic_max_num_merge_cand_minus_max_num_geo_cand is inferred to be equal to sps_max_num_ merge cand minus max num geo cand plusl — 1. The maximum number of geo merge mode candidates, MaxNumGeoMergeCand is derived as follows: MaxNumGeoMergeCand = MaxNumMergeCand — pic max num merge cand minus max_num_geo cand When pic_max_num_merge_cand_minus_max_num_geo_cand is present, the value of MaxNumGeoMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive. When pic_max_num_merge _cand_minus_max_num_geo_cand is not present, and (sps_geo_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumGeoMergeCand is set equal to 0. When MaxNumGeoMergeCand is equal to 0, geo merge mode is not allowed for the slices associated with the PH. Alternatively, max_num_merge_cand_minus_max_num_geo_cand specifies the maximum number of GEO merge mode candidates supported in the SPS subtracted from MaxNumMergeCand. When sps_geo_enabled_flag is equal to 1 and MaxNumMergeCand is greater than or equal to 3, the maximum number of GEO merge mode candidates, MaxNumGeoMergeCand is derived as follows: MaxNumGeoMergeCand = MaxNumMergeCand — max_num_merge cand minus max _num_geo cand If the value of sps_geo_enabled_flag is equal to 1, the value of MaxNumGeoMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive. Otherwise when sps_geo_enabled_flag is equal to 1 and MaxNumMergeCand is equal to 2, MaxNumGeoMergeCand is set equal to 2. Otherwise, MaxNumGeoMergeCand is set equal to 0. Alternative syntax and semantics for this example are as follows: sps_geo_enabled_flag u(l) sps_six_minus_max_num_merge_cand ue(v) if (sps_geo_enabled_flag) sps_max_num_merge cand_minus_max_num_geo_cand ue(v) sps_six_minus_max_num_merge_cand specifies the maximum number of merging motion vector prediction (MVP) candidates supported in the slices associated with the PH subtracted from 6. The maximum number of merging MVP candidates, MaxNumMergeCand is derived as follows: MaxNumMergeCand = 6 — sps_six_minus_max_num_merge_cand The value of MaxNumMergeCand shall be in the range of 1 to 6, inclusive. sps_max_num_merge_cand_minus_max_num_geo_cand specifies the maximum number of geo merge mode candidates supported in the slices associated with the pictur header subtracted from MaxNumMergeCand. The maximum number of geo merge mode candidates, MaxNumGeoMergeCand is derived as follows: MaxNumGeoMergeCand = MaxNumMergeCand — sps_max_num_ merge cand minus max num geo cand When sps_max_num_merge_cand_minus_max_num_geo_cand is present, the value of MaxNumGeoMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive. When sps_max_num_merge_cand_minus_max_num_geo_cand is not present, and (sps_geo_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumGeoMergeCand is set equal to 0. ‘When MaxNumGeoMergeCand is equal to 0, geo merge mode is not allowed. For the examples described above and for both alternative syntax definitions, a check is performed on whether weighted prediction is enabled. This check affects derivation of MaxNumGeoMergeCand variable, and the value of MaxNumGeoMergeCand is set to zero in one of the following cases: when for the value of i 0 .. NumRefldxActive[0] and the value of i=0. NumRefldxActive[ 1 ] all the values of luma_weight 10 flag[i], chroma_weight 10 flag[ i], luma weight 11 _flag[ j ] and chroma weight 11 _flag[j | are either set to zero or not present; when a flag in SPS or PPS indicates the presence of bi-directional weighted prediction (pps_weighted_bipred_ flag); when the presence of bi-directional weighted prediction is indicated in either a picture header (PH) or a slice header (SH). An SPS-level flag indicating the presence of weighted prediction parameters could be signalled as follows: sps_bcw_enabled_flag u(l) sps_ibc_enabled flag u(l)y sps_ciip_enabled flag u(l) if( sps_mmvd_enabled flag) sps_fpel_mmvd_enabled_flag u(l) sps_wp_enabled flag if (!sps_wp_enabled_flag) sps_geo_enabled_flag u(l)y sps_six_minus_max_num_merge cand_plus1 ue(v) if (sps_geo_enabled_flag) sps_max_num_merge cand_minus_max_num_geo_cand_plusl ue(v) sps_Imes_enabled_flag u(l) sps_Ifnst enabled flag u(l) sps_ladf enabled flag u(l) Syntax element “sps_wp_enabled_flag” determines whether weighted prediction could be enabled on a lower level (PPS, PH or SH). Exemplary implementation is given below: if( pps_cu_chroma_qp offset list enabled flag) { chroma_qp_offset_list_len_minus1 ue(v) for(i=0;i<=chroma qp offset list len minusl; i++) { cb_qp_offset_list[ i] se(v) cr_qp_offset_list[i] se(v) if( pps_joint_cber_qp offset present flag ) joint_cber_qp_offset_list[i] se(v) if (sps_wp_enabled_flag) { pps_weighted_pred_flag u(l) pps_weighted_bipred flag u(l) In the above table, pps_weighted_pred_flag and pps_weighted_bipred_flag are flags in the bitstream indicating whether weighted prediction is enabled for uni- and bi-predicted blocks. In an example, where weighted prediction flags are specified in a picture header, e.g. as pic_weighted_pred_flag and pic_weighted_bipred_flag, the following dependency on sps_wp_enabled flag may be specified in bitstream syntax: if (sps_wp_enabled_flag) { pic_weighted_pred_flag pic_weighted_bipred flag In an example, where weighted prediction flags are specified in a slice header, e.g. as weighted_pred_flag and weighted_bipred_flag, the following dependency on sps_wp_enabled flag may be specified in bitstream syntax: if (sps_wp_enabled_flag) { weighted pred _flag weighted _bipred_flag In an example, reference picture lists may be indicated either in PPS or in either PH or SH (but not both). In some examples, signaling of a reference picture list is dependent from the syntax elements that indicate presence of weighted prediction (e.g. pps_weighted pred flag and pps_weighted_bipred_flag). Hence, depending on whether reference picture list is indicated in PPS, PH or SH, weighted prediction parameters are signaled before reference picture list correspondingly in PPS, PH or SH. The following syntax could be specified for this embodiment: Descriptor Picture parameter set syntax pic_parameter_set_rbsp( ) { rpl_present_in_ph flag u(l) sao present in ph flag u(l) alf_present_in_ph_flag u(l) pps weighted pred flag u(l) pps_weighted_bipred flag u(l) if( pps_weighted pred flag | pps weighted bipred flag | rpl present in ph flag) weighted_pred_table_present_in_ph flag u(l) deblocking_filter_control_present_flag u(l) if( deblocking filter control present flag) { deblocking filter override enabled flag u(l) if( deblocking_filter override enabled flag) deblocking_filter_override_present_in_ph_flag u(l) pps_deblocking_filter disabled flag u(l) if( !pps_deblocking filter disabled flag) { pps_beta_offset_div2 se(v) pps_tc_offset_div2 se(v) constant slice header params enabled flag u(l) rpl_present_in_ph_flag equal to 1 specifies the reference picture list signalling is not present in the slice headers referring to the PPS but may be present in the PHs referring to the PPS. rpl_present_in_ph_flag equal to 0 specifies the reference picture list signalling is not present in the PH referring to the PPS but may be present in the slice headers referring to the PPS. sao_present_in_ph_flag equal to 1 specifies the syntax elements for enabling SAO use is not present in the slice headers referring to the PPS but may be present in the PHs referring to the PPS. sao_present_in_ph_flag equal to 0 specifies the syntax elements for enabling SAO use is not present in the PHs referring to the PPS but may be present in the slice headers referring to the PPS. alf_present_in_ph_flag equal to 1 specifies the syntax elements for enabling ALF use is not present in the slice headers referring to the PPS but may be present in the PHs referring to the PPS. alf _present_in_ph_flag equal to 0 specifies the syntax elements for enabling ALF use is not present in the PHs referring to the PPS but may be present in the slice headers referring to the PPS. weighted_pred_table_present_in_ph_flag equal to 1 specifies that weighted prediction table is not present in the slice headers referring to the PPS but may be present in the PHs referring to the PPS. weighted_pred_table_present_in_ph_ flag equal to O specifies that weighted prediction table is not present in the PHs referring to the PPS but may be present in the slice headers referring to the PPS. When not present, the value of weighted pred table present in ph flag is inferred to be equal to 0. deblocking_filter_override_enabled_flag equal to 1 specifies that deblocking filter override may be present in PHs or in slice headers referring to the PPS. deblocking_filter_override_enabled_flag equal to O specifies that that deblocking filter override is not present in PHs nor in slice headers referring to the PPS. When not present, the value of deblocking_filter_override_enabled_flag is inferred to be equal to 0. deblocking_filter_override_present_in_ph_flag equal to 1 specifies that deblocking filter override is not present in the slice headers referring to the PPS but may be present in the PHs referring to the PPS. deblocking_ filter override present_in_ph_flag equal to 0 specifies that deblocking filter override is not present in the PHs referring to the PPS but may be present in slice headers referring to the PPS. picture_header_rbsp( ) { Descriptor if( ( pps_weighted pred flag || pps weighted bipred flag) && “weighted_pred_table present_in_ph flag) pred_weight table( ) if( mpl present in ph flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) pic_rpl_sps_flag[i] u(l) if( pic_rpl_sps_flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == ! && rpll idx present flag))) pic_rpl_idx[i] uv) 1 else ref pic list_struct( i, num_ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if(Itrp in slice header flag[i ][ Rplsldx[i]]) pic_poc_Isb_It[i][j] uv) pic_delta_poc_msb_present flag[i][j] u(l) if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb_cyele It[i][j] ue(v) if( sps_sao enabled flag && sao present in ph flag) { pic_sao_luma_enabled_flag u(l) if(ChromaArrayType |= 0) pic_sao_chroma_enabled_flag u(l) — if( sps_alf enabled flag && alf present in ph flag) { pic_alf_enabled_flag u(l) if( pic_alf enabled flag) { pic_num_alf aps ids _luma ud) for(i=0;i<pic_num alf aps ids luma; i++) pic_alf aps id luma[i] ud) if( ChromaAmayType != 0) pic_alf chroma_idc u2) if( pic_alf chroma _idc ) pic_alf_aps_id_chroma ud) if¢ deblocking filter override enabled flag && deblocking_filter override present in _ph flag) pic_deblocking_filter_override_flag u(l) if( pic_deblocking_filter override flag) { pic_deblocking_filter_disabled_flag u(l) if( !pic_deblocking_filter disabled flag) { pic_beta_offset_div2 se(v) pic_tc_offset_div2 se(v) slice_header( ) { Descriptor if( !rpl_present_in_ph_flag &&( (nal_unit_type != IDR_W_RADL && | mal_unit_type I= IDR N LP) || sps_ idr rpl present flag)) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) slice_rpl_sps_flag[ i] u(l) if( slice_rpl_sps flag[i]) { ~if( num_ref pic lists in sps[i]>1 && slice_rpl_idx[ i] 1 else ref pic list_struct( i, num_ref pic lists in sps[i]) for( j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i] ]: j++) { if( Itrp_in_slice header flag[i ][ Rplsldx[i]]) slice _poc_Isb It[i][j] slice_delta_poc_msb_present flag[i][]] if slice_delta \_ poc_msb_ present flag[i][j]) slice_delta_poc_msb_cycle It[i][j] if( rpl_present_in_ph flag || ((nal unit type != IDR _W_RADL && nal_unit_type |= IDR N LP) || sps_ idr pl present flag)) { if( (slice_tvpe != 1 && num_ref entries[ 0 ][ Rplsldx[0]]>1) |] (slice type == B && num_ref entries[ 1 ][Rplsldx[1]]>1)){ num_ref idx_active override flag if( num_ref idx active override flag) for(i=0;i<(slice type == B?2:1).i++) if( num_ref entries[i][ Rplsldx[i]]>1) num_ref idx active minusi[i] if( slice type != 1){ if( ( ( pps_weighted_pred_flag && slice_type P) || ( pps_weighted_bipred flag && slice_type B)) && lweighted, | pred_table . present_in, \_ph_flag ) pred_weight table() if( sps_sao enabled flag && !sao present in ph flag) { slice sao luma flag if( ChromaArrayType = 0) slice sao chroma flag if( sps_alf enabled flag && lalf present in ph flag) { slice_alf enabled flag if( slice_alf enabled flag) { slice_num_alf aps_ids_luma u3) for(i=0;i<slice num_alf aps ids luma; i++) slice_alf_aps_id_luma[ i] u3) if ChromaAmayType != 0) slice_alf_chroma_idc u2) if( slice alf chroma idc) slice_alf_aps_id_chroma u3) if( deblocking_filter override enabled flag && Ideblocking filter override present _in_ph flag) slice_deblocking_filter_override_flag u(l) if( slice_deblocking filter override flag) { slice_deblocking_filter_disabled_flag u(l) if( !slice_deblocking filter disabled flag) { slice_beta_offset_div2 se(v) slice_tc_offset_div2 se(v) Oo Descriptor An alternative syntax for picture header is as follows: picture_header_rbsp( ) { if( mpl_present_in_ph flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) pic_rpl_sps_flag[i] u(l) if( pic_rpl sps flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 I (i ==! && rpll_idx_ present flag ))) pic_rpl_idx[i] uv) 1 else ref pic list struct(i, num ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) pic_poc_Isb_It[i][j] uv) pic_delta_poc_msb_present flag[i][j] u(l) if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb_cyele It[i][j] ue(v) if( ( pps_weighted_pred flag || pps weighted bipred flag) && “weighted pred_table present in ph flag) pred weight table( ) if( sps_sao_enabled flag && sao present in ph flag) { pic_sao_luma_enabled flag u(l) if(ChromaArrayType != 0) pic_sao_chroma_enabled flag u(l) -— if( sps_alf enabled flag && alf present in ph flag) { pic_alf enabled flag u(l) if( pic_alf enabled flag) { pic_num_alf aps _ids_luma ud) for(i=0;i<pic num alf aps ids luma; i++) pic_alf aps id luma[i] ud) if ChromaAmayType != 0) pic_alf chroma_idc u2) if( pic_alf chroma idc ) pic_alf aps id chroma ud) if¢ deblocking filter override enabled flag && deblocking_ filter override . present_in \ ph flag) pic_deblocking_filter_ override flag u(l) if( pic_deblocking_filter override flag) { pic_deblocking filter disabled flag u(l) if( !pic_deblocking filter disabled flag) { pic_beta_offset_div2 se(v) pic_tc_offset_div2 se(v) 0— In another example, signaling of picture header and slice header elements could be combined in a single process. This example introduces a flag (“picture_header_in_slice_header_flag™) that indicates whether a picture and slice headers are combined. Syntax for a bitstream according to this example is as follows: Picture header RBSP syntax picture_header_rbsp( ) { picture_header structure( ) Picture header structure syntax picture_header_structure( ) { non_reference picture flag : u(l) gdr_pic_flag u(l) no_output_of prior_pics_flag u(l) if( gdr pic flag) recovery_poc_cnt ue(v) ph_pic_parameter_set_id ue(v) General slice header syntax slice_header( ) { picture_header_in_slice_header flag : u(l) if(picture_header in slice header flag) picture_header structure( ) if( subpics_present_flag ) slice_subpic_id uv) if( rect_slice flag || NumTilesInPic>1) slice address uv) if( lrect_slice flag && NumTilesInPic>1) num tiles in slice minus1 ue(v) slice_type ue(v) | if( !pic_rpl_present flag &&( (nal_unit_type != IDR_W_RADL && nal unit type I= IDR N LP) || sps idr rpl present flag) ){ for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == ! && rpll idx present flag))) slice_rpl_sps_flag[ i] u(l) = Semantics for the picture_header_in_slice_header_flag and related bitstream constraints is as follows: picture_header_in_slice_header_flag equal to 1 specifies that the picture header syntax structure is present in the slice header. picture_header_in_slice_header_flag equal to 0 specifies that the picture header syntax structure is not present in the slice header. It is a requirement of bitstream conformance that the value of picture header in slice header flag is the same in all slices of a CLVS. When picture_header_in_slice_header_flag is equal to 1, it is a requirement of bitstream conformance that no NAL unit with NAL unit type equal to PH_NUT is present in the CLVS. When picture_header_in_slice_header_flag is equal to 0, it is a requirement of bitstream conformance that a NAL unit with NAL unit type equal to PH_NUT is present in the PU, preceding the first VCL NAL unit of the PU. A combination of aspects of these examples is as follows. When picture_header_in_slice_header_flag is equal to 0, the flags that specify whether a syntax element of a related coding tool is present in either PH or SH (but not both); Otherwise (when picture_header_in_slice_header_flag is equal to 1), these flags are inferred to 0 indicating tool parameter signaling on slice level. An alternative combination is as follows: When picture_header_in_slice_header_flag is equal to 0, the flags that specify whether a syntax element of a related coding tool is present in either PH or SH (but not both); Otherwise (when picture_header_in_slice_header_flag is equal to 1), these flags are inferred to 0 indicating tool parameter signaling on the picture header level. This combination has the following syntax: Descriptor Picture parameter set syntax pic_parameter_set_rbsp( ) { picture_header_in_slice_header_flag u(l) if (picture _header in_slice header flag) rpl_present_in_ph_flag u(l) sao_present_in_ph_flag u(l) alf present in ph flag u(l) pps weighted pred flag u(l) pps_weighted_bipred flag u(l) if( pps_weighted pred flag | pps weighted bipred flag | rpl present in ph flag) weighted_pred_table_present_in_ph flag u(l) deblocking_filter_control_present_flag u(l) if( deblocking filter control present flag) { deblocking filter override enabled flag u(l) if( deblocking_filter override enabled flag) deblocking_filter_ override present_in_ph_flag u(l) pps_deblocking_filter disabled flag u(l) if( !pps_deblocking_filter disabled flag ) { pps_beta_offset_div2 se(v) pps_tc_offset_div2 se(v) constant slice header params enabled flag u(l) o_ In this example, the check of whether a weighted prediction is enabled is performed by indicating the number of entries in a reference picture list that are referenced with weighted prediction. Syntax and semantics in this example is defined as follows: pred_weight_table( ) { Descriptor luma_log2_weight_denom Co uew) if( ChromaArrayType !'= 0) delta_chroma_log2_weight_denom se(v) num_l0_ weighted _ref pics ue(v) for(i=0;i<num_ 10 weighted ref pics; i++) luma_weight 10 flag[i] u(l) if( ChromaArrayType !'= 0) for(i=0;i<NumRefldxActive[ 0 |; i++) chroma_weight 10 flag[i] u(l) for(i=0;1<NumRefldxActive[ 0 |; i++) { ~ if( luma_weight 10 flag[i]){ delta_luma_weight 10[i] se(v) luma_offset _10[i] se(v) if( chroma weight 10 flag[i]) for(j=0;j<2;j++){ delta_chroma_weight 10[i][j] se(v) delta_chroma_offset 10[i][j] se(v) num_l1_weighted_ref pics ue(v) for(i=0;i<num_11 weighted ref pics; i++) luma_weight 11 _flag[i] u(l) if( ChromaArrayType !'= 0) for( i= 0; i < NumRefldxActive[ 1 ]; i++) chroma_weight _11_flag[i] u(l) for( i=0; i < NumRefldxActive[ 1 |; i++) { if( luma weight 11 flag[i]){ delta_luma_weight 11[i] se(v) luma_offset 11[i] se(v) if( chroma_weight 11 flag[i]) for(j=0;j<2;j++){ delta chroma weight 11[i][j] se(v) delta_chroma_offset 11[i][j] se(v) Oo num_l0_weighted_ref pics specifies the number of reference pictures in reference picture list 0 that are weighted. The value of num_lO_ weighted ref pics shall ranges from 0 to MaxDecPicBuffMinus1 + 14, inclusive. It is a requirement of bitstream conformance that when present, the value of num_l0_weighted_ref_pics shall not be less than the number of active reference pictures for LO of any slices in the picture associated with the picture header. num _11_weighted_ref pics specifies the number of reference pictures in reference picture list that are weighted. The value of num_|1_weighted ref pics shall ranges from 0 to MaxDecPicBuffMinus1 + 14, inclusive. It is a requirement of bitstream conformance that when present, the value of num_11_weighted_ref pics shall not be less than the number of active reference pictures for L1 of any slices in the picture associated with the picture header. MaxNumGeoMergeCand is set to zero when either num_lO_weighted_ref pics or num_11_weighted_ref pics is non-zero. The following syntax is an example of how this dependency could be utilized: if( sps_prof pic present flag) pic_disable_prof flag u(l) if( sps_geo enabled flag && MaxNumMergeCand >= 2 && "Ipps_max_num_merge_cand_minus_max_num_geo cand _plusl && rt Te TR Tm EE ra A der num_l0_weighted_ref_pics==0 && num_l1_weighted_ref_pics==0) pic_max_num_merge cand_minus_max_num_geo_cand ue(v) if ( sps_ibc_enabled_flag ) pic_six_minus_max_num_ibc_merge cand ue(v) if( sps_joint_cbcr enabled flag ) Semantics of pic_max_num_merge_cand_minus_max_num_geo_cand in this embodiment is the same as for the previous embodiments. In an example, inter- and intra-related syntax elements are conditionally signaled if only certain slice types are used in the picture associated with the PH. Syntax for this example is given below: picture_header_rbsp( ) { pic_inter_slice_present_flag : u(l) if( pic_inter slice _present_flag ) pic_intra_slice_present_flag u(l) non_reference picture flag u(l) gdr_pic_flag u(l) no output of prior pics flag u(l) if( gdr pic flag) recovery_poc_cnt ue(v) ph_pic_parameter_set_id ue(v) if( sps_poc_msb flag) { ph_poc_msb_present flag u(l) ~if( ph poc msb present flag) poc_msb_val if( sps_subpic_id_present flag && Isps_subpic_id_signalling_flag ) { ph_subpic_id_signalling_present_flag if( ph_subpics_id signalling present flag ) { ph_subpic_id_len_minus1 for(i=0;1i <= sps_num subpics minusl; i++) ph_subpic_id[i] if( !sps_virtual boundaries present flag) { ph virtual boundaries present flag if( ph_virtual boundaries present flag) { ph_num_ver virtual boundaries for(i=0;i<ph num ver virtual boundaries; i++) ph virtual boundaries pos x[i] ph_num_hor virtual boundaries for(i=0;i<ph num_hor virtual boundaries; i++) ph virtual boundaries pos v[i] if( separate_colour plane flag == 1) colour plane id if( output_flag present flag ) pic_output_flag pic_rpl_present_flag if( pic_rpl_present flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == ' && rpll idx present flag))) pic_rpl_sps_flag[i] if( pic pl sps flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 || (i == 1 && rpll idx present flag))) pic_rpl_idx[i] 1 else ref pic list struct(i, num ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) pic poc Isb It[i][j] pic_delta_poc_msb present flag[i][j] if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb cycle It[i][j] if( partition_constraints_override enabled flag }4 partition_constraints_override flag if( pic_intra_slice present flag) { if( partition _constraints override flag) { pic_log2 diff min gt min cb intra slice luma pic_max_mtt_hierarchy_depth_intra_slice_luma if( pic_max_mtt_ hierarchy depth intra slice luma != 0){ pic_log2_diff max_bt_min_qt_intra_slice luma pic_log2_diff max_tt_min_qt_intra_slice_luma if( qtbtt_dual tree intra flag) { pic_log2_diff min_qt_min_cb_intra_slice_ chroma pic_max_mtt_hierarchy_depth_intra_slice_chroma if( pic_max_mtt_hierarchy depth intra slice chroma != 0){ pic_log2_ diff max_bt _min_qt_intra_slice chroma pic_log2_ diff max tt min_qt_intra_slice_chroma — if( cu_qp delta enabled flag > pic_cu_qp_delta_subdiv_intra_slice if( pps_cu_chroma_qp offset list enabled flag ) pic_cu_chroma_qp_offset_subdiv_intra_slice if( pic_inter slice present flag ) { if( partition_constraints_override flag) { pic_log2_ diff min_qt_min_cb_inter_ slice pic_max_mtt_hierarchy_depth_inter slice if( pic_max_mtt hierarchy depth inter slice |= 0) { pic_log2_diff max_bt_min_qt_inter_slice pic_log2_diff max_tt_min_qt_inter_slice if( cu gp delta enabled flag) pic_cu_qp_delta_subdiv_inter_slice if( pps_cu_chroma_qp offset list_enabled flag) + pic_cu_chroma_qp_offset_subdiv_inter_ slice if( sps_temporal mvp enabled flag) pic_temporal mvp enabled flag if(!pps_mvd_11_zero_idc) mvd_11_zero_flag if( !pps_six_minus max num merge cand plusl ) pic_six_minus_max_num_merge_cand if( sps_affine_ enabled flag) pic_five_minus_max_num_subblock merge cand ue(v) if( sps_fpel mmvd_ enabled flag ) pic_fpel_ mmvd_enabled_flag u(l) if( sps_bdof pic present flag ) pic_disable_bdof flag u(l) if( sps_dmvr pic present flag ) pic_disable dmvr flag u(l) if( sps_prof pic present flag) pic_disable_prof flag u(l) if( sps_triangle enabled flag && MaxNumMergeCand >= 2 && ~ Ipps_max_num_merge_cand_minus_max_num_triangle cand_plusl ) pic_max_num_merge_cand_minus_max_num_triangle cand ue(v) if ( sps_ibc_ enabled flag ) pic_six_minus_max_num_ibc_merge_cand ue(v) 7.3.7.1 General slice header syntax slice_header( ) { slice_pic_order_cnt_Isb Couw) if( subpics present flag ) slice_subpic_id uv) if( rect_slice flag || NumTilesInPic>1) slice address uv) if( !rect_slice flag && NumTilesInPic>1) num tiles in slice minusl ue(v) if( pic_inter slice _present_flag ) slice_type ue(v) 7.4.3.6 Picture header RBSP semantics pic_inter_slice_present_flag equal to 1 specifies that one or more slice with slice_type equal to 0 (B) or (P) may be present in the picture associated with the PH. pic_inter_slice_present_flag equal to 0 specifies that no slice with slice_type equal to 0 (B) or 1 (P) can be present in the picture associated with the PH. pic_intra_slice_present_flag equal to 1 specifies that one or more slice with slice_type equal to 2 (I) may be present in the picture associated with the PH. pic_intra_slice_present_flag is equal to O specifies that no slice with slice_type equal to 2 (I) can be present in the picture associated with the PH. When not present, the value of pic_intra_slice_only_flag is inferred to be equal to 1. NOTE -: The values of both pic_inter slice present flag and pic_intra_ slice present flag are set equal to 1 in the picture header associated with picture containing one or more subpicture(s) containing intra coded slice(s) which may be merged with one or more subpicure(s) containing inter coded slices(s). 7.4.8.1 General slice header semantics slice type specifies the coding type of the slice according to Table 7-5. Table 7-5 — Name association to slice type ag slice_type Name of slice_type 0 B (B slice) - P (P slice) = I (slice) When nal_unit_type is a value of nal_unit_type in the range of IDR_W_RADL to CRA_NUT, inclusive, and the current picture is the first picture in an access unit, slice_type shall be equal to 2. ‘When not present, the value of slice type is infer to be equal to 2. When pic_intra_slice_present_flag is equal to 0, the value of slice_type shall be in the range from 0 to 1, inclusive. This example could be combined with signaling of of pred_weight_table() in picture header. Signaling of pred_weight_table() in a picture header is disclosed in the previous examples. An exemplary syntax is as follows: picture_header_rbsp( ) { Descriptor if( ( pps_weighted pred flag || pps weighted bipred flag) && weighted_pred_table present_in ph flag) pred_weight table( ) When indicating the presence of pred_weight_table( ) in the picture header, the following syntax could be used. picture_header_rbsp( ) { icture_header_rbsp( ) { pic_inter_slice_present_flag u(l) if( pic_inter slice _present_flag ) pic_intra_slice_present_flag u(l) if( ( pps_weighted pred flag || pps weighted bipred flag) && “pic_inter slice present flag) pred_weight table( ) Alternative examples may use the following syntax: picture_header_rbsp( ) { pic_inter_slice_present_flag u(l) if( pic_inter slice _present_flag ) pic_intra_slice_present_flag u(l) if( ( pps_weighted pred flag || pps weighted bipred flag) && “pic_inter slice present flag && weighted pred_table present in_ph flag) pred_weight table( ) Alternative examples may use the following syntax: picture_header_rbsp( ) { pic_inter_bipred_slice_present_flag u(l) if (Ipic_inter bipred slice present flag ) pic_inter_slice_present_flag u(1) if( pic_inter slice present flag) pic_intra_slice_present_flag u(l) if( ( pps_weighted pred flag || pps weighted bipred flag) && “pic_inter slice present flag && weighted pred_table present in_ph flag) pred_weight table( ) In the syntax above, pic_inter_bipred_slice_present_flag indicates the presence of all the slice types, I-, B- and P-slices that refers to the picture header. When pic_inter_bipred_slice_present_flag is 0, the picture comprises only slices of either I- or B-type. In this case non-rectangular modes are disabled. In an example, a combination of above examples is disclosed. An exemplary syntax is described as follows: picture_header_rbsp( ) { Descriptor pic_inter slice present flag u(l) if( pic_inter slice _present_flag ) pic_intra_slice_present_flag u(l) —plerplpresent_flag wh —ifpie—rpl-present—flag if( rpl_present_in_ph flag) { for(i=0;i<2;i++){ if( num_ref pic lists in sps[i]>0 && !pps ref pic list sps idc[i] && (i == 0 || (i == 1 && rpll idx present flag))) pic_rpl_sps_flag[i] if( pic_rpl_sps_flag[i]) { if( num_ref pic lists in sps[i]>1 && (i == 0 I (i ==! && rpll_idx present flag) )) pic_rpl_idx[i] 1 else ref pic list struct(i, num ref pic lists in sps[i]) for(j = 0; j < NumLtrpEntries[ i ][ RplsIdx[i]]; j++) { if( ltrp_in_slice header flag[i ][ Rplsldx[i]]) pic_poc_Isb_It[i][j] pic_delta_poc_msb_present flag[i][j] if( pic_delta_poc_msb_ present flag[i][j]) pic_delta_poc_msb_cyele It[i][j] if( ( pps weighted pred flag || pps weighted bipred flag) && “weighted |_pred_table _present_in_ph_flag && pic_inter_slice, >_present_flag ) pred weight table( ) if( sps_sao_enabled flag && sao present in ph flag) { —pie—sao—enabled—present—flag —if-plo—sno—enabled presenting pic_sao_luma_enabled flag if(ChromaArrayType |= 0) pic_sao_chroma_enabled flag —} if( sps_alf enabled flag && alf present in ph flag) { —pie—al-enabled—present—flag —ifplo—nlf-ennbled—present—flasrf pic_alf enabled flag if( pic_alf enabled flag) { pic_num_alf aps _ids_luma for(i=0;i<pic_num alf aps ids luma; i++) pic_alf aps id luma[i] if( ChromaAmayType != 0) pic_alf chroma_idc if( pic_alf chroma _idc ) pic_alf aps id chroma -— if¢ deblocking filter override enabled flag && deblocking filter override > present_in | ph flag H pic_deblocking filter _override_flag u(l) if( pic_deblocking_filter override flag) { pic_deblocking filter disabled flag u(l) if( !pic_deblocking filter disabled flag) { pic_beta_offset_div2 se(v) pic_tc_offset_div2 se(v) — — 0c— In an example, select non-rectangular (e.g. GEO) mode referring to picture without weighted prediction factor is allowed. In this example, semantics is defined as follows: 7.4.10.7 Merge data semantics The variable MergeGeoFlag[ x0 J[ yO ], which specifies whether geo shape based motion compensation is used to generate the prediction samples of the current coding unit, when decoding a B slice, is derived as follows: If all the following conditions are true, MergeGeoFlag[ x0 ][ yO ] is set equal to 1: sps_geo enabled flag is equal to 1. slice type is equal to B. general merge flag[ x0 ][ yO ] is equal to 1. MaxNumGeoMergeCand is greater than or equal to 2. cbWidth is greater than or equal to 8 cbHeight is greater than or equal to 8 cbWidth is smaller than 8*cbHeight cbHeight is smaller than 8*cbWidth regular merge flag[ x0 ][ yO ]is equal to 0. merge _subblock flag[ x0 ][ yO ] is equal to O. ciip_flag[ x0 ][ yO ] is equal to 0. Otherwise, MergeGeoFlag[ x0 ][ yO ] is set equal to 0. Itis a requirement of bitstream conformance that if one of the luma or chroma explicit weighted flags of the CU is true, MergeGeoFlag[ x0][ yO ] shall be equal to 0. In an example, a part of the VVC specification is explained as follows: 8.5.7 Decoding process for geo inter blocks 8.5.7.1 General This process is invoked when decoding a coding unit with MergeGeoFlag[ xCb ][ yCb ] equal tol. Inputs to this process are: a luma location ( xCb, yCb ) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture, a variable cbWidth specifying the width of the current coding block in luma samples, a variable cbHeight specifying the height of the current coding block in luma samples, the luma motion vectors in 1 / 16 fractional-sample accuracy mvA and mvB, the chroma motion vectors mvCA and mvCB, the reference indices refldx A and refldxB, the prediction list flags predListFlagA and predListFlagB. Let predSamplesL Ar and predSamplesLBL be (cbWidth)x(cbHeight) arrays of predicted luma sample values and, predSamplesLAcy, predSamplesLBcy, predSamplesLAcr and predSamplesLBc: be (cbWidth / SubWidthC)x(cbHeight / SubHeightC) arrays of predicted chroma sample values. The predSamplest, predSamplescy and predSamplesc, are derived by the following ordered steps: 1. For N being each of A and B, the following applies: 2. The partition angle and distance of merge geo mode variable angleldx and distanceldx are set according to the value of merge geo partition idx[ xCb ][ yCb ] as specified in Table 36. 3. The varialbe explictWeightedFlag is derived as follow: lumaWeightedFlagA predListFlagA ? luma_weight_11_flag[ refldxA luma_weight 10 flag[ refldxA ] lumaWeightedFlagB predListFlagB ? luma_weight_11_flag[ refldxB luma_weight 10 flag[ refldxB ] chromaWeightedFlagA = predListFlagA ? chroma_weight I1_flag[ refldxA ] : chroma weight 10 flag[ refldxA ] chromaWeightedFlagB =: predListFlagB ? chroma weight 11_flag[ refldxB ] : chroma weight 10 flag[ refldxB ] weightedFlag = lumaWeightedFlagA || lumaWeightedFlagB || chromaWeightedFlagA || chromaWeightedFlagB 4. The prediction samples inside the current luma coding block, predSamples.[ xr ][ yr ] with x =0..cbWidth—1 and y.=0..cbHeight — 1, are derived by invoking the weighted sample prediction process for geo merge mode specified in clause 8.5.7.2 if weightedFlag is equal to 0, and the explicit weighted sample prediction process in clause 8.5.6.6.3 if weightedFlag is equal to 1 with the coding block width nCbW set equal to cbWidth, the coding block height nCbH set equal to cbHeight, the sample arrays predSamplesLAr and predSamplesLBr, and the variables angleldx and distanceldx, and cIdx equal to O as inputs. 5. The prediction samples inside the current chroma component Cb coding block, predSamplescs[ xc ][ ye ] with xc = 0..cbWidth / SubWidthC — 1 and yc = 0..cbHeight / SubHeightC — 1, are derived by invoking the weighted sample prediction process for geo merge mode specified in clause 8.5.7.2 if weightedFlag is equal to 0, and the explicit weighted sample prediction process in clause 8.5.6.6.3 if weightedFlag is equal to 1 with the coding block width nCbW set equal to cbWidth / SubWidthC, the coding block height nCbH set equal to cbHeight / SubHeightC, the sample arrays predSamplesLAcb, and predSamplesLBco, and the variables angleldx and distanceldx, and cIdx equal to 1 as inputs. 6. The prediction samples inside the current chroma component Cr coding block, predSamplesc:| xc ][ ve ] with xc = 0..coWidth / SubWidthC — 1 and yc = 0..cbHeight / SubHeightC — 1, are derived by invoking the weighted sample prediction process for geo merge mode specified in clause 8.5.7.2 if weightedFlag is equal to 0, and the explicit weighted sample prediction process in clause 8.5.6.6.3 if weightedFlag is equal to 1 with the coding block width nCbW set equal to cbWidth / SubWidthC, the coding block height nCbH set equal to cbHeight / SubHeightC, the sample arrays predSamplesLAc, and predSamplesLBcr, and the variables angleldx and distanceldx, and cIdx equal to 2 as inputs. 7. The motion vector storing process for merge geo mode specified in clause 8.5.7.3 is invoked with the luma coding block location ( xCb, yCb ), the luma coding block width cbWidth, the luma coding block height cbHeight, the partition direction angleldx and distanceldx, the luma motion vectors mvA and mvB, the reference indices refldxA and refldxB, and the prediction list flags predListFlagA and predListFlagB as inputs. Table 36 — Specification of the angleldx and distanceldx values based on the merge geo partition idx value. 8.5.6.6.3 Explicit weighted sample prediction process Inputs to this process are: two variables nCbW and nCbH specifying the width and the height of the current coding block, two (nCbW)x(nCbH) arrays predSamplesL0O and predSamplesL1, the prediction list utilization flags, predFlagL0 and predFlagL1, the reference indices, refIdxL0 and refIdxL1, the variable cldx specifying the colour component index, the sample bit depth, bitDepth. Output of this process is the (n"CbW)x(nCbH) array pbSamples of prediction sample values. The variable shift] is set equal to Max( 2, 14 — bitDepth ). The variables log2Wd, 00, ol, w0 and wl are derived as follows: If cldx is equal to O for luma samples, the following applies: log2Wd = luma_log2 weight denom + shiftl (1010) w0 = LumaWeightLO[ refIdxL0 | (1011) wl = LumaWeightL1[ refldxL1 | (1012) 00 = luma_offset_10[ refldxL0 | << (bitDepth — 8)(1013) ol =luma offset 11[ refldxL1] << (bitDepth— 8)(1014) Otherwise (cIdx is not equal to 0 for chroma samples), the following applies: log2Wd = ChromaLog2 WeightDenom + shift] (1015) w0 = ChromaWeightLO[ refldxL0 ][ cIdx — 1] (1016) wl = ChromaWeightL1[ refldxL1 ][cIdx— 1] (1017) 00 = ChromaOffsetLO[ refldxL0 ]J[ cldx — 1] << (bitDepth — 8) (1018) ol = ChromaOffsetL1[ refldxL1 ][ cldx— 1] << (bitDepth—8) (1019) The prediction sample pbSamples[ x ][ y] with x=0..nCbW —1 and y=0.nCbH — 1 are derived as follows: If predFlagL0 is equal to 1 and predFlagL1 is equal to 0, the prediction sample values are derived as follows: if(log2Wd >= 1) pbSamples[ x][y]=Clip3(0,(1 << bitDepth)-1, ( (predSamplesLO[ x ][ y ] * w0 + 2082%d=1) >> 10g2Wd ) +00 ) (1020) else pbSamples[ x ][y]=Clip3(0,(1 << bitDepth)— 1, predSamplesLO[ x ][y] * w0 +00) Otherwise, if predFlagL0 is equal to 0 and predFlagL1 is equal to 1, the prediction sample values are derived as follows: if(log2Wd >= 1) ‘pbSamples[ x ][y]=Clip3(0,(1 << bitDepth)- 1, ((predSamplesL1[ x J[y] * wl+2082Wd=-1) >> Jog2Wd)+ol) (1021) else pbSamples[ x ][ v]=Clip3(0,(1 << bitDepth)— 1, predSamplesL1[x][y]* wl +o0l) Otherwise (predFlagL0 is equal to 1 and predFlagL1 is equal to 1), the prediction sample values are derived as follows: pbSamples[ x ][ v ] = Clip3( 0, ( 1 << bitDepth) —- 1, ( predSamplesLO[ x ][ vy ] * wO + predSamplesL1[ x ][y¥] * wl + C((00+01+1) << log2Wd)) >> (log2Wd+1)) (1022) In this example, a syntax of merge data parameter that comprises a check of a variable that indicates the presence of a non-rectangular merge mode (e.g. GEO mode) is disclosed. The syntax example is given below: merge_data( x0, y0, cbWidth, cbHeight, chType ) { Descriptor if( CuPredMode[ chType ][ x0 ][v0] == MODE_IBC){ if( MaxNumIbcMergeCand > 1 ) ae(v) merge _idx[ x0 [v0] Yelse { if( MaxNumSubblockMergeCand >0 && cbWidth >= 8 && cbHeight >= 8) merge _subblock_flag[ x0 ][ v0] ae(v) if( merge subblock flag[ x0 ][y0] == 1){ if( MaxNumSubblockMergeCand > 1) merge_subblock_idx[ x0 ][ v0] ae(v) }else { if(cbWidth< 128 && cbHeight<128 && ((sps_ciip enabled flag && cu_skip flag[x0][v0] == 0 && (cbWidth* cbHeight) >= 64 > || ( sps. ;_geo_ enabled flag && MaxNumGeoMergeCand > 1 && cbWidth>=8 && cbHeight >=8 && cbWidth < 8*cbHeight && cbHeight < 8*cbWidth && slice type == B))) regular merge flag[ x0 [v0] ae(v) if( regular merge flag[ x0 ][y0] == 1){ if( sps_mmvd_enabled flag ) mmvd_merge_flag[ x0][ v0] ae(v) iff mmvd merge flag[ x0][v0] == 1){ if( MaxNumMergeCand > 1 ) mmvd_cand_flag[ x0 ][ v0] ae(v) mmvd_distance_idx[ x0 ][v0 ] ae(v) mmvd_direction_idx[ x0 ][ v0 | ae(v) 1 else if( MaxNumMergeCand > 1 ) merge _idx[ x0 ][y0] ae(v) Yelse { if( sps_ciip enabled flag && sps_geo enabled flag && “ MaxNumGeoMergeCand >1 && slice_type == B && cu skip flag[x0][y0] == 0 && cbWidth >= 8 && cbHeight >= 8 && cbWidth <8*cbHeight && cbHeight < 8*cbWidth && cbWidth<128 && cbHeight<128) ae(v) ciip_flag[ x0 ][ v0] if( ciip_flag[ x0][v0] && MaxNumMergeCand>1) ae(v) merge _idx[ x0 ][ v0] if( !ciip_flag[ x0 [[y0] && MaxNumGeoMergeCand>1) { merge_geo_partition_idx[ x0 [v0] ae(v) merge geo _idx0[ x0 [v0] ae(v) if( MaxNumGeoMergeCand > 2 ) merge_geo_idx1[ x0 ][ v0] ae(v) 0 Variable MaxNumGeoMergeCand is derived according to any of the previous examples. An alternative variable SliceMaxNumGeoMergeCand which is derived from MaxNumGeoMergeCand variable may be used. The value of MaxNumGeoMergeCand is obtained on the higher signaling levels (e.g. PH, PPS or SPS). In an example, SliceMaxNumGeoMergeCand is derived based on the value of MaxNumGeoMergeCand and additional checks that are performed for the slice. For example, SliceMaxNumGeoMergeCand (num_10_weighted_ref pics>0 || num _11_weighted ref pics>0) ? 0 : MaxNumGeoMergeCand. In another example, the following expression is used to determine MaxNumGeoMergeCand value: SliceMaxNumGeoMergeCand = (Ipic_inter_slice_present_flag) ? 0: MaxNumGeoMergeCand. In an example, The following syntax table is defined: picture_header_rbsp( ) { pic_inter_bipred_slice_present_flag if (Ipic_inter bipred slice present flag ) pic_inter_slice_present_flag if( pic_inter slice present flag) pic_intra_slice_present flag u(l) if( ( pps_weighted pred flag || pps weighted bipred flag) && “pic_inter slice present flag && weighted pred_table present in_ph flag) pred weight table( ) Variable MaxNumGeoMergeCand is derived as follows: SliceMaxNumGeoMergeCand (!pic_inter_bipred_slice_present_flag) ? 0: MaxNumGeoMergeCand. A method of indication of the number of merge candidates for rectangular and non- rectangular modes is disclosed. The numbers of merge candidates for rectangular and non- rectangular modes are interdependent, and it may not be needed to indicate the number of merge candidates for non-rectangular modes in the event when it is indicated that the number of merge candidates for rectangular modes is lower than a threshold. Particularly for TPM or Geo merge modes, there should be at least two candidates for the merge mode, since a block predicted using any of those non-rectangular merge modes require two inter predictors with different MV's specified for them. In an embodiment, when the number of merge mode candidates is indicated in the sequence parameter set (SPS), the following syntax could be used: 7.3.2.3 Sequence parameter set RBSP syntax seq_parameter_set_rbsp( ) { sps_decoding_parameter_set_id : u(4) sps_video_parameter_set_id u(4) sps_max_sublayers_minusl u(3) sps_reserved_zero_4bits u(4) sps_ptl_dpb_hrd_params_present_flag u(l) if( sps_ptl dpb _hrd params present flag) profile_tier level( 1, sps_max_sublayers minus] ) gdr_enabled_flag u(l) sps_seq_parameter_set_id u(4) chroma format idc u(2) if( chroma format idc == 3) separate_colour_plane flag u(l) ref _pic_resampling_enabled_flag u(l) pic_width_max_in_luma_samples ue(v) pic_height_max_in_luma_samples ue(v) sps_log2_ctu_size_minus5 u(2) subpics_present_flag u(l) if( subpics_present flag) { sps_num_subpics_minus1 u(®) for(i=0;i <= sps_num_subpics_minusl; i++) { subpic_ctu_top_left x[i] uv) subpic_ctu_top_left_v[i] uv) subpic_width_minus1[i] uv) subpic_height_ minus1[i] uv) subpic_treated_as_pic_flag[i] u(l) loop_filter_across_subpic_enabled_flag[ i] u(l) sps_subpic_id_present_flag u(l) if( sps_subpic_id_present flag) { sps_subpic_id_signalling present flag u(l) if( sps_subpic id signalling present flag) { sps_subpic_id_len_minus1 ue(v) for(i=0;i <= sps_num_subpics_minusl; i++) i uv) sps_subpic_id[ i] bit depth minus8 ue(v) min gp prime ts minus ue(v) sps_weighted pred flag u(l) sps_weighted_bipred_flag u(l) log2_max_pic_order_cnt_lsb_minusd sps_poc_msb_flag if( sps_poc_msb flag ) poc_msb_len_minusl if( sps_max_sublayers minus] > 0) sps_sublayer_dpb_params_flag if( sps_ptl_dpb_hrd params present flag ) dpb_parameters( 0, sps_max_sublayers_minusl, sps_sublayer_dpb_params_flag ) long _term_ref pics flag inter_layer_ref pics present flag sps_idr_rpl_present_flag rpll_same_as_rpl0 flag for(i=0;i<!rpll_ same as rpl0 flag?2:1;i++){ num_ref pic_lists_in_sps[i] for( j=0;j <num_ref pic lists_in_sps[ i]; j++) ref pic _list_struct( i,j) if( ChromaArrayType |=0) qtbtt_dual_tree_intra_flag log2_min_luma_coding_block_size minus2 partition_constraints_override enabled flag sps_log2_diff min_qt_min_cb_intra_slice luma sps_log2_diff min_qt_min_cb_inter_slice sps_max_mtt_hierarchy_depth_inter_slice sps_max_mtt_hierarchy depth_intra_slice_luma if( sps_max_mtt hierarchy depth intra slice luma != 0){ sps_log2_diff max_bt _min_gt_intra_ slice luma sps_log2 diff max_tt_min_qt_intra slice luma if( sps max mitt hierarchy depth inter slice != 0){ sps_log2_ diff max_bt_min_qgt_inter slice sps_log2_ diff max_tt_min_qt_inter slice if( qtbtt_dual tree _intra_flag ) { sps_log2_diff min_qt_min_cb_intra_slice chroma sps_max_mtt_hierarchy depth_intra_slice chroma if( sps_max_mtt_hierarchy depth intra slice chroma |= 0){ sps_log2_ diff max _bt min_qt_intra_slice_chroma sps_log2_diff max_tt_min_qt_intra_slice chroma sps_max_luma_transform_size 64 flag sps_joint_cher_enabled flag if( ChromaArray Type !=0) { same_qp_table_for_chroma numQpTables = same_qp_table for chroma ? | : ( sps_joint_cbcr enabled flag ? 3 : for( i= 0; i < numQpTables: i++) { q| p_table start minus26[i] num_points_in_qp_table_minus1[i] for(j = 0; j <= num _points_in_qp_table minusl[i]: j++) { delta qp in val minusl[i][]j] delta_qp_diff val[i][j] sps_sao_enabled flag sps_alf enabled flag sps_transform_skip_enabled_flag if( sps_transform_skip enabled flag) sps_bdpcm_enabled flag if( sps_bdpcm_enabled flag && chroma format idc == 3) sps_bdpem_chroma_enabled flag sps_ref wraparound _enabled_flag if( sps_ref wraparound_enabled_flag ) sps_ref_wraparound_offset_minus1 sps_temporal_mvp_enabled flag if( sps_temporal mvp enabled flag) sps_sbtmvp_enabled flag sps_amvr_enabled_flag sps_bdof _enabled_flag if( sps_bdof enabled flag) sps_bdof _pic_present_flag sps_smvd_enabled_flag sps_dmvr_enabled_flag if( sps dmvr enabled flag) sps_dmvr_pic_present flag sps_mmvd_enabled flag sps_isp_enabled_flag sps_mrl_enabled_flag sps_mip_enabled flag if( ChromaArrayType !'= 0) sps_cclm_enabled flag if( chroma_format_idc == 1){ sps_chroma_ horizontal collocated flag sps_chroma_vertical collocated flag sps_mts_enabled_flag if( sps_mts_enabled flag) { sps_explicit_mts_intra_enabled flag sps_explicit_mts_inter_enabled_flag sps_six_minus_max_num_merge_cand sps_sbt_enabled_flag sps_affine_enabled_flag if( sps_affine enabled flag) { sps_five_minus_max_num_subblock_merge cand sps_affine_type flag sps_affine_amvr_enabled_flag sps_affine_prof enabled flag if( sps_affine prof enabled flag) sps_prof _pic_present flag if( chroma_format_idc == 3){ sps_act_enabled_flag sps_palette_enabled flag sps_bcw_enabled flag sps_ibc_enabled_flag if ( sps_ibc_ enabled flag ) sps_six minus max num ibc merge cand sps_ciip_enabled_flag if( sps_mmvd_ enabled flag ) sps_fpel_mmvd_enabled_flag sps_geo_enabled_flag if (sps_geo_enabled_ flag && MaxNumMergeCand >= 3) sps_max_num_merge_cand_minus_max_num_geo_cand sps_Imcs_enabled flag sps_Ifnst_enabled flag sps_ladf enabled flag if( sps_ladf enabled flag ) { sps_num_ladf _intervals_minus2 sps_ladf lowest _interval_qp_offset for(i=0;i<sps num ladf intervals minus2 + 1; i++) { sps_ladf qp_offset[ i] sps_ladf delta_threshold_minus1[i] sps_scaling_list_enabled flag sps_virtual_boundaries_present_flag if( sps_virtual_boundaries_present_flag ) { sps_num_ver_virtual_boundaries for(i=0;i<sps num ver virtual boundaries; i++) sps_virtual_boundaries pos x[i] sps_num_hor_ virtual boundaries for(i=0;i<sps num hor virtual boundaries: i++) sps_virtual_boundaries_pos v[i] if( sps_ptl_dpb_hrd_params present flag ) { sps_general_hrd_params_present_flag u(l) if( sps_general hrd_params present flag ) { general _hrd_parameters( ) if( sps_max_sublayers minus] > 0) sps_sublayer _cpb_params_present flag u(l) firstSubLayer = sps_sublaver cpb_params_present_flag ? 0 : sps_max_sublayers_minus1 ols_hrd_parameters( firstSubLaver, sps_max_sublavers_minusl ) field_seq_flag u(l) vui_parameters_present flag u(l) if( vui_parameters_ present flag ) vui_parameters( ) / * Specified in ITU-T H.SEI | ISO / IEC 23002-7 * / sps_extension_flag u(l) ~ if( sps_extension_flag ) while( more_rbsp_data( ) ) sps_extension_data_flag u(l) tbsp trailing bits( ) ; = — According to an embodiment of the invention, the following steps are performed for indication of number of merge mode candidates in the SPS: Indication of the number of the merge mode candidates for regular modes (MaxNumMergeCand); Indicationof whether non-rectangular modes are enabled by a non-rectangular merge enabling flag (sps_geo enabled flag); and In the event of the non-rectangular merge enabling flag value is non zero and when the number of merge mode candidates for regular merge modes exceed a first threshold, indication of the number of non-rectangular modes modes (sps_max_num_merge cand minus _max_num_geo cand). wherein indication of the non-rectangular merge enabling flag is performed when the number of the merge mode candidates for regular modes exceeds a second threshold value, e.g. 1. In Embodiment 1, this sequence of steps is shown as the following part of SPS syntax of VVC specification: if (MaxNumMergeCand > 1) sps_geo_enabled_flag u(l) if (sps_geo_enabled_ flag && MaxNumMergeCand >= 3) sps_max_num_merge_cand_minus_max_num_geo_cand ue(v) In this embodiment, two sequential checks are performed, and the second check is dependent on the value of a flag which is signaled or not according the result of the first check. Embodiment 2 performed the second check differently in comparison with the process described for Embodiment 1. Particularly, Embodiment 1 uses “greater” condition instead of “greater or equal”. This sequence of steps is shown as the following part of SPS syntax of VVC specification: if (MaxNumMergeCand > 1) sps_geo_enabled_flag u(l) if (sps_geo enabled flag && MaxNumMergeCand > 2) sps_max_num_merge_cand_minus_max_num_geo_cand ue(v) ‘Embodiment 3 differs from Embodiment 1 that the second check is not performed when the first check results in a false value,the non-rectangular merge enabling flag value (sps_geo_enabled_flag) is determined after a process of derivation of MaxNumMergeCand value from sps_six_minus_max_num_merge_cand synthax element is finished is a technical benefit, because the value of sps_geo_enabled_flag is not referenced for some values of MaxNumMergeCand and thus could be skipped from handling in the parsing process. This sequence of steps performed in accordance with Embodiment 3 is shown as the following part of SPS syntax of VVC specification: if (MaxNumMergeCand > 1) sps_geo_enabled_flag u(l) if ( sps_geo enabled flag && MaxNumMergeCand >= 3) sps_max_num_merge cand_minus_max_num_geo_cand ue(v) Embodiment 4 is a combination of aspects of Embodiment 2 and Embodiment 3. The sequence of steps performed in accordance with Embodiment 4 is shown as the following part of SPS syntax of VVC specification: if (MaxNumMergeCand > 1){ sps_geo_enabled_flag u(l) if (sps_geo enabled flag && MaxNumMergeCand > 2) sps_max_num_merge_cand_minus_max_num_geo_cand ue(v) Embodiments 5-8 disclose different formulations of the first and the second checks. These embodiments may be explained as follows: Embodiment 5 if (MaxNumMergeCand >= 2) sps_geo_enabled_flag u(l) if ( sps_geo enabled flag && MaxNumMergeCand >= 3) sps_max_num_merge_cand_minus_max_num_geo_cand ue(v) Embodiment 6 w— — if (MaxNumMergeCand >= 2) sps_geo_enabled_flag u(l) if (sps_geo enabled flag && MaxNumMergeCand > 2) sps_max_num_merge_cand_minus_max_num_geo_cand ue(v) Embodiment 7 F———— if (MaxNumMergeCand >= 2){ sps_geo_enabled_flag u(l) if (sps_geo enabled flag && MaxNumMergeCand >= 3) sps_max_num_merge cand_minus_max_num_geo_cand ue(v) Embodiment 8 [P——————————————————————————— if (MaxNumMergeCand >= 2){ sps_geo_enabled_flag u(l) if (sps_geo enabled flag && MaxNumMergeCand > 2) sps_max_num_merge cand_minus_max_num_geo_cand ue(v) In an implementation as shown in Fig. 15, a method of obtaining a maximum number of geometric partitioning merger mode candidates for video decoding is disclosed, the method comprising: S1501: obtaining a bitstream for a video sequence. The bitstream may be obtained according to wireless network or wired network. The bitstream may be transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, microwave, WIFI, Bluetooth, LTE or 5G. In an embodiment, a bitstream are a sequence of bits, in the form of a network abstraction layer (NAL) unit stream or a byte stream, that forms the representation of a sequence of access units (AUs) forming one or more coded video sequences (CVSs). In some embodiments, for a decoding process, decoder side reads a bitstream and derives decoded pictures from the bitstream; for an encoding process, encoder side produces a bitstream. Normally, a bitstream will comprise syntax elements that are formed by a syntax structure. syntax element: An element of data represented in the bitstream. syntax structure: Zero or more syntax elements present together in the bitstream in a specified order. In a specific example, bitstream formats specifies the relationship between the network abstraction layer (NAL) unit stream and byte stream, either of which are referred to as the bitstream. The bitstream can be in one of two formats: the NAL unit stream format or the byte stream format. The NAL unit stream format is conceptually the more "basic" type. The NAL unit stream format comprises a sequence of syntax structures called NAL units. This sequence is ordered in decoding order. There are constraints imposed on the decoding order (and contents) of the NAL units in the NAL unit stream. The byte stream format can be constructed from the NAL unit stream format by ordering the NAL units in decoding order and prefixing each NAL unit with a start code prefix and zero or more zero-valued bytes to form a stream of bytes. The NAL unit stream format can be extracted from the byte stream format by searching for the location of the unique start code prefix pattern within this stream of bytes. This clause specifies the relationship between source and decoded pictures that is given via the bitstream. The video source that is represented by the bitstream is a sequence of pictures in decoding order. The source and decoded pictures are each comprised of one or more sample arrays: Luma (Y) only (monochrome). Luma and two chroma (YCbCr or YCgCo). Green, blue, and red (GBR, also known as RGB). Arrays representing other unspecified monochrome or tri-stimulus colour samplings (for example, YZX, also known as XYZ). The variables and terms associated with these arrays are referred to as luma (or L or Y) and chroma, where the two chroma arrays are referred to as Cb and Cr; regardless of the actual colour representation method in use. The actual colour representation method in use can be indicated in syntax that is specified in VUI parameters as specified in ITU-T H.SEI | ISO / IEC 23002-7. $1502: obtaining a value of a first indicator according to the bitstream. The first indicator represents the maximum number of merging motion vector prediction, MVP, candidates. In an example, the first indicator is represented according to a variable MaxNumMergeCand. In example, the maximum number of merging MVP candidates, MaxNumMergeCand, is derived as follows: MaxNumMergeCand = 6 — sps_six_minus_max_num_ merge cand. Wherein sps_six_minus_max_num_merge_cand specifies the maximum number of merging motion vector prediction (MVP) candidates supported in the SPS subtracted from 6. The value of sps_six_minus_max_num_merge_cand shall be in the range of 0 to 5, inclusive. In an example, sps_six_minus_max_num_merge_cand is parsed form Sequence parameter set RBSP syntax structure in the bitstream. $1503: obtaining a value of a second indicator according to the bitstream. The second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence. In an example, the second indicator is represented according to sps_geo enabled flag (sps_gpm_enabled_flag). sps_geo_enabled flag equal to 1 specifies that the geometric partition based motion compensation is enabled for the CLVS and merge_gpm _partition_idx, merge_gpm_idx0, and merge_gpm_idx1 could be present in the coding unit syntax of the CLVS. sps_geo_enabled_flag equal to O specifies that the geometric partition based motion compensation is disabled for the CLVS and merge_gpm_partition_idx, merge_gpm_idx0, and merge_gpm_idx1 are not present in the coding unit syntax of the CLVS. When not present, the value of sps_geo enabled flag is inferred to be equal to 0. In one implementation, the step of obtaining a value of a second indicator is performed after the step of obtaining a value of a first indicator, In one implementation, the value of the second indicator is obtained from sequence parameter set, SPS, of the bitstream. In one implementation, the value of the second indicator is parsed from sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. The threshold is an integer value, in an example, the threshold is 2. For example, the value of the second indicator sps_gpm_enabled_flag is obtained according to, Sequence parameter set RBSP syntax if MaxNumMergeCand >= 2){ sps_gpm_enabled flag u(l) S1504: parsing a value of a third indicator from the bitstream. In one implementation, parsing a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. The threshold is an integer value, the preset value is an integer value. In an example, the threshold is 2. In an example, the preset value is 1. In an example, the value of the third indicator is obtained from sequence parameter set, SPS, of the bitstream In an example, the third indicator is represented according to sps_max_num_merge cand minus_max_num geo cand (sps_max_num_ merge cand minus max_num_gpm_cand). For example, the value of the third indicator sps_max_num_merge_cand_minus_max_num_gpm_cand is obtained according to, Sequence parameter set RBSP syntax if( MaxNumMergeCand >= 2){ sps_gpm_enabled flag =~ Cul) if( sps_gpm_enabled flag && MaxNumMergeCand >= 3) sps_max_num_merge_cand_minus_max_num_gpm_cand ue(v) In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value. In one implementation, wherein the method further comprise: setting the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In an example, sps max num_merge_cand_minus max num gpm cand specifies the maximum number of geometric partitioning merge mode candidates supported in the SPS subtracted from MaxNumMergeCand. The value of sps_max_num_merge_cand_minus_max_num_gpm_cand shall be in the range of 0 to MaxNumMergeCand — 2, inclusive. The maximum number of geometric partitioning merge mode candidates, MaxNumGpmMergeCand (MaxNumGeoMergeCand), is derived as follows: if( sps_gpm enabled flag && MaxNumMergeCand >= 3) MaxNumGpmMergeCand = MaxNumMergeCand — sps_max_num_merge cand minus max _num_gpm cand else if( sps_gpm_enabled flag && MaxNumMergeCand 2) MaxNumGpmMergeCand = 2 else MaxNumGpmMergeCand = 0. In an implementation as shown in Fig. 16, a video decoding apparatus 1600 is disclosed, the video decoding apparatus comprising: a receiving module 1601, which is configured to obtain a bitstream for a video sequence; an obtaining module 1602, which is configured to obtain a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; the obtaining module 1602 being configured to obtain a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; a parsing module 1603, which is configured to parse a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. In an implementation, the obtaining module 1602 is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator equal to the preset value. In an implementation, the obtaining module 1602 is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator not equal to the preset value. In an implementation, the threshold is 2. In an implementation, the preset value is 1. In an implementation, the step of obtaining a value of a second indicator is performed after the step of obtaining a value of a first indicator, In an implementation, the value of the second indicator is parsed from sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold. In an implementation, the value of the second indicator is obtained from sequence parameter set, SPS, of the bitstream. In an implementation, the value of the third indicator is obtained from sequence parameter set, SPS, of the bitstream. The further details for receiving module 1601, obtaining module 1602 and parsing module 1603 could refer to the above method examples and implementations. Example 1.The method of video coding comprising signaling of merge mode candidates number, the method comprising: Indication of the number of the merge mode candidates for regular modes (MaxNumMergeCand); Indication of whether non-rectangular modes are enabled by a non-rectangular merge enabling flag (sps_geo enabled flag); and In the event of the non-rectangular merge enabling flag value is non zero and when the number of merge mode candidates for regular merge modes exceed a first threshold, indication of the number of non-rectangular modes modes (sps_max_num_ merge cand minus max num geo cand), wherein indication of the non-rectangular merge enabling flag is performed when the number of the merge mode candidates for regular modes exceeds a second threshold value (1). Example 2. The method of example 1, wherein the non-rectangular merge enabling flag value is determined after a process of derivation of MaxNumMergeCand value from sps_six minus max num merge cand synthax element is finished. Example 3. The method of any of the previous examples wherein the threshold checking is a comparison of whether the number of merge mode candidates for regular merge modes is greater than 2. Example 4. The method of example 1 or example 2, wherein the first threshold checking is a comparison of whether the number of merge mode candidates for regular merge modes is greater or equal than 3. In an example, an inter prediction method is disclosed, comprising: determining whether a non- rectangular inter prediction mode is allowed for a group of blocks; obtaining one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and obtaining prediction value of a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In an example, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In a feasible implementation, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In an example, determining the non-rectangular inter prediction mode is allowed, comprising: indicating the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In an example, the group of blocks consists of a picture, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a picture header of the picture. In an example, the group of blocks consists of a slice, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a slice header of the slice. In an example, the non-rectangular inter prediction mode is a triangular partitioning mode. In an example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In an example, the weighted prediction parameters are used for a slice-level luminance compensation. In an example, the weighted prediction parameters are used for a block-level luminance compensation. In an example, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. In an example, an apparatus for inter prediction is disclosed, comprising: a non-transitory memory having processor-executable instructions stored thereon; and a processor, coupled to the memory, configured to execute the processor-executable instructions to facilitate any one of method examples. In an example, a bitstream for inter prediction is disclosed, comprising: indicating information for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; and one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks, wherein prediction value of a current block is obtained based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In an example, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In an example, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In an example, the indicating information comprises the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In an example, the group of blocks consists of a picture, and wherein the weighted prediction parameters and the indicating information are in a picture header of the picture. In an example, the group of blocks consists of a slice, and wherein the weighted prediction parameters and the indicating information are in a slice header of the slice. In an example, the non-rectangular inter prediction mode is a triangular partitioning mode. In an example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In an example, the weighted prediction parameters are used for a slice-level luminance compensation. In an example, the weighted prediction parameters are used for a block-level luminance compensation. In an example, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. In an example, an inter prediction apparatus is disclosed, comprising: a determining module, configured to determine whether a non-rectangular inter prediction mode is allowed for a group of blocks; an obtaining module, configured to obtain one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and a predicting module, configured to obtain prediction value of a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In an example, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In an example, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In an example, the determining module is specifically configured to: indicate the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In an example, the group of blocks consists of a picture, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a picture header of the picture. In an example, the group of blocks consists of a slice, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a slice header of the slice. In an example, the non-rectangular inter prediction mode is a triangular partitioning mode. In an example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In an example, the weighted prediction parameters are used for a slice-level luminance compensation. In an example, the weighted prediction parameters are used for a block-level luminance compensation. In an example, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. Embodiments provide for an efficient encoding and / or decoding using signal-related information in slice headers only for slices which allow or enable bidirectional inter- prediction, e.g. in bidirectional (B) prediction slices, also called B-slices. Following is an explanation of the applications of the encoding method as well as the decoding method as shown in the above-mentioned embodiments, and a system using them. FIG. 10 is a block diagram showing a content supply system 3100 for realizing content distribution service. This content supply system 3100 includes capture device 3102, terminal device 3106, and optionally includes display 3126. The capture device 3102 communicates with the terminal device 3106 over communication link 3104. The communication link may include the communication channel 13 described above. The communication link 3104 includes but not limited to WIFI, Ethernet, Cable, wireless (3G / 4G / 5G), USB, or any kind of combination thereof, or the like. The capture device 3102 generates data, and may encode the data by the encoding method as shown in the above embodiments. Alternatively, the capture device 3102 may distribute the data to a streaming server (not shown in the Figures), and the server encodes the data and transmits the encoded data to the terminal device 3106. The capture device 3102 includes but not limited to camera, smart phone or Pad, computer or laptop, video conference system, PDA, vehicle mounted device, or a combination of any of them, or the like. For example, the capture device 3102 may include the source device 12 as described above. When the data includes video, the video encoder 20 included in the capture device 3102 may actually perform video encoding processing. When the data includes audio (i.e., voice), an audio encoder included in the capture device 3102 may actually perform audio encoding processing. For some practical scenarios, the capture device 3102 distributes the encoded video and audio data by multiplexing them together. For other practical scenarios, for example in the video conference system, the encoded audio data and the encoded video data are not multiplexed. Capture device 3102 distributes the encoded audio data and the encoded video data to the terminal device 3106 separately. In the content supply system 3100, the terminal device 310 receives and reproduces the encoded data. The terminal device 3106 could be a device with data receiving and recovering capability, such as smart phone or Pad 3108, computer or laptop 3110, network video recorder (NVR) / digital video recorder (DVR) 3112, TV 3114, set top box (STB) 3116, video conference system 3118, video surveillance system 3120, personal digital assistant (PDA) 3122, vehicle mounted device 3124, or a combination of any of them, or the like capable of decoding the above-mentioned encoded data. For example, the terminal device 3106 may include the destination device 14 as described above. When the encoded data includes video, the video decoder 30 included in the terminal device is prioritized to perform video decoding. ‘When the encoded data includes audio, an audio decoder included in the terminal device is prioritized to perform audio decoding processing. For a terminal device with its display, for example, smart phone or Pad 3108, computer or laptop 3110, network video recorder (NVR) digital video recorder (DVR) 3112, TV 3114, personal digital assistant (PDA) 3122, or vehicle mounted device 3124, the terminal device can feed the decoded data to its display. For a terminal device equipped with no display, for example, STB 3116, video conference system 3118, or video surveillance system 3120, an external display 3126 is contacted therein to receive and show the decoded data. When each device in this system performs encoding or decoding, the picture encoding device or the picture decoding device, as shown in the above-mentioned embodiments, can be used. FIG. 11 is a diagram showing a structure of an example of the terminal device 3106. After the terminal device 3106 receives stream from the capture device 3102, the protocol proceeding unit 3202 analyzes the transmission protocol of the stream. The protocol includes but not limited to Real Time Streaming Protocol (RTSP), Hyper Text Transfer Protocol (HTTP), HTTP Live streaming protocol (HLS), MPEG-DASH, Real-time Transport protocol (RTP), Real Time Messaging Protocol (RTMP), or any kind of combination thereof, or the like. After the protocol proceeding unit 3202 processes the stream, stream file is generated. The file is outputted to a demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into the encoded audio data and the encoded video data. As described above, for some practical scenarios, for example in the video conference system, the encoded audio data and the encoded video data are not multiplexed. In this situation, the encoded data is transmitted to video decoder 3206 and audio decoder 3208 without through the demultiplexing unit 3204. Via the demultiplexing processing, video elementary stream (ES), audio ES, and optionally subtitle are generated. The video decoder 3206, which includes the video decoder 30 as explained in the above mentioned embodiments, decodes the video ES by the decoding method as shown in the above-mentioned embodiments to generate video frame, and feeds this data to the synchronous unit 3212. The audio decoder 3208, decodes the audio ES to generate audio frame, and feeds this data to the synchronous unit 3212. Alternatively, the video frame may store in a buffer (not shown in FIG. 11) before feeding it to the synchronous unit 3212. Similarly, the audio frame may store in a buffer (not shown in FIG. 11) before feeding it to the synchronous unit 3212. The synchronous unit 3212 synchronizes the video frame and the audio frame, and supplies the video / audio to a video / audio display 3214. For example, the synchronous unit 3212 synchronizes the presentation of the video and audio information. Information may code in the syntax using time stamps concerning the presentation of coded audio and visual data and time stamps concerning the delivery of the data stream itself. If subtitle is included in the stream, the subtitle decoder 3210 decodes the subtitle, and synchronizes it with the video frame and the audio frame, and supplies the video / audio / subtitle to a video / audio / subtitle display 3216. The present invention is not limited to the above-mentioned system, and either the picture encoding device or the picture decoding device in the above-mentioned embodiments can be incorporated into other system, for example, a car system. Mathematical Operators The mathematical operators used in this application are similar to those used in the C programming language. However, the results of integer division and arithmetic shift operations are defined more precisely, and additional operations are defined, such as exponentiation and real-valued division. Numbering and counting conventions generally begin from 0, e.g., "the first" is equivalent to the O-th, "the second" is equivalent to the 1-th, etc. Arithmetic operators The following arithmetic operators are defined as follows: + Addition Subtraction (as a two-argument operator) or negation (as a unary prefix operator) * Multiplication, including matrix multiplication Exponentiation. Specifies x to the power of y. In other contexts, such notation is used for superscripting not intended for interpretation as exponentiation. Integer division with truncation of the result toward zero. For example, 7 / 4 and =7 / —4 are truncated to 1 and =7 / 4 and 7 / —4 are truncated to —1. Used to denote division in mathematical equations where no truncation or rounding is intended. Xx Used to denote division in mathematical equations where no truncation or rounding y is intended. y f(i) The summation of f{ i ) with i taking all integer values from x up to and including y. pa i=x Modulus. Remainder of x divided by y, defined only for integers x and y with x >= 0 ed andy > 0, ? andy x%y Logical operators The following logical operators are defined as follows: x && y Boolean logical "and" of x and y x||y Boolean logical "or" of x and y Boolean logical "not" x ?vy:z Ifxis TRUE or not equal to 0, evaluates to the value of y; otherwise, evaluates to the value of z. Relational operators The following relational operators are defined as follows: pe? Greater than >= Greater than or equal to < Less than <= Less than or equal to Equal to I= Not equal to When a relational operator is applied to a syntax element or variable that has been assigned the value "na" (not applicable), the value "na" is treated as a distinct value for the syntax element or variable. The value "na" is considered not to be equal to any other value. Bit-wise operators The following bit-wise operators are defined as follows: & Bit-wise "and". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. Bit-wise "or". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. Bit-wise "exclusive or". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. x>>y Arithmetic right shift of a two's complement integer representation of x by y binary digits. This function is defined only for non-negative integer values of y. Bits shifted into the most significant bits (MSBs) as a result of the right shift have a value equal to the MSB of x prior to the shift operation. x <<vy Arithmetic left shift of a two's complement integer representation of x by y binary digits. This function is defined only for non-negative integer values of y. Bits shifted into the least significant bits (LSBs) as a result of the left shift have a value equal to 0. Assignment operators The following arithmetic operators are defined as follows: Assignment operator ++ Increment, i.e., x+ + is equivalent to x = x + 1; when used in an array index, evaluates to the value of the variable prior to the increment operation. Decrement, i.e., x— — is equivalent to x = x — 1; when used in an array index, evaluates to the value of the variable prior to the decrement operation. += Increment by amount specified, i.e., x += 3 is equivalent to x = x + 3, and x += (-3) is equivalent to x =x + (3). Decrement by amount specified, i.e., x —= 3 is equivalent to x =x — 3, and x —= (3) is equivalent to x =x — (3). Range notation The following notation is used to specify a range of values: x =vy..z x takes on integer values starting from y to z, inclusive, with x, y, and z being integer numbers and z being greater than y. Mathematical functions The following mathematical functions are defined: x >= 0 x<0 Abs(x)= {x Asin( x) the trigonometric inverse sine function, operating on an argument x that is in the range of —1.0 to 1.0, inclusive, with an output value in the range of —n+2 to +2, inclusive, in units of radians Atan( x) the trigonometric inverse tangent function, operating on an argument x, with an output value in the range of —1+2 to +2, inclusive, in units of radians Atan (1) x>0 X<0 && y>=0 X<0 && v <0 Aun(L) +z Atan2(y, x)= | Atan(¥) - = ks +3 x==0&& y>=0 otherwise i Ceil( x) the smallest integer greater than or equal to x. Cliply(x)=Clip3(0, (1 << BitDepthy)—1,x) Cliple( x)=Clip3(0,(1 << BitDepthc)—1,x) z<XxX z>y otherwise XxX Clip3( x,y,z) = fv Zz Cos(x) the trigonometric cosine function operating on an argument x in units of radians. Floor( x) the largest integer less than or equal to x. b—-a>=d / 2 a-b>d / 2 c otherwise c+d GetCurtMsb( a,b, c,d) = fc -d c Ln(x) the natural logarithm of x (the base-e logarithm, where e is the natural logarithm base constant 2.718281 828..). Log2( x) the base-2 logarithm of x. Logl0( x ) the base-10 logarithm of x. x<=y X Min(xy)= { X>y x>=y x<y Max(x,v)= { 3 Round( x ) = Sign( x ) * Floor( Abs( x) + 0.5) x>0 x == 0 x <0 1 Sign(x)= [s —1 Sin( x) the trigonometric sine function operating on an argument x in units of radians Sqrt( x) = Vx Swap(x,y)=(Vy,Xx) Tan(x) the trigonometric tangent function operating on an argument X in units of radians Order of operation precedence When an order of precedence in an expression is not indicated explicitly by use of parentheses, the following rules apply: Operations of a higher precedence are evaluated before any operation of a lower precedence. Operations of the same precedence are evaluated sequentially from left to right. The table below specifies the precedence of operations from highest to lowest; a higher position in the table indicates a higher precedence. For those operators that are also used in the C programming language, the order of precedence used in this Specification is the same as used in the C programming language. Table: Operation precedence from highest (at top of table) to lowest (at bottom of table) operations (with operands x, y, and z Hep! tym "Ix", "=x" (as a unary prefix operator) x "Ry tx yt tx yt, ol "x % y" "x+y", "x—y" (as a two-argument operator), " | $1) i= "<< yx >> y "yt Tx <= yx Sy" x >= y tg == yh ix l= yt i & y x |g" w && y" iy “ "x?y:z" gy" tg = yt Ny bm yt My = yt Text description of logical operations In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0) statement 0 else if( condition 1) statement 1 else / * informative remark on remaining condition * / statement n may be described in the following manner: ... as follows / ... the following applies: If condition 0, statement O Otherwise, if condition 1, statement 1 Otherwise (informative remark on remaining condition), statement n. Each "If ... Otherwise, if ... Otherwise, ..." statement in the text is introduced with "... as follows" or "... the following applies" immediately followed by "If ... ". The last condition of the "If ... Otherwise, if ... Otherwise, ..." is always an "Otherwise, ...". Interleaved "If ... Otherwise, if ... Otherwise, ..." statements can be identified by matching "... as follows" or ". the following applies” with the ending "Otherwise, ...". In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0a && condition Ob) statement 0 else if( condition 1a || condition 1b) statement 1 else statement n may be described in the following manner: ... as follows / ... the following applies: If all of the following conditions are true, statement 0: condition Oa condition Ob Otherwise, if one or more of the following conditions are true, statement 1: condition la condition 1b Otherwise, statement n In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0) statement 0 if( condition 1) statement 1 may be described in the following manner: When condition 0, statement 0 When condition 1, statement 1. Embodiments, e.g. of the encoder 20 and the decoder 30, and functions described herein, e.g. with reference to the encoder 20 and the decoder 30, may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over communication media as one or more instructions or code and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and / or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium. By way of example, and not limiting, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer- readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media. Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term “processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and / or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements. The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and / or firmware. Further embodiments of the present invention are provided in the following. It should be noted that the numbering used in the following section does not necessarily need to comply with the numbering used in the previous sections. Embodiment 1: A method of inter prediction of a block of a picture, wherein signaling of weighted prediction parameters and enabling of non-rectangular inter prediction is performed for a group of predicted blocks, the method comprising: obtaining an inter prediction mode parameters for a block, wherein the obtaining comprises the check of whether a non-rectangular inter prediction mode is enabled for the group of blocks that comprises the predicted block; and obtaining weighted prediction parameters associated with the block and an inter prediction mode parameters for a block with respect to the reference picture being indicated for the block and weighted prediction parameters specified for the group of blocks. Embodiment 2: A method of embodiment 1, wherein enabling of non-rectangular inter prediction is performed by indicating the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) that is greater than 1. Embodiment 3: A method of embodiment 1 or 2, wherein non-rectangular inter prediction is inferred to be disabled when weighted prediction parameters specifies enabled weighted prediction for at least one reference index. Embodiment 4: A method of any embodiments 1 to 3, wherein a group of blocks is a picture and both weighted prediction parameters and enabling of inter prediction non-rectangular mode parameters are indicated in picture header. Embodiment 5: A method of any embodiments 1 to 4, wherein a group of blocks is a slice and both weighted prediction parameters and enabling of inter prediction non-rectangular mode parameters are indicated at the slice header. Embodiment 6: A method of any embodiments 1 to 5, wherein inter prediction mode parameters comprise reference index used to determine the reference picture and motion vector information used to determine position of the reference block in the reference picture. Embodiment 7: A method of any embodiments 1 to 6, where non-rectangular merge mode is a triangular partitioning mode. Embodiment 8: A method of any embodiments 1 to 7, where non-rectangular merge mode is a GEO mode. Embodiment 9: A method of any embodiments 1 to 8, wherein weighted prediction is a slice- level luminance compensation mechanism (such as global weighted prediction). Embodiment 10: A method of any embodiments 1 to 9, wherein weighted prediction is a block- level luminance compensation mechanism, such as local illumination compensation (LIC). Embodiment 11: A method of any embodiments 1 to 10, wherein weighted prediction parameters comprise: a set of flags indicating whether weighted prediction is applied to luma and chroma components of the predicted block; Linear model parameters \alpha and \betta specifying the linear transformation of the values of the predicted block. In a first aspect of the present application, as shown in Fig. 12, an inter prediction method 1200 is disclosed, which comprises: $1201: determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; $1202: obtaining one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and $1203: obtaining prediction value of a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In a feasible implementation, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In a feasible implementation, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In a feasible implementation, determining the non-rectangular inter prediction mode is allowed, comprising: indicating the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In a feasible implementation, the group of blocks consists of a picture, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a picture header of the picture. In a feasible implementation, the group of blocks consists of a slice, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a slice header of the slice. In a feasible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode. In a feasible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In a feasible implementation, the weighted prediction parameters are used for a slice-level luminance compensation. In a feasible implementation, the weighted prediction parameters are used for a block-level luminance compensation. In a feasible implementation, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. In a second aspect of the present application, an apparatus 1300 for inter prediction, as shown in Fig. 13, which comprises: a non-transitory memory 1301 having processor-executable instructions stored thereon; and a processor 1302, coupled to the memory1301 configured to execute the processor-executable instructions to facilitate any one of feasible implementations in the first aspect of the present application. In a third aspect of the present application, a bitstream for inter prediction, comprising: indicating information for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; and one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks, wherein prediction value of a current block is obtained based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In a feasible implementation, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In a feasible implementation, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In a feasible implementation, the indicating information comprises the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In a feasible implementation, the group of blocks consists of a picture, and wherein the weighted prediction parameters and the indicating information are in a picture header of the picture. In a feasible implementation, the group of blocks consists of a slice, and wherein the weighted prediction parameters and the indicating information are in a slice header of the slice. In a feasible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode. In a feasible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In a feasible implementation, the weighted prediction parameters are used for a slice-level luminance compensation. In a feasible implementation, the weighted prediction parameters are used for a block-level luminance compensation. In a feasible implementation, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. In a fourth aspect of the present application, as shown in Fig. 14, an inter prediction apparatus 1400 is disclosed, which comprises: a determining module 1401, configured to determine whether a non-rectangular inter prediction mode is allowed for a group of blocks; an obtaining module 1402, configured to obtain one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and a predicting module 1403, configured to obtain prediction value of a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. In a feasible implementation, the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. In a feasible implementation, the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. In a feasible implementation, the determining module 1401 is specifically configured to: indicate the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. In a feasible implementation, the group of blocks consists of a picture, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a picture header of the picture. In a feasible implementation, the group of blocks consists of a slice, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a slice header of the slice. In a feasible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode. In a feasible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode. In a feasible implementation, the weighted prediction parameters are used for a slice-level luminance compensation. In a feasible implementation, the weighted prediction parameters are used for a block-level luminance compensation. In a feasible implementation, the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. Methods of the prior art could be summarized in the following list of aspects: Aspect 1. An inter prediction method, comprising: determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; obtaining one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and obtaining prediction value of a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. Aspect 2. The method of aspect 1, wherein the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non-rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. Aspect 3. The method of aspect 1 or 2, wherein the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. Aspect 4. The method of any one of aspects 1 to 3, wherein determining the non-rectangular inter prediction mode is allowed, comprising: Indicating the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. Aspect 5. The method of any one of aspects 1 to 4, wherein the group of blocks consists of a picture, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a picture header of the picture. Aspect 6. The method of any one of aspects 1 to 4, wherein the group of blocks consists of a slice, and wherein the weighted prediction parameters and indicating information for determining the non-rectangular inter prediction mode is allowed are in a slice header of the slice. Aspect 7. The method of any one of aspects 1to 6, wherein the non-rectangular inter prediction mode is a triangular partitioning mode. Aspect 8. The method of any one of aspects 1 to 6, wherein the non-rectangular inter prediction mode is a geometric (GEQ) partitioning mode. Aspect 8a. The method of any one of aspects 1 to 8, wherein syntax elements related to number of candidates for merge mode (indicating information for determining the non-rectangular inter prediction) are signaled in the sequence parameter set (SPS) Aspect 8b. The method of any one of aspects 1 to 8a, wherein picture header is signaled in slice header when a picture comprises just one slice. Aspect 8c. The method of any one of aspects 1 to 8b, wherein picture header is signaled in slice header when a picture comprises just one slice. Aspect 8d. The method of any one of aspects 1 to 8c, wherein picture parameter set comprises a flag, the value of which defines whether weighted prediction parameters are present in picture header or in a slice header. Aspect 8e. The method of any one of aspects 1 to 8d, wherein a flag in a picture header indicates whether a slice of non-intra type is present and whether inter prediction mode parameters are signaled for this slice. Aspect 9. The method of any one of aspects 1 to 8, wherein the weighted prediction parameters are used for a slice-level luminance compensation. Aspect 10. The method of any one of aspects 1 to 8, wherein the weighted prediction parameters are used for a block-level luminance compensation. Aspect 11. The method of any one of aspects 1 to 10, wherein the weighted prediction parameters comprises: flags indicating whether the weighted prediction is applied to luma and / or chroma components of a prediction block; and linear model parameters specifying a linear transformation of a value of the prediction block. Aspect 12. An apparatus for inter prediction, comprising: a non-transitory memory having processor-executable instructions stored thereon; and a processor, coupled to the memory, configured to execute the processor-executable instructions to facilitate any one of aspects 1-11. Aspect 13. A bitstream for inter prediction, comprising; indicating information for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; and one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks, wherein prediction value of a current block is obtained based on the one or more inter prediction mode parameters and weighted prediction parameters, wherein one of the inter prediction mode parameters indicates reference picture information for the current block, and wherein the group of blocks comprises the current block. Aspect 14. The bitstream of aspect 13, wherein the reference picture information comprises whether weighted prediction is enabled for a reference picture index, and wherein the non- rectangular inter prediction mode is disabled in the event that weighted prediction is enabled. Aspect 15. The bitstream of aspect 13 or 14, wherein the non-rectangular inter prediction mode is enabled in the event that weighted prediction is disabled. Aspect 16. The bitstream of any one of aspects 13 to 15, wherein the indicating information comprises the maximum number of triangular merge candidates (MaxNumTriangleMergeCand) is greater than 1. Aspect 17. The bitstream of any one of aspects 13 to 16, wherein the group of blocks consists of a picture, and wherein the weighted prediction parameters and the indicating inform...

Claims

CLAIMS 1.A method of obtaining a maximum number of geometric partitioning merge mode candidates for video decoding, wherein the method comprises: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; obtaining a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator.

2. The method of claim 1, wherein the threshold is 2. 3.The method of claim 1 or 2, wherein the method further comprises: setting the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator is equal to the preset value.

4. The method of any one of claims 1 to 3, wherein the method further comprises: setting the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator is not equal to the preset value.

5. The method of any one of claims 1 to 4, wherein the preset value is 1.

6. The method of any one of claims 1 to 5, wherein the step of obtaining the value of the second indicator is performed after the step of obtaining the value of the first indicator.

7. The method of claim 6, wherein the value of the second indicator is parsed from a sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold.

8. The method of any one of claims 1 to 7, wherein the value of the second indicator is obtained from a sequence parameter set, SPS, of the bitstream.

9. The method of any one of claims 1 to 8, wherein the value of the third indicator is obtained from a sequence parameter set, SPS, of the bitstream.

10. A video decoding apparatus, wherein the video decoding apparatus comprises: a receiving module, which is configured to obtain a bitstream for a video sequence; an obtaining module, which is configured to obtain a value of a first indicator according to the bitstream, wherein the first indicator represents the maximum number of merging motion vector prediction, MVP, candidates; and wherein the obtaining module is configured to obtain a value of a second indicator according to the bitstream, wherein the second indicator represents whether a geometric partition based motion compensation is enabled for the video sequence; a parsing module, which is configured to parse a value of a third indicator from the bitstream, when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, wherein the third indicator represents the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. 11.The video decoding apparatus of claim 10, wherein the obtaining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 2, when the value of the first indicator is equal to the threshold and when the value of the second indicator is equal to the preset value.

12. The video decoding apparatus of claim 10 or 11, wherein the obtaining module is configured to set the value of the maximum number of geometric partitioning merge mode candidates to 0, when the value of the first indicator is less than the threshold or when the value of the second indicator is not equal to the preset value.

13. The video decoding apparatus of any one of claims 10 to 12, wherein the threshold is 2.

14. The video decoding apparatus of any one of claims 10 to 13, wherein the preset value is 1.

15. The video decoding apparatus of any one of claims 10 to 14, wherein the step of obtaining the value of the second indicator is performed after the step of obtaining the value of the first indicator.

16. The video decoding apparatus of claim 15, wherein the value of the second indicator is parsed from a sequence parameter set, SPS, of the bitstream, when the value of the first indicator is greater than or equal to the threshold.

17. The video decoding apparatus of any one of claims 10 to 16, wherein the value of the second indicator is obtained from a sequence parameter set, SPS, of the bitstream.

18. The video decoding apparatus of any one of claims 10 to 17, wherein the value of the third indicator is obtained from a sequence parameter set, SPS, of the bitstream.

19. A computer program product comprising a program code for performing the method according to any one of the claims 1 to 9 when executed on a computer or a processor.

20. A decoder, comprising: one or more processors, and a non-transitory computer-readable storage medium coupled to the processors and storing programming for execution by the processors, wherein the programming, when executed by the processors, configures the decoder to carry out the method according to any one of the claims 1 to 9 21. A non-transitory computer-readable medium carrying a program code which, when executed by a computer device, causes the computer device to perform the method of any one ofthe claims 1 to 9.

Images