RU2815734C1 - Method and device for motion information storage - Google Patents

Abstract

FIELD: video encoding.

SUBSTANCE: bitstream is received that contains the encoded data of the current block and a pointer. The current block is divided by a common boundary into the first subblock and the second subblock. The first sub-block corresponds to the first prediction value, and the second sub-block corresponds to the second prediction value. The common boundary represents the dividing line of the geometric partitioning mode. The pointer is extracted from the bit stream by analysis. An angular parameter and a distance parameter are obtained based on the pointer, where the angular parameter specifies the angle index of the geometric partitioning mode, and the distance parameter specifies the distance index of the geometric partitioning mode. The distance between the set of discrete samples in the current block and the common boundary is determined based on the angular parameter and the distance parameter by checking a preset lookup table. The first weighting coefficient is obtained according to the distance. The second weight coefficient is obtained according to the first weight coefficient. The concatenated prediction value for the current block is obtained by using the first prediction value, the second prediction value, the first weight coefficient, and the second weight coefficient.

EFFECT: improved efficiency of video encoding.

39 cl, 24 dwg, 5 tbl

Description

FIELD OF TECHNOLOGY TO WHICH THE INVENTION RELATES

Embodiments of the present application generally relate to the field of video coding and, more specifically, to inter-prediction.

BACKGROUND OF THE ART

Video encoding (video encoding and decoding) is used in a wide range of digital video applications, such as digital broadcast television, video transmission over the Internet and mobile networks, real-time conversational applications such as video chat, video conferencing, DVD and Blu-ray discs, systems for collecting and editing video content and video cameras for security applications.

The amount of video data required to present even a relatively short video can be significant, which can lead to difficulties when the data must be streamed or otherwise transmitted over a communications network with limited bandwidth. Thus, video data is typically compressed before being transmitted over modern telecommunications networks. Video size can also be an issue when the video is stored on a storage device, as memory resources may be limited. Video compression devices often use software and/or hardware at the source to encode video data before transmission or storage, thereby reducing the amount of data required to represent digital video images. The compressed data is then received by the recipient's video decompressor, which decodes the video data. With limited network resources and ever-increasing demands for higher video quality, improved compression and decompression techniques are desired that improve the compression ratio with little or no loss in image quality.

SUMMARY OF THE INVENTION

Embodiments of the present application provide devices and methods for encoding and decoding according to independent claims.

The above and other goals are achieved by the invention according to independent claims. Additional forms of implementation are obvious from the dependent claims, description and figures.

According to a first aspect of the present application, a method for storing motion information is disclosed, the current block is composed of a first sub-block and a second sub-block, the first sub-block and the second sub-block are separated by a common boundary, the first sub-block corresponds to the first traffic information, and the second sub-block corresponds to the second traffic information, wherein the method contains: determining the distance between a set of discrete samples in the current block and a common boundary; and comparing the distance with a threshold to determine that third motion information is stored for the sample set, wherein the third motion information is derived from the first motion information and the second motion information.

In an exemplary embodiment, comparing the distance to a threshold for determining that third motion information is stored for the sample set comprises determining that third motion information is stored for the sample set in the case where the absolute value of the distance is less than or equal to threshold value.

In an exemplary embodiment, in a case in which the absolute value of the distance is greater than a threshold value, the method further comprises: determining that the first motion information is stored for a set of discrete samples in the case in which the distance is positive; or determining that the second motion information is stored for a set of samples, in the case where the distance is negative.

In an exemplary embodiment, the threshold value is predetermined.

In an exemplary embodiment, the threshold is based on a geometric relationship between the common boundary and the horizontal direction or vertical direction.

In an exemplary embodiment, the threshold is based on the angle between the perpendicular direction of the common boundary and the horizontal direction or vertical direction.

In an exemplary embodiment, the threshold is based on the width and/or height of the current block.

In a possible embodiment, the common boundary is determined by an angular parameter and a distance parameter, and before determining the distance between the set of discrete samples in the current block and the common boundary, the method further comprises: determining the angular parameter and the distance parameter.

In an exemplary embodiment, in the decoder, determining the angular parameter and the distance parameter comprises: extracting, by analyzing, the angular parameter and the distance parameter from the bit stream; or extracting, by parsing, a pointer from the bitstream and obtaining an angular parameter and a distance parameter based on the pointer.

In an exemplary embodiment, after determining the angular parameter and the distance parameter, the method further comprises: determining a first computational parameter based on the angular parameter; calculating a temporary angular parameter based on the angular parameter; determining a second computational parameter based on the time angular parameter; and calculating a third calculation parameter based on the angular parameter and the distance parameter.

In an exemplary embodiment, a first computational parameter is determined by checking a preset lookup table according to an angular parameter, and a second computational parameter is determined by checking said lookup table according to a temporary angular parameter, and wherein the first computational parameter and the second computational parameter are a cosine value and a sine value of one and the same angle, respectively.

In a possible implementation, the distance is calculated as follows:

distFromLine=(x+K)*P1+(y+K)*P2-P3,

where P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter, respectively, distFromLine represents the distance, K is a non-negative integer, x represents the horizontal coordinate of the target position in the sample set, y represents the vertical coordinate of the target position in the rectangular a coordinate system where the position of the top left sampled reference of the current block is set as the origin, the right direction is set as the positive horizontal direction, and the down direction is set as the positive vertical direction.

In a possible implementation, K is equal to 1.

In an exemplary embodiment, the target position is predefined in a set of discrete samples.

In an exemplary embodiment, the predetermined position is the top left position of the sample set or the center position of the sample set.

In a possible embodiment, the accuracy of the discrete distance reading is higher than the integer discrete reading; Accordingly, the distance is calculated as follows:

distFromLine=((x<<N)+ K)*P1+((y<<N)+K)*P2-P3,

where 2 ^N represents the reciprocal of the discrete distance reading accuracy.

In a possible implementation, N is equal to 1.

In an exemplary embodiment, the set of samples is a set of luminance samples of the current block.

In an exemplary embodiment, before determining the distance between a set of samples in the current block and a common boundary, the method further comprises: dividing the current block into a plurality of sets of samples, each of the plurality of sets of samples having the same size as the set of samples; or setting the current block as a set of discrete samples.

In an exemplary embodiment, the sample set is a 4x4 sample array.

In an exemplary embodiment, each of the plurality of sets of discrete samples corresponds to each motion information storage module, the motion information storage module is used to store one of the first motion information, the second motion information, and the third motion information.

In an exemplary embodiment, the first subblock and the second subblock are a triangular mesh, a trapezoidal mesh, or an asymmetric rectangular mesh.

In an exemplary embodiment, the first motion information comprises motion information based on the first reference picture list, the second motion information contains motion information based on the second reference picture list, and wherein the third motion information comprises first motion information and second motion information. movement.

Information.

According to a second aspect of the present application, an apparatus for decoding a video stream is disclosed, including a processor and a memory. The memory stores instructions that cause the processor to execute the method according to the first aspect.

According to a third aspect of the present application, an apparatus for encoding a video stream is disclosed, including a processor and a memory. The memory stores instructions that cause the processor to execute the method according to the first aspect.

According to a fourth aspect, there is provided a computer-readable storage medium that stores instructions that, when executed, cause one or more processors to provide encodings of video data. The instructions direct one or more processors to perform the method according to the first aspect.

According to a fifth aspect, the computer program includes program code for performing the method according to the first aspect when executed on a computer.

Details of one or more embodiments are set forth in the accompanying drawings and in the following description. Other features, objects and advantages will be apparent from the description, drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following embodiments, the applications are described in more detail with reference to the accompanying figures and drawings, in which:

FIG. 1A is a block diagram showing an example of a video encoding system configured to implement embodiments of the present application; FIG.

FIG. 1B is a block diagram showing another example of a video encoding system configured to implement embodiments of the present application; FIG.

FIG. 2 is a block diagram showing an example of a video encoder configured to implement embodiments of the present application;

FIG. 3 is a block diagram showing an example of a structure of a video decoder configured to implement embodiments of the present application; FIG.

Fig. 4 is a block diagram illustrating an example of an encoding device or a decoding device;

Fig. 5 is a block diagram illustrating another example of an encoding device or a decoding device;

FIG. 6 is a diagram showing an example of positions of a spatial merging candidate;

FIG. 7 is a diagram showing an example of pairs of candidates considered for redundancy testing of spatial candidates for merging; FIG.

FIG. 8 is a diagram showing an example of motion vector scaling for a temporary fusion candidate; FIG.

Fig. 9 is a diagram showing an example of motion vector storage for a prediction block of size 8×8 luminance samples;

Fig. 10 is a diagram showing an example of inter-prediction based on triangular partitioning;

FIG. 11 is a diagram showing an example of selecting a uni-prediction MV for a triangular partitioning mode; FIG.

Fig. 12 is a diagram showing an example of weighting factors used in the mixing process;

Fig. 13 is a diagram showing an example of motion vector storage for the triangular partitioning mode;

FIG. 14 is a diagram showing an example of another geometric partition; FIG.

FIG. 15 is a diagram showing an example of GEO partitioning parameters;

Fig. 16 is a diagram showing an example of a mixing operation;

FIG. 17 is a diagram showing an example of a lookup table for a mixing operation;

Fig. 18 is a diagram showing an example of a 4x4 motion storage example with an integer position and a half-pixel position;

Fig. 19 is a diagram showing an example of a motion storage method;

Fig. 20 is a block diagram illustrating an example of a method for storing motion information;

FIG. 21 is a block diagram illustrating an example of a motion information storage device;

FIG. 22 is a block diagram showing an exemplary structure of a content delivery system 3100 that implements a content delivery service; FIG.

FIG. 23 is a block diagram showing the structure of an exemplary terminal device.

The following identical reference numerals refer to identical or at least functionally equivalent features unless expressly indicated otherwise.

DETAILED DESCRIPTION OF IMPLEMENTATION OPTIONS

In the following description, reference is made to the accompanying drawings, which form a part of the disclosure and which show by way of illustration specific aspects of embodiments of the application or specific aspects in which embodiments of the present application may be used. It is understood that embodiments of the application may be used in other aspects and contain structural or logical changes not depicted in the figures. Therefore, the following detailed description should not be taken in a limiting sense, and the scope of the present application is determined by the appended claims.

For example, it should be understood that the disclosure in connection with a method described may also be true for a corresponding device or system configured to perform the method, and vice versa. For example, if one or more specific method steps are described, the corresponding apparatus may include one or more blocks (modules), such as functional blocks, for performing the one or more method steps described (e.g., one unit performing one or more steps or multiple blocks, each of which performs one or more of a plurality of steps), even if such one or more blocks are not explicitly described or illustrated in the figures. On the other hand, for example, if a particular device is described in terms of one or more blocks, such as function blocks, the corresponding method may include one step for performing the functionality of one or more blocks (e.g., one step of performing the functionality of one or more modules or a plurality of steps, each of which performs the functionality of one or more of the plurality of modules), even if such one or multiple steps are not expressly described or illustrated in the figures. It is further understood that features of various exemplary embodiments and/or aspects described herein may be combined with each other unless specifically stated otherwise.

Video encoding generally refers to the processing of a sequence of pictures that form a video or video sequence. Instead of the term "snapshot", the term "frame" or "image" can be used interchangeably in the field of video coding. Video encoding (or encoding in a general sense) contains two parts: video encoding and video decoding. Video encoding is performed at the source side, typically involving processing (eg, through compression) of the original video pictures to reduce the amount of data required to represent the video pictures (for more efficient storage and/or transmission). Video decoding is performed at the receiving end and typically involves reverse processing from the encoder to reconstruct video images. Embodiments relating to "coding" of video pictures (or pictures in general) should be understood as relating to either "encoding" or "decoding" of video pictures or corresponding video sequences. The combination of an encoding part and a decoding part is also called CODEC (encoding and decoding).

In the case of lossless video encoding, the original video images can be restored, i.e. Recovered videos are of the same quality as the original videos (assuming there is no transmission loss or other data loss during storage or transmission). In the case of lossy video encoding, further compression is performed, for example through quantization, to reduce the amount of data representing video images that cannot be fully reconstructed in the decoder, i.e. The quality of the restored videos is lower or worse compared to the quality of the original videos.

Several video coding standards belong to the group of “hybrid lossy video codecs” (that is, they combine spatial and temporal sample-domain prediction and 2D transform coding to apply quantization to the transform domain). Each snapshot of a video sequence is usually divided into a set of non-overlapping blocks, and coding is usually performed at the block level. In other words, in an encoder, video is typically processed, i.e. encoded, at the block (video block) level, for example, using spatial (intra-shot) (intra) prediction and/or temporal (inter-shot) (inter) prediction to generate a prediction block. subtracting the prediction block from the current block (the block that is currently being 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 that needs to be transferred (compression), whereas in The decoder reverses processing from the encoder and applies it to the encoded or compressed block to recover the current block for presentation. In addition, the encoder duplicates the decoder's processing loop so that both will generate identical predictions (eg, intra- and inter-prediction) and/or reconstruction for processing, ie encoding, subsequent blocks.

In the following embodiments of the video encoding system 10, the encoder 20 and decoder 30 are described based on Figures 1 to 3.

FIG. 1A is a schematic block diagram illustrating an exemplary encoding system 10, such as a video encoding system 10 (or encoding system 10 for short), which may utilize the techniques of this present application. Video encoder 20 (or encoder 20 for short) and video decoder 30 (or decoder 30 for short) of video encoding system 10 are examples of devices that may be configured to perform techniques in accordance with the various examples described herein.

As shown in FIG. 1A, the encoding system 10 includes a source device 12 configured to provide encoded picture data 21, for example, to a destination device 14 for decoding the encoded picture data 13.

The source device 12 contains an encoder 20 and can additionally, i.e. optionally comprising a snapshot source 16, a preprocessor (or preprocessing module) 18, such as snapshot preprocessor 18, and a communications interface or communications module 22.

The image source 16 may contain or be any type of image capture device, such as a camera for capturing a real image and/or any kind of image generation device, such as a computer graphics processor for generating a computer animated image, or any other device for obtaining and/or providing real a snapshot, a computer-generated snapshot (e.g., screen content, virtual reality (VR) snapshot), and/or any combination thereof (eg, augmented reality (AR) snapshot). The snapshot source can be any type of memory or storage that stores any of the above snapshots.

In contrast to the preprocessor 18 and the processing performed by the preprocessing module 18, the snapshot or snapshot data 17 may also be referred to as a raw snapshot or raw snapshot data 17.

The preprocessor 18 is configured to receive (raw) image data 17 and perform preprocessing of the image data 17 to produce a preprocessed image 19 or preprocessed image data 19. Preprocessing performed by preprocessor 18 may, for example, include cropping, color format conversion (eg, RGB to YCbCr), color correction, or noise reduction. It may be understood that the pre-processing module 18 may be an optional component.

Video encoder 20 is configured to receive pre-processed picture data 19 and provide encoded picture data 21 (further details will be described below, eg based on FIG. 2).

The communication interface 22 of the source device 12 may be configured to receive the encoded image data 21 and to transmit the encoded image data 21 (or any further processed version thereof) via the communication channel 13 to another device, for example, to the recipient device 14 or any other storage or direct recovery device.

The recipient device 14 includes a decoder 30 (eg, video decoder 30) and may additionally, i.e. optionally comprising an interface or communication module 28, a post-processor 32, and a display device 34.

The communication interface 28 of the destination device 14 is configured to receive coded snapshot data 21 (or any further processed version thereof), for example, directly from the source device 12 or from any other source, such as a storage device, such as a coded snapshot data storage device, and provide 21 encoded picture data to decoder 30.

The communication interface 22 and the communication interface 28 may be configured to transmit or receive encoded picture data 21 or encoded data 13 through a direct communication link between the source device 12 and the destination device 14, such as a direct wired or wireless connection, or through any type of network , such as a wired or wireless network or any combination thereof, or any private and public network, or any combination thereof.

The communications interface 22 may, for example, be configured to package the encoded snapshot data 21 into an appropriate format, such as packets, and/or process the encoded snapshot data using any type of transmission encoding or processing for transmission over a communication channel or communication network.

The communication interface 28, constituting a counterpart to the communication interface 22, may, for example, be configured to receive transmitted data and process the transmission data using any form of appropriate decoding or transmission processing and/or decompression to obtain encoded picture data 21.

Both communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces, as shown by the arrow for communication channel 13 in FIG. 1A pointing from source device 12 to destination device 14, or as bidirectional communication interfaces, and may be configured, for example, to send and receive messages, for example to establish a connection, to confirm and exchange any other information related to the communication channel and/or data transfer, for example, to transmit encoded snapshot data.

The decoder 30 is configured to receive encoded picture data 21 and provide decoded picture data 31 or decoded picture 31 (further details will be described below, for example based on FIG. 3 or FIG. 5).

The post-processor 32 of the recipient device 14 is configured to post-process decoded snapshot data 31 (also referred to as reconstructed snapshot data), such as decoded snapshot 31, to obtain post-processed snapshot data 33, such as post-processed snapshot 33. Post-processing performed by post-processing module 32 may include, for example, color format conversion (e.g., from YCbCr to RGB), color correction, cropping or resampling, or any other processing, for example, to prepare decoded image data 31 for display, e.g. , using the display device 34.

The display device 34 of the recipient device 14 is configured to receive photo data 33 with post-processing to display the photo, for example, to a user or viewer. The display device 34 may be or include any kind of display for presenting the reconstructed image, such as an integrated or external display or monitor. The displays may, for example, comprise liquid crystal displays (LCDs), organic light emitting diodes (OLEDs), plasma displays, projectors, micro-LED displays, liquid crystal on silicon (LCoS), digital light processor (DLP), or any other displays.

Although FIG. 1A depicts source device 12 and destination device 14 as separate devices, embodiments of the devices may also include both or both functionality, source device 12 or related functionality and destination device 14 or related functionality. In such embodiments, source device 12 or related functionality and destination device 14 or related functionality may be implemented using the same hardware and/or software, or using separate hardware and/or software, or any combination thereof. .

As will be apparent for a specific element based on the description, the presence and (precise) separation of functionality of various modules or functions in the source device 12 and/or destination device 14, as shown in FIG. 1A, may vary depending on the actual device and applications.

Encoder 20 (eg, video encoder 20) or decoder 30 (eg, video decoder 30), or both encoder 20 and decoder 30 may be implemented through processing circuitry as shown in FIG. 1B, such as one or more microprocessors, digital processors, signals (DSP), application programs. application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, video encoding hardware, or any combination thereof. Encoder 20 may be implemented through processing circuitry 46 to implement various modules, as discussed with respect to encoder 20 in FIG. 2 and/or any other encoding system or subsystem described herein. Decoder 30 may be implemented through processing circuitry 46 to implement various modules, as discussed with respect to decoder 30 in FIG. 3 and/or any other decoder system or subsystem described herein. The processing circuit may be configured to perform various operations, as described below. As shown in FIG. 5, if the techniques are partially implemented in software, the apparatus may store instructions for the software on a suitable non-transitory computer readable storage medium and may execute the instructions in hardware using one or more processors to execute 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 include any of a wide range of devices, including any type of portable or stationary device, such as laptop or notebook computers, mobile phones, smartphones, tablets or tablet computers, cameras, desktop computers, sets- set-top boxes, televisions, display devices, digital media players, game consoles, video streaming devices (such as content service servers or content delivery servers), broadcast receiver device, broadcast transmitter device, and the like. and may or may not use any kind of operating system. In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices.

In some cases, the video encoding system 10 illustrated in FIG. 1A is merely an example, and the techniques of the present application may be applied to video encoding settings (e.g., video encoding or video decoding) that do not necessarily involve any communication between encoding and decoding devices. . In other examples, data is retrieved from local memory, transferred over a network, etc. A video encoding apparatus may encode and store data in memory, and/or a video decoding apparatus may retrieve and decode data from memory. In some examples, encoding and decoding are performed by devices that do not communicate with each other, but simply encode data into memory and/or retrieve and decode data from memory.

For convenience of description, embodiments of the application are described herein, for example, with reference to High Efficiency Video Coding (HEVC) or to the Versatile Video Coding (VVC) reference software, a next-generation video coding standard developed by the Joint Collaboration Group on Video Coding (JCT-VC) Group ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Picture Experts Group (MPEG). One skilled in the art will appreciate that embodiments of the application are not limited to HEVC or VVC.

Encoder and encoding method

FIG. 2 shows a schematic block diagram of an exemplary video encoder 20 that is configured to implement the methods of the present application. In the example of FIG. 2, video encoder 20 includes an input 201 (or input interface 201), a remainder calculation module 204, a transform processing module 206, a quantization module 208, an inverse quantization module 210 and an inverse transform processing module 212, a reconstruction module 214, a contour module 220 filter, decoded snapshot buffer (DPB) 230, mode selection module 260, entropy encoding module 270, and output 272 (or output interface 272). The mode selection module 260 may include an inter-prediction module 244, an intra-prediction module 254, and a partitioning module 262. The inter-prediction module 244 may include a motion estimation module and a motion compensation module (not shown). The video encoder 20 shown in FIG. 2 may also be called a hybrid video encoder or a video encoder according to a hybrid video codec.

The remainder calculation unit 204, transform processing unit 206, quantization unit 208, mode selection unit 260 may relate to the forward signal path generation of the encoder 20, while the inverse quantization unit 210, inverse transform processing unit 212, restoration unit 214, buffer 216, loop filter 220, decoded picture buffer (DPB) 230, inter-prediction module 244, and intra-prediction module 254 may relate to generating a return signal path of the video encoder 20, wherein the return signal path of the video encoder 20 corresponds to the signal path of the decoder (see video decoder 30 in FIG. 3). An inverse quantization unit 210, an inverse transform processing unit 212, a restoration unit 214, a loop filter 220, a decoded picture buffer (DPB) 230, an inter-prediction unit 244, and an intra-prediction unit 254 also relate to forming the “Built-in Decoder” of the video encoder 20.

Snapshots and snapshot splitting (snapshots and blocks)

Encoder 20 may be configured to receive, for example, via input 201, a still image 17 (or image data 17), for example, a still image from a sequence of still images 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 simplicity, the following description refers to snapshot 17. Snapshot 17 may also be referred to as the current snapshot or the snapshot to be encoded (particularly in video encoding, to distinguish the current snapshot from other snapshots, such as previously encoded and/or decoded snapshots of the same video sequence, i.e. a video sequence that also contains the current snapshot).

A (digital) image is, or can be viewed as, a two-dimensional array or matrix of discrete samples with intensity values. A discrete sample in an array may also be called a pixel (short form of a snapshot element) or pixel. The number of discrete samples in the horizontal and vertical direction (or axis) of the array or image determines the size and/or resolution of the image. To represent color, three color components are usually used, that is, a photograph can be represented by or include three arrays of discrete samples. In RBG format, or color space, an image contains a corresponding array of discrete samples of red, green, and blue. However, in video encoding, each pixel is typically represented in a luminance-chrominance format or color space, such as YCbCr, which contains a luminance component denoted Y (sometimes L is also used instead) and two chrominance components denoted Cb and Cr. The luminance (or short chroma) component Y represents the brightness or intensity of the gray level (eg, as in a grayscale photo), while the two chrominance (or short chrominance) components Cb and Cr represent the chrominance components or color information. Accordingly, an image in the YCbCr format contains an array of discrete luminance samples of discrete luminance samples (Y) and two arrays of discrete chromaticity samples of chromaticity values (Cb and Cr). RGB photos can be converted or converted to YCbCr format and vice versa, this process is also known as color conversion or conversion. If the image is monochrome, then it can only contain an array of discrete brightness samples. Accordingly, the image can be, for example, an array of discrete luminance samples in a monochrome format or an array of discrete luminance samples and two corresponding arrays of discrete chrominance samples in the color format 4:2:0, 4:2:2 and 4:4:4.

Embodiments of video encoder 20 may include a picture splitter module (not shown in FIG. 2) configured to split picture 17 into multiple (typically non-overlapping) picture blocks 203. These blocks may also be called root blocks, macroblocks (H.264/AVC) or coding tree blocks (CTB) or coding tree units (CTU) (H.265/HEVC and VVC). The shot splitter block may be configured to use the same block size for all shots of a video sequence and a corresponding grid defining the block size, or to vary the block size between shots or subsets or groups of shots, and to split each shot into appropriate blocks.

In additional embodiments, the video encoder may be configured to receive directly a block 203 of a picture 17, such as one, more, or all of the blocks constituting a picture 17. The block of a picture 203 may also be referred to as a block of a current picture or a block of a picture to be encoded.

Similar to snapshot 17, snapshot block 203 is again, or can be viewed as, a two-dimensional array or matrix of samples with intensity values (sample values), albeit smaller in size than snapshot 17. In other words, block 203 may contain, for example, one array of samples samples (for example, a brightness array in the case of a monochrome photograph 17 or an array of brightness or chrominance for a color photograph) or three arrays of discrete samples (for example, a brightness array and two chrominance arrays in the case of a color photograph 17) or any other number and/or type of arrays depending depending on the color format used. The number of samples in the horizontal and vertical direction (or axis) of block 203 determines the size of block 203. Accordingly, the block may, for example, be an MxN array of samples (M-column by N-row) or an MxN array of transform coefficients.

Embodiments of video encoder 20, as shown in FIG. 2, may be configured to encode picture 17 block by block, such that encoding and prediction are performed for each block 203.

Embodiments of video encoder 20, as shown in FIG. 2, may further be configured to split and/or encode a picture using segments (also referred to as video segments), wherein the picture may be divided or encoded using one or more segments (usually without overlap), and each segment may contain one or more blocks (eg, CTUs) or one or more groups of blocks (eg, tiles (H.265/HEVC and VVC) or bricks (VVC)).

Embodiments of video encoder 20, as shown in FIG. 2, may be further configured to partition and/or encode a picture using groups of segments/cells (also called groups of cells) and/or cells (also called video cells), in which the picture may be divided or encoded using one or more groups of segments/cells (usually not overlapping), and each group of segments/cells may contain, for example, one or more blocks (for example, CTU) or one or more cells, with each cell, for example, may be rectangular in shape and may contain one or more blocks (eg, CTUs), such as full or fractional blocks.

Calculating the remainder

Residual calculation module 204 may be configured to calculate residual block 205 (also referred to as residual 205) based on snapshot block 203 and prediction block 265 (additional details about prediction block 265 provided later), for example, by subtracting the sample values of prediction block 265 from the sample values of snapshot block 203, sample by sample (pixel by pixel), to obtain a residual block 205 in the sample domain.

Conversion

The transform processing unit 206 may be configured to apply a transform, such as a discrete cosine transform (DCT) or a discrete sine transform (DST), to the sample values of the residual block 205 to obtain transform coefficients 207 in the transform domain. The transform coefficients 207 may also be referred to as residual transform coefficients and represent the residual block 205 in the transform domain.

Transform processing module 206 may be configured to apply DCT/DST integer approximations such as those specified for H.265/HEVC. Compared to the orthogonal DCT transform, such integer approximations are usually scaled by a certain factor. To preserve the norm of the residual block that is processed by the forward and inverse transformations, additional scaling factors are applied during the transformation process. Scaling factors are typically chosen based on certain constraints, such as scaling factors that are powers of two for shift operations, the bit depth of the transform coefficients, the tradeoff between accuracy and implementation cost, etc. Specific scaling factors, for example, are set for the inverse transform, for example, by the inverse transform processing unit 212 (and the corresponding inverse transform, for example, by the inverse transform processing unit 312 in the video encoder 30), and corresponding scaling factors for the forward transform, for example, by the processing unit 206 transformations in the encoder 20 can be determined accordingly.

Embodiments of video encoder 20 (respectively transform processing module 206) may be configured to output transform parameters, such as the type of transform or transforms, for example, directly or encoded or compressed via entropy encoding module 270, so that, for example, video decoder 30 can receive and use conversion parameters for decoding.

Quantization

Quantization module 208 may be configured to quantize transform coefficients 207 to obtain quantized coefficients 209, for example, by applying scalar quantization or vector quantization. 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 factor may be rounded to an m-bit transform factor during quantization, where n is greater than m. The degree of quantization can be changed by adjusting the 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, while larger quantization step sizes correspond to coarser quantization. The applicable quantization step size may be specified by the quantization parameter (QP). The quantization parameter may, for example, be an index to a predetermined 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. Quantization may include dividing by a quantization step size, and corresponding and/or inverse dequantization, for example by inverse quantization module 210, may include multiplying by a quantization step size. Embodiments according to some standards, such as HEVC, may be configured to use a quantization parameter to determine the quantization step size. Typically, the quantization step size can be calculated based on the quantization parameter using a fixed-point approximation to the equation involving division. Additional scaling factors can be introduced for quantization and dequantization to recover the residual block norm, which can be changed due to the scaling used in the fixed-point approximation of the equation for the quantization step size and the quantization parameter. In one exemplary implementation, inverse transform scaling and dequantization may be combined. Alternatively, customized quantization tables can be used and the encoder can pass them to the decoder, for example in a bitstream. Quantization is a lossy operation in which losses increase as the size of the quantization stages increases.

Embodiments of video encoder 20 (respectively quantization module 208) may be configured to output quantization parameters (QPs), for example, directly or encoded through entropy encoding module 270, so that, for example, video decoder 30 can receive and apply quantization parameters for decoding.

Inverse quantization

The inverse quantization module 210 is configured to apply the inverse quantization of the quantization block 208 to the quantized coefficients to obtain the dequantized coefficients 211, for example, by applying the inverse quantization scheme applied by the quantization block 208 based on or using the same quantization step size as the quantization module 208 . The dequantized coefficients 211 may also be referred to as the dequantized residual coefficients 211 and correspond to, although typically not identical to, the transform coefficients due to quantization loss, to the transform coefficients 207 .

Reverse conversion

The inverse transform processing unit 212 is configured to apply the inverse transform applied by the transform processing unit 206, such as an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST) or other inverse transforms to obtain the reconstructed residual block 213 (or corresponding coefficients 213 dequantization) in the domain of discrete samples. The reconstructed residual block 213 may also be referred to as a transform block 213.

Recovery

The reconstruction module 214 (e.g., the adder 214) is configured to add a transform block 213 (i.e., the reconstructed residual block 213) to the prediction block 265 to obtain the reconstructed block 215 in the sample domain, for example, by adding (sample by sample) the values of the sampled samples recovered by the residual block 213 and the values of the sampled samples of the prediction block 265.

Filtration

Loop filter module 220 (or “loop filter” 220 for short) is configured to filter the reconstructed block 215 to produce a filtered block 221 or, more generally, to filter the reconstructed samples to produce filtered sample values. The edge filter unit, for example, is configured to smooth pixel transitions or otherwise improve video quality. Loop filter module 220 may include one or more loop filters, such as a deblocking filter, an adaptive sample offset (SAO) filter, or one or more other filters, such as an adaptive loop filter (ALF), a noise reduction filter (NSF), or any their combination. In one example, loop filter module 220 may include a deblocking filter, an SAO filter, and an ALF filter. The order of the filtering process can be deblocking filter, SAO and ALF. Another example adds a process called luminance chroma scaling (LMCS) mapping (namely, adaptive in-loop converter). This process is performed before the blocks are disbanded. In another example, the deblock filtering process may also be applied to inner subblock edges, such as affine subblock edges, ATMVP subblock edges, subblock transform (SBT) edges, and intrasubblock (ISP) edges. Although loop filter module 220 is shown in FIG. 2 as a loop filter, in other configurations, loop filter module 220 may be implemented as a post-loop filter. Filtered block 221 may also be referred to as filtered reconstructed block 221.

Embodiments of encoder 20 (respectively, loop filter module 220) may be configured to output loop filter parameters (such as adaptive sample offset information), for example, directly or entropy encoded by entropy encoding block 270 or any other entropy encoding block, so that, for example, decoder 30 can receive and apply the same loop filter parameters for decoding.

Buffer of decoded pictures

Decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or generally reference picture data, for encoding video data by video encoder 20. DPB 230 may be formed by any of a variety of storage devices, such as dynamic random access memory (DRAM). DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded snapshot buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded snapshot buffer 230 may be further configured to store other previously filtered blocks, such as previously reconstructed and filtered blocks 221, the same current snapshot, or different snapshots, such as previously recovered snapshots, and can provide complete previously restored ones, i.e. decoded, snapshots (and associated reference blocks and samples) and/or partially reconstructed current snapshot (and associated reference blocks and samples), for example, for inter-prediction. The decoded picture buffer (DPB) 230 may also be configured to store one or more unfiltered reconstructed blocks 215, or generally unfiltered reconstructed samples, for example if the reconstructed block 215 is not filtered by the loop filter module 220, or any other further processed version of the reconstructed samples. blocks or discrete samples.

Mode selection (Partition and Prediction)

The mode selection module 260 includes a partitioning module 262, an inter-prediction module 244, and an intra-prediction module 254, and is configured to receive or obtain original snapshot data, such as the original block 203 (the current block 203 of the current snapshot 17), and reconstructed snapshot data, such as filtered and/or unfiltered reconstructed samples or blocks of the same (current) snapshot and/or from one or multiple previously decoded snapshots, for example from decoded snapshot buffer 230 or other buffers (for example, a line buffer, not shown). The reconstructed snapshot data is used as reference snapshot data for prediction, such as inter-prediction or intra-prediction, to obtain a prediction block 265 or a predictor 265.

The mode selector 260 may be configured to determine or select a split for the current block prediction mode (including no split) and prediction mode (eg, intra or inter-prediction mode) and generate a corresponding prediction block 265 that is used to calculate the residual block 205 and to restore the recovered block 215.

Embodiments of mode selector 260 may be configured to select a partition and prediction mode (e.g., from those supported or available to mode selector 260) that provides the best match, or in other words, the minimum remainder (minimum remainder means better compression for transmission or storage), or minimum signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which takes into account or balances both. The mode selection module 260 may be configured to determine a partitioning and prediction mode based on rate distortion optimization (RDO), that is, selecting a prediction mode that provides minimal rate distortion. Terms such as “best”, “minimum”, “optimal”, etc. In this context do not necessarily refer to a general "best", "minimum", "optimal", etc., but may also refer to the performance of a termination or selection criterion, such as a value exceeding or falling below a threshold, or other characteristics , potentially leading to “sub-optimal selection” but reducing complexity and processing time.

In other words, partitioner 262 may be configured to partition a snapshot from a video sequence into a sequence of coding tree units (CTUs), and CTU 203 may be further partitioned into smaller block sections or sub-blocks (which form blocks again), for example, iteratively with using quadrant partitioning (QT), binary partitioning (BT), or ternary tree partitioning (TT), or any combination thereof, and to perform, for example, a prediction for each of the block or sub-block partitions, wherein selecting a mode includes selecting a tree structures of the divided block 203, and prediction modes are applied to each of the splits or subblocks of the block.

Next, the partitioning (e.g., through partitioning module 260) and prediction processing (via inter-prediction module 244 and intra-prediction module 254) performed by the exemplary video encoder 20 are explained in more detail.

Splitting

The partitioning module 262 may be configured to partition a snapshot from a video sequence into a sequence of coding tree units (CTUs), and the partitioning module 262 may partition (or partition) the coding tree unit (CTU) 203 into smaller sections, such as smaller blocks of square or rectangular size. . For a photograph that has three arrays of samples, the CTU consists of a block of N × N luminance samples along with two corresponding blocks of chroma samples. The maximum allowed luminance block size in a CTU is defined as 128×128 in the evolving Versatile Video Coding (VVC), but a value other than 128×128 may be specified in the future, such as 256×256. Snapshot CTUs can be clustered/grouped as cell segments/groups, cells or blocks. A cell covers a rectangular area of the photo, and it can be divided into one or more fragments. A fragment consists of a number of rows of CTUs within a cell. A cell that is not divided into several fragments can be called a fragment. However, a fragment is a true subset of a cell and is not called a cell. VVC supports two cell group modes, namely segment/cell group raster scanning mode and rectangular segment mode. In the cell group raster scanning mode, the cell group/segment contains a sequence of cells in a cell-by-cell raster scanning of the image. In rectangular segment mode, a segment contains several image fragments that together form a rectangular area of the image. The fragments within a rectangular segment are in raster scan order of the segment. These smaller blocks (which may also be called subblocks) can be further divided into even smaller sections. This also applies to tree splitting or hierarchical tree splitting, in which the root block, for example at root tree level 0 (hierarchy level 0, depth 0), can be recursively split, for example split into two or more blocks at the next lower tree level. for example nodes at tree level 1 (hierarchy level 1, depth 1), where these blocks can again be divided into two or more blocks of the next lower level, for example tree level 2 (hierarchy level 2, depth 2), etc. . Until the split is completed, for example because a completion criterion is met, such as the maximum tree depth or minimum block size being reached. Blocks that are not further divided are also called leaf blocks or leaf nodes of a tree. A tree that uses a two-partition is called a binary tree (BT), a tree that uses a three-partition is called a triple-tree (TT), and a tree that uses a four-partition is called a quadtree (QT).

For example, a coding tree unit (CTU) may be either a CTB of luminance samples, two corresponding CTBs of chroma samples of a picture that has three arrays of samples, or a CTB of samples of a monochrome picture or picture that is being encoded. using three separate color planes and syntactic structures used to encode discrete samples. Accordingly, a coding tree block (CTB) may be a block of NxN samples for some value of N, such that a partition of a component into a CTB is a partition. A coding unit (CU) may be or comprise a luminance sample encoding unit, two corresponding chroma sample encoding units of a photograph that has three sample arrays, or a monochrome sample encoding unit or a photograph that is encoded using three separate color planes and syntactic structures used to encode discrete samples. Accordingly, a coding block (CB) may be a block of MxN samples for some values of M and N, so that partitioning the CTB into coding blocks is a partitioning.

In embodiments, for example, according to HEVC, a coding tree unit (CTU) can be divided into CUs using a quadtree structure, referred to as a coding tree. The decision of whether to encode a picture region using inter-picture (temporal) or intra-picture (spatial) prediction is made at the leaf CU level. Each leaf CU can be further divided into one, two or four PUs according to the PU partitioning type. Within a single PU, the same prediction process is applied and the corresponding information is passed to the PU-based decoder. After obtaining the residual block by applying a prediction process based on the partitioning type of the PU, the leaf CU can be divided into transform units (TUs) according to a different quadtree structure similar to the encoding tree for the CU.

In embodiments, for example, in accordance with a recent video coding standard currently under development called Versatile Video Coding (VVC), a nested multi-type concatenated square tree using a binary and ternary partitioning structure, for example, used for block partitioning coding tree. In a coding tree structure, within a coding tree unit, a CU can be square or rectangular in shape. For example, a coding tree unit (CTU) is first divided by a quaternary tree. The leaf nodes of the quadtree can then be further divided using a multi-type tree structure. There are four types of splits in a multi-type tree structure: vertical binary split (SPLIT_BT_VER), horizontal binary split (SPLIT_BT_HOR), vertical ternary split (SPLIT_TT_VER), and horizontal ternary split (SPLIT_TT_HOR). The leaf nodes of a multi-type tree are called coding units (CUs), and if the CU is not too large for the maximum length of the transformation, this segmentation is used to predict and process the transformation without any further partitioning. This means that in most cases, CU, PU and TU have the same block size in the quadtree with a nested multi-type tree encoding block structure. An exception occurs when the maximum supported transform length is less than the width or height of the CU color component. VVC develops a unique mechanism for signaling partitioning information in a quadtree with a nested multi-type encoding tree structure. In the signaling mechanism, a coding tree unit (CTU) is considered as the root of a quadtree and is first divided by the quadtree structure. Each leaf node of the quadtree (if it is large enough to be used) is then split into parts using a multi-type tree structure. In a multi-type tree structure, the first flag (mtt_split_cu_flag) is signaled to indicate whether the node is further split; when a node is further partitioned, a second flag (mtt_split_cu_vertical_flag) is signaled to indicate the direction of the split, and then a third flag (mtt_split_cu_binary_flag) is signaled to indicate whether the split is binary or ternary. Based on the values of mtt_split_cu_vertical_flag and mtt_split_cu_binary_flag, the multi-type tree splitting mode (MttSplitMode) of the CU can be obtained by the decoder based on a predefined rule or table. It should be noted that for a certain design, such as 64×64 luma block pipeline and 32×32 chroma pipeline in hardware VVC decoders, TT splitting is prohibited when the luma coding block width or height is greater than 64, as shown in Figure 6 TT splitting is also prohibited if the chrominance block width or height is greater than 32. The pipeline design divides the snapshot into virtual pipeline data units (VPDUs), which are defined as non-overlapping blocks in the snapshot. In hardware decoders, successive VPDUs are processed by multiple pipeline stages simultaneously. The size of the VPDU is roughly proportional to the buffer size in most stages of the pipeline, so it is important to keep the VPDU size small. In most hardware decoders, the VPDU size can be set to the maximum translation block (TB) size. However, in VVC, splitting the ternary tree (TT) and binary tree (BT) can lead to an increase in the size of the VPDU. Additionally, it should be noted that when a portion of a tree node block exceeds the bottom or right boundary of a snapshot, the tree node block is forced to be split until all samples of each encoded CU are within the snapshot boundaries.

As an example, the Intra Sub-Partitions (ISP) tool can split intra-predicted luminance blocks vertically or horizontally into 2 or 4 sub-partitions depending on the block size.

In one example, the mode selection module 260 of the video encoder 20 may be configured to perform any combination of partitioning methods described herein.

As described above, video encoder 20 is configured to determine or select the best or optimal prediction mode from a set of (eg, predetermined) prediction modes. The set of prediction modes may comprise, for example, intra-prediction modes and/or inter-prediction modes.

Intra-prediction

The set of intra-prediction modes may contain 35 different intra-prediction modes, such as non-directional modes such as constant (or average) mode and planar mode, or directional modes such as those defined in HEVC, or may contain 67 different intra-prediction modes , for example, non-directional modes such as DC (or average) mode and planar mode, or directional modes such as those defined for VVC. As an example, several conventional angular intra-prediction modes are adaptively replaced by wide-angle intra-prediction modes for non-square blocks, for example, as defined in VVC. As another example, to avoid division operations for DC prediction, only the long side is used to calculate the average for non-square blocks. And the planar mode intra-prediction results can be further modified by a position-dependent intra-prediction fusion (PDPC) method.

The intra-prediction module 254 is configured to use the reconstructed samples of adjacent blocks of the same current snapshot to generate an intra-prediction block 265 according to the intra-prediction mode of a set of intra-prediction modes.

The intra-prediction module 254 (or more generally the mode selection module 260) is further configured to output intra-prediction parameters (or more generally information indicating the selected intra-prediction mode for a block) to the entropy encoding module 270 in the form of a syntax elements 266 for inclusion in the encoded picture data 21 so that, for example, video decoder 30 can receive and use prediction parameters for decoding.

Inter-prediction

The set (or possibly) of inter-prediction modes depends on the available reference pictures (i.e. previous, at least partially decoded pictures, e.g. stored in the DBP 230) and other inter-prediction parameters, for example whether the entire reference picture is used or just a portion, e.g., window search area around the area of the current block, reference snapshot to find the best reference block match, and/or, e.g., whether pixel interpolations are applied, e.g., half/half-pixel, quarter-pixel, and/or 1/ 16 pixels or not.

In addition to the above prediction modes, skip mode and direct mode can be used.

The inter-prediction module 244 may include a motion estimation (ME) module (not shown in FIG. 2) and a motion compensation (MC) module (both not shown in FIG. 2). The motion estimation module may be configured to receive or receive a snapshot block 203 (current snapshot block 203 of the current snapshot 17) and a decoded snapshot 231, or at least one or a plurality of previously reconstructed blocks, such as reconstructed blocks of one or more many others. /various previously decoded images 231 for motion estimation. For example, the video sequence may contain the current picture and previously decoded pictures 231, or in other words, the current picture and previously decoded pictures 231 may be part of or form a sequence of pictures making up the video sequence.

Encoder 20 may, for example, be configured to select a reference block from a plurality of reference blocks of the same or different pictures from a 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 interrelated prediction parameters in the motion estimation module. This displacement is also called motion vector (MV).

The motion compensation module is configured to receive, for example, an inter-prediction parameter and perform inter-prediction based on or using the inter-prediction parameter to obtain an inter-prediction block 265. The motion compensation performed by the motion compensation block may include sampling or generating a prediction block based on a motion vector/block determined by motion estimation, possibly performing interpolation to sub-pixel precision. Interpolation filtering can generate additional pixel samples from known pixel samples, thereby potentially increasing the number of candidate prediction blocks that can be used to encode a snapshot block. After receiving the motion vector for the current shot block PU, the motion compensation module can find the prediction block pointed to by the motion vector in one of the reference shot lists.

The motion compensation module may also generate syntax elements associated with blocks and video segments for use by video decoder 30 when decoding the picture blocks of a video segment. In addition to or as an alternative to segments and corresponding syntax elements, groups of cells and/or cells and corresponding syntax elements may be generated or used.

Entropy coding

The entropy encoding module 270 is configured to employ, for example, an entropy encoding algorithm or scheme (e.g., a variable length coding (VLC) scheme, a context adaptive VLC (CAVLC) scheme, an arithmetic encoding scheme, binarization, a context adaptive binary arithmetic encoding ( CABAC) based on the syntax of context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy encoding (PIPE), or other entropy encoding method or technique) or bypass (uncompressed) with respect to quantized coefficients 209, inter-prediction parameters, intra-prediction parameters, loop filter parameters, and/or other syntax elements to obtain encoded picture data 21, which may be output via pin 272, for example in the form of an encoded bitstream 21, so that, for example, video decoder 30 can receive and use these parameters to decoding. The encoded bitstream 21 may be transmitted to video decoder 30 or stored in memory for later transmission or retrieval by video decoder 30.

Other changes to the structure of video encoder 20 may be used to encode the video stream. For example, non-transform encoder 20 may quantize the residual signal directly without transform processing unit 206. In another implementation, encoder 20 may have a quantization module 208 and an inverse quantization module 210 combined into a single unit.

Decoder and decoding method

Figure 3 shows an example of a video decoder 30 that is configured to implement the methods of the present application. Video decoder 30 is configured to receive coded picture data 21 (e.g., coded bitstream 21), such as encoded by encoder 20, to obtain a decoded picture 331. The coded picture data or coded bitstream contains information for decoding the coded picture data, such as data that represents snapshot blocks of an encoded video segment (and/or cells or groups of cells) and associated syntactic elements.

In the example of FIG. 3, decoder 30 includes an entropy decoding module 304, an inverse quantization module 310, an inverse transform processing module 312, a reconstruction module 314 (eg, adder 314), a loop filter 320, a decoded picture buffer (DPB) 330, a module 360 mode application, inter-prediction module 344 and intra-prediction module 354. Inter-prediction module 344 may be or include a motion compensation module. Video decoder 30 may, in some examples, perform a decoding step that is generally the reverse of the encoding step described with respect to video encoder 100 in FIG. 2.

As described with respect 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 snapshot buffer (DPB) 230, the inter-prediction unit 344, and the intra-prediction unit 354 are also related to the generation of " built-in decoder" of the 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 restoration unit 314 may be identical in function to the restoration unit 214, loop filter 320 may be identical in function to loop filter 220, and decoded snapshot buffer 330 may be identical in function to decoded snapshot buffer 230. Therefore, the explanations provided for the corresponding blocks and functions of the video encoder 20 apply correspondingly to the corresponding blocks and functions of the video decoder 30.

Entropy Decoding

Entropy decoding module 304 is configured to parse bit stream 21 (or generally encoded snapshot data 21) and perform, for example, entropy decoding on coded snapshot data 21 to obtain, for example, quantized coefficients 309 and/or decoded encoding parameters (not shown in FIG. 3), e.g., any or all of inter-prediction parameters (eg, reference shot index and motion vector), intra-prediction parameter (eg, index or intra-prediction mode), transform parameters, quantization parameters , loop filter parameters and/or other syntactic elements. Entropy decoding module 304 may be configured to employ decoding algorithms or schemes corresponding to encoding schemes as described with respect to entropy encoding module 270 of encoder 20. Entropy decoding module 304 may be further configured to provide inter-prediction parameters, an intra-prediction parameter and/or other syntax elements to module 360 for applying the mode and other parameters to other modules of decoder 30. Video decoder 30 may receive syntax elements at the video segment level and/or video block level. In addition to or as an alternative to segments and corresponding syntactic elements, groups of cells and/or cells and corresponding syntactic elements may be accepted and/or used.

Inverse quantization

Inverse quantization module 310 may be configured to receive quantization parameters (QPs) (or, more generally, information related to inverse quantization) and quantized coefficients from encoded snapshot data 21 (e.g., by parsing and/or decoding, e.g., by entropy decoding module 304) and apply, based on the quantization parameters, inverse quantization to 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 using a quantization parameter determined by video encoder 20 for each video block in a video segment (or cell or group of cells) to determine the degree of quantization and likewise the degree of inverse quantization to be applied.

Reverse conversion

The inverse transform processing unit 312 may be configured to receive the dequantized coefficients 311, also referred to as transform coefficients 311, and apply a transform to the dequantized coefficients 311 to obtain reconstructed sample domain residual blocks 213. The reconstructed residual blocks 213 may also be referred to as transform blocks 313. The conversion may be an inverse transform, such as an inverse DCT, an inverse DST, an inverse integer transform, or a fundamentally similar inverse transform process. The inverse transform processing module 312 may be further configured to receive transform parameters or corresponding information from the encoded snapshot data 21 (e.g., by parsing and/or decoding, e.g., by entropy decoder 304) to determine a transform to be applied to dequantized coefficients 311.

Recovery

The reconstruction module 314 (e.g., the adder 314) may be configured to add the reconstructed residual block 313 to the prediction block 365 to obtain the reconstructed block 315 in the sample domain, for example, by adding the sample values of the reconstructed residual block 313 and the block sample values 365 predictions.

Filtration

A loop filter module 320 (either in the encoding loop or after the encoding loop) is configured to filter the reconstructed block 315 to produce a filtered block 321, for example, to smooth pixel transitions or otherwise improve video quality. Loop filter module 320 may include one or more loop filters, such as a deblocking filter, an adaptive sample offset (SAO) filter, or one or more other filters, such as an adaptive loop filter (ALF), a noise reduction filter (NSF), or any their combination. In one example, loop filter module 220 may include a deblocking filter, an SAO filter, and an ALF filter. The order of the filtering process can be block deblocking filter, SAO and ALF. Another example adds a process called luminance chroma scaling (LMCS) mapping (namely, adaptive in-loop converter). This process is performed before the blocks are disbanded. In another example, the deblock filtering process may also be applied to inner subblock edges, such as affine subblock edges, ATMVP subblock edges, subblock transform (SBT) edges, and intrasubblock (ISP) edges. Although loop filter module 320 is shown in FIG. 3 as a loop filter, in other configurations, loop filter module 320 may be implemented as a post-loop filter.

Buffer of decoded pictures

The decoded video blocks 321 of pictures are then stored in a decoded picture buffer 330, which stores the decoded pictures 331 as reference pictures for subsequent motion compensation for other pictures and/or for display output, respectively.

The decoder 30 is configured to output the decoded picture 311, for example, through an output 312 for presentation or viewing to a user.

Prediction

The inter-prediction module 344 may be identical to the inter-prediction module 244 (specifically, the motion compensation module), and the intra-prediction module 354 may be identical to the inter-prediction module 254 in function, and makes partitioning or partitioning decisions and performs prediction on based on partitioning and/or prediction parameters or corresponding information received from the encoded image data 21 (eg, through analysis and/or decoding, eg, through entropy decoding unit 304). Mode application module 360 may be configured to perform prediction (intra- or inter-prediction) for each block based on the reconstructed snapshots, blocks, or corresponding samples (filtered or unfiltered) to obtain prediction block 365.

When a video segment is encoded as an intra-encoded segment (I), the intra-prediction module 354 of the mode applying module 360 is configured to generate a prediction block 365 for the snapshot block of the current video segment based on the intra-prediction signal mode and data from previously decoded current snapshot blocks. When a video is encoded with an inter-encoding (ie, B or P) segment, an inter-prediction module 344 (eg, a motion compensation module) of the mode applying module 360 is configured to create prediction blocks 365 for the video block of the current video. segment based on motion vectors and other syntax elements obtained from entropy decoding module 304. For inter-prediction, prediction blocks can be created from one of the reference pictures in one of the reference picture lists. Video decoder 30 may create 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 used for or through embodiments using groups of cells (e.g., groups of video cells ) and/or cells (eg, video cells) in addition to or alternatively to segments (eg, video segments), for example, video may be encoded using groups of I, P or B cells and/or cells.

The mode applying module 360 is configured to determine prediction information for a video block of the current video segment by analyzing motion vectors or related information and other syntax elements, and uses the prediction information to create prediction blocks for the current video block to be decoded. For example, mode application module 360 uses some of the received syntax elements to determine the prediction mode (eg, intra or inter prediction) used to encode video blocks of a video segment, type of inter-prediction segment (eg, B-segment, P-segment, or GPB segment ), design information for one or more reference picture lists for a segment, motion vectors for each segment inter-encoded video block, inter-prediction status for each segment inter-encoded video block, and other information for decoding video blocks in the current video segment. The same or similar may be used for or through embodiments using groups of cells (e.g., groups of video cells) and/or cells (e.g., video cells) in addition to or alternatively to segments (e.g., video segments), for example, video may be coded using groups I, P or B cells and/or cells.

Embodiments of video decoder 30, as shown in FIG. 3, may be configured to split and/or decode a picture using segments (also called video segments), wherein the picture may be divided into or decoded using one or more segments (usually without overlap), and each segment may contain one or more blocks (eg, CTU) or one or more groups of blocks (eg, tiles (H.265/HEVC and VVC) or bricks (VVC)).

Embodiments of video decoder 30, as shown in FIG. 3, may be configured to partition and/or decode a picture using groups of segments/cells (also called groups of cells) and/or cells (also called video cells), wherein the picture may be divided into or decoded using one or more groups of segments/cells (usually not overlapping), and each group of segments/cells may contain, for example, one or more blocks (e.g., CTUs) or one or more cells, wherein each cell, for example, may be rectangular in shape and may contain one or more blocks (eg, CTUs), such as full or fractional blocks.

Other embodiments of the video decoder 30 may be used to decode the encoded picture data 21. For example, decoder 30 may produce an output video stream without loop filtering block 320. For example, the non-transform decoder 30 may perform inverse quantization of the residual signal directly without the inversion processing module 312 for certain blocks or frames. In another implementation, video decoder 30 may have an inverse quantization module 310 and an inverse transform processing module 312 combined into one module.

It should be understood that in the encoder 20 and decoder 30, the processing result of the current stage may be further processed and then output to the next stage. For example, after interpolation filtering, motion vector output, or loop filtering, an additional operation, such as cropping or shifting, may be performed on the result of the interpolation filtering, motion vector output, or loop filtering processing.

It should be noted that additional operations may be applied to the resulting current block motion vectors (including, but not limited to, affine mode checkpoint motion vectors, affine mode subblock motion vectors, planar mode motion vectors, ATMVP mode vectors, temporary motion vectors, and the like) . For example, the value of a motion vector is limited to a predetermined range according to its representing bit. If the representing bit of the motion vector is bitDepth, then the range is -2^(bitDepth-1)~2^(bitDepth-1)-1, where "^" means exponentiation. For example, if bitDepth is 16, then the range is -32768~32767; if bitDepth is 18, then the range is -131072~131071. For example, the value of the resulting motion vector (eg, the MV of four 4x4 subblocks in one 8x8 block) is limited such that the maximum difference between the entire portions of the MV of the four 4x4 subblocks is no more than N pixels, eg, no more than 1 pixel. Here are two ways to limit the motion vector according to bitDepth.

FIG. 4 is a schematic diagram of a video encoding apparatus 400 according to an embodiment of the disclosure. Video encoding apparatus 400 is suitable for implementing the disclosed embodiments as described herein. In an embodiment, video encoding 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 encoding device 400 includes input ports 410 (or input ports 410) and receiver (Rx) modules 420 for receiving data; a processor, logical unit, or central processing unit (CPU) 430 for processing data; transmitter (Tx) modules 440 and output ports 450 (or output ports 450) for data transmission; and a memory 460 for storing data. Video encoding device 400 may also include optical-electrical (OE) components and electrical-optical (EO) components connected to input ports 410, receiver modules 420, transmitter modules 440, and output ports 450 to output or receive optical or electrical signals.

The 430 processor is implemented in hardware and software. Processor 430 may be implemented as one or more CPU chips, cores (eg, as a multi-core processor), FPGA, ASIC, and DSP. Processor 430 communicates with input ports 410, receiver modules 420, transmitter modules 440, output ports 450, and memory 460. Processor 430 includes an encoding module 470. Encoding module 470 implements the disclosed embodiments described above. For example, encoding module 470 implements, processes, prepares, or provides various encoding operations. Thus, the resolution of the encoding unit 470 provides a significant improvement in the functionality of the video encoding apparatus 400 and allows the video encoding apparatus 400 to be converted to a different state. Alternatively, encoding module 470 is implemented as instructions stored in memory 460 and executed by processor 430.

Memory 460 may include one or more disks, tape drives, and solid state drives and may be used as an overflow storage device, for storing programs when such programs are selected for execution, and for storing instructions and data that are read during program execution. Memory 460 may be, for example, volatile and/or non-volatile and may be 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 a device 500 that may be used as one or both of a source device 12 and a destination device 14 of FIG. 1 according to an exemplary embodiment .

The processor 502 in the device 500 may be a central processing unit. Alternatively, processor 502 may be any other type of device or plurality of devices capable of manipulating or processing information currently existing or developed in the future. Although the disclosed implementations can be implemented with a single processor, as shown, for example, processor 502, speed and efficiency benefits can be achieved using more than one processor.

Memory 504 in device 500 may be a read-only memory (ROM) or random access memory (RAM) device in an implementation. The memory 504 may be any other suitable type of storage device. Memory 504 may include code and data 506 that is accessed by processor 502 using bus 512. Memory 504 may further include an operating system 508 and application programs 510, application programs 510 including at least one program that allows processor 502 to perform the methods described herein. For example, application programs 510 may include applications 1 through N, which further include a video encoding application that performs the methods described herein.

Device 500 may also include one or more output devices, such as a display 518. The display 518 may be, in one example, a touch display that combines a display with a touch element capable of sensing touch inputs (touch). Display 518 may be coupled to processor 502 via bus 512.

Although depicted here as a single bus, bus 512 of device 500 may be composed of multiple buses. In addition, secondary storage 514 may be directly coupled to other components of device 500 or may be accessible over a network and may comprise a single plug-in unit, such as a memory card, or multiple units, such as multiple memory cards. Thus, device 500 can be implemented in a wide variety of configurations.

The following are some related examples and note that the JVET meeting document JVET-N1002 is used as reference.

I. Prediction with fusion:

The list of potential merger candidates is constructed by including the following five types of potential candidates in the following order:

1) Spatial MVP from spatial neighboring CUs;

2) Temporary MVP from combined CUs;

3) MVP based on history from the FIFO table;

4) Pairwise average MVP;

5) Zero MVs.

The size of the merge list is specified in the fragment header, and the maximum allowed size of the merge list is an integer, for example the number could be 6. For each CU code in merge mode, the index of the best potential merge candidate is encoded. This session presents the process for generating each category of potential merge candidate.

(1) Derivation of spatial potential candidates

For example, from among the potential candidates located at the positions depicted in Figure 6, a maximum of four potential candidates are selected for fusion. Output order: A0, B0, B1, A1 and B2. Position B2 is considered only when any CU of position A0, B0, B1, A1 is not available (for example, because it belongs to another segment or cell) or is intra-coded. After adding a potential candidate to position A1, the addition of the remaining potential candidates is subjected to a redundancy check, which ensures that potential candidates with the same motion information are eliminated from the list. In an exemplary embodiment, only the pairs connected by the arrow in Figure 7 are considered and a candidate is added to the list only if the corresponding candidate used for redundancy testing does not have the same motion information.

(2) Derivation of temporary potential suitable options

For example, only one potentially suitable option is added to the list. Specifically, when inferring this temporary candidate candidate for fusion, a scaled motion vector is inferred based on the fused CU belonging to the fused reference image. The list of reference snapshots that should be used to derive the co-located CU is explicitly specified in the segment header. The scaled motion vector for the temporary potential fusion candidate is obtained as shown by the dashed line in Figure 8, which is scaled from the motion vector of the merged CU using the POC distances, tb and td, where tb is defined as the difference in POC between the reference snapshot of the current snapshot and the current snapshot and td is defined as the POC difference between the reference image of the fused image and the fused image. The reference snapshot index of the temporary merge candidate is set to zero.

It should be noted that POC (Photo Sequence Number) refers to a variable that is associated with each shot, uniquely identifies the associated shot among all the shots in the CVS (coded video sequence), and, when the related shot is to be removed from the decoded snapshot buffer, indicates the position of the associated shot in output order relative to the output order positions of other snapshots in the same CVS that are to be output from the decoded snapshot buffer.

(3) Identification of potentially suitable merger options based on history

History-based MVP (HMVP) merge candidates are added to the merge list after spatial MVPs and TMVPs. The movement information of the previously encoded block is stored in a table and used as MVP for the current CU. A table of many potential HMVP candidates is maintained during the encoding/decoding process. The table is reset when a new CTU row is encountered. Whenever there is an inter-encoded CU not belonging to a sub-block, the corresponding motion information is added to the last table entry as a new potential candidate HMVP. The last few HMVP candidates in the table are checked in order and inserted into the list of potential candidates after the TMVP candidate. A redundancy check is applied to HMVP candidates for spatial or temporal merger candidates.

(4) Derivation of pairwise averages of potentially suitable options for merging

Pairwise averages of potential candidates are generated by averaging the predefined pairs of potential candidates in the existing list of potential merge candidates, and the predefined pairs are specified as {(0, 1), (0, 2), (1, 2), (0 , 3), (1, 3), (2, 3)}, where the numbers indicate the merge indices in the list of potentially suitable merge options. Averaged motion vectors are calculated separately for each reference list. If both motion vectors are available in the same list, the two motion vectors are averaged, even if they point to different reference shots; if only one motion vector is available, then use it directly; if the motion vector is not available, leave this list invalid.

(5) When the merge list is not full after adding pairwise averages of potential merge candidates, zero MVPs are inserted at the end until the maximum number of potential merge candidates is encountered.

II. Bi-prediction

Inter-prediction uses the temporal correlation between snapshots to produce a motion-compensated prediction (MCP) for a block of sampled images. For each block, a corresponding block in a previously decoded snapshot can be found, which serves as a predictor. The position of a block in a previously decoded snapshot is indicated by a motion vector (Δx, Δy), where Δx specifies the horizontal and Δy specifies the vertical offset relative to the position of the current block. Motion vectors (Δx, Δy) can have fractional sampling precision to more accurately capture the motion of the underlying object. Interpolation is applied to reference images to output a prediction signal when the corresponding motion vector has fractional sample precision. The previously decoded picture is referred to as a reference picture and is designated by the reference picture index Δt in the reference picture list.

In the case of bi-prediction (versus uni-prediction, which uses one set of motion data), two sets of motion data (Δx0, Δy0, Δt0 and Δx1, Δy1, Δt1) are used to generate two MCPs (may be from different snapshots or the same snapshot), which are then combined to produce the final MCP. Typically this is derived by averaging. In the case of weighted prediction, different weights can be applied to each MCP. The reference snapshots that can be used in bi-prediction are stored in two separate lists, namely list 0 and list 1.

III. Storing traffic information

After motion compensation is performed, motion information (uni-prediction or bi-prediction) associated with the prediction block is stored in memory. The stored motion information is used as reference information for a future unit (CU/PU), for example, through spatial or temporal motion vector prediction.

In some examples, motion information storage is performed using a two-dimensional array of motion information subblocks or motion information storage modules. The spatial resolution of the two-dimensional array may differ from the spatial resolution of the image to be encoded. In one example, the lower resolution of the motion storage module is used to save memory space. For example, 16×16 luminance samples correspond to one motion information storage unit, which means that each sample in 16×16 luminance samples contains the same motion information, and the same motion information is stored in one information storage unit about motion, which corresponds to these 16x16 discrete brightness samples. In other words, the motion information storage module contains inter-prediction information of the corresponding prediction block, which consists of 16×16 luminance samples.

It should also be noted that 16x16 luminance samples means a set of luminance samples, which is an array of two-dimensional samples, and the width and height of the two-dimensional sample array is 16. One motion information storage module can also correspond to 8x8 luminance samples , 4x4 luminance samples or other NxM luminance samples or chrominance samples, N and M are positive integers. And it is clear that the smaller size of the motion information storage module makes it possible to better predict the motion vector, but requires more memory space. Motion vector storage for a prediction block of size 8x8 luminance samples is shown in FIG. 9. Motion information of the prediction block, denoted as Mv0, is stored in each 2x2 motion vector storage unit.

III. Triangular partitioning for inter-prediction

For example, triangular split mode only applies to CUs of size 8x8 or larger encoded in skip or merge mode. The ACU level flag is signaled to indicate whether the triangular split mode is applied or not.

The CU in triangular partitioning mode is evenly divided into two triangular partitions using either diagonal partitioning or anti-diagonal partitioning (Fig. 10). Each triangular partition in the CU is inter-predicted using its own motion; For each partition, only uni-prediction is allowed, that is, each partition has one motion vector and one reference index. Uni-prediction motion constraint is applied to ensure that, like conventional bi-prediction, only two motion-compensated predictions are required for each CU. The uni-prediction motion for each split is obtained directly from the list of potential fusion candidates created for the fusion prediction mentioned above, and the selection of the uni-prediction motion from the given potential fusion candidate in the list is carried out in accordance with the "build" procedure list of potentially suitable options with uni-prediction.” After each of the triangular partitions is predicted, the sample values along the diagonal or anti-diagonal edge are adjusted using blending processing with adaptive weights. Finally, the CU motion field predicted using the triangular partitioning mode is preserved.

(1) Constructing a list of potentially suitable options with uni-prediction

Given the index of a potential merge candidate, the uni-prediction motion vector is derived from the list of potential merge candidates constructed for the merge prediction mentioned above as an example in Figure 11. For a potential candidate in the list, its motion vector LX with X, equal to the parity of the index value of the potential fusion candidate, is used as the uni-prediction motion vector for the triangular partitioning mode. These motion vectors are marked with "x" in Figure 11. In the case where a corresponding motion vector LX does not exist, the motion vector L(1-X) of the same candidate candidate in the fusion prediction candidate candidate list is used as the motion vector with uni-prediction for the triangular partitioning mode.

(2) Blending along the edge of the triangular partition

After each triangular partition is predicted using its own motion, mixing is applied to the two prediction signals to derive discrete samples around the diagonal or antidiagonal edge. The following weighting factors are used during the blending process: {7/8, 6/8, 5/8, 4/8, 3/8, 2/8, 1/8} for brightness and {6/8, 4/8, 2 /8} for chroma, as shown in Figure 12.

(3) Motion field storage

For example, CU motion vectors encoded in triangular partitioning mode are stored in 4x4 units. Depending on the position of each 4x4 module, motion vectors are stored with uni-prediction or bi-prediction. Let us denote Mv1 and Mv2 as the uni-prediction motion vectors for partition 1 and partition 2, respectively. If a 4x4 module is located in the unweighted region shown in the example of Figure 12, either Mv1 or Mv2 is stored for that 4x4 module. Otherwise (if the 4x4 module is in the weighted region), the bi-prediction motion vector is preserved. The bi-prediction motion vector is derived from Mv1 and Mv2 according to the following process:

1) If Mv1 and Mv2 are taken from different reference snapshot lists (one from L0 and the other from L1), then Mv1 and Mv2 are simply combined to form a bi-predictive motion vector;

2) Otherwise, if Mv1 and Mv2 belong to the same list, and without loss of generality consider that they are both from L0.

In this case:

If a reference shot Mv2 (or Mv1) appears in L1, then that Mv2 (or Mv1) is converted to a motion vector of L1 using that reference shot in L1. The two motion vectors are then combined to form a bi-predictive motion vector.

Otherwise, instead of the bi-prediction motion, only the Mv1 uni-prediction motion is stored.

As another example, motion vector storage for triangular mode is shown in Figure 13.

IV. Geometric partition into intermediate blocks

In triangular split mode, two sub-blocks are separated by a separating line, and the direction of the dividing line is 45 degrees or 135 degrees. Other splitting angles and splitting proportions are also possible, which are referred to as GEO (geometric splitting) mode in this application, for example, as shown in Figure 14.

For example, the total number of GEO partitions could be 140. This number was found to be optimal due to the balance between flexibility and bit cost. Additional signaling for GEO requires signaling the angle α and the offset line relative to the block center ρ. α is a quantized angle from 0 to 360 degrees with a separation of 11.25 degrees, and ρ is a distance with 5 different values. The value of α and ρ is shown in Figure 15.

It is understood that in the field of video encoding technology, generally, the prediction process performed at the encoder side and at the decoder side is similar, except that additional information is extracted by analysis from the bit stream at the decoder side, and the additional information is determined by a preset rule , such as the Rate Distortion Optimization (RDO) method. For example, to obtain discrete prediction samples in GEO mode, the following steps are applied at the decoder side:

S101: Determine the splitting proportion for the current block.

The syntax of the geo_partition_idx element is extracted by parsing from the bitstream, which is used as an index to the lookup table that stores the α and ρ pairs. In the example, α and ρ are represented by an angle index and a distance index, respectively.

S102: Obtaining a first prediction mode for the first sub-block and a second prediction mode for the second sub-block.

Typically, the same merge list derivation process that is used for the triangular partition mode is used to derive the motion vectors of each partition (subblock) of a GEO block. Each partition is predicted only by uni-prediction. The syntax of the two elements geo_merge_idx0 and geo_merge_idx1 is extracted by parsing from the bitstream to indicate the prediction modes of the two sub-blocks, respectively.

In one example, the first prediction mode is not identical to the second prediction mode. In one example, the prediction mode (the first prediction mode or the second prediction mode) may be an inter-prediction mode, the information for the inter-prediction mode may include a reference picture index and a motion vector. In another example, the prediction mode may be an intra-prediction mode, the information for the intra-prediction mode may include an index of the intra-prediction mode.

S103: Generating a first prediction value for the first sub-block and a second prediction value for the second sub-block using the first prediction mode and the second prediction mode, respectively.

S104: Obtaining combined prediction sample values according to combining the first prediction value and the second prediction value according to the division disclosed in step S101.

For example, more specifically, step S104 includes:

S104-1: For the luminance sample in the current block, a sample distance (sample_dist) is calculated, the sample distance is the distance from the luminance sample to the dividing line of the current block as determined in step S101.

In one example, the sample distance sample_dist is calculated according to the formula:

sample_dist=((x<<1)+1)*Dis[angleIdx1]+((y<<1)+1))*Dis[angleIdx2]-offset(distanceIdx).

angleIdx1 and angleIdx2 are obtained from the bitstream or output based on other information obtained from the bitstream, for example, output based on the syntax of the geo_partition_idx element as the angle index in step S101; angleIdx1 and angleIdx2 represent the quantized trigonometric parameters of the dividing line.

x and y are the horizontal and vertical distances of the discrete sample relative to the top left discrete sample of the current block.

offset(distanceIdx) is a function of the index value (distanceIdx), the index value is obtained from the bitstream or is output based on other information obtained from the bitstream, for example, is output based on the syntax of the geo_partition_idx element, such as the distance index in step S101.

Dis[] is a predefined lookup table.

In another example, sample_dist and sampleWeight1 can be obtained according to the following equations:

nCbR=(W>H)?(W/H):(H/W)

sample_dist=(W>H)?(Clip3(0, 8, (x/nCbR-y)+4)):(Clip3(0, 8, (x-y/nCbR)+4)),

or

sample_dist=(W>H)?(Clip3(0, 8, (H-1-x/nCbR-y)+4)):(Clip3(0, 8, (W-1-x-y/nCbR)+4) ),

where W is the width of the current block, H is the height of the current block.

It should be noted that the above 2 examples show two ways of calculation according to integer arithmetic. Embodiments of the invention are not limited to these examples of calculating sample_dist.

In examples, sample_dist can be the perpendicular distance between the sample located at (x, y) and the dividing line. In another example, a horizontal line or a vertical line is drawn through a sample located at (x, y). The horizontal line or vertical line will have an intersection point with the separating line. sample_dist can be the distance between the sample located at (x, y) and the intersection point.

S104-2: The blending operation is implemented as a function with sample_dist as input and sampleWeight1 or sampleWeight2 as output.

Sample_dist is used to calculate the weights, the weights are used for the concatenated prediction value, which is output by concatenating the first prediction value and the second prediction value corresponding to the first sub-block and the second sub-block, respectively. In the example, the weights are denoted as sampleWeight1 and sampleWeight2, referring to the values of the weights corresponding to the first prediction value and the second prediction value, respectively. In one example, sampleWeight1 is calculated according to sample_dist, sampleWeight2 is calculated according to the formula sampleWeight2=T-sampleWeight1, where T is a predefined constant. In one example, the predefined constant T is 8, which means that sampleWeight1 and sampleWeight2 can have values ranging from 0 to 8 (including 0 and 8). In another example, the preset constant T is 16.

According to one example, the first weight sampleWeight1 is obtained according to sample_dist and the lookup table. In one example, a lookup table is used to store filter coefficients. In other words, the mixing operation is implemented according to a lookup table. In such an example, the sample_dist function can be used as an index value for the lookup table. Said function may be a division or multiplication operation with a constant number, a right shift operation by a constant amount, a truncate or absolute value operation, or a combination thereof.

The mixing operation is applied to a sample according to the indication value in the bitstream or to a sample according to the indication value in the bitstream.

For example, sampleWeight1=Clip3(0, 8, f(sample_dist)). The function f() can be a divide/add/multiply with a constant number operation, a right shift with a constant value operation, an absolute value operation, or a truncate operation, or a combination of these.

For example, sampleWeight1 (or sampleWeight2)=Clip3(0, 8, sample_dist),

For example, sampleWeight1 (or sampleWeight2)=Clip3(0, 8, sample_dist+4);

For example, sampleWeight1 (or sampleWeight2)=sample_dist==4 ? 4: sample_dist < 4? 0 : 8;

For example, sampleWeight1 (or sampleWeight2)=Clip3(0, 8, (sample_dist - 4)*K+sample_dist);

For example, sampleWeight1 (or sampleWeight2)=sample_dist == 0 ? 4: sample_dist < 0? 0 : 8;

For example, sampleWeight1 (or sampleWeight2)=Clip3(0, 8, sample_dist*K+Clip3(0, 8, sample_dist+4)), K is an integer with a value greater than 0. Note that the blending operation becomes shorter (hence sharper) as K increases. For example, when K=4, then the second mixing operation becomes identical to the following "sampleWeight=sample_dist == 0 ? 4 : sample_dist < 0 ? 0 : 8", an example of which is shown in Figure 16. According to one example the pointer value in the bitstream indicates the value of K.

In one example, the blending operation may be implemented as a lookup table, such as the tables illustrated in Figure 17. For example, sampleWeight may be obtained as geoFilter[idx], where idx is obtained as a function of sampleDist and geoFilter is a one-dimensional linear array of weights filters. For example, idx=min((abs(sample_dist) + 8) >> 4, maxIdx), where maxIdx is the maximum value that idx can take.

S105: storing prediction mode information (for example, motion information containing motion vectors or intra-prediction information) of the current block in accordance with the division that is disclosed in step S101 and in accordance with the combining method that is disclosed in step 104.

Specifically, in the first embodiment of the decoding process for the GEO prediction mode:

This process is called when decoding a single encoding block with MergeTriangleFlag[xCb][yCb] equal to 1 or geo_flag[xCb][yCb] equal to 1.

The inputs for this process are as follows:

luminance location (xCb, yCb) indicating the upper left sample of the current encoding block relative to the upper left luminance sample of the current picture,

variable cbWidth, indicating the width of the current encoding block in discrete brightness samples,

variable cbHeight indicating the height of the current encoding block in discrete brightness samples,

brightness motion vectors in mvA and mvB with an accuracy of 1/16 fractional discrete count,

chromaticity motion vectors mvCA and mvCB,

reference indices refIdxA and refIdxB,

flags predListFlagA and predListFlagB of the prediction list.

The results of this process are:

array (cbWidth)x(cbHeight) predSamples_L discrete samples brightness predictions,

array (cbWidth/2)x(cbHeight/2) predSamples_Cb discrete samples color prediction for the Cb component,

array (cbWidth/2)x(cbHeight/2) predSamples_Cr discrete samples color prediction for the Cr component.

Let predSamplesLA _L and predSamplesLB _L be (cbWidth)x(cbHeight) arrays of predicted luminance sample values, and let predSamplesLA _Cb , predSamplesLB _Cb , predSamplesLA _Cr and predSamplesLB _Cr be ₍ cbWidth _/ 2)x ₍ cbHeight _/ 2) arrays of predicted brightness sample values chromaticity.

preSamples_L, preSamples_Cband preSamples_Crare obtained with using the following ordered steps:

1. For N being each of A and B, the following applies:

A reference image consisting of an ordered two-dimensional array refPicLN_L discrete brightness samples and two ordered two-dimensional arrays refPicLNCb and refPicLNCr of discrete chromaticity samples are output b with X, set to predListFlagN, and refIdxX set to refIdxN as input.

Array predSamplesLN_L is displayed from luminance location(xCb, yCb), luminance coding block width sbWidth set to cbWidth, luminance coding block height sbHeight set to cbHeight, motion vector offset mvOffset set to (0, 0), motion vector mvLX set to mvN, and reference array refPicLX_L, set equal to refPicLN_L, bdofFlag variable set to FALSE, and cIdx variable set to 0 as input.

Array predSamplesLN_Cb is output from luminance location (xCb, yCb), encoding block width sbWidth set to cbWidth/2, encoding block height sbHeight set to cbHeight/2, motion vector offset mvOffset set to (0, 0), motion vector mvLX set to mvCN , and the reference array refPicLX_Cb, set equal to refPicLN_Cb, variable bdofFlag set to FALSE, and variable cIdx set to 1 as input.

Array predSamplesLN_Cr displayed with location brightness (xCb, yCb), encoding block width sbWidth set to cbWidth/2, encoding block height sbHeight set to cbHeight/2, motion vector offset mvOffset set to (0, 0), motion vector mvLX set to mvCN, and reference array refPicLX_Cr, set equal to refPicLN_Cr, bdofFlag variable set to FALSE, and cIdx variable set to 2 as input.

2. If geo_flag[xCb][yCb] is equal to 1, the angleIdx and DistanceIdx variables associated with the geometric partitioning are set according to the value of geo_partitioning_idx[xCb][yCb] as specified in Table 1.

a. The process of deriving the discrete sample weight coefficient for the geometric partition merging mode starts. The input to the process is three ordered arrays sampleWeight _L , sampleWeightC and motionWeight of size (cbWidth)x(cbHeight), (cbWidth/2)x(cbHeight/2) and (cbWidth/4)x(cbHeight/4), respectively, and also the variables angleIdx, distanceIdx, cbWidth and cbHeight.

b. The prediction samples within the current luminance encoding block, predSamplesL[xL][yL] with xL=0...cbWidth - 1 and yL=0...cbHeight - 1, are output by calling the weighted sample prediction process for the geometric partition merging mode with width nCbW encoding block set equal to cbWidth, encoding block height nCbH set equal to cbHeight, sample arrays predSamplesLAL, predSamplesLBL, predWeightL and cIdx equal to 0, as input data.

c. The prediction samples within the current Cb chroma component encoding block, predSamplesCb[xC][yC] with xC=0...cbWidth/2 - 1 and yC=0...cbHeight/2 - 1, are output by calling the weighted sample prediction process for the merge mode geometric partition with coding block width nCbW set to cbWidth/2, coding block height nCbH set to cbHeight/2, sample arrays predSamplesLACb, predSamplesLBCb, predWeightC and cIdx equal to 1, as input data.

d. The prediction samples within the current Cr chrominance component encoding block, predSamplesCr[xC][yC] with xC=0…cbWidth/2 - 1 and yC=0…cbHeight/2 - 1, are output by calling the weighted sample prediction process for the merge mode geometric partition with coding block width nCbW set to cbWidth/2, coding block height nCbH set to cbHeight/2, sample arrays predSamplesLACr, predSamplesLBCr, predWeightC and cIdx equal to 2, as input data.

e. The motion vector storage process for the geometric fusion mode is called with the luminance coding block location (xCb, yCb), luminance coding block width cbWidth, luminance coding block height cbHeight, sample motionWeight array, luminance motion vectors mvA and mvB, reference indices refIdxA and refIdxB, and with the prediction list flags predListFlagA and predListFlagB as input.

Reference image matching process for triangular fusion mode

The input data to this process is the following:

the variable X representing the list of links is 0 or 1,

reference index refIdxN.

The result of this process:

reference index refIdxTemp.

The refPicPoc variable is output as follows:

refPicPoc=(X== 0) ? RefPicList[0][refIdxN] : RefPicList[1][refIdxN] (8-878)

The list of reference pictures refPicListTemp is displayed as follows:

refPicListTemp=(X==0)?RefPicList[1]:RefPicList[0] (8-879)

The refIdxTemp variable is obtained as follows:

The mapStop variable is set to FALSE.

For the refIdx variable_m With m=0…NumRefIdxActive[1] - 1 the following applies until mapStop is FALSE:

refIdxTemp=(refPicListTemp[refIdxm]== refPicPoc) ? refIdxm : -1 (8-880)

mapStop=(refIdxTemp!= -1)? TRUE : FALSE (8-881)

The process of deriving the weighting coefficient of a discrete sample for the merging mode of a geometric partition

The inputs for this process are as follows:

two variables nCbW and nCbH, defining the width and height of the current encoding block,

two variables angleIdx and DistanceIdx, which define the angle and distance search values for the current geometric partitioning mode,

(nCbW)x(nCbH) array sampleWeight _L ,

(nCbW/2)x(nCbH/2) sampleWeightC array,

(nCbW/4)x(nCbH/4) motionWeight array.

The result of this process is the same three sampleWeight arrays_L,sampleWeight_C And motionWeight with values of weighting coefficients for a discrete sample, having a range from 0 ... 8.

1. The luminance blending weights stored in sampleWeight _L for the current geometric partitioning mode are output as follows:

The following variables are set:

wIdx is set to log2 (nCbW) - 3,

hIdx is set equal to log2(nCbH) - 3,

stepOffset is set to 64,

the following variables are set according to the comparison (wIdx >= hIdx):

whRratio=(wIdx >= hIdx) ? wIdx - hIdx : hIdx - wIdx (8-882)

wIsLargerH=(wIdx >= hIdx)? true : false (8-883)

scaleStep=(wIdx >= hIdx)? (1 << hIdx) : (1 << wIdx) (8-884)

displacementX is set to angularIdx

displacementY set to (displacementX+8)% 32

angleN is set to:

angleN=angleIdx, if angleIdx >= 0 && angleIdx <=8,

angleN=16 - angleIdx, if angleIdx > 8 && angleIdx<= 16,

angleN=angleIdx - 16 if angleIdx > 16 && angleIdx <=24,

angleN=32 - angleIdx otherwise,

then angleN is set to the following value, depending on wIsLargerH:

angleN=(wIsLargerH) ? 8 - angleN : angleN

stepDis is set according to the whRatio and angleN values as specified in Table 2ff.

stepSize=stepDis+stepOffset

rho is set to the following value using the lookup table, designated Dis, listed in Table 3:

rho=DistanceIdx*stepSize*scaleStep+nCbW*Dis[displacementX] + nCbH*Dis[displacementY] . (8-885)

For each sample position x=0… nCbW - 1 and y=0… nCbH - 1 sampleWeight value_L[x][y] is output as follows way:

The distance distFromLine is calculated using a lookup table denoted Dis, listed in Table 3 as follows:

distFromLine=((x<<1) + 1)*Dis[displacementX] + ((y<<1) + 1))*Dis[displacementY] - rho. (8-886)

The scaled distance distScaled is obtained as follows:

distScaled=min((abs(distFromLine) + 8) >> 4, 14). (8-887)

sampleWeight value_L[x][y] is set according to the filter weight lookup table, designated GeoFilter, specified in

Table 4 as:

sampleWeight _L [x][y]=GeoFilter[distScaled] if distFromLine <= 0

sampleWeight _L [x][y]=8 - GeoFilter [distScaled] if distFromLine > 0

2. The chroma weights stored in sampleWeight _C for the current geometric partitioning mode are output as follows:

For each sample position x=0… (nCbW/2) - 1 and y=0… (nCbH/2) - 1 the sampleWeight _C [x][y] value is output as follows:

sampleWeight _C [x][y]=sampleWeight _L [(x<<1)][(y<<1)]

3. The motion weights stored in the motionWeight array for the current geometric partitioning mode are output as follows:

The following variables are set:

threshScaler=((log2(nCbW) + log2(nCbH)) >> 1) - 1

threshLower=32 >> threshScaler

threshUpper=32 - threshLower

For each sample position x=0… (nCbW/4) - 1 and y=0… (nCbH/4) - 1 the motionWeight[x][y] value is output as follows:

Cnt=sampleWeight _L [(x<<2)][(y<<2)]

+ sampleWeight _L [(x<<2) + 3][(y<<2)]

+ sampleWeight _L [(x<<2)][(y<<2) + 3]

+ sampleWeight _L [(x<<2) + 3][(y<<2) + 3]

The motionWeight[x][y] value is:

motionWeight[x][y]=0 if Cnt <= threshLower

motionWeight[x][y]=1 if Cnt >= threshUpper

motionWeight[x][y]=2 , otherwise

Weighted sample prediction process for fusion mode with geometric partitioning

The inputs for this process are as follows:

two variables nCbW and nCbH, defining the width and height of the current encoding block,

two arrays (nCbW)x(nCbH) predSamplesLA and predSamplesLB,

Array (nCbW)x(nCbH) sampleWeight,

cIdx variable indicating the index of the color component.

The result of this process is an array (nCbW)x(nCbH) pbSamples of prediction sample values.

The bitDepth variable is output as follows:

- If cIdx is 0, bitDepth is set to BitDepthY.

- Otherwise, bitDepth is set equal to BitDepthC.

The shift1 and offset1 variables are output as follows:

- The shift1 variable is set to Max(5, 17 - bitDepth).

- The offset1 variable is set to 1 << (shift1 - 1).

The prediction sample values are output as follows:

pbSamples[x][y] =

Clip3(0, (1 << bitDepth) - 1,

(predSamplesLA[x][y] * sampleWeight[x][y]

+ predSamplesLB[x][y] * (8 - sampleWeight [x][y]) + offset1) >> shift1)

Storing motion vectors for geometric mesh merging mode

This process is called when decoding a single encoding block with geo_flag[xCb][yCb] equal to 1.

The inputs for this process are as follows:

luminance location (xCb, yCb) indicating the upper left sample of the current encoding block relative to the upper left luminance sample of the current picture,

variable cbWidth, indicating the width of the current encoding block in discrete brightness samples,

variable cbHeight indicating the height of the current encoding block in discrete brightness samples,

motionWeight array of size (cbWidth/4)x(cbHeight/4) containing motion destination indices,

brightness motion vectors in mvA and mvB with an accuracy of 1/16 fractional discrete count,

reference indices refIdxA and refIdxB,

flags predListFlagA and predListFlagB of the prediction list.

The variables numSbX and numSbY, which determine the number of 4x4 blocks in the current encoding block horizontally and vertically, are set to numSbX=cbWidth >> 2 and numSbY=cbHeight >> 2.

The variable minSb is set equal to min(numSbX, numSbY).

The variable refIdxTempA is output by calling the reference snapshot mapping process for the triangular merge mode with X set to predListFlagA and refIdxN set to refIdxA as input.

The variable refIdxTempB is output by calling the reference snapshot mapping process for the triangular merge mode with X set to predListFlagB and refIdxN set to refIdxB as input.

For each 4x4 sub-block with a sub-block index (xSbIdx, ySbIdx) with xSbIdx=0…numSbX - 1 and ySbIdx=0…numSbY - 1 the following applies:

If motionWeight[xSbIdx][ySbIdx] is 0, the following applies:

predFlagL0=(predListFlagA== 0) ? 1 : 0 (8-888)

predFlagL1=(predListFlagA== 0) ? 0 : 1 (8-889)

refIdxL0=(predListFlagA== 0) ? refIdxA : -1 (8-890)

refIdxL1=(predListFlagA== 0) ? -1 : refIdxA (8-891)

mvL0 [0]=(predListFlagA== 0) ? mvA[0] : 0 (8-892)

mvL0[1]=(predListFlagA== 0) ? mvA[1]: 0 (8-893)

mvL1 [0]=(predListFlagA== 0) ? 0 : mvA[0] (8-894)

mvL1[1]=(predListFlagA== 0) ? 0 : mvA[1] (8-895)

Otherwise, if motionWeight[xSbIdx][ySbIdx] is 1, the following applies:

predFlagL0=(predListFlagB== 0) ? 1 : 0 (8-896)

predFlagL1=(predListFlagB== 0) ? 0 : 1 (8-897)

refIdxL0=(predListFlagB== 0) ? refIdxB : -1 (8-898)

refIdxL1=(predListFlagB== 0) ? -1 : refIdxB (8-899)

mvL0 [0]=(predListFlagB== 0) ? mvB[0] : 0 (8-900)

mvL0[1]=(predListFlagB== 0) ? mvB[1]: 0 (8-901)

mvL1 [0]=(predListFlagB== 0) ? 0 : mvB[0] (8-902)

mvL1[1]=(predListFlagB== 0) ? 0 : mvB[1] (8-903)

Otherwise (motionWeight[xSbIdx][ySbIdx] is 2) the following applies:

If predListFlagA+predListFlagB is 1,

predFlagL0=1 (8-904)

predFlagL1=1 (8-905)

refIdxL0=(predListFlagA== 0) ? refIdxA : refIdxB (8-906)

refIdxL1=(predListFlagA== 0) ? refIdxB : refIdxA (8-907)

mvL0 [0]=(predListFlagA== 0) ? mvA[0] : mvB[0] (8-908)

mvL0[1]=(predListFlagA== 0) ? mvA[1] : mvB[1] (8-909)

mvL1 [0]=(predListFlagA== 0) ? mvB[0] : mvA[0] (8-910)

mvL1[1]=(predListFlagA== 0) ? mvB[1] : mvA[1] (8-911)

If predListFlagA+predListFlagB is 0, the following applies:

predFlagL0=1 (8-912)

predFlagL1=(refIdxTempA== -1 && refIdxTempB== -1) ? 0 : 1 (8-913)

refIdxL0=(refIdxTempB != -1) ? refIdxA : (8 914) ((refIdxTempA != -1) ? refIdxB : refIdxA)

refIdxL1=(refIdxTempB != -1) ? refIdxTempB : (8 915) ((refIdxTempA != -1) ? refIdxTempA : -1)

mvL0[0] = (refIdxTempB != -1) ? mvA[0] : (8-916) ((refIdxTempA != -1) ? mvB[0] : mvA[0])

mvL0[1] = (refIdxTempB != -1) ? mvA[1]: (8-917) ((refIdxTempA != -1) ? mvB[1] : mvA[1])

mvL1[0] = (refIdxTempB != -1) ? mvB[0] : (8-918) ((refIdxTempA != -1) ? mvA[0] : 0)

mvL1[1] = (refIdxTempB != -1) ? mvB[1]: (8-919) ((refIdxTempA != -1) ? mvA[1] : 0)

If the value of predListFlagA+predListFlagB is 2, the following applies:

predFlagL0=(refIdxTempA== -1 && refIdxTempB== -1) ? 0 : 1 (8-920)

predFlagL1=1 (8-921)

refIdxL0=(refIdxTempB != -1) ? refIdxTempB : (8-922) ((refIdxTempA != -1) ? refIdxTempA : -1)

refIdxL1=(refIdxTempB != -1) ? refIdxA : (8-923) ((refIdxTempA != -1) ? refIdxB : refIdxA)

mvL0[0] = (refIdxTempB != -1) ? mvB[0] : (8-924) ((refIdxTempA != -1) ? mvA[0] : 0)

mvL0[1] = (refIdxTempB != -1) ? mvB[1]: (8-925) ((refIdxTempA != -1) ? mvA[1] : 0)

mvL1[0] = (refIdxTempB != -1) ? mvA[0] : (8-926) ((refIdxTempA != -1) ? mvB[0] : mvA[0])

mvL1[1] = (refIdxTempB != -1) ? mvA[1]: (8-927) ((refIdxTempA != -1) ? mvB[1] : mvA[1])

For x=0..3 and y=0..3 the following assignments are made:

MvL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=mvL0 (8-928)

MvL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=mvL1 (8-929)

RefIdxL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=refIdxL0 (8-930)

RedIdxL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=refIdxL1 (8-931)

PredFlagL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=predFlagL0 (8-932)

PredFlagL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=predFlagL1 (8-933)

Table 1. Setting angleIdx and distanceIdx values based on geo_partition_idx value geo_partition_idx angleIdx distanceIdx 0 0 1 1 0 2 2 0 3 3 0 4 4 1 0 5 1 1 6 1 2 7 1 3 8 1 4 9 2 0 10 2 1 eleven 2 2 12 2 3 13 2 4 14 3 0 15 3 1 16 3 2 17 3 3 18 3 4 19 4 1 20 4 2 21 4 3 22 4 4 23 5 0 24 5 1 25 5 2 26 5 3 27 5 4 28 6 0 29 6 1 thirty 6 2 31 6 3 32 6 4 33 7 0 34 7 1 35 7 2 36 7 3 37 7 4 38 8 1 39 8 2 40 8 3 41 8 4 42 9 0 43 9 1 44 9 2 45 9 3 46 9 4 47 10 0 48 10 1 49 10 2 50 10 3 51 10 4 52 eleven 0 53 eleven 1 54 eleven 2 55 eleven 3 56 eleven 4 57 12 1 58 12 2 59 12 3 60 12 4 61 13 0 62 13 1 63 13 2 64 13 3 65 13 4 66 14 0 67 14 1 68 14 2 69 14 3 70 14 4 71 15 0 72 15 1 73 15 2 74 15 3 75 15 4 76 16 1 77 16 2 78 16 3 79 16 4 80 17 1 81 17 2 82 17 3 83 17 4 84 18 1 85 18 2 86 18 3 87 18 4 88 19 1 89 19 2 90 19 3 91 19 4 92 20 1 93 20 2 94 20 3 95 20 4 96 21 1 97 21 2 98 21 3 99 21 4 100 22 1 101 22 2 102 22 3 103 22 4 104 23 1 105 23 2 106 23 3 107 23 4 108 24 1 109 24 2 110 24 3 111 24 4 112 25 1 113 25 2 114 25 3 115 25 4 116 26 1 117 26 2 118 26 3 119 26 4 120 27 1 121 27 2 122 27 3 123 27 4 124 28 1 125 28 2 126 28 3 127 28 4 128 29 1 129 29 2 130 29 3 131 29 4 132 thirty 1 133 thirty 2 134 thirty 3 135 thirty 4 136 31 1 137 31 2 138 31 3 139 31 4

Table 2. Setting the step distance stepDis depending on the values of whRatio and angleN whRatio angleN stepDis 0 0 0 0 1 18 0 2 31 0 3 40 0 4 42 0 5 40 0 6 31 0 7 18 0 8 0 1 0 0 1 1 38 1 2 71 1 3 97 1 4 115 1 5 125 1 6 126 1 7 118 1 8 102 2 0 0 2 1 78 2 2 149 2 3 210 2 4 260 2 5 295 2 6 315 2 7 319 2 8 307 3 0 0 3 1 158 3 2 306 3 3 438 3 4 549 3 5 636 3 6 694 3 7 721 3 8 717 4 0 0 4 1 318 4 2 619 4 3 893 4 4 1129 4 5 1317 4 6 1450 4 7 1524 4 8 1536

Table 3. Lookup table Dis for deriving geometric partition distance idx 0 1 2 3 4 5 6 7 8 9 10 eleven 12 13 14 15 Dis[idx] 64 63 59 53 45 36 24 12 0 -12 -24 -36 -45 -53 -59 -63 idx 16 17 18 19 20 21 22 23 24 25 26 27 28 29 thirty 31 Dis[idx] -64 -63 -59 -53 -45 -36 -24 -12 0 12 24 36 45 53 59 63

Table 4. GeoFilter filter weights lookup table for deriving geometric partition filter weights idx 0 1 2 3 4 5 6 7 8 9 10 eleven 12 13 14 GeoFilter [idx] 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8

In the second embodiment of the decoding process for the GEO prediction mode, the motion information storage process is as follows:

The coding block is divided into K motion storage modules, the size of the coding block is MxN brightness samples, for example, each motion storage module has the same size (M/K)x(N/K) brightness samples. In one example, the K value is 4, the M value is 16, and the N value is 16. In this example, each motion storage module is associated with a 4x4 luminance subblock. The top left brightness position (x, y) of the encoding block is related to the top left position (x/K, y/K) of the motion storage block.

For the motion storage unit, it is decided whether the first uni-prediction motion information, the second uni-prediction motion information, or the bi-prediction motion information is stored in accordance with the first sample weight or the second sample weight. In one example, the decision is made in accordance with the distance from the sample in the motion storage module to the dividing boundary. The discrete count can be integer or fractional. The dividing line is defined as the dividing line of the geometric partition mode. According to one example, K is equal to 4 (the width and height of the motion storage module in terms of discrete luminance samples). An example of dividing a coding block into a motion storage module is shown in Figure 13.

According to one example, the distance between the sample and the dividing line can be calculated as follows: For a luminance sample in a block, the sample distance (sample_dist) is calculated, the sample distance being the distance from the luminance sample to the block's dividing line.

In one example, the sample distance sample_dist is calculated according to the formula:

sample_dist=((x<<1)+1)*Dis[angleIdx1]+((y<<1)+1))*Dis[angleIdx2]-offset(distanceIdx).

The value of angleIdx1 and the value of angleIdx2 are obtained from the bitstream or derived/calculated based on other information obtained from the bitstream, angleIdx1 and angleIdx2 are quantized trigonometric dividing line parameters, the first of which is of cosine type and the second of sine type.

x and y represent the -x and -y coordinates of the sample sample relative to the upper left sample sample of the encoding block.

offset(distanceIdx) is an offset value which is a function of the index value (distanceIdx), the index value is obtained from the bitstream or is inferred/computed based on other information obtained from the bitstream.

Dis[] is a lookup table. Dis[angleIdx1] describes the change in sample distance (sample_dist) relative to a unit increment (increase by value 1) at the -x coordinate of the specified sample. Dis[angleIdx2] describes the change in sample distance (sample_dist) with respect to a unit increase (increase by value 1) in the -y coordinate of the specified sample.

It should be noted that the coordinator in the above example is located according to the top left position of the current encoding block, and not according to the top left position.

It should be noted that the above example shows the calculation method according to integer arithmetic. Embodiments of the invention are not limited to these examples of calculating sample_dist.

It should be noted that according to the example above, the sample coordinator is shifted to the left by one bit ((x<<1), (y<<1)). In this example, the distance calculation can be done to within 1/2 a sample for integer arithmetic, for example the position of the sample at (0.5, 0.5) can be calculated.

In FIG. Figure 18 shows an example of 4x4 motion storage with an integer position and a half-pixel position (fractional position, dividing boundary, and distance between sample and dividing boundary (sample_dist).

In one example, the decision relates to whether to store first uni-prediction motion information labeled Mv0, second uni-prediction motion information labeled Mv1, or combined motion information such as bi-prediction motion information. prediction, labeled Mv2, is carried out according to the following steps. In example one, the solution is performed for the motion storage module; in another example, the decision is performed on at least two (or all) motion storage units contained in the encoding block. The top left coordinate of the motion storage module is set to (x/K, y/K), and the width and height of the motion storage module are set to K in luminance samples.

If the calculated distance sample_dist is less than and/or equal to the threshold, the combined motion information (Mv2) is stored for the motion storage module. The threshold value may be a fixed number, which may be adaptively determined based on the angle of the dividing line, the aspect ratio of the current encoding block, or other parameters; otherwise (if the distance sample_dist is greater than or/and equal to the threshold), the sign of sample_dist is checked:

If sample_dist is negative (or positive), MV0 (or MV1) is stored for the current motion storage module,

Otherwise (sample_dist positive (or negative)) MV1 (or MV0) are stored for the current motion storage module.

In FIG. 19 shows one example of motion storage based on the above method.

Compared with other motion storage method, this method only requires computing one sample distance for each motion storage module, which reduces the computational complexity.

In the third embodiment, the decoding process for the GEO prediction mode, as shown in FIG. 20, is as follows:

For a video coding technique that allows bi-prediction, two lists of reference frames are used, for example, List0 and List1, or a list of forward reference frames and a list of backward reference frames. For example, traffic information includes:

(1) Prediction Flag L0 (PFL0) and Prediction Flag L1 (PFL1), where when Prediction Flag L0 is true, List0 will be used in inter-prediction, otherwise (Prediction Flag L0 is false ( false)) List0 will not be used. The L1 prediction flag is similar.

(2) Reference Index L0 (RIL0) and Reference Index L1 (RIL1), Reference Index L0 is used to indicate which reference frame (potential candidate) from List0 is used as the current reference frame. The L1 reference index is similar. And in a possible implementation, the Reference Index L0 is -1, which means that the reference frame from List0 is not used.

(3) Motion vector L0 (MVL0) and motion vector L1 (MVL1) correspond to List0 and List1 respectively, and both have a horizontal component and a vertical component.

Once the motion information is determined for the current block, in an exemplary embodiment, the motion information may be stored and used as reference information for the prediction process of future encoding blocks, for example, as motion information for predicting a neighboring block in spatial prediction or temporal prediction.

The motion information is stored in the memory, more specifically, stored in the motion information storage units in this embodiment.

The current block may be divided into a plurality of sample sets, each of the plurality of sample sets having the same size as the sample set; or setting the current block as a set of discrete samples. For example, the sample set may be a 4x4 sample array. The size of the sample set can also be 8x8, 16x16, 8x16, etc., which is not limited. Each of the plurality of sample sets corresponds to each motion information storage module, so motion information from the sample set will be stored in a corresponding motion information storage module. It is noted that there are two cases of “information about the movement of a set of discrete samples.” Case 1: Motion information is used to determine the prediction value of a set of discrete samples; Case 2: Motion information is assigned to a set of discrete samples for storage.

Moreover, in the current embodiment, the set of samples is a set of luminance samples, and in another embodiment, the set of samples may be a set of chrominance samples.

The GEO prediction mode is presented in the previous section. Generally, in GEO prediction, the current block consists of a first sub-block and a second sub-block, the first sub-block and the second sub-block are separated by a common boundary, the first sub-block corresponds to the first motion information, and the second sub-block corresponds to the second motion information. The first sub-block and the second sub-block may be a triangular mesh, a trapezoidal mesh, or an asymmetric rectangular mesh, etc., but is not limited to. And it is clear that, for example, in a triangular partition, each subblock is a triangular block.

For example, in the current embodiment, both the first motion information and the second motion information come from the uni-prediction. The first motion information may only include RIL0, MVL0, which means PFL0=1, PFL1=0; or may include only RIL1, MVL1, which means PFL0=0, PFL1=1; similarly, the second motion information may only include RIL0, MVL0, which means PFL0=1, PFL1=0; or may include only RIL1, MVL1, which means PFL0=0, PFL1=1.

S201: Determination of angular parameter and distance parameter.

The common boundary is determined by an angular parameter and a distance parameter.

(1) In decoder:

In a possible implementation, extracting by analyzing an angular parameter and a distance parameter directly from the bit stream.

In another possible implementation, extracting by parsing a pointer from the bitstream and deriving an angular parameter and a distance parameter based on the pointer. The pointer may be an index, the angle parameter and the distance parameter may be determined by checking a lookup table with such an index. Or the angle parameter and the distance parameter can be calculated by a function, and the pointer is the input to the function.

In another possible implementation, extracting by parsing two pointers from the bitstream and obtaining an angular parameter from one of the two pointers and a distance parameter from the other of the two pointers.

In the current embodiment, the syntax element "geo_partition_idx" is extracted by parsing from the bitstream. The angle parameter "angleIdx" and the distance parameter "distanceIdx" are obtained by looking up a lookup table that defines the relationship between "geo_partition_idx" and the pair "angleIdx" and "distanceIdx". The lookup table, for example, could be table 1.

S202: determining the first calculation parameter based on the angular parameter; calculating a temporary angular parameter based on the angular parameter; determining a second computational parameter based on the time angular parameter; and calculating a third calculation parameter based on the angular parameter and the distance parameter.

The first calculation parameter is determined by checking a preset lookup table according to an angular parameter, and the second calculation parameter is determined by checking said lookup table according to a temporary angular parameter, the first calculation parameter and the second calculation parameter being a cosine value and a sine value of the same angle, respectively. It is clear that the calculations of cosine and sine can be simulated and replaced by a lookup table method, while the complexity of the calculations is reduced.

In the current embodiment,

In a possible implementation: The first calculation parameter has the value Dis[angleIdx], Dis[] is a lookup table, for example it could be Table 3.

The temporary angle parameter is set to (angleIdx+8)%32, assumed to be TempIdx.

The second computational parameter has the value Dis[TempIdx].

It is noted that theoretically, Dis[angleIdx] and Dis[TempIdx] are approximate values of the cosine and sine of the same angle, and the angle represents the geometric relationship between the common boundary and the current block.

In another possible implementation: The first calculation parameter has the value Dis1[angleIdx], Dis1[] is a lookup table, for example it could be Table 3.

The second computational parameter is set to Dis2[angleIdx], Dis2[] is another lookup table.

It should be noted that Dis1[angleIdx] and Dis2[angleIdx] are approximate values of the cosine and sine of the same angle, and the angle represents the geometric relationship between the common boundary and the current block.

The third computational parameter is obtained as follows:

wIdx is set equal to log2(nCbW) - 3, nCbW is the width of the current block;

hIdx is set equal to log2(nCbH) - 3, nCbH - the height of the current block;

stepOffset is set to a positive integer, such as 64.

Comparison of wIdx and hIdx:

whRratio=(wIdx >= hIdx) ? wIdx - hIdx : hIdx - wIdx

wIsLargerH=(wIdx >= hIdx)? true : false

scaleStep=(wIdx >= hIdx)? (1 << hIdx) : (1 << wIdx)

It is clear that in another possible implementation:

whRratio=(wIdx > hIdx)? wIdx - hIdx : hIdx - wIdx

wIsLargerH=(wIdx > hIdx)? true : false

ScaleStep=(wIdx > hIdx)? (1 << hIdx) : (1 << wIdx)

angleN is set to:

angleN=angleIdx, if angleIdx >= 0 && angleIdx <=8,

angleN=16 - angleIdx, if angleIdx > 8 && angleIdx<= 16,

angleN=angleIdx - 16 if angleIdx > 16 && angleIdx <=24,

angleN=32 - angleIdx otherwise,

It should be noted that in different implementations the endpoints angleIdx 0, 8, 16, 24 may belong to different subpartitions, for example:

In another possible implementation, the angle N is set to:

angleN=angleIdx, if angleIdx > 0 && angleIdx <8,

angleN=16 - angleIdx, if angleIdx >= 8 && angleIdx< 16,

angleN=angleIdx - 16, if angleIdx > =16 && angleIdx <24,

angleN=32 - angleIdx otherwise,

Additionally, angleN is set to the following value:

angleN=(wIsLargerH) ? 8 - angleN : angleN

stepDis is set according to the whRatio and angleN values specified in the lookup table, such as Table 2.

stepSize=stepDis+stepOffset

The third computational parameter rho is set to the following value using a lookup table designated Dis, e.g. Table 3.

rho=DistanceIdx*stepSize*scaleStep+nCbW*Dis[angleIdx] + nCbH*Dis[TempIdx].

And accordingly, in another possible implementation, the third computational parameter rho can be set as:

rho=DistanceIdx*stepSize*scaleStep+nCbW*Dis1 [angleIdx] + nCbH*Dis2 [angleIdx].

It is noted that since after the presence of the angular parameter and the distance parameter, the first, second and third computational parameter can be determined. In an exemplary embodiment, the first, second, and third computational parameters would be calculated only once as parameters for all samples in the current block. And steps S201 and S202 can be skipped for the motion information storing process if the first, second and third calculation parameters of the current block have already been determined.

S203: determining the distance between a set of discrete samples in the current block and a common boundary.

The distance is calculated as follows:

distFromLine=(x+K)*P1+(y+K)*P2-P3,

where P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter, respectively, distFromLine represents the distance, K is a non-negative integer, x represents the horizontal coordinate of the target position in the sample set, y represents the vertical coordinate of the target position in the rectangular a coordinate system where the position of the top left sampled reference of the current block is set as the origin, the right direction is set as the positive horizontal direction, and the down direction is set as the positive vertical direction.

In a possible implementation, K is equal to 1.

distFromLine=(x+1)*P1+(y+1)*P2-P3.

It is noted that the distance between the sample set in the current block and the common boundary is generally the distance between the target position in the sample set and the common boundary.

The target position in the sample set is predetermined. For example, the predetermined position may be the top left position of the sample set, or the center position of the sample set, or another position of the sample set.

It should be noted that the target position may be an integer sample position in a sample set, and the target position may also be a fractional sample position. For example, the target position may be the position of the current block's center of gravity. More specifically, in the case where the current block is a 4x4 sample array, the target position may be a position at coordinates (1.5, 1.5) in the rectangular coordinate system of the current embodiment.

In a possible embodiment, the accuracy of the discrete distance reading is higher than the integer discrete reading. Accordingly, the distance is calculated as follows:

distFromLine=((x<<N)+ K)*P1+((y<<N)+K)*P2-P3,

where 2 ^N represents the reciprocal of the distance sample precision, for example, when the distance sample accuracy is half a pixel, N is 1, when the distance sample accuracy is 1/4 pixel, N is 2.

For example, distance is calculated as follows:

distFromLine=((x<<1)+1)*Dis[angleIdx]+((y<<1)+1)*Dis[TempIdx]-rho

S204: Comparing the distance with a threshold to determine that the third motion information is stored for the sample set.

The third motion information is derived from the first motion information and the second information. In an exemplary embodiment, the third motion information is a combination of the first motion information and the second motion information, similar to the motion information for bi-prediction. More specifically, in the case where the first motion information includes RILX_first, MVLX_first, the second motion information includes RILY_second, MVLY_second, where X may be 0 or 1, and Y may be 0 or 1, the third motion information may include all RILX_first, MVLX_first , RILY_second, MVLY_second, which means PFL0=1, PFL1=1.

In another possible embodiment, the third motion information may be equal to one of the first motion information or the second motion information in a case where both the first motion information and the second motion information correspond to the same list (List0 or List1) . For example, if PFL0 is 1 and PFL1 is 0 for both the first and second motion information, the third motion information may be set equal to the first motion information (or the second motion information, according to another implementation). Likewise, if PFL0 is 0 and PFL1 is 1 for both the first and second motion information, the third motion information may be set equal to the first motion information (or the second motion information, according to another embodiment).

In an exemplary embodiment, the threshold may be a predetermined value.

In another possible embodiment, the threshold is based on a geometric relationship between a common boundary and a horizontal direction or a geometric relationship between a common boundary and a vertical direction. More specifically, the threshold value is based on the angle between the perpendicular direction of the common boundary and the horizontal direction or vertical direction. And in other embodiments, the geometric relationship may include a length relationship between a common boundary and a block boundary of the current block or a subblock of the current block. In the current embodiment, the threshold value can be obtained using a lookup table such as Table 5 according to the angle calculated above.

Threshold=RhoMax[angleN].

It should be noted that since the angle N can be determined before step S204, the threshold value (Threshold) can be determined before step S204 for the current block.

The threshold value can also be

threshLower=- RhoMax[angleN]

threshUpper=RhoMax[angleN].

Table 5 RhoMax table for deriving the weighting coefficients of the geometric partition. idx 0 1 2 3 4 5 6 7 8 RhoMax[idx] 1 2 2 3 3 3 2 2 1

In another possible implementation, the threshold value may also be

threshLower=- K

threshUpper=K, where K is a predefined positive number. For example, the value of K may be 1. In one example, K may be obtained according to a pointer in the bit stream.

In another possible implementation, the threshold is based on the width and/or height of the current block.

It should be noted that the threshold may also be determined by two or more of the above conditions. For example, the width and/or height of the current block can be defined by a ratio, ratio=1<< abs(log2(width) - log2(height)), and then this ratio is used to scale the threshold determined by the angle. And the scaled threshold is set as the final threshold.

Comparisons between threshold and distance are made in the following steps:

S204-1: Determining that the third motion information is stored for a set of discrete samples, in the case where the absolute value of the distance is less than or equal to the threshold value;

S204-2: in the case where the absolute value of the distance is greater than the threshold value:

determining that the first motion information is stored for a set of discrete samples, in the case where the distance is positive (or negative); or

determining that the second motion information is stored for a set of discrete samples, in the case where the distance is negative (or positive, in accordance with the above branch).

It is understood that, according to another embodiment, the condition in step S204-1 may also be that the absolute value of the distance is less than a threshold value, accordingly, the condition in step S204-2 may be that the absolute value of the distance is greater than or equal to the threshold value .

In another possible implementation, the absolute value calculation is replaced by more subpartitions.

In the current embodiment, that the first motion information is stored for the sample set is stored in the case where the distance is less than threshLower; That the second motion information is stored for a set of discrete samples is retained in the case where the distance is greater than threshUpper; Otherwise, it is maintained that the third motion information is stored for a set of discrete samples.

And it is understood that one of the first motion information, the second motion information, and the third motion information is stored in the motion information storage unit and corresponds to a set of discrete samples.

It should be noted that when the current block can be divided into multiple sets of samples, in an exemplary embodiment, the above steps in the current embodiment are used for all sets of samples. In another possible implementation, the steps described above in the current embodiment are used for only one set of discrete samples. In another possible implementation, the steps described above in the current embodiment are used for at least two sets of discrete samples. For sample sets not implemented by the steps above, a possible implementation would store default motion information or motion information output according to a predetermined condition.

It should be noted that only the distance value needs to be calculated based on the predefined module (function) of the GEO partition, the module parameter of which can be defined at the CU level to determine the storage of motion information for the GEO partition. Computational complexity is limited.

In the fourth embodiment of the decoding process for the GEO prediction mode:

This process is called when decoding a single encoding block with MergeTriangleFlag[xCb][yCb] equal to 1 or geo_flag[xCb][yCb] equal to 1.

The inputs for this process are as follows:

luminance location (xCb, yCb) indicating the upper left sample of the current encoding block relative to the upper left luminance sample of the current picture,

variable cbWidth, indicating the width of the current encoding block in discrete brightness samples,

variable cbHeight indicating the height of the current encoding block in discrete brightness samples,

brightness motion vectors in mvA and mvB with an accuracy of 1/16 fractional discrete count,

chrominance motion vectors mvCA and mvCB,

reference indices refIdxA and refIdxB,

flags predListFlagA and predListFlagB of the prediction list.

The results of this process are:

array (cbWidth)x(cbHeight) predSamples_L discrete samples brightness predictions,

array (cbWidth/2)x(cbHeight/2) predSamples_Cb discrete samples color prediction for the Cb component,

array (cbWidth/2)x(cbHeight/2) predSamples_Cr discrete samples color prediction for the Cr component.

Let predSamplesLA _L and predSamplesLB _L be (cbWidth)x(cbHeight) arrays of predicted brightness sample values, and let predSamplesLA _Cb , predSamplesLB _Cb , predSamplesLA _Cr and predSamplesLB _Cr be (cbWidth/2)x(cbHeight/2) arrays of predicted brightness sample values chromaticity.

preSamples_L, preSamples_Cband preSamples_Crare output from using the following ordered steps:

3. For N being each of A and B, the following applies:

A reference image consisting of an ordered two-dimensional array refPicLN_L discrete brightness samples and two ordered two-dimensional arrays refPicLN_Cb and refPicLN_Cr discrete color samples, output with X set equal to predListFlagN, and refIdxX set equal to refIdxN as input.

Array predSamplesLN_L is output via calling a fractional sample interpolation process with luminance location (xCb, yCb), luminance coding block width sbWidth set to cbWidth, luminance coding block height sbHeight set to cbHeight, motion vector offset mvOffset set to (0, 0), vector mvLX motion set to mvN, and reference array refPicLX_L, set to refPicLNL, bdofFlag set to FALSE, and cIdx set to 0 as input.

Array predSamplesLN_Cb is output via calling a fractional sample interpolation process with luminance location (xCb, yCb), coding block width sbWidth set to cbWidth/2, coding block height sbHeight set to cbHeight/2, motion vector offset mvOffset set to (0, 0), motion vector mvLX set equal to mvCN, reference array refPicLX_Cb, set equal to refPicLN_Cb,bdofFlag variable set to FALSE and cIdx variable set to 1 as input.

Array predSamplesLN_Cr is displayed by calling process of interpolating a fractional sample with brightness position (xCb, yCb), coding block width sbWidth set to cbWidth/2, coding block height sbHeight set to cbHeight/2, motion vector offset mvOffset set to (0, 0), vector motion mvLX set equal to mvCN, reference array refPicLX_Cr, set equal to refPicLN_Cr, bdofFlag variable set to FALSE, and cIdx variable set to 2 as input.

4. If MergeTriangleFlag[xCb][yCb] is 1, the split direction of the triangle merge mode variable triangleDir is set to merge_triangle_split_dir[xCb][yCb].

a. Prediction samples within the current luma coding block, predSamples_L[x_L][y_L] with xL=0…cbWidth - 1 and yL=0…cbHeight - 1 are output by calling the weighted sample prediction process for the triangular fusion mode with the coding block width nCbW set to cbWidth, the coding block height nCbH set to cbHeight, arrays predSamplesLA_L and predSamplesLB_L discrete samples and variables triangleDir and cIdx equal to 0 as input.

b. The prediction samples within the current Cb chroma component encoding block, predSamples _Cb [x _C ][y _C ] with xC=0...cbWidth/2 - 1 and yC=0...cbHeight/2 - 1, are output by calling the weighted sample prediction process for triangular merging mode with the encoding block width nCbW set to cbWidth/2, the encoding block height nCbH set to cbHeight/2, the predSamplesLA _Cb and predSamplesLB _Cb arrays of sampled samples, and the variables triangleDir and cIdx equal to 1, as input.

d. The prediction samples within the current Cr chrominance component encoding block, predSamples _Cr [x _C ][y _C ] with xC=0...cbWidth/2 - 1 and yC=0...cbHeight/2 - 1, are output by calling the weighted sample prediction process for triangular merging mode with encoding block width nCbW set to cbWidth/2, coding block height nCbH set to cbHeight/2, arrays predSamplesLA _Cr and predSamplesLB _Cr of sampled samples, and variables triangleDir and cIdx equal to 2, as input.

d. The motion vector saving process for the triangular fusion mode is called with the luminance encoding block location (xCb, yCb), luminance encoding block width cbWidth, luminance encoding block height cbHeight, split direction triangleDir, luminance motion vectors mvA and mvB, reference indices refIdxA and refIdxB, and flags predListFlagA and predListFlagB of the prediction list as input.

5. If geo_flag[xCb][yCb] is equal to 1, the angleIdx and distanceIdx variables associated with the geometric partitioning are set according to the value of geo_partitioning_idx[xCb][yCb] as specified in Table 1.

a. The process of deriving the weighting coefficient of the discrete sample for the geometric partition merging mode starts. The input to the process is three ordered arrays sampleWeightL, sampleWeightC and motionWeight with sizes of (cbWidth)x(cbHeight), (cbWidth/2)x(cbHeight/2) and (cbWidth/4)x(cbHeight/4), respectively. as well as the variables angleIdx, DistanceIdx, cbWidth and cbHeight.

b. The prediction samples within the current luminance encoding block, predSamplesL[xL][yL] with xL=0..cbWidth - 1 and yL=0..cbHeight - 1, are output by calling the weighted sample prediction process for the geometric split fusion mode with encoding block width nCbW set equal to cbWidth, encoding block height nCbH set equal to cbHeight, sample arrays predSamplesLAL, predSamplesLBL, predWeightL and cIdx equal to 0, as input data.

c. The prediction samples within the current Cb chrominance component encoding block, predSamplesCb[xC][yC] with xC=0..cbWidth/2 - 1 and yC=0..cbHeight/2 - 1, are output by calling the weighted sample prediction process for geometric partition fusion mode with coding block width nCbW set to cbWidth/2, coding block height nCbH set to cbHeight/2, sample arrays predSamplesLACb, predSamplesLBCb, predWeightC and cIdx equal to 1, as input data.

d. The prediction samples within the current Cr chrominance component encoding block, predSamplesCr[xC][yC] with xC=0..cbWidth/2 - 1 and yC=0..cbHeight/2 - 1, are output by calling the weighted sample prediction process for geometric partition fusion mode, as specified in clause 8.5.8.3, with the width nCbW of the coding block set equal to cbWidth/2, the height nCbH of the coding block set to cbHeight/2, arrays predSamplesLACr, predSamplesLBCr of discrete samples, predWeightC and cIdx equal to 2, as inputs.

e. The motion vector storing process for the geometric fusion mode is called with the luminance coding block location (xCb, yCb), luminance coding block width cbWidth, luminance coding block height cbHeight, motionWeight array of samples, luminance motion vectors mvA and mvB, reference indices refIdxA and refIdxB, and with the prediction list flags predListFlagA and predListFlagB as input.

Reference image matching process for triangular merge mode

The input data to this process is the following:

the variable X representing the list of links is 0 or 1,

reference index refIdxN.

The result of this process:

reference index refIdxTemp.

The refPicPoc variable is output as follows:

refPicPoc=(X== 0) ? RefPicList[0][refIdxN] : RefPicList[1][refIdxN] (8-878)

The list of reference pictures refPicListTemp is displayed as follows:

refPicListTemp=(X== 0) ? RefPicList[1] : RefPicList[0] (8-879)

The refIdxTemp variable is obtained as follows:

The mapStop variable is set to FALSE.

For variable refIdxm _with m=0..NumRefIdxActive[1] - 1, the following applies until mapStop is FALSE:

refIdxTemp=(refPicListTemp[refIdxm]== refPicPoc) ? refIdxm : -1 (8-880)

mapStop=(refIdxTemp!= -1)? TRUE : FALSE (8-881)

The process of deriving the weighting coefficient of a discrete sample for the merging mode of a geometric partition

The inputs for this process are as follows:

two variables nCbW and nCbH, defining the width and height of the current encoding block,

two variables angleIdx and DistanceIdx, which define the angle and distance search values for the current geometric partitioning mode,

(nCbW)x(nCbH) array sampleWeight _L ,

(nCbW/2)x(nCbH/2) array sampleWeight _C ,

(nCbW/4)x(nCbH/4) motionWeight array.

The result of this process is the same three arrays sampleWeight _L, sampleWeightC _and motionWeight with weighting coefficients for the discrete sample having a range from 0 ... 8.

4. The luminance blending weights stored in sampleWeight _L for the current geometric partitioning mode are output as follows:

The following variables are set:

wIdx is set to log2 (nCbW) - 3,

hIdx is set equal to log2(nCbH) - 3,

stepOffset is set to 64,

the following variables are set according to the comparison (wIdx >= hIdx):

whRratio=(wIdx >= hIdx) ? wIdx - hIdx : hIdx - wIdx (8-882)

wIsLargerH=(wIdx >= hIdx)? true : false (8-883)

scaleStep=(wIdx >= hIdx)? (1 << hIdx) : (1 << wIdx) (8-884)

displacementX is set to angularIdx

displacementY set to (displacementX+8)% 32

angleN is set to:

angleN=angleIdx, if angleIdx >= 0 && angleIdx <=8,

angleN=16 - angleIdx, if angleIdx > 8 && angleIdx<= 16,

angleN=angleIdx - 16 if angleIdx > 16 && angleIdx <=24,

angleN=32 - angleIdx otherwise,

then angleN is set to the following value, depending on wIsLargerH:

angleN=(wIsLargerH) ? 8 - angleN : angleN

stepDis is set according to the whRatio and angleN values as specified in Table 2ff.

stepSize=stepDis+stepOffset

rho is set to the following value using the lookup table, designated Dis, listed in Table 3:

rho=DistanceIdx*stepSize*scaleStep+nCbW*Dis[displacementX] + nCbH*Dis[displacementY] . (8-885)

For each sample position x=0… nCbW - 1 and y=0… nCbH - 1 the sampleWeight _L [x][y] value is output as follows:

the distance distFromLine[x][y] is calculated using the lookup table denoted Dis, listed in Table 3 as follows:

distFromLine[x][y]=((x<<1) + 1)*Dis[displacementX] + ((y<<1) + 1))*Dis[displacementY] - rho (8-886)

The scaled distance distScaled is obtained as follows:

distScaled=min((abs(distFromLine[x][y]) + 8) >> 4, 14). (8-887)

The value of sampleWeight _L [x][y] is set according to the filter weight lookup table designated as GeoFilter listed in Table 4 as:

sampleWeight _L [x][y]=GeoFilter[distScaled] if distFromLine <= 0

sampleWeight _L [x][y]=8 - GeoFilter [distScaled] if distFromLine > 0

5. The chroma weights stored in sampleWeight _C for the current geometric partitioning mode are output as follows:

For each sample position x=0… (nCbW/2) - 1 and y=0… (nCbH/2) - 1 the sampleWeight _C [x][y] value is output as follows:

sampleWeight _C [x][y]=sampleWeight _L [(x<<1)][(y<<1)]

6. The motion weights stored in the motionWeight array for the current geometric partitioning mode are output as follows:

The following variables are set according to Table 5:

threshLower=- RhoMax[angleN]

threshUpper=RhoMax[angleN].

For each sample position x=0… (nCbW/4) - 1 and y=0… (nCbH/4) - 1 the motionWeight[x][y] value is output as follows:

Cnt=distFromLine[x*4+1][y*4+1] The motionWeight[x][y] value is set to:

motionWeight[x][y]=0 if Cnt <= threshLower

motionWeight[x][y]=1 if Cnt >= threshUpper

motionWeight[x][y]=2 otherwise

Weighted sample prediction process for fusion mode with geometric partitioning

The inputs for this process are as follows:

two variables nCbW and nCbH, defining the width and height of the current encoding block,

two arrays (nCbW)x(nCbH) predSamplesLA and predSamplesLB,

Array (nCbW)x(nCbH) sampleWeight,

cIdx variable indicating the index of the color component.

The result of this process is an array (nCbW)x(nCbH) pbSamples of prediction sample values.

The bitDepth variable is output as follows:

- If cIdx is 0, bitDepth is set to BitDepthY.

- Otherwise, bitDepth is set equal to BitDepthC.

The shift1 and offset1 variables are output as follows:

- The shift1 variable is set to Max(5, 17 - bitDepth).

- The offset1 variable is set to 1 << (shift1 - 1).

The prediction sample values are output as follows:

pbSamples[x][y] =

Clip3(0, (1 << bitDepth) - 1,

(predSamplesLA[x][y] * sampleWeight[x][y]

+ predSamplesLB[x][y] * (8 - sampleWeight [x][y]) + offset1) >> shift1)

Saving motion vectors for geometric mesh merging mode

This process is called when decoding a single encoding block with geo_flag[xCb][yCb] equal to 1.

The inputs for this process are as follows:

luminance location (xCb, yCb) indicating the upper left sample of the current encoding block relative to the upper left luminance sample of the current picture,

variable cbWidth, indicating the width of the current encoding block in discrete brightness samples,

variable cbHeight indicating the height of the current encoding block in discrete brightness samples,

motionWeight array of size (cbWidth/4)x(cbHeight/4) containing motion destination indices,

brightness motion vectors in mvA and mvB with an accuracy of 1/16 fractional discrete count,

reference indices refIdxA and refIdxB, Data

flags predListFlagA and predListFlagB of the prediction list.

The variables numSbX and numSbY, which determine the number of 4x4 blocks in the current encoding block horizontally and vertically, are set to numSbX=cbWidth >> 2 and numSbY=cbHeight >> 2.

The variable minSb is set equal to min(numSbX, numSbY).

The variable refIdxTempA is derived by calling the reference snapshot mapping process for the triangular merge mode specified in clause 8.5.7.4 with X set to predListFlagA and refIdxN set to refIdxA as input.

The variable refIdxTempB is derived by running the reference snapshot matching process for the triangular merge mode specified in clause 8.5.7.4 with X set to predListFlagB and refIdxN set to refIdxB as input.

For each 4x4 subblock with a subblock index (xSbIdx, ySbIdx) with xSbIdx=0..numSbX - 1 and ySbIdx=0..numSbY - 1, the following applies:

If motionWeight[xSbIdx][ySbIdx] is 0, the following applies:

predFlagL0=(predListFlagA== 0) ? 1 : 0 (8-888)

predFlagL1=(predListFlagA== 0) ? 0 : 1 (8-889)

refIdxL0=(predListFlagA== 0) ? refIdxA : -1 (8-890)

refIdxL1=(predListFlagA== 0) ? -1 : refIdxA (8-891)

mvL0 [0]=(predListFlagA== 0) ? mvA[0] : 0 (8-892)

mvL0[1]=(predListFlagA== 0) ? mvA[1]: 0 (8-893)

mvL1 [0]=(predListFlagA== 0) ? 0 : mvA[0] (8-894)

mvL1[1]=(predListFlagA== 0) ? 0 : mvA[1] (8-895)

Otherwise, if motionWeight[xSbIdx][ySbIdx] is 1, the following applies:

predFlagL0=(predListFlagB== 0) ? 1 : 0 (8-896)

predFlagL1=(predListFlagB== 0) ? 0 : 1 (8-897)

refIdxL0=(predListFlagB== 0) ? refIdxB : -1 (8-898)

refIdxL1=(predListFlagB== 0) ? -1 : refIdxB (8-899)

mvL0 [0]=(predListFlagB== 0) ? mvB[0] : 0 (8-900)

mvL0[1]=(predListFlagB== 0) ? mvB[1]: 0 (8-901)

mvL1 [0]=(predListFlagB== 0) ? 0 : mvB[0] (8-902)

mvL1[1]=(predListFlagB== 0) ? 0 : mvB[1] (8-903)

Otherwise (motionWeight[xSbIdx][ySbIdx] is 2) the following applies:

If predListFlagA+predListFlagB is 1,

predFlagL0=1 (8-904)

predFlagL1=1 (8-905)

refIdxL0=(predListFlagA== 0) ? refIdxA : refIdxB (8-906)

refIdxL1=(predListFlagA== 0) ? refIdxB : refIdxA (8-907)

mvL0 [0]=(predListFlagA== 0) ? mvA[0] : mvB[0] (8-908)

mvL0[1]=(predListFlagA== 0) ? mvA[1] : mvB[1] (8-909)

mvL1 [0]=(predListFlagA== 0) ? mvB[0] : mvA[0] (8-910)

mvL1[1]=(predListFlagA== 0) ? mvB[1] : mvA[1] (8-911)

If predListFlagA+predListFlagB is 0, the following applies:

predFlagL0=1 (8-912)

predFlagL1=(refIdxTempA== -1 && refIdxTempB== -1) ? 0 : 1 (8-913)

refIdxL0=(refIdxTempB != -1) ? refIdxA : (8-914) ((refIdxTempA != -1) ? refIdxB : refIdxA)

refIdxL1=(refIdxTempB != -1) ? refIdxTempB : (8-915) ((refIdxTempA != -1) ? refIdxTempA : -1)

mvL0[0] = (refIdxTempB != -1) ? mvA[0] : (8-916) ((refIdxTempA != -1) ? mvB[0] : mvA[0])

mvL0[1] = (refIdxTempB != -1) ? mvA[1]: (8-917) ((refIdxTempA != -1) ? mvB[1] : mvA[1])

mvL1[0] = (refIdxTempB != -1) ? mvB[0] : (8-918) ((refIdxTempA != -1) ? mvA[0] : 0)

mvL1[1] = (refIdxTempB != -1) ? mvB[1]: (8-919) ((refIdxTempA != -1) ? mvA[1] : 0)

If the value of predListFlagA+predListFlagB is 2, the following applies:

predFlagL0=(refIdxTempA== -1 && refIdxTempB== -1) ? 0 : 1 (8-920)

predFlagL1=1 (8-921)

refIdxL0=(refIdxTempB != -1) ? refIdxTempB : (8-922) ((refIdxTempA != -1) ? refIdxTempA : -1)

refIdxL1=(refIdxTempB != -1) ? refIdxA : (8-923) ((refIdxTempA != -1) ? refIdxB : refIdxA)

mvL0[0] = (refIdxTempB != -1) ? mvB[0] : (8-924) ((refIdxTempA != -1) ? mvA[0] : 0)

mvL0[1] = (refIdxTempB != -1) ? mvB[1]: (8-925) ((refIdxTempA != -1) ? mvA[1] : 0)

mvL1[0] = (refIdxTempB != -1) ? mvA[0] : (8-926) ((refIdxTempA != -1) ? mvB[0] : mvA[0])

mvL1[1] = (refIdxTempB != -1) ? mvA[1]: (8-927) ((refIdxTempA != -1) ? mvB[1] : mvA[1])

For x=0..3 and y=0..3 the following assignments are made:

MvL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=mvL0 (8-928)

MvL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=mvL1 (8-929)

RefIdxL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=refIdxL0 (8-930)

RedIdxL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=refIdxL1 (8-931)

PredFlagL0[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=predFlagL0 (8-932)

PredFlagL1[(xSbIdx << 2) + x][(ySbIdx << 2) + y]=predFlagL1 (8-933)

In an alternative implementation of step 6 “The process of deriving the discrete sample weight coefficient for the geometric partition merging mode” can be implemented as follows:

6. The motion weights stored in the motionWeight array for the current geometric partitioning mode are output as follows:

The following variables are set according to Table 5:

threshLower=- RhoMax[angleN]

threshUpper=RhoMax[angleN].

For each sample position x=0... (nCbW/4) - 1 and y=0... (nCbH/4) - 1 the motionWeight[x][y] value is output as follows:

Cnt=((x<<4) + 3)*Dis[offsetX] + ((y<<4) + 3))*Dis[offsetY] - rho<<1

The motionWeight[x][y] value is:

motionWeight[x][y]=0 if Cnt <= threshLower

motionWeight[x][y]=1 if Cnt >= threshUpper

motionWeight[x][y]=2 otherwise

In the above example implementation of step 6 "Process of discrete sample weight derivation for geometric partition merging mode", the equation "Cnt=((x<<4) + 3)*Dis[displacementX] + ((y<<4) + 3 ))*Dis[displacementY] - rho<<1" corresponds to calculating the distance between the center of gravity of the sample set and the line. The sample set in this example consists of 16 samples with the following coordinates:

(x*4,y*4), (x*4+1,y*4), (x*4+2,y*4), (x*4+3,y*4), (x*4 ,y*4+1), (x*4+1,y*4+1), (x*4+2,y*4+1), (x*4+3,y*4+1), (x*4,y*4+2), (x*4+1,y*4+2), (x*4+2,y*4+2), (x*4+3,y*4 +2), (x*4,y*4+3), (x*4+1,y*4+3), (x*4+2,y*4+3), (x*4+3 ,у*4+3).

Coordinates of the center of gravity (x*4+1.5,y*4+1.5). In the above equation, all additive terms in the equation are multiplied by 2 to make the coordinate offsets 1.5 integer (hence 3 in this example), since integer arithmetic is the desired implementation feature.

In the fifth embodiment, the motion information storage device, as shown in FIG. 21, is as follows:

A motion information storage device (3000), wherein the current block is composed of a first sub-block and a second sub-block, the first sub-block and the second sub-block are separated by a common boundary, the first sub-block corresponds to the first motion information, and the second sub-block corresponds to the second motion information, wherein the device (3000) contains: a calculation module (3001) configured to determine the distance between a set of discrete samples in the current block and a common boundary; and a comparison unit (3002) configured to compare the distance with a threshold value to determine that third motion information is stored for a set of discrete samples, wherein the third motion information is derived from the first motion information and the second motion information.

In a possible implementation in which the comparison module (3002) is configured to:

determine that the third motion information is stored for a set of discrete samples, in a case in which the absolute value of the distance is less than or equal to the threshold value.

In a possible implementation in which, in a case in which the absolute value of the distance is greater than a threshold value, the comparison module (3002) is further configured to: determine that the first motion information is stored for a set of discrete samples, in the case in which the distance is positive ; or determine that the second motion information is stored for a set of discrete samples, in the case where the distance is negative.

In an exemplary embodiment, the threshold value is predetermined.

In an exemplary embodiment, the threshold is based on a geometric relationship between the common boundary and the horizontal direction or vertical direction.

In an exemplary embodiment, the threshold is based on the angle between the perpendicular direction of the common boundary and the horizontal direction or vertical direction.

In an exemplary embodiment, the threshold is based on the width and/or height of the current block.

In a possible implementation in which the common boundary is determined by an angular parameter and a distance parameter, the calculation module (3001) is further configured to: determine the angular parameter and the distance parameter.

In a possible implementation in which, in the decoder, the calculation module (3001) is further configured to: extract, by analyzing, an angular parameter and a distance parameter from the bit stream; or extracting by parsing a pointer from the bitstream and deriving an angular parameter and a distance parameter based on the pointer.

In a possible embodiment, the calculation module (3001) is further configured to: determine the first calculation parameter based on the angular parameter; calculating a temporary angular parameter based on the angular parameter; determining a second computational parameter based on the time angular parameter; and calculating a third calculation parameter based on the angular parameter and the distance parameter.

In an exemplary embodiment, wherein a first computational parameter is determined by checking a preset lookup table according to an angular parameter, and a second computational parameter is determined by checking said lookup table according to a temporary angular parameter, and wherein the first computational parameter and the second computational parameter are a cosine value and the value of the sine of the same angle, respectively.

In a possible implementation, the distance is calculated as follows:

distFromLine=(x+K)*P1+(y+K)*P2-P3,

where P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter, respectively, distFromLine represents the distance, K is a non-negative integer, x represents the horizontal coordinate of the target position in the sample set, y represents the vertical coordinate of the target position in the rectangular a coordinate system where the position of the top left sampled reference of the current block is set as the origin, the right direction is set as the positive horizontal direction, and the down direction is set as the positive vertical direction.

In a possible implementation where K is equal to 1.

In a possible implementation in which the target position is predefined in a set of discrete samples.

In an exemplary embodiment, wherein the predetermined position is the top left position of the sample set or the center position of the sample set.

In a possible embodiment, in which the accuracy of the discrete distance reading is higher than the integer discrete reading;

Accordingly, the distance is calculated as follows:

distFromLine=((x<<N)+ K)*P1+((y<<N)+K)*P2-P3,

where 2 ^N represents the reciprocal of the discrete distance reading accuracy.

In a possible implementation where N is 1.

In an exemplary embodiment, the set of samples is a set of luminance samples of the current block.

In an exemplary embodiment in which the device (3000) further comprises a splitting module (3003) configured to: divide the current block into a plurality of sample sets, wherein each of the plurality of sample sets has the same size as the sample set ; or setting the current block as a set of discrete samples.

In an exemplary embodiment, the sample set is a 4x4 sample array.

In an exemplary embodiment in which each of the plurality of sets of discrete samples corresponds to each motion information storage module, the motion information storage module is used to store one of the first motion information, the second motion information, and the third motion information.

In an exemplary embodiment, the first subblock and the second subblock are a triangular mesh, a trapezoidal mesh, or an asymmetric rectangular mesh.

In an exemplary embodiment, in which the first motion information contains motion information based on the first reference picture list, the second motion information contains motion information based on the second reference picture list, and the third motion information contains the first motion information and the second information about movement.

In a sixth embodiment, an apparatus for decoding a video stream includes a processor and a memory, wherein the memory stores instructions that cause the processor to execute a method according to any embodiment of the third embodiment.

In a seventh embodiment, an apparatus for encoding a video stream includes a processor and a memory, wherein the memory stores instructions that cause the processor to execute a method according to any embodiment of the third embodiment.

In an eighth embodiment, a computer-readable storage medium storing instructions that, when executed, direct one or more processors to provide encodings of video data, wherein the instructions direct one or more processors to execute a method according to any embodiment of the third embodiment.

In the ninth embodiment, the computer program contains program code for executing the method according to any embodiment of the third embodiment when executed on a computer.

The following will explain the applications of the encoding method as well as the decoding method as shown in the above embodiments and the system using them.

FIG. 22 is a block diagram showing a content delivery system 3100 for implementing a content distribution service. This content delivery system 3100 includes a capture device 3102, a terminal device 3106, and optionally includes a display 3126. The capture device 3102 communicates with the terminal device 3106 over a communication line 3104. The communication link may include a communication channel 13 described above. Communication link 3104 includes, but is not limited to, WIFI, Ethernet, cable, wireless (3G/4G/5G), USB, or any combination thereof, and the like.

The capture device 3102 generates data and can encode the data in an encoding manner 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 is not limited to, a camera, a smartphone or tablet, or a computer. or a laptop computer, a video conferencing system, a PDA, a vehicle-mounted device, or a combination of any of these, or the like. For example, capture device 3102 may include 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 (ie, voice), an audio encoder included in the capture device 3102 may actually perform audio encoding processing. For some practical scenarios, capture device 3102 distributes encoded video and audio data by multiplexing them together. For other practical scenarios, such as in a video conferencing system, encoded audio data and encoded video data are not multiplexed. The capture device 3102 separately distributes the encoded audio data and the encoded video data to the terminal device 3106.

In the content delivery system 3100, the terminal device 310 receives and reproduces encoded data. The terminal device 3106 may be a device with the ability to receive and retrieve data, such as a smartphone or tablet 3108, a computer or laptop 3110, a network video recorder (NVR)/digital video recorder (DVR) 3112, a television 3114, a set-top box (STB) 3116, a video conferencing system 3118 , a video surveillance system 3120, a personal digital assistant (PDA) 3122, a vehicle-mounted device 3124, or a combination thereof, or the like, capable of decoding the aforementioned encoded data. For example, terminal device 3106 may include a recipient device 14, as described above. When the encoded data includes video, the video decoder 30 included in the terminal device is given priority to perform video decoding. When the encoded data includes audio, an audio decoder included in the terminal device takes priority to perform audio decoding processing.

For a terminal device with a display, such as a smartphone or tablet 3108, a computer or laptop 3110, a network video recorder (NVR)/digital video recorder (DVR) 3112, a television 3114, a personal digital assistant (PDA) 3122, or a vehicle-mounted device 3124, terminal device can transmit decoded data to its display. For a non-display terminal device, such as an STB 3116, video conferencing system 3118, or video surveillance system 3120, it communicates with an external display 3126 to receive and display decoded data.

When each device in this system performs encoding or decoding, a picture encoding device or a picture decoding device may be used, as shown in the above embodiments.

FIG. 23 is a diagram showing the structure of an example of a terminal device 3106. After the terminal device 3106 receives a stream from the capture device 3102, the protocol processing unit 3202 analyzes the transmission protocol of the stream. The protocol includes, but is not limited to, Real Time Streaming Protocol (RTSP), Hypertext Transfer Protocol (HTTP), HTTP Real Time Streaming Protocol (HLS), MPEG-DASH, Real Time Transport Protocol (RTP), Real Time Messaging (RTMP), or any combination thereof or the like.

After the protocol processing module 3202 processes the stream, a stream file is created. The file is output to the demultiplexing module 3204. The demultiplexing unit 3204 may separate the multiplexed data into encoded audio data and encoded video data. As described above, for some practical scenarios, such as in a video conferencing system, encoded audio data and encoded video data are not multiplexed. In this situation, the encoded data is transmitted to the video decoder 3206 and audio decoder 3208 without using the demultiplexing module 3204.

Through demultiplexing processing, a video elementary stream (ES), an audio ES, and optionally subtitles are generated. The video decoder 3206, which includes the video decoder 30 as explained in the above embodiments, decodes the video ES using the decoding method as shown in the above embodiments to generate a video frame and supplies this data to the synchronization unit 3212. Audio decoder 3208 decodes the audio ES to generate an audio frame and supplies this data to synchronization module 3212. Alternatively, the video frame may be stored in a buffer (not shown in FIG. 23) before being supplied to the timing module 3212. Likewise, an audio frame may be stored in a buffer (not shown in FIG. 23) before being supplied to timing module 3212.

The synchronization module 3212 synchronizes the video frame and the audio frame and supplies the video/audio to the video/audio display 3214. For example, the synchronization module 3212 synchronizes the presentation of video and audio information. Information may be encoded in syntax using timestamps relating to the presentation of the encoded audio and visual data, and timestamps relating to the delivery of the data stream itself.

If subtitles are included in the stream, subtitle decoder 3210 decodes the subtitles and synchronizes them with the video frame and audio frame and transmits the video/audio/subtitles to the video/audio/subtitle display 3216.

The present application is not limited to the above system, and either the picture encoding device or the picture decoding device in the above embodiments may be included in another system, such as an automotive 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 such as exponentiation and real-valued division are also defined. Numbering and counting rules usually start from 0, for example, "first" is equivalent to 0, "second" is equivalent to 1, 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 x _y Exponentiation. Defines x to the power of y. In other contexts, this notation is used as a superscript that should not be interpreted as exponentiation. / Integer division with the result truncated towards zero. For example, 7/4 and -7/-4 are truncated to 1, and -7/4 and 7/-4 are truncated to -1. ÷ Used to indicate division in mathematical equations where truncation or rounding is not intended. Used to indicate division in mathematical equations where truncation or rounding is not intended. Summation f(i), where i takes all integer values from x to y inclusive. x%y Modulo operation. The remainder of x divided by y is defined only for integers x and y, where x >= 0 and y > 0.

Logical operators

The following logical operators are defined as follows:

x && y Boolean logical "and" for x and y

x || y Boolean logical "or" for x and y

! Boolean logical "not"

x?y:z If x is TRUE or not 0, the value of y is calculated; otherwise, the z value is calculated.

Relational operators

The following relational operators are defined as follows:

>More than

>= Greater than or equal to

< Less than

<= Less than or equal to

== Equal

!= Not equal

When a relational operator is applied to an element or syntax variable that is set to "na" (not applicable), the value "na" is treated as a separate value for the element or syntax variable. The value "na" is not considered equal to any other value.

Bitwise operators

The following bitwise operators are defined as follows:

& Bitwise "and". When working with integer arguments, operates on the two's complement representation of the integer value. When dealing with a binary argument that contains fewer bits than another argument, the shorter argument is expanded by adding more significant bits equal to 0.

| Bitwise "or". When working with integer arguments, operates on the two's complement representation of the integer value. When dealing with a binary argument that contains fewer bits than another argument, the shorter argument is expanded by adding more significant bits equal to 0.

^ Bitwise exclusive OR. When working with integer arguments, operates on the two's complement representation of the integer value. When dealing with a binary argument that contains fewer bits than another argument, the shorter argument is expanded by adding more significant bits equal to 0.

x >> y Arithmetic right shift of the integer representation of x with y's complement of binary digits. This function is defined only for non-negative integer values of y. Bits shifted to the most significant bits (MSB) by a right shift have a value equal to MSB x before the shift operation.

x << y Arithmetic left shift of the two's complement integer representation of x to y binary digits. This function is defined only for non-negative integer values of y. Bits shifted to the least significant bits (LSB) by left shifting have a value of 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 before the increment operation.

-- Decrease, i.e. x-- is equivalent to x = x-1 ; when used in an array index, evaluates the value of the variable before the decrement operation.

+= Increment by the specified amount, i.e. x+=3 is equivalent to x=x+3, and x+=(-3) is equivalent to x=x+(-3).

-= Decrease by the specified amount, i.e. x-=3 is equivalent to x=x-3, and x-=(-3) is equivalent to x=x-(-3).

Range designation

The following notation is used to indicate a range of values:

x=y..z x takes integer values from y to z, inclusive, where x, y and z are integers and z is greater than y.

Mathematical functions

The following mathematical functions are defined:

Abs(x)=

Asin(x) is a trigonometric arcsine function operating on an argument x that ranges from -1.0 to 1.0 inclusive, with an output ranging from -π÷2 to π÷2 inclusive, in units of radians.

Atan(x) is a trigonometric arctangent function operating on an argument x, with an output value ranging from -π÷2 to π÷2 inclusive, in radian units.

Ceil(x) is the smallest integer greater than or equal to x.

Clip1Y(x)=Clip3(0, (1 << BitDepthY) - 1, x)

Clip1C(x)=Clip3(0, (1 << BitDepthC) - 1, x)

Cos(x) is a trigonometric cosine function that operates on x in radian units.

Floor(x) is the largest integer less than or equal to x.

Ln(x) natural logarithm of x (logarithm to base e, where e is the base constant of the natural logarithm 2.781 281 828...).

Log2(x) logarithm of x to base 2.

Log10(x) logarithm of x to base 10.

Min(x, y)=

Max(x, y)=

Round(x)=Sign(x)*Floor(Abs(x)+)

Sign(x)=

Sin(x) is a trigonometric sine function that takes the argument x in radian units.

Sqrt(x)=

Swap(x, y)=(y, x)

Tan(x) is a trigonometric tangent function that operates on x in radian units.

Order of priority of operations

When the order of precedence in an expression is not explicitly specified using parentheses, the following rules apply:

- Higher priority operations are evaluated before any lower priority operation.

- Operations with the same priority are evaluated sequentially from left to right.

The table below lists the priority of operations from highest to lowest; a higher position in the table indicates higher priority.

For those operators that are also used in the C programming language, the order of precedence used in this description is the same as in the C programming language.

Table: Operation priority from highest (at the top of the table) to lowest (at the bottom of the table) operations (with operands x, y and z) "x++", "x- -" "!x", "-x" (as unary prefix operator) x ^y "x*y", "x/y", "x ÷ y", " ", "x%y" "x+y", "x - y" (as an operator with two arguments), " " "x << y", "x>>y" "x < y", "x <= y", "x > y", "x >= y" "x==y", "x != y" "x&y" "x | y" "x && y" "x || y" "x ? y : z" "x..y" "x=y", "x += y", "x -= y"

Text description of logical operations

The text contains a definition of logical operations, which would be described mathematically in the following form:

if(condition 0)

statement 0

else if(condition 1)

statement 1

...

otherwise /* informative comment on the remaining condition */

statement n

can be described as follows:

... as below / ... the following applies:

- If condition is 0, assertion is 0

- Otherwise, If condition 1, statement 1

-...

- Otherwise (informative comment on the remaining condition), statement n.

Each "If...Else, If...Else,..." statement in the text is introduced with the words "...as stated below" or "...the following applies" followed immediately by "If...". The last condition of "If... Else If... Otherwise, ..." is always "Else, ...". Alternating definitions "If... Else If... Else, ..." can be identified by juxtaposing "... as follows" or "... the following applies" with the final "Else, ...".

The text contains a statement of logical operations, which would be mathematically described in the following form:

if(condition 0a && condition 0b)

statement 0

else if(condition 1a | | condition 1b)

statement 1

...

otherwise

statement n

can be described as follows:

... as below / ... the following applies:

-- If all of the following conditions are true, assertion 0:

- condition 0a

- condition 0b

- Otherwise, if one or more of the following conditions are true, statement 1:

- condition 1a

- condition 1b

-...

- Otherwise, statement n

The text contains a statement of logical operations, which would be mathematically described in the following form:

if(condition 0)

statement 0

if(condition 1)

statement 1

can be described as follows:

When condition is 0, assertion is 0

When condition is 1, statement is 1.

Embodiments of, for example, encoder 20 and decoder 30, as well as the functions described herein, for example, with respect to encoder 20 and decoder 30, may be implemented by hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over a communication medium in the form of one or more instructions or code executed by a hardware processing unit. A computer-readable medium may include a computer-readable storage medium that corresponds to a tangible medium, such as a storage medium, or a transmission medium, including any medium that facilitates the transfer of a computer program from one place to another, for example, in accordance with a communications protocol. Thus, computer-readable media may generally correspond to (1) tangible computer-readable storage media that are non-transitory, or (2) transmission media such as a signal or carrier wave. Storage media can 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 implementing the techniques described in this disclosure. The computer program product may include a machine-readable medium.

By way of example, and not limitation, such computer-readable storage media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage device, magnetic disk storage device or other magnetic storage devices, flash memory or any other storage medium, which can be used to store desired program code in the form of instructions or data structures and can be accessed by a computer. In addition, any connection is properly called a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL or wireless technologies such as infrared, radio and microwave are included in the definition of media. However, it should be understood that computer-readable storage media and storage media do not include connections, carrier waves, signals or other temporary media, but are instead directed to durable tangible storage media. The disc and disc used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where discs typically reproduce data magnetically and discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of machine-readable media.

The 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 gate arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Accordingly, the term “processor” as used herein can refer to any of the above structure or any other structure suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding or included in a bundled codec. In addition, the techniques may 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 devices, including a wireless telephone, an integrated circuit (IC), or a set of ICs (eg, a chipset). This disclosure describes various components, modules, or blocks to highlight functional aspects of devices configured to perform the disclosed technologies, but not necessarily required to be implemented by various hardware units. Rather, as described above, the various blocks may be combined into a codec hardware block or provided by a set of interacting hardware blocks, including one or more processors, as described above, in combination with suitable software and/or firmware.

Claim 1: A method for storing motion information, wherein a current block is composed of a first sub-block and a second sub-block, the first sub-block and the second sub-block are separated by a common boundary, the first sub-block corresponds to the first motion information, and the second sub-block corresponds to the second motion information, wherein the method contains stages in which:

determine the distance between the set of discrete samples in the current block and the common boundary; And

comparing the distance with a threshold to determine whether third motion information is stored for the sample set, wherein the third motion information is derived from the first motion information and the second motion information.

Provision 2. The method according to Proposition 1, in which comparing the distance with a threshold value for determining whether the third motion information is stored for the sample set, comprises determining that the third motion information is stored for the sample set in the case, in which the absolute value of the distance is less than or equal to the threshold value.

Provision 3. The method according to Proposition 2, wherein in the case in which the absolute value of the distance is greater than the threshold value, the method further comprises the steps of:

determining that the first motion information is stored for the sample set in a case in which the distance is positive; or

it is determined that the second motion information is stored for the sample set in the case in which the distance is negative.

Provision 4. A method according to any one of Provisions 1-3, in which the threshold value is predetermined.

Provision 5. The method according to any one of Provisions 1-4, wherein the threshold value is based on a geometric relationship between the common boundary and the horizontal direction or vertical direction.

Provision 6. The method according to Provision 5, in which the threshold value is based on the angle between the perpendicular direction of the common boundary and the horizontal direction or vertical direction.

Proposition 7. A method according to any one of Provisions 1-6, wherein the threshold is based on the width and/or height of the current block.

Provision 8. The method according to any one of Provisions 1-7, in which the common boundary is determined by an angular parameter and a distance parameter, and before determining the distance between a set of discrete samples in the current block and the common boundary, the method further comprises the step of determining the angular parameter and the distance parameter.

Provision 9. The method according to Provision 8, in which, in the decoder, determining the angular parameter and the distance parameter comprises the steps of:

extracting by analysis an angular parameter and a distance parameter from the bit stream; or

extracts a pointer from the bitstream by analysis, and

obtain an angular parameter and a distance parameter based on the pointer.

Provision 10. The method according to Provision 8 or 9, wherein after determining the angular parameter and the distance parameter, the method further comprises the steps of:

determining a first computational parameter based on the angular parameter;

calculating a temporary angular parameter based on the angular parameter;

determining a second computational parameter based on the time angular parameter; And

a third computational parameter is calculated based on the angular parameter and the distance parameter.

Provision 11. The method according to Proposition 10, wherein the first calculation parameter is determined by checking a preset lookup table according to an angular parameter, and the second calculation parameter is determined by checking said lookup table according to a temporary angular parameter, wherein the first calculation parameter and the second calculation parameter are a value cosine and sine value of the same angle, respectively.

Provision 12. Method according to Provision 10 or 11, in which the distance is calculated as follows:

distFromLine=(x+K)*P1+(y+K)*P2-P3,

where P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter, respectively, distFromLine represents the distance, K is a non-negative integer, x represents the horizontal coordinate of the target position in the sample set, y represents the vertical coordinate of the target position in the rectangular coordinate system, where the top left sample position of the current block is set as the origin, the right direction is set as the positive horizontal direction, and the down direction is set as the positive vertical direction.

Proposition 13. Method according to Proposition 12 in which K is equal to 1.

Position 14. A method according to Position 12 or 13, in which the target Position is predefined in a set of discrete samples.

Position 15. The method according to Position 14, wherein the predetermined Position is the top left position of the sample set or the center position of the sample set.

Provision 16. The method according to any one of Provisions 12-15, in which the accuracy of the discrete distance reading is higher than the integer discrete reading;

Accordingly, the distance is calculated as follows:

distFromLine=((x<<N)+ K)*P1+((y<<N)+K)*P2-P3,

where 2N represents the reciprocal of the discrete distance reading accuracy.

Provision 17. Method according to Provision 13 in which N is equal to 1.

Clause 18. The method according to any one of Clauses 1-17, wherein the set of samples is a set of luminance samples of the current block.

Provision 19. A method according to any one of Provisions 1-18, wherein, before determining the distance between a set of discrete samples in the current block and a common boundary, the method further comprises the steps of:

dividing the current block into a plurality of sets of discrete samples, each of the plurality of sets of discrete samples having the same size as the set of discrete samples; or

set the current block as a set of discrete samples.

Clause 20. A method according to any one of Clauses 1-19, wherein the sample set is a 4x4 sample array.

Claim 21. The method according to Clause 18 or 19, wherein each of the plurality of sets of discrete samples corresponds to each motion information storage module, wherein the motion information storage module is used to store one of the first motion information, the second motion information, and the third motion information. movement.

Provision 22. The method according to any one of Provisions 1-21, wherein the first sub-block and the second sub-block are a triangular mesh, a trapezoidal mesh, or an asymmetric rectangular mesh.

Provision 23. The method according to any one of Provisions 1 to 22, wherein the first motion information comprises motion information based on a first list of reference pictures, the second motion information contains motion information based on a second list of reference pictures, wherein the third information motion contains first motion information and second motion information.

Statement 24. A motion information storage device, wherein the current block is composed of a first sub-block and a second sub-block, the first sub-block and the second sub-block are separated by a common boundary, the first sub-block corresponds to the first motion information, and the second sub-block corresponds to the second motion information, wherein the device comprises: :

a calculation module configured to determine the distance between a set of discrete samples in the current block and a common boundary; And

a comparison module configured to compare the distance with a threshold to determine whether third motion information is stored for a set of discrete samples, wherein the third motion information is derived from the first motion information and the second motion information.

Position 25. Device according to Position 24, in which the comparison module is configured to:

determine that the third motion information is stored for a set of discrete samples in a case in which the absolute value of the distance is less than or equal to the threshold value.

Statement 26. The device according to Statement 25, in which, in the case in which the absolute value of the distance is greater than a threshold value, the comparison module is further configured to:

determine that the first motion information is stored for a set of discrete samples in a case in which the distance is positive; or

determine that the second motion information is stored for the sample set in the case in which the distance is negative.

Provision 27. A device according to any one of Provisions 24 to 26, wherein the threshold value is predetermined.

Provision 28. A device according to any one of Provisions 24-27, wherein the threshold value is based on the geometric relationship between the common boundary and the horizontal direction or the vertical direction.

Regulation 29. Device according to Regulation 28, wherein the threshold value is based on the angle between the perpendicular direction of the common boundary and the horizontal direction or vertical direction.

Provision 30. A device according to any one of Provisions 24-29, wherein the threshold is based on the width and/or height of the current block.

Provision 31. An apparatus according to any one of Provisions 24-30, wherein the common boundary is determined by an angular parameter and a distance parameter, wherein the calculation module is further configured to determine the angular parameter and the distance parameter.

Position 32. Device according to Position 31, in which in the decoder the calculation module is additionally configured to:

extract by analysis the angular parameter and the distance parameter from the bit stream; or

extract by analysis a pointer from the bit stream, and

get the angular parameter and the distance parameter based on the pointer.

Position 33. Device according to Position 31 or 32, in which the calculation module is additionally configured to:

determine a first computational parameter based on the angular parameter;

calculate a temporary angular parameter based on the angular parameter;

determine a second computational parameter based on the time angular parameter; And

calculate the third computational parameter based on the angular parameter and the distance parameter.

Statement 34. An apparatus according to Statement 33, wherein a first calculation parameter is determined by checking a preset lookup table according to an angular parameter, and a second calculation parameter is determined by checking said lookup table according to a temporary angular parameter, wherein the first calculation parameter and the second calculation parameter are a cosine value and the value of the sine of the same angle, respectively.

Position 35. Device according to Position 33 or 34, the distance being calculated as follows:

distFromLine=(x+K)*P1+(y+K)*P2-P3,

where P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter, respectively, distFromLine represents the distance, K is a non-negative integer, x represents the horizontal coordinate of the target position in the sample set, y represents the vertical coordinate of the target position in the rectangular coordinate system, where the top left sample position of the current block is set as the origin, the right direction is set as the positive horizontal direction, and the down direction is set as the positive vertical direction.

Position 36. Device according to Position 35, with K equal to 1.

Position 37. Device according to Position 35 or 36, with the target Position predefined in a set of discrete samples.

Position 38. A device according to Position 37, wherein the predetermined Position is the top left position of the sample set or the center position of the sample set.

Provision 39. A device in accordance with any one of Provisions 35-38, wherein the accuracy of the discrete distance reading is greater than the integer discrete reading;

Accordingly, the distance is calculated as follows:

distFromLine=((x<<N)+ K)*P1+((y<<N)+K)*P2-P3,

where 2N represents the reciprocal of the discrete distance reading accuracy.

Position 40. Device according to Position 36, in which N is equal to 1.

Statement 41. A device according to any one of Statements 24-40, wherein the set of samples is a set of samples of the brightness of the current block.

Provision 42. A device according to any one of Provisions 24-41, wherein the device further comprises a separation module configured to:

divide the current block into a plurality of sample sets, each of the plurality of sample sets having the same size as the sample set; or

set the current block as a set of discrete samples.

Statement 43. A device according to any one of Statements 24-42, wherein the sample set is a 4x4 sample array.

Statement 44. An apparatus according to Statement 42 or 43, wherein each of the plurality of sets of discrete samples corresponds to each motion information storage module, wherein the motion information storage module is used to store one of the first motion information, the second motion information, and the third motion information. movement.

Provision 45. An arrangement according to any one of Provisions 24-44, wherein the first sub-unit and the second sub-unit are a triangular partition, a trapezoidal partition, or an asymmetric rectangular partition.

Clause 46. A device according to any one of Clauses 24-45, wherein the first motion information comprises motion information based on a first list of reference pictures, the second motion information comprises motion information based on a second list of reference pictures, and the third motion information contains first motion information and second motion information.

Statement 47: An apparatus for decoding a video stream includes a processor and a memory, wherein the memory stores instructions that cause the processor to execute the method of any one of claims 1 to 23.

Statement 48: An apparatus for encoding a video stream includes a processor and a memory, wherein the memory stores instructions that cause the processor to perform the method of any one of claims 1 to 23.

Statement 49. A computer-readable storage medium on which instructions are stored which, when executed, direct one or more processors to provide encoding of video data, wherein the instructions direct one or more processors to perform a method in accordance with any one of Statements 1-23.

Statement 50. A computer program containing program code for performing a method according to any one of Statements 1-23 when executed on a computer.

Claims (87)

1. A decoding method comprising the steps of: receive a bit stream, wherein the bit stream contains encoded data of a current block and an indicator, wherein the current block is divided by a common boundary into a first sub-block and a second sub-block, wherein the first sub-block corresponds to a first prediction value and the second sub-block corresponds to a second prediction value, wherein the common boundary represents is the dividing line of the geometric partition mode; extracting a pointer from the bitstream by analysis; obtaining an angular parameter and a distance parameter based on the pointer, wherein the angular parameter specifies an angle index of the geometric partitioning mode, and the distance parameter specifies a distance index of the geometric partitioning mode; determining the distance between the set of discrete samples in the current block and the common boundary based on the angular parameter and the distance parameter by checking a preset lookup table; obtaining a first weight according to the distance; obtaining a second weight according to the first weight; And obtaining a fusion prediction value for the current block by using the first prediction value, the second prediction value, the first weight coefficient, and the second weight coefficient. 2. The method of claim 1, wherein the angular parameter is angleIdx, the distance parameter is distanceIdx, wherein said determining the distance based on the angular parameter and the distance parameter by checking a preset lookup table comprises calculating the distance using the following equations: where distFromLine represents the distance, K is a non-negative integer, N=1, P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter respectively, where the first computational parameter is determined by checking a preset lookup table according to angleIdx, the second a computational parameter is determined by checking this lookup table according to (angleIdx+8)%32 and a third computational parameter is determined based on angleIdx and distanceIdx. 3. The method of claim 1 or 2, wherein the method further comprises comparing the distance with a threshold to determine whether to store third motion information for the sample set, wherein the first sub-block corresponds to the first motion information and the second the subblock corresponds to the second motion information, wherein the third motion information is derived from the first motion information and the second motion information. 4. The method of claim 3, wherein said comparison of a distance with a threshold for determining whether to store third motion information for the sample set comprises determining whether to store third motion information for the sample set in the event that in which the absolute value of the distance is less than or equal to the threshold value. 5. The method according to claim 3 or 4, wherein in the case in which the absolute value of the distance is greater than the threshold value, the method further comprises the steps of: determining that the first motion information is stored for the sample set in a case in which the distance is positive; or it is determined that the second motion information is stored for the sample set in the case in which the distance is negative. 6. Method according to any one of paragraphs. 3-5, in which the threshold value is predetermined. 7. Method according to any one of paragraphs. 1-6, in which the first weighting factor is calculated using the following equation: where sampleWeight1 represents the first weight, sample_dist represents the distance, f(sample_dist) represents the function with sample_dist as input. 8. Method according to any one of paragraphs. 1-7, wherein said obtaining a second weight according to the first weight comprises calculating the second weight according to the following formula: where sampleWeight1 represents the first weighting factor, sampleWeight2 represents the second weighting factor, T is a predefined constant. 9. The method according to claim 8, in which T is equal to 8. 10. Method according to any one of paragraphs. 1-9, in which the set of discrete samples is a set of discrete brightness samples of the current block. 11. Method according to any one of paragraphs. 1-10, wherein before determining the distance between the set of discrete samples in the current block and the common boundary, the method further comprises a step in which: dividing the current block into a plurality of sets of discrete samples, each of the plurality of sets of discrete samples having the same size as said set of discrete samples; or set the current block as said set of discrete samples. 12. Method according to any one of paragraphs. 1-11, in which the sample set is a 4x4 sample array. 13. Method according to any one of paragraphs. 1-12, in which the third motion information is obtained by combining the first motion information and the second motion information, where the first motion information and the second motion information are from different reference picture lists, wherein the third motion information is equal to the second motion information motion when the first motion information and the second motion information are from the same reference picture list. 14. Method according to any one of paragraphs. 1-13, in which the stored motion information is used to determine a sample set prediction value, or the stored motion information is used as reference information for a prediction process of future encoding blocks. 15. A decoding device comprising: a receiving module configured to receive a bit stream, wherein the bit stream includes encoded data of a current block and an indicator, wherein the current block is divided by a common boundary into a first sub-block and a second sub-block, wherein the first sub-block corresponds to a first prediction value and the second sub-block corresponds to a second prediction value , while the common boundary represents the dividing line of the geometric partition mode; an analysis module configured to extract a pointer from the bit stream by analysis; a receiving module configured to obtain an angular parameter and a distance parameter based on the pointer, wherein the angular parameter specifies an angle index of a geometric partitioning mode, and the distance parameter specifies a distance index of a geometric partitioning mode; a calculation module configured to determine a distance between a set of discrete samples in the current block and a common boundary based on an angular parameter and a distance parameter by checking a preset lookup table; wherein the receiving module is additionally configured to: obtain a first weight coefficient according to the distance; obtain a second weight according to the first weight; And obtain a concatenated prediction value for the current block by using the first prediction value, the second prediction value, the first weight, and the second weight. 16. The device according to claim 15, wherein the angular parameter is angleIdx, the distance parameter is distanceIdx, and the calculation module is further configured to calculate the distance using the following equation: where distFromLine represents the distance, K is a non-negative integer, N=1, P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter respectively, where the first computational parameter is determined by checking a preset lookup table according to angleIdx, the second a computational parameter is determined by checking this lookup table according to (angleIdx+8)%32 and a third computational parameter is determined based on angleIdx and distanceIdx. 17. The apparatus of claim 15 or 16, further comprising a comparison module configured to compare the distance with a threshold to determine whether to store third motion information for the set of discrete samples, wherein the third motion information is derived from the first motion information and second motion information, the first sub-block corresponding to the first motion information and the second sub-block corresponding to the second motion information. 18. The device according to claim 17, wherein the comparison module is configured to determine to store the third motion information for a set of discrete samples in a case in which the absolute value of the distance is less than or equal to a threshold value. 19. The device according to claim 17 or 18, in which, in the case in which the absolute value of the distance is greater than the threshold value, the comparison module is further configured to: determine that the first motion information is stored for a set of discrete samples in a case in which the distance is positive; or determine that the second motion information is stored for the sample set in the case in which the distance is negative. 20. The device according to any one of paragraphs. 15-19, wherein the threshold value is predetermined. 21. The device according to any one of paragraphs. 15-20, with the first weighting factor being calculated using the following equation: where sampleWeight1 represents the first weight, sample_dist represents the distance, f(sample_dist) represents the function with sample_dist as input. 22. The device according to any one of paragraphs. 15-21, wherein the acquisition module is further configured to calculate the second weighting coefficient in accordance with the following formula: where sampleWeight1 represents the first weighting factor, sampleWeight2 represents the second weighting factor, T is a predefined constant. 23. Device according to claim 22, wherein T is equal to 8. 24. The device according to any one of paragraphs. 15-23, wherein the set of discrete samples is a set of discrete samples of the brightness of the current block. 25. The device according to any one of paragraphs. 15-24, wherein the device additionally contains a separation module configured to: dividing the current block into a plurality of sample sets, each of the plurality of sample sets having the same size as said sample set; or set the current block as the said sample set. 26. The device according to any one of paragraphs. 15-25, wherein the set of discrete samples is a 4×4 array of discrete samples. 27. The device according to any one of paragraphs. 15-26, in which the third motion information is obtained by combining the first motion information and the second motion information, where the first motion information and the second motion information are from different reference picture lists, wherein the third motion information is equal to the second motion information motion when the first motion information and the second motion information are from the same reference picture list. 28. The device according to any one of paragraphs. 15-27, in which the stored motion information is used to determine a sample set prediction value, or the stored motion information is used as reference information for a prediction process of future encoding blocks. 29. A device for decoding a video stream, including a processor and memory, wherein the memory stores instructions that instruct the processor to perform the method according to any one of claims. 1-14. 30. A computer-readable storage medium on which instructions are stored that, when executed, instruct one or more processors to provide encoding of video data, the instructions instructing one or more processors to perform the method of any one of claims. 1-14. 31. An encoding method containing the steps of: encoding the current block and the pointer into a bit stream, wherein the current block is divided by a common boundary into a first sub-block and a second sub-block, the first sub-block corresponding to a first prediction value and the second sub-block corresponding to a second prediction value, wherein the common boundary is a geometric partitioning mode dividing line ; wherein the pointer is used to obtain an angular parameter and a distance parameter, wherein the angular parameter specifies the angle index of the geometric partitioning mode, and the distance parameter specifies the distance index of the geometric partitioning mode; determining the distance between the set of discrete samples in the current block and the common boundary based on the angular parameter and the distance parameter by checking a preset lookup table; obtaining a first weight according to the distance; obtaining a second weight according to the first weight; And obtaining a fusion prediction value for the current block by using the first prediction value, the second prediction value, the first weight coefficient, and the second weight coefficient. 32. The method of claim 31, wherein the first weighting factor is calculated using the following equation: where sampleWeight1 represents the first weight, sample_dist represents the distance, f(sample_dist) represents the function with sample_dist as input. 33. The method according to claim 31 or 32, wherein said obtaining a second weighting coefficient according to the first weighting coefficient comprises calculating the second weighting coefficient in accordance with the following formula: where sampleWeight1 represents the first weighting factor, sampleWeight2 represents the second weighting factor, T is a predefined constant. 34. The method according to claim 33, in which T is equal to 8. 35. Method according to any one of paragraphs. 31-34, wherein the angular parameter is angleIdx, the distance parameter is distanceIdx, wherein said determining the distance based on the angular parameter and the distance parameter by checking a preset lookup table comprises a step of calculating the distance using the following equation: where distFromLine represents the distance, K is a non-negative integer, N=1, P1, P2 and P3 are the first computational parameter, the second computational parameter and the third computational parameter respectively, where the first computational parameter is determined by checking a preset lookup table according to angleIdx, the second a computational parameter is determined by checking this lookup table according to (angleIdx+8)%32 and a third computational parameter is determined based on angleIdx and distanceIdx. 36. Method according to any one of paragraphs. 31-35, the method further comprising comparing the distance with a threshold to determine whether to store third motion information for the sample set, the first sub-block corresponding to the first motion information and the second sub-block corresponding to the second motion information , wherein the third motion information is derived from the first motion information and the second motion information. 37. The method of claim 36, wherein said comparison of a distance with a threshold for determining whether to store third motion information for the sample set comprises determining whether to store third motion information for the sample set in the event that in which the absolute value of the distance is less than or equal to the threshold value. 38. The method according to claim 36 or 37, wherein in the case in which the absolute value of the distance is greater than the threshold value, the method further comprises the step of: determining that the first motion information is stored for the sample set in a case in which the distance is positive; or it is determined that the second motion information is stored for the sample set in the case in which the distance is negative. 39. A device for encoding a video stream, including a processor and memory, wherein the memory stores instructions that instruct the processor to perform the method according to any one of claims. 31-38.

Images