EP4022901A1

EP4022901A1 - Method and apparatus of still picture and video coding with shape-adaptive resampling of residual blocks

Info

Publication number: EP4022901A1
Application number: EP20858800.4A
Authority: EP
Inventors: Vasily Alexeevich RUFITSKIY; Elena Alexandrovna ALSHINA; Alexey Konstantinovich FILIPPOV
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2019-08-31
Filing date: 2020-08-25
Publication date: 2022-07-06
Also published as: WO2021040574A1; EP4022901A4

Abstract

The present invention relates to a method for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non-vertical boundary between prediction partitions, the method being implemented by a decoding device or an encoding device, wherein only a subsampled residual block corresponding to a boundary region of non-zero residuals covering the boundary between the prediction partitions is transformed and coded in the bitstream of the video.

Description

METHOD AND APPARATUS OF STILL PICTURE AND VIDEO CODING WITH SHAPE-ADAPTIVE RESAMPLING OF RESIDUAL BLOCKS

CROSS-REFERENCE TO RELATED APPLICATION This application claims priority from international patent application PCT/CN2019/103896 filed on August 31, 2019, in the Chinese Patent Office, the disclosure of which is incorporated herein in its entirety by reference.

TECHNICAL FIELD

Embodiments of the present application generally relate to the field of picture processing and more particularly to shape-adaptive resampling of residual blocks for still image and video coding.

BACKGROUND

Video coding (video encoding and decoding) is used in a wide range of digital video applications, for example broadcast digital TV, video transmission over internet and mobile networks, real-time conversational applications such as video chat, video conferencing, DVD and Blu-ray discs, video content acquisition and editing systems, and camcorders of security applications.

The amount of video data needed to depict even a relatively short video can be substantial, which may result in difficulties when the data is to be streamed or otherwise communicated across a communications network with limited bandwidth capacity. Thus, video data is generally compressed before being communicated across modern day telecommunications networks. The size of a video could also be an issue when the video is stored on a storage device because memory resources may be limited. Video compression devices often use software and/or hardware at the source to code the video data prior to transmission or storage, thereby decreasing the quantity of data needed to represent digital video images. The compressed data is then received at the destination by a video decompression device that decodes the video data. With limited network resources and ever increasing demands of higher video quality, improved compression and decompression techniques that improve compression ratio with little to no sacrifice in picture quality are desirable. SUMMARY OF THE DISCLOSURE

Embodiments of the present application provide apparatuses and methods for shape-adaptive resampling of residual blocks for inter or intra prediction coding (encoding and/or decoding) of a picture according to the independent claims.

Embodiments of the present application facilitate an efficient inter or intra prediction coding using shape-adaptive resampling of residual blocks.

The foregoing and other objects are achieved by the subject matter of the independent claims. Further implementation forms are apparent from the dependent claims, the description and the figures.

A first embodiment of the present disclosure provides a method for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non- vertical boundary between prediction partitions, the method being implemented by a decoding device or an encoding device and comprising inverse transforming a subsampled residual block to determine a subsampled reconstructed residual block; filling samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the subsampled reconstructed residual block, and obtaining a reconstructed block of the current block from a predicted block and the reconstructed residual block.

The method may improve the coding efficiency as prediction errors are localized only in the boundary region covering the boundary between the prediction partitions of the current block.

The method may further comprise setting samples outside the boundary region of the reconstructed residual block to zero.

The method may further comprise deriving at least one of a height or a width of the sub sampled residual block from at least one of a height or a width of the current block. Alternatively, the method may further comprise signaling at least one of a height or a width of the sub sampled residual block in a bitstream of the video sequence. The at least one of a height or a width of the sub sampled residual block may be set to L/2^m wherein L is the respective one of the at least one of a height or a width of the current block, and wherein m Î {1,2,3}.

The boundary region may be defined based on a line that partitions the current block into two non-rectangular prediction partitions. According to a particular aspect, a start side position and an end side position of the line may be determined based on intersections of the line with boundaries of the reconstructed residual block, wherein the boundary region is defined based on the start and end side positions of the line. The boundary region may includes samples having a distance from the line smaller than or equal to a distance threshold.

The line may connect a top-left corner of the reconstructed residual block and a bottom-right corner of the reconstructed residual block or a top-right corner of the reconstructed residual block and a botom-left corner of the reconstructed residual block.

Alternatively, the line may be defined by an angle parameter and a distance parameter. The angle parameter may be determined using a look-up table.

The method may further comprise comparing the angle parameter with a range of angles and determining whether the height or the width of the sub sampled residual block is reduced as compared to the height or the width, respectively, of the reconstructed residual block based on the comparison.

For the case that the width of the subsampled residual block is reduced as compared to the width of the reconstructed residual block, the boundary region according to the first embodiment may comprise a range of rows of the reconstructed residual block starting from a first row corresponding to the start side position up to a last row corresponding to the end side position, wherein filling samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block comprises defining a sampling position for each of the rows in the range of rows so that the sampling position is a monotonic function of a row position within the reconstructed residual block, and filling a respective set of samples of each of the rows in the range of rows with values of corresponding rows of the sub sampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective row is not greater than the distance threshold. The distance threshold may be set equal to half of the width of the reconstructed residual block.

For the case that the height of the subsampled residual block is reduced as compared to the height of the reconstructed residual block, the boundary region according to the first embodiment may comprise a range of columns of the reconstructed residual block starting from a first column corresponding to the start side position up to a last column corresponding to the end side position, wherein filling samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block comprises defining a sampling position for each of the columns in the range of columns so that the sampling position is a monotonic function of a column position within the reconstructed residual block, and filling a respective set of samples of each of the columns in the range of columns with values of corresponding columns of the subsampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective column is not greater than the distance threshold. The distance threshold may be set equal to half of the height of the reconstructed residual block.

The predicted block may be obtained using Triangular Partitioning Mode (TPM). Alternatively, the predicted block may be obtained using Geometric Motion Partitioning (GMP).

The method may further comprise applying a smoothing filter to samples of the reconstructed residual block that are adjacent to the boundary region. In particular, a Finite Impulse Response (FIR) filter may be applied to the samples adjacent to the boundary region.

Applying a smoothing filter may prevent blocking artifacts at the boundaries of the boundary region.

According to an aspect of the first embodiment, an encoder is provided comprising processing circuitry for carrying out any one of the methods according to the first embodiment. According to a further aspect of the first embodiment, a decoder is provided comprising processing circuitry for carrying out any one of the methods according to the first embodiment.

According to a further aspect of the first embodiment, a computer program product is provided comprising instructions which, when the program is executed by a computer, cause the computer to carry out any one of the methods according to the first embodiment.

According to a further aspect of the first embodiment, a decoder is provided, comprising one or more processors; and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, wherein the instructions, when executed by the one or more processors, configure the decoder to carry out any one of the methods according to the first embodiment.

According to a further aspect of the first embodiment, an encoder is provided, comprising one or more processors; and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, wherein the instructions, when executed by the one or more processors, configure the encoder to carry out any one of the methods according to the first embodiment.

A second embodiment of the present disclosure provides a decoder or an encoder for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non- vertical boundary between prediction partitions, comprising an inverse transform processing unit configured to inverse transform a subsampled residual block to determine a subsampled reconstructed residual block; a filling unit configured to fill samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the sub sampled reconstructed residual block; and an obtaining unit configured to obtain a reconstructed block of the current block from a predicted block and the reconstructed residual block.

The method may improve the coding efficiency as prediction errors are localized mainly in the boundary region covering the boundary between the prediction partitions of the current block. The filling unit may be further configured to set samples outside the boundary region of the reconstructed residual block to zero.

The boundary region may be defined based on a line that partitions the current block into two non-rectangular prediction partitions. According to a particular aspect of the second embodiment, a start side position and an end side position of the line may be determined based on intersections of the line with boundaries of the reconstructed residual block, wherein the boundary region is defined based on the start and end side positions of the line. The boundary region may include samples having a distance from the line smaller than or equal to a distance threshold.

The filling unit may be further configured to compare the angle parameter with a range of angles and to determine whether the height or the width of the subsampled residual block is reduced as compared to the height or the width, respectively, of the reconstructed residual block based on the comparison.

For the case that the width of the subsampled residual block is reduced as compared to the width of the reconstructed residual block, the boundary region according to the second embodiment may comprise a range of rows of the reconstructed residual block starting from a first row corresponding to the start side position up to a last row corresponding to the end side position, and the filling unit may be configured to fill samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block by defining a sampling position for each of the rows in the range of rows so that the sampling position is a monotonic function of a row position within the reconstructed residual block, and by filling a respective set of samples of each of the rows in the range of rows with values of corresponding rows of the sub sampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective row is not greater than the distance threshold. The distance threshold may be set equal to half of the width of the reconstructed residual block.

For the case that the height of the subsampled residual block is reduced as compared to the height of the reconstructed residual block, the boundary region according to the second embodiment may comprise a range of columns of the reconstructed residual block starting from a first column corresponding to the start side position up to a last column corresponding to the end side position, and the filling unit may be configured to fill samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block by defining a sampling position for each of the columns in the range of columns so that the sampling position is a monotonic function of a column position within the reconstructed residual block, and by filling a respective set of samples of each of the columns in the range of columns with values of corresponding columns of the sub sampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective column is not greater than the distance threshold. The distance threshold is set equal to half of the height of the reconstructed residual block.

The decoder or the encoder may further comprise an inter prediction unit configured to determine the predicted block using Triangular Partitioning Mode (TPM). Alternatively, the inter prediction unit may be configured to determine the predicted block using Geometric Motion Partitioning (GMP).

The decoder or the encoder may further comprise a filter unit configured to apply a smoothing filter to samples of the reconstructed residual block that are adjacent to the boundary region. The filter unit may be configured to apply a Finite Impulse Response (FIR) filter to the samples adjacent to the boundary region.

According to an aspect of the second embodiment, the filling unit may be further configured to derive at least one of a height or a width of the subsampled residual block from at least one of a height or a width of the current block. Alternatively, the decoder may further comprise an entropy decoding unit configured to parse at least one of a height or a width of the subsampled residual block from a bitstream of the video sequence.

Likewise, the encoder may further comprise an entropy encoding unit configured to encode at least one of a height or a width of the sub sampled residual block in a bitstream of the video sequence.

In either case, the at least one of a height or a width of the subsampled residual block may be set to L/2^m wherein L is the respective one of the at least one of a height or a width of the current block, and wherein m Î {1,2,3}.

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

BRIEF DESCRIPTION OF THE DRAWINGS

In the following, embodiments of the disclosure are described in more detail with reference to the attached figures and drawings, in which:

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

FIG. IB is a block diagram showing another example of a video coding system configured to implement embodiments of the disclosure;

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

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

FIG. 4 is a block diagram illustrating an example of an encoding apparatus or a decoding apparatus;

FIG. 5 is a block diagram illustrating another example of an encoding apparatus or a decoding apparatus; FIG. 6 is an illustration of the steps at an encoder side to obtain a set of transform blocks for the color components of a transform unit according to an embodiment of the disclosure;

FIG. 7 is an illustration of an alternative way to resample residual blocks for obtaining a set of transform blocks for the color components of a transform unit according to an embodiment of the disclosure;

FIG. 8 is a flowchart to illustrate the processing steps of the disclosure applied to a unit predicted using TPM at both, decoder and encoder side according to an embodiment of the disclosure;

FIG. 9 is an illustration of a resampling process within a unit where the GMP technique is used according to an embodiment of the disclosure;

FIG. 10 is a flowchart to illustrate the processing steps of an embodiment of the disclosure at both, decoder and encoder side if the resampling process is applied to a unit where the GMP technique is used;

FIG. 11 is a flowchart showing the signaling according to an embodiment of the disclosure;

FIG. 12 is a flowchart showing the signaling according to another embodiment of the disclosure;

FIG. 13 is an illustration of a smoothing process that uses one-dimensional padding of the samples adjacent to the near-boundary region;

FIG. 14 is an illustration of a smoothing process that uses a two-dimensional spatial filter on the samples adjacent to the near-boundary region;

FIG. 15 is an illustration of obtaining the near-boundary region for the case of GMP using a column-wise scan; ad

FIG. 16 is an illustration of obtaining the near-boundary region for the case of GMP using a row-wise scan;

FIG. 17 shows a flowchart for a method of video encoding/decoding according to an embodiment of the disclosure;

FIG. 18 shows a block diagram illustrating an example of an encoding/decoding apparatus according to an embodiment of the disclosure.

In the following, identical reference signs refer to identical or at least functionally equivalent features if not explicitly specified otherwise. DETAILED DESCRIPTION OF THE EMBODIMENTS

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

For instance, it is understood that a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa. For example, if one or a plurality of specific method steps are described, a corresponding device may include one or a plurality of units, e.g. functional units, to perform the described one or plurality of method steps (e.g. one unit performing the one or plurality of steps, or a plurality of units each performing one or more of the plurality of steps), even if such one or more units are not explicitly described or illustrated in the figures. On the other hand, for example, if a specific apparatus is described based on one or a plurality of units, e.g. functional units, a corresponding method may include one step to perform the functionality of the one or plurality of units (e.g. one step performing the functionality of the one or plurality of units, or a plurality of steps each performing the functionality of one or more of the plurality of units), even if such one or plurality of steps are not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary embodiments and/or aspects described herein may be combined with each other, unless specifically noted otherwise.

Video coding typically refers to the processing of a sequence of pictures, which form the video or video sequence. Instead of the term “picture”, the term “frame” or “image” may be used as synonyms in the field of video coding. Video coding (or coding in general) comprises two parts: video encoding and video decoding. Video encoding is performed at the source side, typically comprising processing (e.g. by compression) the original video pictures to reduce the amount of data required for representing the video pictures (for more efficient storage and/or transmission). Video decoding is performed at the destination side and typically comprises the inverse processing compared to the encoder to reconstruct the video pictures. Embodiments referring to “coding” of video pictures (or pictures in general) shall be understood to relate to “encoding” or “decoding” of video pictures or respective video sequences. The combination of the encoding part and the decoding part is also referred to as CODEC (Coding and Decoding).

In case of lossless video coding, the original video pictures can be reconstructed, i.e. the reconstructed video pictures have the same quality as the original video pictures (assuming no transmission loss or other data loss occurs during storage or transmission). In case of lossy video coding, further compression, e.g. by quantization, is performed, to reduce the amount of data representing the video pictures, which cannot be completely reconstructed at the decoder, i.e. the quality of the reconstructed video pictures is lower or worse compared to the quality of the original video pictures.

Several video coding standards belong to the group of “lossy hybrid video codecs” (i.e. combine spatial and temporal prediction in the sample domain and 2D transform coding for applying quantization in the transform domain). Each picture of a video sequence is typically partitioned into a set of non-overlapping blocks and the coding is typically performed on a block level. In other words, at the encoder the video is typically processed, i.e. encoded, on a block (video block) level, e.g. by using spatial (intra picture) prediction and/or temporal (inter picture) prediction to generate a prediction block, subtracting the prediction block from the current block (block currently processed/to be processed) to obtain a residual block, transforming the residual block and quantizing the residual block in the transform domain to reduce the amount of data to be transmitted (compression), whereas at the decoder the inverse processing compared to the encoder is applied to the encoded or compressed block to reconstruct the current block for representation. Furthermore, the encoder duplicates the decoder processing loop such that both will generate identical predictions (e.g. intra- and inter predictions) and/or re-constructions for processing, i.e. coding, the subsequent blocks.

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

Fig. 1 A is a schematic block diagram illustrating an example coding system 10, e.g. a video coding system 10 (or short coding system 10) that may utilize techniques of this present application. Video encoder 20 (or short encoder 20) and video decoder 30 (or short decoder 30) of video coding system 10 represent examples of devices that may be configured to perform techniques in accordance with various examples described in the present application. As shown in Fig. 1 A, the coding system 10 comprises a source device 12 configured to provide encoded picture data 21 e.g. to a destination device 14 for decoding the encoded picture data 13.

The source device 12 comprises an encoder 20, and may additionally, i.e. optionally, comprise a picture source 16, a pre-processor (or pre-processing unit) 18, e.g. a picture pre- processor 18, and a communication interface or communication unit 22.

The picture source 16 may comprise or be any kind of picture capturing device, for example a camera for capturing a real-world picture, and/or any kind of a picture generating device, for example a computer-graphics processor for generating a computer animated picture, or any kind of other device for obtaining and/or providing a real-world picture, a computer generated picture (e.g. a screen content, a virtual reality (VR) picture) and/or any combination thereof (e.g. an augmented reality (AR) picture). The picture source may be any kind of memory or storage storing any of the aforementioned pictures.

In distinction to the pre-processor 18 and the processing performed by the pre-processing unit 18, the picture or picture data 17 may also be referred to as raw picture or raw picture data 17.

Pre-processor 18 may be configured to receive the (raw) picture data 17 and to perform pre- processing on the picture data 17 to obtain a pre-processed picture 19 or pre-processed picture data 19. Pre-processing performed by the pre-processor 18 may, e.g., comprise trimming, color format conversion (e.g. from RGB to YCbCr), color correction, or de- noting. It can be understood that the pre-processing unit 18 may be an optional component. The video encoder 20 may be configured to receive the pre-processed picture data 19 and provide encoded picture data 21 (further details will be described below, e.g., based on Fig.

2)·

Communication interface 22 of the source device 12 may be configured to receive the encoded picture data 21 and to transmit the encoded picture data 21 (or any further processed version thereof) over communication channel 13 to another device, e.g. the destination device 14 or any other device, for storage or direct reconstruction.

The destination device 14 comprises a decoder 30 (e.g. a video decoder 30), and may additionally, i.e. optionally, comprise a communication interface or communication unit 28, a post-processor 32 (or post-processing unit 32) and a display device 34.

The communication interface 28 of the destination device 14 may be configured to receive the encoded picture data 21 (or any further processed version thereof), e.g. directly from the source device 12 or from any other source, e.g. a storage device, such as an encoded picture data storage device, and provide the encoded picture data 21 to the decoder 30.

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

The communication interface 22 may be configured to package the encoded picture data 21 into an appropriate format, e.g. packets, and/or process the encoded picture data using any kind of transmission encoding or processing for transmission over a communication link or communication network.

The communication interface 28, forming the counterpart of the communication interface 22, may be configured to receive the transmitted data and process the transmission data using any kind of corresponding transmission decoding or processing and/or de-packaging to obtain the encoded picture data 21.

Both, communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces as indicated by the arrow for the communication channel 13 in Fig. 1 A pointing from the source device 12 to the destination device 14, or as bi-directional communication interfaces, and may be configured to send and receive messages, e.g. to set up a connection, to acknowledge and exchange any other information related to the communication link and/or data transmission, such as encoded picture data transmission.

The decoder 30 may be configured to receive the encoded picture data 21 and provide decoded picture data 31 or a decoded picture 31 (further details will be described below, e.g., based on Fig. 3 or Fig. 5). The post-processor 32 of destination device 14 may be configured to post-process the decoded picture data 31 (also called reconstructed picture data), e.g. the decoded picture 31, to obtain post-processed picture data 33, such as a post-processed picture 33. The post-processing performed by the post-processing unit 32 may comprise any one or more of color format conversion (e.g. from YCbCr to RGB), color correction, trimming, or re-sampling, or any other processing, e.g. for preparing the decoded picture data 31 for display, e.g. by display device 34.

The display device 34 of the destination device 14 may be configured to receive the post- processed picture data 33 for displaying the picture, e.g. to a user or viewer. The display device 34 may be or comprise any kind of display for representing the reconstructed picture, such as an integrated or external display or monitor. The display may be a liquid crystal displays (LCD), an organic light emitting diodes (OLED) display, a plasma display, a projector , a micro LED display, a liquid crystal on silicon (LCoS), a digital light processor (DLP) or any kind of other display.

Although Fig. 1 A depicts the source device 12 and the destination device 14 as separate devices, embodiments of devices may also comprise both devices or both functionalities, i.e. the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality. In such embodiments the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality may be implemented using the same hardware and/or software or by separate hardware and/or software or any combination thereof.

As will be apparent for the skilled person based on the description, the existence and (exact) split of functionalities of the different units or functionalities within the source device 12 and/or destination device 14 as shown in Fig. 1 A may vary depending on the actual device and application. The encoder 20 (e.g. a video encoder 20) or the decoder 30 (e.g. a video decoder 30) or both, encoder 20 and decoder 30 may be implemented via processing circuitry as shown in Fig. IB, such as one or more microprocessors, digital signal processors (DSPs), application- specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, hardware, video coding dedicated or any combinations thereof. The encoder 20 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to encoder 20 of Fig. 2 and/or any other encoder system or subsystem described herein. The decoder 30 may be implemented via processing circuitry 46 to embody the various modules as discussed with respect to decoder 30 of Fig. 3 and/or any other decoder system or subsystem described herein. The processing circuitry may be configured to perform the various operations as discussed later. As shown in Fig. 5, if the techniques are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer-readable storage medium and may execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. 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. IB.

The video coding system 40 shown in Fig. IB comprises a processing circuitry implementing both a video encoder 20 and a video decoder 30. In addition, one or more imaging devices 41, such as a camera for capturing real-world pictures, an antenna 42, one or more memory stores 44, one or more processors 43 and/or a display device 45, such the display device 34 described above, may be provided as part of the video coding system 40.

Source device 12 and destination device 14 may comprise any of a wide range of devices, including any kind of handheld or stationary devices, e.g. notebook or laptop computers, mobile phones, smart phones, tablets or tablet computers, cameras, desktop computers, set- top boxes, televisions, display devices, digital media players, video gaming consoles, video streaming devices (such as content services servers or content delivery servers), broadcast receiver devices, broadcast transmitter devices, or the like and may use no or any kind of operating system. In some cases, the source device 12 and the destination device 14 may be equipped for wireless communication. Thus, the source device 12 and the destination device 14 may be wireless communication devices. In some cases, video coding system 10 illustrated in Fig. 1 A is merely an example and the techniques of the present application may apply to video coding systems (e.g., video encoding or video decoding) that do not necessarily include any data communication between the encoding and decoding devices. In other examples, data is retrieved from a local memory, streamed over a network, or the like. A video encoding device may encode and store data in memory, and/or a video decoding device may retrieve and decode data from memory. In some examples, the encoding and decoding is performed by devices that do not communicate with one another, but simply encode data to memory and/or retrieve and decode data from memory.

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

Encoder and Encoding Method

Fig. 2 shows a schematic block diagram of an example video encoder 20 that is configured to implement the techniques of the present application. In the example of Fig. 2, the video encoder 20 comprises an input 201 (or input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, and an inverse transform processing unit 212, a reconstruction unit 214, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy encoding unit 270 and an output 272 (or output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254 and a partitioning unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). A video encoder 20 as shown in Fig. 2 may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.

The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, and the mode selection unit 260 may be referred to as forming a forward signal path of the encoder 20, whereas the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20, wherein the backward signal path of the video encoder 20 corresponds to the signal path of the decoder (see video decoder 30 in Fig. 3). The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244 and the intra-prediction unit 254 are also referred to forming the “built-in decoder” of video encoder 20.

Pictures & Picture Partitioning (Pictures & Blocks)

The encoder 20 may be configured to receive, e.g. via input 201, a picture 17 (or picture data 17), e.g. a picture of a sequence of pictures forming a video or video sequence. The received picture or picture data may also be a pre-processed picture 19 (or pre-processed picture data 19). For the sake of simplicity the following description refers to the picture 17. The picture 17 may also be referred to as a current picture or a picture to be coded (in particular, in video coding to distinguish the current picture from other pictures, e.g. previously encoded and/or decoded pictures of the same video sequence, i.e. the video sequence which also comprises the current picture).

A (digital) picture is or can be regarded as a two-dimensional array or matrix of samples with intensity values. A sample in the array may also be referred to as pixel (short form of picture element) or a pel. The number of samples in the horizontal and vertical direction (or axis) of the array or picture defines the size and/or resolution of the picture. For representation of color, typically three color components are employed, i.e. the picture may be represented as or include three sample arrays. In RBG format or color space, a picture comprises a corresponding red, green and blue sample array. However, in video coding each pixel is typically represented in a luminance and chrominance format or color space, e.g. YCbCr, which comprises a luminance component indicated by Y (sometimes also L is used instead) and two chrominance components indicated by Cb and Cr. The luminance (or short luma) component Y represents the brightness or grey level intensity (e.g. like in a grey-scale picture), while the two chrominance (or short chroma) components Cb and Cr represent the chromaticity or color information components. Accordingly, a picture in YCbCr format comprises a luminance sample array of luminance sample values (Y), and two chrominance sample arrays of chrominance values (Cb and Cr). Pictures in RGB format may be converted or transformed into YCbCr format and vice versa. The process is also known as color transformation or conversion. If a picture is monochrome, the picture may comprise only a luminance sample array. Accordingly, a picture may be, for example, an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 colour format.

Embodiments of the video encoder 20 may comprise a picture partitioning unit (not depicted in Fig. 2) configured to partition the picture 17 into a plurality of (typically non-overlapping) picture blocks 203. These blocks may also be referred to as root blocks, macro blocks (H.264/AVC) or coding tree blocks (CTB) or coding tree units (CTU) (according to H.265/HEVC and VVC). The picture partitioning unit may be configured to use the same block size for all pictures of a video sequence and the corresponding grid defining the block size, or to change the block size between pictures or subsets or groups of pictures, and partition each picture into the corresponding blocks.

In further embodiments, the video encoder may be configured to receive directly a block 203 of the picture 17, e.g. one, several or all blocks forming the picture 17. The picture block 203 may also be referred to as current picture block or picture block to be coded.

Like the picture 17, the picture block 203 is or can be regarded as a two-dimensional array or matrix of samples with intensity values (sample values), although of smaller dimension than the picture 17. In other words, the block 203 may comprise, e.g., one sample array (e.g. a luma array in case of a monochrome picture 17, or a luma or chroma array in case of a color picture) or three sample arrays (e.g. a luma and two chroma arrays in case of a color picture 17) or any other number and/or kind of arrays depending on the color format applied. The number of samples in the horizontal and vertical direction (or axis) of the block 203 defines the size of the block 203. Accordingly, a block may, for example, comprise an MxN (M- column by N-row) array of samples, or an MxN array of transform coefficients.

Embodiments of the video encoder 20 as shown in Fig. 2 may be configured to encode the picture 17 block by block, e.g. the encoding and prediction is performed per block 203. Embodiments of the video encoder 20 as shown in Fig. 2 may be further configured to partition and/or encode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or encoded using one or more slices (typically non- overlapping), and each slice may comprise one or more blocks (e.g. CTUs). Embodiments of the video encoder 20 as shown in Fig. 2 may be further configured to partition and/or encode the picture by using tile groups (also referred to as video tile groups) and/or tiles (also referred to as video tiles), wherein a picture may be partitioned into or encoded using one or more tile groups (typically non-overlapping), and each tile group may comprise one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks.

Residual Calculation

The residual calculation unit 204 may be configured to calculate a residual block 205 (also referred to as residual 205) based on the picture block 203 and a prediction block 265 (further details about the prediction block 265 are provided later), e.g. by subtracting sample values of the prediction block 265 from sample values of the picture block 203, sample by sample (pixel by pixel) to obtain the residual block 205 in the sample domain.

Transform

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

The transform processing unit 206 may be configured to apply integer approximations of DCT/DST, such as the transforms specified for H.265/HEVC. Compared to an orthogonal DCT transform, such integer approximations are typically scaled by a certain factor. In order to preserve the norm of the residual block which is processed by forward and inverse transforms, additional scaling factors are applied as part of the transform process. The scaling factors are typically chosen based on certain constraints like scaling factors being a power of two for shift operations, bit depth of the transform coefficients, tradeoff between accuracy and implementation costs, etc. Specific scaling factors are, for example, specified for the inverse transform, e.g. by inverse transform processing unit 212 (and the corresponding inverse transform, e.g. by inverse transform processing unit 312 at video decoder 30) and corresponding scaling factors for the forward transform, e.g. by transform processing unit 206, at an encoder 20 may be specified accordingly. Embodiments of the video encoder 20 (respectively, the transform processing unit 206) may be configured to output transform parameters, e.g. a type of transform or transforms, e.g. directly or encoded or compressed via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and use the transform parameters for decoding.

Quantization

The quantization unit 208 may be configured to quantize the transform coefficients 207 to obtain quantized coefficients 209, e.g. by applying scalar quantization or vector quantization. The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209.

The quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be rounded down to an m-bit transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a quantization parameter (QP). For example for scalar quantization, different scalings may be applied to achieve finer or coarser quantization. Smaller quantization step sizes correspond to finer quantization, whereas larger quantization step sizes correspond to coarser quantization. The applicable quantization step size may be indicated by a quantization parameter (QP). The quantization parameter may, for example, be an index of a predefined set of applicable quantization step sizes. For example, small quantization parameters may correspond to fine quantization (small quantization step sizes) and large quantization parameters may correspond to coarse quantization (large quantization step sizes) or vice versa. The quantization may include division by a quantization step size and a corresponding and/or the inverse dequantization, e.g. by inverse quantization unit 210, may include multiplication by the quantization step size. Embodiments according to some standards, e.g. HEVC, may be configured to use a quantization parameter to determine the quantization step size. Generally, the quantization step size may be calculated based on a quantization parameter using a fixed point approximation of an equation including division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which might get modified because of the scaling used in the fixed point approximation of the equation for quantization step size and quantization parameter. In one examplary implementation, the scaling of the inverse transform and dequantization might be combined. Alternatively, customized quantization tables may be used and signaled from an encoder to a decoder, e.g. in a bitstream. The quantization is a lossy operation, wherein the loss increases with increasing quantization step sizes.

Embodiments of the video encoder 20 (respectively, the quantization unit 208) may be configured to output quantization parameters (QPs), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., the video decoder 30 may receive and apply the quantization parameters for decoding.

Inverse Quantization

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

Inverse Transform

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

Reconstruction

The reconstruction unit 214 (e.g. adder or summer 214) is configured to add the transform block 213 (i.e. reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in the sample domain, e.g. by adding - sample by sample - the sample values of the reconstructed residual block 213 and the sample values of the prediction block 265. Filtering

The loop filter unit 220 (or short “loop filter” 220), is configured to filter the reconstructed block 215 to obtain a filtered block 221, or in general, to filter reconstructed samples to obtain filtered samples. The loop filter unit may be configured to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 220 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, such as a bilateral filter, an adaptive loop filter (ALF), a sharpening, a smoothing filter or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is shown in Fig. 2 as being an in-loop filter, in other configurations, the loop filter unit 220 may be implemented as a post loop filter. The filtered block 221 may also be referred to as a filtered reconstructed block 221.

Embodiments of the video encoder 20 (respectively, the loop filter unit 220) may be configured to output loop filter parameters (such as sample adaptive offset information), e.g. directly or encoded via the entropy encoding unit 270, so that, e.g., a decoder 30 may receive and apply the same loop filter parameters or respective loop filters for decoding.

Decoded Picture Buffer

The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or in general reference picture data, for encoding video data by video encoder 20. The DPB 230 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may be further configured to store other previously filtered blocks, e.g. previously reconstructed and filtered blocks 221, of the same current picture or of different pictures, e.g. previously reconstructed pictures, and may provide complete previously reconstructed, i.e. decoded, pictures (and corresponding reference blocks and samples) and/or a partially reconstructed current picture (and corresponding reference blocks and samples), for example for inter prediction. The decoded picture buffer (DPB) 230 may also be configured to store one or more unfiltered reconstructed blocks 215, or in general unfiltered reconstructed samples, e.g. if the reconstructed block 215 is not filtered by loop filter unit 220, or any other further processed version of the reconstructed blocks or samples. Mode Selection (Partitioning & Prediction)

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

Mode selection unit 260 may be configured to determine or select a partitioning for a current block prediction mode (including no partitioning) and a prediction mode (e.g. an intra- or inter-prediction mode) and generate a corresponding prediction block 265, which is used for the calculation of the residual block 205 and for the reconstruction of the reconstructed block 215.

Embodiments of the mode selection unit 260 may be configured to select the partitioning and the prediction mode (e.g. from those supported by or available for mode selection unit 260), which provide the best match or in other words the minimum residual (minimum residual means better compression for transmission or storage), or a minimum signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which considers or balances both. The mode selection unit 260 may be configured to determine the partitioning and prediction mode based on rate distortion optimization (RDO), i.e. select the prediction mode which provides a minimum rate distortion. Terms like “best”, “minimum”, “optimum” etc. in this context do not necessarily refer to an overall “best”, “minimum”, “optimum”, etc. but may also refer to the fulfillment of a termination or selection criterion like a value exceeding or falling below a threshold or other constraints leading potentially to a “sub-optimum selection” but reducing complexity and processing time.

In other words, the partitioning unit 262 may be configured to partition the block 203 into smaller block partitions or sub-blocks (which again form blocks), e.g. iteratively using quad- tree-partitioning (QT), binary-tree partitioning (BT) or triple-tree-partitioning (TT) or any combination thereof, and to perform the prediction for each of the block partitions or sub- blocks, wherein the mode selection comprises the selection of the tree -structure of the partitioned block 203 and the prediction modes are applied to each of the block partitions or sub-blocks.

In the following, the partitioning (e.g. by partitioning unit 262) and prediction processing (by inter-prediction unit 244 and intra-prediction unit 254) performed by an example video encoder 20 will be explained in more detail.

Partitioning

The partitioning unit 262 may partition (or split) a current block 203 into smaller partitions, e.g. smaller blocks of square or rectangular size. These smaller blocks (which may also be referred to as sub-blocks) may be further partitioned into even smaller partitions. This is also referred to as tree-partitioning or hierarchical tree-partitioning, wherein a root block, e.g. at root tree-level 0 (hierarchy-level 0, depth 0), may be recursively partitioned, e.g. partitioned into two or more blocks of a next lower tree-level, e.g. nodes at tree-level 1 (hierarchy-level 1, depth 1), wherein these blocks may be again partitioned into two or more blocks of a next lower level, e.g. tree-level 2 (hierarchy-level 2, depth 2), etc. until the partitioning is terminated, e.g. because a termination criterion is fulfilled, e.g. a maximum tree depth or minimum block size is reached. Blocks which are not further partitioned are also referred to as leaf-blocks or leaf nodes of the tree. A tree using partitioning into two partitions is referred to as a binary-tree (BT), a tree using partitioning into three partitions is referred to as a ternary-tree (TT), and a tree using partitioning into four partitions is referred to as a quad-tree (QT).

As mentioned before, the term “block” as used herein may be a portion, in particular a square or rectangular portion, of a picture. With reference, for example, to HEVC and VVC, the block may be or correspond to a coding tree unit (CTU), a coding unit (CU), a prediction unit (PU), or a transform unit (TU) and/or to the corresponding blocks, e.g. a coding tree block (CTB), a coding block (CB), a transform block (TB) or a prediction block (PB).

For example, a coding tree unit (CTU) may be or comprise a CTB of luma samples and two corresponding CTBs of chroma samples of a picture that has three sample arrays, or a CTB of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly, a coding tree block (CTB) may be an N><N block of samples for some value of N such that the division of a component into CTBs is a partitioning. A coding unit (CU) may be or comprise a coding block of luma samples and two corresponding coding blocks of chroma samples of a picture that has three sample arrays, or a coding block of samples of a monochrome picture or a picture that is coded using three separate colour planes and syntax structures used to code the samples. Correspondingly, a coding block (CB) may be an MxN block of samples for some values of M and N such that the division of a CTB into coding blocks is a partitioning.

In some embodiments, e.g., according to HEVC, a coding tree unit (CTU) may be split into CUs by using a quad-tree structure denoted as a coding tree. The decision whether to code a picture area using inter-picture (temporal) or intra-picture (spatial) prediction is made at the CU level. Each CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quad-tree structure similar to the coding tree for the CU.

In embodiments, e.g., according to the latest video coding standard currently in development, which is referred to as Versatile Video Coding (VVC), a combined quad-tree and binary-tree (QTBT) partitioning is for example used to partition a coding block. In the QTBT block structure, a CU can have either a square or rectangular shape. For example, a coding tree unit (CTU) is first partitioned by a quad-tree structure. The quad-tree leaf nodes are further partitioned by a binary-tree or ternary (or triple)-tree structure. The partitioning tree leaf nodes are called coding units (CUs), and that partition is used for prediction and transform processing without any further partitioning. This means that the CU, PU and TU have the same block size in the QTBT coding block structure. In parallel, multiple partitions, for example, triple-tree partition may be used together with the QTBT block structure.

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

As described above, the video encoder 20 is configured to determine or select the best or an optimum prediction mode from a set of (e.g. pre-determined) prediction modes. The set of prediction modes may comprise intra-prediction modes and/or inter-prediction modes. Intra-Prediction

The set of intra-prediction modes may comprise 35 different intra-prediction modes, such as non-directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined in HEVC, or may comprise 67 different intra-prediction modes, such as non- directional modes like DC (or mean) mode and planar mode, or directional modes, e.g. as defined for VVC.

The intra-prediction unit 254 is configured to use reconstructed samples of neighboring blocks of the same current picture to generate an (intra-)prediction block 265 according to an intra-prediction mode from the set of intra-prediction modes.

The intra-prediction unit 254 (or in general the mode selection unit 260) may be further configured to output intra-prediction parameters (or in general information indicative of the selected intra-prediction mode for the block) to the entropy encoding unit 270 in the form of syntax elements 266 for inclusion into the encoded picture data 21, so that, e.g., the video decoder 30 may receive and use the prediction parameters for decoding.

Inter-Prediction

The set of (or possible) inter-prediction modes depends on the available reference pictures (i.e. previous, at least partially decoded pictures, e.g. stored in DBP 230) and other inter- prediction parameters, e.g. whether the whole reference picture or only a part, e.g. a search window area around the area of the current block, of the reference picture is used for searching for a best matching reference block, and/or e.g. whether pixel interpolation is applied, such as half/semi-pel and/or quarter-pel interpolation, or not.

In addition to the above prediction modes, skip mode and/or direct mode may be applied.

The inter-prediction unit 244 may include a motion estimation (ME) unit and a motion compensation (MC) unit (both not shown in Fig.2). The motion estimation unit may be configured to receive or obtain the picture block 203 (current picture block 203 of the current picture 17) and a decoded picture 231, or at least one or a plurality of previously reconstructed blocks, such as reconstructed blocks of one or a plurality of previously decoded pictures 231, for motion estimation. By way of example, a video sequence may comprise the current picture and the previously decoded pictures 231, or in other words, the current picture and the previously decoded pictures 231 may be part of or form a sequence of pictures forming a video sequence.

The encoder 20 may be configured to select a reference block from a plurality of reference blocks of the same or different pictures of the plurality of previously decoded pictures and provide a reference picture (or reference picture index) and/or an offset (spatial offset) between the position (x, y coordinates) of the reference block and the position of the current block as inter-prediction parameters to the motion estimation unit. This offset is also called motion vector (MV).

The motion compensation unit may be configured to obtain, e.g. receive, an inter-prediction parameter and to perform inter-prediction based on or using the inter-prediction parameter to obtain an (inter-)prediction block 265. Motion compensation, performed by the motion compensation unit, may involve fetching or generating the prediction block based on the motion/block vector determined by motion estimation, possibly performing interpolations to sub-pixel precision. Interpolation filtering may generate additional pixel samples from known pixel samples, thus potentially increasing the number of candidate prediction blocks that may be used to code a picture block. Upon receiving the motion vector for the PU of the current picture block, the motion compensation unit may locate the prediction block to which the motion vector points in one of the reference picture lists.

The motion compensation unit may also generate syntax elements associated with the blocks and video slices for use by video decoder 30 in decoding the picture blocks of the video slice. In addition or as an alternative to slices and respective syntax elements, tile groups and/or tiles and respective syntax elements may be generated or used.

Entropy Coding

The entropy encoding unit 270 is configured to apply, for example, an entropy encoding algorithm or scheme (e.g. a variable length coding (VLC) scheme, a context adaptive VLC scheme (CAVLC), an arithmetic coding scheme, a binarization, a context adaptive binary arithmetic coding (CAB AC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique) or bypass (no compression) on the quantized coefficients 209, inter-prediction parameters, intra-prediction parameters, loop filter parameters and/or other syntax elements to obtain encoded picture data 21 which can be output via the output 272, e.g. in the form of an encoded bitstream 21, so that, e.g., the video decoder 30 may receive and use the parameters for decoding. The encoded bitstream 21 may be transmitted to video decoder 30, or stored in a memory for later transmission or retrieval by video decoder 30. Other structural variations of the video encoder 20 can be used to encode the video stream. For example, a non-transform based encoder 20 can quantize the residual signal directly without the transform processing unit 206 for certain blocks or frames. In another implementation, an encoder 20 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.

Decoder and Decoding Method

Fig. 3 shows an example of a video decoder 30 that is configured to implement the techniques of the present application. The video decoder 30 is configured to receive encoded picture data 21 (e.g. encoded bitstream 21), e.g. encoded by encoder 20, to obtain a decoded picture 331. The encoded picture data or bitstream comprises information for decoding the encoded picture data, e.g. data that represents picture blocks of an encoded video slice (and/or tile group or tile) and associated syntax elements.

In the example of Fig. 3, the decoder 30 comprises an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g. a summer 314), a loop filter 320, a decoded picture buffer (DBP) 330, a mode application unit 360, an inter-prediction unit 344 and an intra-prediction unit 354. Inter- prediction unit 344 may be or include a motion compensation unit. Video decoder 30 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 20 of Fig. 2.

As explained with regard to the encoder 20, the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter-prediction unit 244 and the intra-prediction unit 254 are also referred to as forming the “built-in decoder” of video encoder 20. Accordingly, the inverse quantization unit 310 may be identical in function to the inverse quantization unit 210, the inverse transform processing unit 312 may be identical in function to the inverse transform processing unit 212, the reconstruction unit 314 may be identical in function to reconstruction unit 214, the loop filter 320 may be identical in function to the loop filter 220, and the decoded picture buffer 330 may be identical in function to the decoded picture buffer 230. Therefore, the explanations provided for the respective units and functions of the video 20 encoder apply correspondingly to the respective units and functions of the video decoder 30.

Entropy Decoding

The entropy decoding unit 304 is configured to parse the bitstream 21 (or in general encoded picture data 21) and perform, for example, entropy decoding to the encoded picture data 21 to obtain, e.g., quantized coefficients 309 and/or decoded coding parameters 366, such as any or all of inter-prediction parameters (e.g. reference picture index and motion vector), intra- prediction parameters (e.g. intra-prediction mode or index), transform parameters, quantization parameters, loop filter parameters, and/or other syntax elements. Entropy decoding unit 304 may be configured to apply the decoding algorithms or schemes corresponding to the encoding schemes as described with regard to the entropy encoding unit 270 of the encoder 20. Entropy decoding unit 304 may be further configured to provide inter- prediction parameters, intra-prediction parameters and/or other syntax elements to the mode application unit 360 and other parameters to other units of the decoder 30. Video decoder 30 may receive the syntax elements at the video slice level and/or the video block level. In addition or as an alternative to slices and respective syntax elements, tile groups and/or tiles and respective syntax elements may be received and/or used.

Inverse Quantization

The inverse quantization unit 310 may be configured to receive quantization parameters (QP) (or in general, information related to the inverse quantization) and quantized coefficients from the encoded picture data 21 (e.g. by parsing and/or decoding, e.g. by entropy decoding unit 304) and to apply, based on the quantization parameters, an inverse quantization 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 use of a quantization parameter determined by video encoder 20 for each video block in the video slice (or tile or tile group) to determine a degree of quantization and, likewise, a degree of inverse quantization that should be applied. Inverse Transform

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

Reconstruction

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

Filtering

The loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter the reconstructed block 315 to obtain a filtered block 321, e.g. to smooth pixel transitions, or otherwise improve the video quality. The loop filter unit 320 may comprise one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or one or more other filters, e.g. a bilateral filter, an adaptive loop filter (ALF), a sharpening, a smoothing filter or a collaborative filter, or any combination thereof. Although the loop filter unit 320 is shown in Fig. 3 as being an in-loop filter, in other configurations, the loop filter unit 320 may be implemented as a post loop filter.

Decoded Picture Buffer

The decoded video blocks 321 of a picture are then stored in the decoded picture buffer 330, which stores the decoded pictures 331 as reference pictures for subsequent motion compensation for other pictures and/or for output or respectively display. The decoder 30 is configured to output the decoded picture 311, e.g. via output 312, for presentation or viewing to a user.

Prediction

The inter-prediction unit 344 may be identical to the inter-prediction unit 244 (in particular, to the motion compensation unit) and the intra -prediction unit 354 may be identical to the intra-prediction unit 254 in function, and performs split or partitioning decisions and prediction based on the partitioning and/or prediction parameters or respective information received from the encoded picture data 21 (e.g. by parsing and/or decoding, e.g. by entropy decoding unit 304). Mode application unit 360 may be configured to perform the prediction (intra- or inter-prediction) per block based on reconstructed pictures, blocks or respective samples (filtered or unfiltered) to obtain the prediction block 365.

When the video slice or picture is coded as an intra-coded (I) slice, intra-prediction unit 354 of mode application unit 360 is configured to generate prediction block 365 for a picture block of the current video slice based on a signaled intra-prediction mode and data from previously decoded blocks of the current picture. When the video slice or picture is coded as an inter-coded (i.e., B, or P) slice, inter-prediction unit 344 (e.g. motion compensation unit) of mode application unit 360 is configured to produce prediction block 365 for a video block of the current video slice based on the motion vectors and other syntax elements received from entropy decoding unit 304. For inter-prediction, the prediction blocks may be produced from one of the reference pictures within one of the reference picture lists. Video decoder 30 may construct the reference picture lists, List 0 and List 1, using default construction techniques based on reference pictures stored in DPB 330. The same or similar approach may be applied for or by embodiments using tile groups (e.g. video tile groups) and/or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and/or tiles.

Mode application unit 360 is configured to determine the prediction information for a video/picture block of the current video slice by parsing the motion vectors or related information and other syntax elements, and use the prediction information to produce the prediction blocks for the current video block being decoded. For example, the mode application unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra- or inter-prediction) used to code the video blocks of the video slice, an inter-prediction slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for the slice, motion vectors for each inter-coded video block of the slice, inter-prediction status for each inter-coded video block of the slice, and other information to decode the video blocks in the current video slice. The same or similar approach may be applied for or by embodiments using tile groups (e.g. video tile groups) and/or tiles (e.g. video tiles) in addition or alternatively to slices (e.g. video slices), e.g. a video may be coded using I, P or B tile groups and/or tiles.

Embodiments of the video decoder 30 as shown in Fig. 3 may be configured to partition and/or decode the picture by using slices (also referred to as video slices), wherein a picture may be partitioned into or decoded using one or more slices (typically non-overlapping), and each slice may comprise one or more blocks (e.g. CTUs).

Embodiments of the video decoder 30 as shown in Fig. 3 may be configured to partition and/or decode the picture by using tile groups (also referred to as video tile groups) and/or tiles (also referred to as video tiles), wherein a picture may be partitioned into or decoded using one or more tile groups (typically non-overlapping), and each tile group may comprise one or more blocks (e.g. CTUs) or one or more tiles, wherein each tile may be of rectangular shape and may comprise one or more blocks (e.g. CTUs), e.g. complete or fractional blocks.

Other variations of the video decoder 30 can be used to decode the encoded picture data 21. For example, the decoder 30 can produce the output video stream without the loop filtering unit 320. For example, a non-transform based decoder 30 can inverse-quantize the residual signal directly without the inverse-transform processing unit 312 for certain blocks or frames. In another implementation, the video decoder 30 can have the inverse-quantization unit 310 and the inverse-transform processing unit 312 combined into a single unit.

It should be understood that, in the encoder 20 and the decoder 30, a processing result of a current step may be further processed and then output to the next step. For example, after interpolation filtering, motion vector derivation or loop filtering, a further operation, such as Clip or shift, may be performed on the processing result of the interpolation filtering, motion vector derivation or loop filtering. It should be noted that further operations may be applied to the derived motion vectors of the current block (including but not limited to control point motion vectors of affine mode, sub- block motion vectors in affine, planar, ATMVP modes, temporal motion vectors, and so on). For example, the value of a motion vector is constrained to a predefined range according to its representing bit number. If the representing bit number of the motion vector is bitDepth, then the range is -2^{^}(bitDepth-l) ~ 2^{^}(bitDepth-1)-1, where “^{^}” means exponentiation. For example, if bitDepth is set equal to 16, the range is -32768 ~ 32767; if bitDepth is set equal to 18, the range is -131072-131071. For example, the value of the derived motion vector (e.g. the MVs of four 4x4 sub-blocks within one 8x8 block) is constrained such that the maximum difference between integer parts of the four 4x4 sub-block MVs is no more than N pixels, such as no more than 1 pixel. The following description provides two methods for constraining the motion vector according to the bitDepth.

Method 1 : remove the overflow MSB (most significant bit) by the following operations: ux= ( mvx+2^bitDepth ) % 2^bitDepth ( 1 ) mvx = ( ux >= 2^bitDepth-1 ) ? (ux - 2^bitDepth ) : ux (2) uy= ( mvy+2^bitDepth ) % 2^bitDepth (3) mvy = ( uy >= 2^bitDepth-1 ) ? (uy - 2^bitDepth ) : uy (4) where mvx is a horizontal component of a motion vector of an image block or a sub-block, mvy is a vertical component of a motion vector of an image block or a sub-block, and ux and uy indicate respective intermediate values.

For example, if the value of mvx is -32769, after applying formulae (1) and (2), the resulting value is 32767. In a computer system, decimal numbers are stored as two’s complements. The two’s complement of -32769 is 1,0111,1111,1111,1111 (17 bits). Then, the MSB is discarded, so the resulting two ’ s complement is 0111,1111,1111,1111 (decimal number is 32767), which is the same as the output by applying formulae (1) and (2). ux= ( mvpx + mvdx +2^bitDepth ) % 2^bitDepth (5) mvx = ( ux >= 2^bitDepth-1 ) ? (ux - 2^bitDepth ) : ux (6) uy= ( mvpy + mvdy +2^bitDepth ) % 2^bitDepth (7) mvy = ( uy >= 2^bitDepth-¹ ) ? (uy - 2^bitDepth ) : uy (8)

The operations may be applied during the sum of the motion vector predictor mvp and the motion vector difference mvd, as shown in formulae (5) to (8).

Method 2: remove the overflow MSB by clipping the value: vx = Clip3(-2^bitDepth-1, 2^bitDepth-1 -1, vx) vy = Clip3(-2^bitDepth-1, 2^bitDepth-1 -1, vy) where vx is a horizontal component of a motion vector of an image block or a sub-block, vy is a vertical component of a motion vector of an image block or a sub-block; x, y and z respectively correspond to three input values of the MV clipping process, and the definition of the function Clip3 is as follows: x ; z < x

Clip3( x, y, z ) y ; z > y z ; otherwise

Fig. 4 is a schematic diagram of a video coding device 400 according to an embodiment of the present disclosure. The video coding device 400 is suitable for implementing the disclosed embodiments as described below. In an embodiment, the video coding device 400 may be a decoder such as video decoder 30 of Fig. 1 A or an encoder such as video encoder 20 of Fig. 1A.

The video coding device 400 may comprise ingress ports 410 (or input ports 410) and one or more receiver units (Rx) 420 for receiving data; a processor, logic unit, or central processing unit (CPU) 430 to process the data; one or more transmitter units (Tx) 440 and egress ports 450 (or output ports 450) for transmitting the data; and a memory 460 for storing the data.

The video coding device 400 may also comprise optical-to-electrical (OE) components and electrical -to-optical (EO) components coupled to the ingress ports 410, the receiver units 420, the transmitter units 440, and the egress ports 450 for egress or ingress of optical or electrical signals. The processor 430 may be implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGAs, ASICs, and DSPs. The processor 430 may be in communication with the ingress ports 410, the receiver units 420, the transmitter units 440, egress ports 450, and the memory 460. The processor 430 may comprise a coding module 470. The coding module 470 implements the disclosed embodiments described above and below. For instance, the coding module 470 may implement, process, prepare, or provide the various coding operations. The inclusion of the coding module 470 therefore provides a substantial improvement to the functionality of the video coding device 400 and effects a transformation of the video coding device 400 to a different state. Alternatively, the coding module 470 may be implemented as instructions stored in the memory 460 and executed by the processor 430.

The memory 460 may comprise one or more disks, tape drives, and solid-state drives and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution. The memory 460 may be, for example, volatile and/or non-volatile and may be a read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and/or static random-access memory (SRAM).

Fig. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of the source device 12 and the destination device 14 from Fig. 1A according to an exemplary embodiment.

A processor 502 in the apparatus 500 can be a central processing unit. Alternatively, the processor 502 can be any other type of device, or multiple devices, capable of manipulating or processing information now-existing or hereafter developed. Although the disclosed implementations can be practiced with a single processor as shown, e.g., the processor 502, advantages in speed and efficiency can be achieved using more than one processor.

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

The apparatus 500 can also include one or more output devices, such as a display 518. The display 518 may be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs. The display 518 can be coupled to the processor 502 via the bus 512.

Although depicted here as a single bus, the bus 512 of the apparatus 500 can be composed of multiple buses. Further, a secondary storage (not shown) can be directly coupled to the other components of the apparatus 500 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards. The apparatus 500 can thus be implemented in a wide variety of configurations.

Triangular partitioning mode (TPM) and geometric motion partitioning (GMP) are partitioning techniques that enable non-horizontal and non-vertical boundaries between prediction partitions, as exemplarily shown in Fig. 6, where prediction unit PU1 601 and prediction unit PU 1 602 are combined in region 603 using a weighted averaging procedure of subsets of their samples. TMP enables boundaries between prediction partitions only along diagonals of a rectangular block, whereas boundaries according to GMP may be located at arbitrary positions and have arbitrary orientations as Fig. 9 illustrates. In region 603 of Fig. 6, integer numbers within squares denote weights W_PU1 applied to the luma component of prediction unit PU 1. In an example, weights W_PU2 applied to the luma component of prediction unit PU2 are calculated as follows: W_PU2 = 8 — W_PU1 ·

In the example of Fig. 6, the weights W_PU1 in the remaining (empty) squares of prediction unit PU 1 may be set to 8 while they are set to 0 in the remaining (empty) squares of prediction unit PU2, such that no averaging is applied to the respective samples.

Weights applied to chroma components of corresponding prediction units may differ from the weights applied to luma components of corresponding prediction units. The details on the syntax for TPM are presented in Table 1, where 4 syntax elements are used to signal information on TPM:

MergeTriangleFlag is a flag that identifies whether TPM is selected or not (“0” means that TPM is not selected; otherwise, TPM is chosen); merge triangle split dir is a split direction flag for TPM (“0” means the split direction from top-left corner to the below-right corner; otherwise, the split direction is from top-right corner to the below-left corner); merge triangle idxO and merge triangle idxl are indices of merge candidates 0 and 1 used for TPM.

Table 1. Merge data syntax including syntax for TPM

In more detail, TPM is described in the following proposal: R-L. Liao and C.S. Lim “CE10.3.1.b: Triangular prediction unit mode,” contribution JVET-L0124 to the 12^th JVET meeting, Macao, China, October 2018, which is publicly available under http://phenix.it- sudparis.eu/jvet/. GMP is explained in the following paper: M. Blaser, J. Schneider, Johannes Sauer, and Mathias Wien, “Geometry-based Partitioning for Predictive Video Coding with Transform Adaptation,” Picture Coding Symposium (PCS), San Francisco, California, USA, June 2018.

Compression efficiency of TPM and GMP is increased by reducing the bitrate needed to encode blocks, wherein the blocks are predicted using these and similar partitioning techniques.

Prediction errors are localized only in the near-boundary region (or simply boundary region) that covers the boundary between partitions. For a more compact representation, transform and quantization are performed only for this near-boundary region.

The present disclosure is, however, not limited to inter prediction but may equally be applied to intra prediction based on prediction units PU 1 and PU2 defined by a non-horizontal and non-vertical boundary as described herein.

According to the present disclosure, a method for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non-vertical boundary between prediction partitions, may be implemented by a decoding device or an encoding device with the following steps shown in Fig. 17 and performed by the decoder processing loop shown in Fig. 2 and Fig. 3:

Step 1710: inverse transforming a subsampled residual block to determine a subsampled reconstructed residual block;

Step 1720: filling samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the subsampled reconstructed residual block, and Step 1730: obtaining a reconstructed block of the current block from a predicted block and the reconstructed residual block.

As the prediction errors are limited to a region near the boundary as described in further detail below, only part of the residual block 205 of Fig. 2 corresponding to the prediction unit needs to be coded in the bitstream while the remaining samples of the residual block are assumed to have zero residual. As described in further detail below, the residual block 205 is thus subsampled to form a transform block that is subsequently transformed by transform processing unit 206 of the encoder 20 and quantized by quantization unit 208. In other words, only a subset of the samples of the residual block 205, i.e. a subsampled residual block, is selected to be coded in the bitstream.

The decoder processing loop of the encoder 20 and the decoder 30 thus performs, after inverse quantization, an inverse transform in the inverse transform processing unit 212 or 312, respectively, on the subsampled residual block to determine a subsampled reconstructed residual block.

As described in further detail below, the subsampled residual block corresponds to a rectangular transform block. To improve the coding efficiency, at least one of the height and the width of the transform block may be reduced as compared to the corresponding dimensions of the prediction unit, depending on the specific case of partitioning the current block with a non-horizontal and non- vertical boundary, as described in further detail below.

Depending on the case, the subsampled reconstructed residual block is mapped to the near- boundary region or boundary region row -by-row or column-by-column as detailed further below. In other words, the boundary region may be scanned row by row or column by column wherein subsets of samples in the respective rows or columns correspond to respective rows or columns of the sub sampled reconstructed residual block. As shown in Figs. 6, 7 and 9, offsets may be provided between individual subsets such that the boundary region covers the boundary between the partitions. The offsets may be zero for some subsets, but otherwise constant. If the boundary is scanned row by row, each subset covers the same number of columns. If the boundary is scanned column by column, each subset covers the same number of rows. As a result, a skewed boundary region covering the boundary as shown in Figs. 6, 7, and 9 maps to a rectangular subsampled (reconstructed) residual block corresponding to the transform block which is coded in the bitstream.

The following embodiments exemplify how this method can be implemented.

In an exemplary embodiment, a near-boundary region (or boundary region) is defined by start and end side positions, wherein the first of the side positions is located on a first side of the block, wherein a side of the block is top, left, right or bottom; and the second side position is located on a second side of the block, and wherein the first side of the block is not the same as the second side of a block. The near-boundary region may be defined by a curve that connects the first and the second side positions wherein samples with a distance to the curve not exceeding a distance threshold may be included in the near-boundary region. The distance threshold may be set to 2.

For example, rows of a subsampled block may be obtained by selecting a set of samples from a range of rows of a block of residual signal, wherein the start position for the first row of the range is specified as the first side position and the end position is specified for the last row of the range as the end position, and wherein a sampling position is specified for each of the rows between the first row and the last row of the range so that the sampling position is a monotonic function of the row position within a block, and wherein the set of samples comprises the samples for which the distance to the sampling position of the row is not greater than the distance threshold. In other words, an offset in the horizontal direction may be provided between the sampling positions for adjacent rows in the range of rows, wherein a zero offset may be provided for some of the rows.

In another example, columns of a sub sampled block may be obtained by selecting a set of samples from a range of columns of a block of residual signal, wherein the start position for the first column of the range is specified as the first side position and the end position is specified for the last column of the range as the end position, and wherein a sampling position is specified for each of the columns between the first column and the last column of the range so that the sampling position is a monotonic function of the column position within a block, and wherein the set of samples comprises the samples for which the distance to the sampling position of the column is not greater than the distance threshold. In other words, an offset in the vertical direction may be provided between the sampling positions for adjacent columns in the range of columns, wherein a zero offset may be provided for some of the columns.

It is understood, that the distance threshold is smaller than corresponding block side length, i.e. it may be set to half of the height or half of the width of the block.

Embodiments of this disclosure disclose a mechanism of resampling a block to obtain a near- boundary region, i.e. boundary region, that is processed as a transform block / transform unit.

In an embodiment of the present invention, as shown in Fig. 6, prediction unit PU1 601 and prediction unit PU2 602 are combined in region 603 using TPM technique as described above to determine a predictor, wherein the prediction error is calculated for these prediction units. A residual block contains 2 zero-residual regions 611 and 612, and region 613 is resampled into a transform block (TB) 623. The TB 623 represents residuals for a color component, such a luma or chroma, of a transform unit (TU). In regions 611 and 612, residuals are assumed to be zero, whereas the residual may be non-zero in region 613. In the example of Fig. 6, region 613 covers at least the area where weights for both prediction units PU1 and PU2 are non-zero as indicated by the numbers in the left-hand figure. The boundary in the depicted case connects the top-left corner and the bottom-right corner of the current block, i.e. the entire prediction unit. In an example, residual signals from region 613 can be resampled into transform block 623 by reading samples from memory row-wise or column- wise. In the example of Fig. 6, the transform block 623 has a width of 16 corresponding to the width of entire prediction unit and a height of 8 which is half of the height of the entire prediction unit. The samples are read column-wise to determine the columns of the transform block 623. Here and in the following, the terms residual and residue are used synonymously.

In another example, as shown in Fig. 7, non-zero residuals shown in region 701 cover a part of the area where weights for both prediction units PU1 and PU2 are non-zero as indicated by the numbers in the top figure. In regions 702 and 703, residuals are assumed to be quantized out to zero. In other words, no residuals are signaled for regions 702 and 703 in the bitstream such that the decoder assumes zero residuals for these regions. So, transform block 704 that represents residuals for a color component, such as luma or chroma, of a transform unit (TU) is the result of resampling region 701. In the example of Fig. 7, the transform block 704 has a width of 16 corresponding to the width of entire prediction unit and a height of 4 which is a quarter of the height of the entire prediction unit. The samples are read column-wise to determine the columns of the transform block 704.

In another example, as shown in Fig. 8, processing steps for the TPM case are presented as 2 flow-charts for a decoder and an encoder, respectively. In step 801, residual data are decoded, inverse quantization and inverse transform (if any) are performed to obtain transform blocks (TBs) of a TU. Then, inverse resampling 802 restores residuals within each transform block (TB) of a TU placing samples of a transform block at corresponding positions within a residual block. The correspondence or mapping between sample positions in region 613 and sample positions in transform block 623 of a TU is demonstrated in Fig. 6. Similarly, this correspondence is also shown in Fig. 7. Regions 611 and 612 in Fig. 6 or regions 702 and 703 in Fig. 7, which include the samples of the residual block outside the boundary region, are filled in with zero residuals. Step 803 corresponds to PU reconstruction using the restored residuals and the TPM predictor.

In an example, at the encoder side, the order of actions shown in Fig. 8 for TPM is as follows. In step 811, the prediction process according to TPM is performed to determine a predictor for an entire prediction unit. Residuals are obtained according to the predictor. In step 812, samples corresponding to region 613 in Fig. 6 or region 701 in Fig. 7 are fetched from memory either row-wise or column-wise to get a transform block of a TU. Forward transform, quantization and residual coding are performed as in step 813.

Similarly, resampling and inverse resampling may be used in the case of GMP as shown in Fig. 9. In regions 902, 904, 912 and 914, residuals are assumed to be zero. The boundary between regions 902 and 904 is shown by line 903, whereas the boundary between regions 912 and 914 is shown by line 913. The near-boundary regions or boundary regions 901 or 911 cover the area between regions 902 and 904 as well as 912 and 914 in different ways as Fig. 9 illustrates, respectively. Besides, regions 901 or 911 are resampled into transform blocks of different shapes 905 and 915, respectively. The example in the left-hand figure corresponds to a row-wise scan of the boundary region while the example in the right-hand figure corresponds to a column-wise scan of the boundary p and q refer to the maximum width and height of the prediction unit PU1 to the top -right of the line 903.

In Fig. 10, processing steps for the GMP case are presented as 2 flow-charts for a decoder and an encoder. In step 1001, residuals are decoded, inverse quantization and inverse transform (if any) are performed to obtain transform blocks of a TU. Then, inverse resampling 1002 restores residuals within each transform block of a TU, placing samples of a transform block at corresponding positions within a residual block. The correspondence or mapping between samples positions within regions 901 and 911 and transform blocks 905 and 915 of TUs is demonstrated in Fig. 9. Regions 902, 904, 912 and 914, which include the samples of the residual block outside the respective boundary region, in Fig. 9 are filled in with zero residuals. The final step 1003 corresponds to PU reconstruction using the restored residuals and the GMP predictor.

At the encoder side, the order of actions shown in Fig. 10 for GMP is as follows. In step 1011, the prediction process for GMP is performed to determine a predictor for an entire prediction unit and then, residuals are obtained. In step 1012, samples corresponding to region 901 or 911 in Fig. 9 are fetched from memory either row -wise or column-wise to get a transform block of a TU. Finally, forward transform, quantization and residual coding are performed as in step 1013.

In another embodiment, a resampling process to obtain a TU 1012 may be using GMP partitioning parameters that were used in step 1011 to obtain the predictor and the residuals. These parameters define a line (903) that divides a rectangular block into two non-rectangular areas (904 and 902, respectively). These parameters may be defined as two values: angle parameter; and distance parameter.

Distance parameter d (907) may define the (orthogonal) distance between the partitioning line 903 and the center of the block 908. Angle parameter is a value that defines an angle of a line 903 relative to the sides of the block 902. As indicated in Fig. 9, the angle may be taken from a vertical line starting at the center in a counterclockwise direction. The angle parameter may be defined as an index value p_a. The value of an angle a (906) for partitioning line 903 may be defined as a = p_a · C_a , wherein C_a is a predefined angular step.

In another implementation, the value of a may be determined by the means of a lookup table (LUT), wherein an angle parameter is used as an index of the LUT: a = LUT[ p_a ].

A near-boundary region or boundary region that is used in steps 1002 and 1012 may be defined by performing the following steps.

In step 1, angle parameter p_a is normalized to 180 degrees. A check whether the angle a is greater than 180 degrees is performed. For example, when p_a Î [0,P], step 1 consists in checking whether For example, when the value P is set equal to 31, the value of angular step C_a is set equal to 11.25 degrees. Alternatively, the check may be performed as follows: When the condition is true, the value p_a is decreased by

In step 2, it is determined whether the near-boundary region is scanned row by row as in the left-hand figure of Fig. 9 or column by column as in the right-hand figure of Fig. 9. This determination may be performed by comparing the angle parameter p_a normalized in step 1 with two threshold values T_a0 < p_a £ T_a1. These two values may correspond to angular parameters that define the block diagonals of the predicted block. Angles corresponding to T_a0 and T_a1 may be found as and where W is the width of the predicted block and H is the height of the predicted block. In an exemplary implementation, the values of T_a0 and T_a1 may be stored in a lookup table indexed by an aspect ratio.

For example, when the value P is set equal to 31, and the width W of a block is greater or equal to the height H of the block, the following lookup table may be used:

Table 2: Dependency of the values T_a0 and T_a1 on the aspect ratio when width W is greater or equal to height H When the value P is set equal to 31, and the width W of a block is less than the height H of the block, the following lookup table may be used.

Table 3 : Dependency of the values T_a0 and T_a1 on the aspect ratio when width W is smaller than height H

Based on a comparison of the angle parameter p_a with the two threshold values T_a0 and T_a1 three different scenarios present themselves:

When T_a0 < p_a £ T_a1, a boundary region may be defined to have a width equal to the width of the block W, and a height that is equal to wherein g = 2^m. In specific embodiments, the value of m may be defined, e.g., as follows: m Î {1}, m Î {1,2} or m Î {1,2,3}.

The value of a per-column step shift in the vertical direction may be D_c = max(1,log₂(8 — T_ao)) For arbitrary values of T_a0, a floor operation may be applied to ensure an integer D_c.

The value of the maximum offset of line 903 from the horizontal symmetry axis, i.e. a horizontal line through the center 908 of the block, is defined, e.g., as follows:

Start and end side position of the line 903 are correspondingly determined as follows:

Start and end side positions are also referred to as the first and the second positions.

When p_a £ T_a0, a boundary region may be defined to have a height equal to the height of the block//, and a width that is equal to wherein g = 2^m. In specific embodiments, the value of m may be defined, e.g., as follows: m Î {1}, m € {1,2} or m Î {1,2,3}.

The value of a per-row step shift in the horizontal direction may be For arbitrary values of T_a0 , a floor operation may be applied to ensure an integer D_R.

The value of the maximum offset of line 903 from the vertical symmetry axis, i.e. a vertical line through the center 908 of the block, is defined, e.g., as follows:

Start and end side positions of the line 903 are correspondingly determined as follows:

Start and end side positions are also referred to as the first and the second position.

When p_a > T_a1 a boundary region may be defined to have a height equal to the height of the block//, and a width that is equal to wherein y = 2^m. In specific embodiments, the value of m may be defined, e.g., as follows: m Î {1}, m € {1,2} or m £ {1,2,3}.

The value of a per-row step shift in the horizontal direction may be D_R = max(l,log₂(16 — T_a1 ) ). For arbitrary values of T_a1, a floor operation may be applied to ensure an integer D_R.

Start and end side positions of the line 903 are determined as follows:

The value of g determines the width of the boundary region and a corresponding value of m may be signaled in a bitstream.

In case when the resulting width or height of the boundary region is smaller than a predefined size threshold T_s, a partial transform may not be performed and no signaling is indicated in the bitstream. Particularly, threshold T_s may be set equal to 4.

In step 3, when the height of the boundary region is equal to the height of the block, for each row of a block, a value of a row offset, i.e. an offset of the sets of samples selected from the range of rows to form the rows of the subsampled residual block, may be defined as: d = (X_d + ( 1 << (S — 1)) >> S) — (W₀ >> 1) , wherein W₀ is the width of the boundary region.

In a particular embodiment, precision parameter S may be set equal to 6. For a first row, X_d = x_s << S, and for the last row X_d = x_E << S. For the other rows, the value of X_d changes gradually from the value assigned for the first row and the value assigned to the last row.

Similarly, when the width of the boundary region is equal to the width of the block, for each column of a block, a value of a column offset may be defined and a boundary region may be defined.

The disclosed mechanism adds one more state that should be signaled. In Fig. 11, a signaling mechanism is illustrated for the above described method exemplarily applied to TPM. In steps 1101 and 1102, the value of the flags MergeTriangleFlag and cbf are checked. If the values of both MergeTriangleFlag and cbf flags are set to 1, then the flag ShapeAdaptiveResamplingFlag may be checked. At the encoder side, its value may be iterated in a Rate-Distortion Optimization procedure. So, its set value may be read from memory. At the decoder side, a value of ShapeAdaptiveResamplingFlag may be parsed from a bitstream. If ShapeAdaptiveResamplingFlag equals 1, resampling for transform blocks is performed.

Note that in the current design of H.266/VVC, there are several syntax elements that have the meaning of cbf (Coded Block Flag) flags, namely: cu cbf for an entire coding unit (CU), tu cbf luma, tu cbf cb and tu cbf cr are CBFs for luma, Cb, and Cr components of a TU, respectively. For the sake of generality, the abbreviation cbf in step 1102 may denote any one of these flags. Of course, the meaning of these flags is different in each case. If cu cbf is checked, then the disclosed resampling may be applied to each color component. Otherwise, it is used only for a specific color component (luma, Cb, or Cr). As mentioned above, the height of a region to be resampled and, therefore, the height of a TB may vary. By way of example, the height of region 613 in Fig. 6 differs from the height of region 701 in Fig. 7. To make the design of the disclosed technique flexible, the height of a region to be resampled and, therefore, the height of a TB may be adjustable. A first mechanism to adjust the height of a region to be resampled and, therefore, the height of a TB may derive the height using an entire block shape and size. For example, a value of height _TB of a region to be resampled and, therefore, the height of a TB may be calculated as follows: height_TB = max{width, height} / 2, where width and height are the horizontal and vertical lengths of a (current) block. A second mechanism to adjust the height of a region to be resampled and, therefore, the height of a TB may signal the height in a bitstream as shown in Fig. 12. Steps 1201-1203 are the same as steps 1101-1103 in Fig. 11. At step 1204, the value of ShapeAdaptiveResamplingFlag is checked whether it equals 1 or not. If ShapeAdaptiveResamplingFlag equals 1, then the syntax element Shape AdaptiveResampling Size may be read from memory (at the encoder side) or parsed from a bit-stream (at the decoder side) at step 1205. Various codes may be used to encode or decode the syntax element ShapeAdaptiveResamplingSize. For example, if it is necessary to choose only between 2 values for the height of a region to be resampled and, therefore, the height of a TB, 1 binary flag can be used. If more options (3 or more variants of the height) are available, unary truncated code, fixed-length code, exponential Golomb-Rice code, etc. may be used as codes.

One of the difficulties in using the disclosed technique is how to perform deblocking filtering on the boundaries of a region when its boundaries are not horizontal or vertical. In Fig. 13, region 1301 is resampled into a TB and then transform (if any) and quantization are performed. So, blocking artifacts might appear near the boundary between region 1301 and region 1302 as well as near the boundary between region 1301 and region 1303. To deblock these 2 boundaries, the following mechanism may be used:

1. Fetch sample p[x][y] located within region 1301 directly on block boundary and marked by black circles in Fig. 13;

2. Assign value of (p [x] [y] » k ) to samples at position (x, y - k) if k <= 3

3. Fetch sample p[x][y] located within region 1301 directly on block boundary and marked by black triangles in Fig. 13;

4. Assign value of (p [x] [y] » k ) to samples at position (x, y + k) if k <= 3. The described deblocking filter is directional. The propagation directions are marked by arrows 1304 and 1305 in Fig. 13.

Another mechanism to deblock boundaries between regions 1401 and 1402 as well as 1401 and 1403 is presented in Fig. 14. A spatial filter of (2 ^N+1 )x(2^M+ ) size (where N and M are non-zero integer values) is applied on the boundaries between regions 1401 and 1402 as well as 1401 and 1403 so that the spatial filter is fed by a group of samples that contains at least one sample belonging to region 1401 and at least one sample belonging to region 1402 or 1403. In the example shown in Fig. 14, regions where the spatial filter is applied have sizes of 3x3 and are denoted by 1404 and 1405. The spatial filter may relate to the type of low-pass smoothing filters. If a 3x3 Gaussian filter is used, its coefficients may be as follows:

In another embodiment of the disclosure illustrated in Fig. 15 and Fig. 16, a boundary region is defined by the partitioning process of GMP that subdivides a PU into two regions using a straight line. The line has an intersection with the PU boundary in two points corresponding to two integer positions. There are 6 general cases of partitioning, four of these cases split the PU into one triangle and 1 pentagon area, and the remaining two cases split the PU into two trapeze areas.

For the trapeze cases, these two positions are located on the top and bottom sides, or on the left and right sides of the PU.

The boundary region may be obtained by either a row-wise or column-wise scan, wherein for each iteration, the sampling position is shifted by a step value, that may be defined as: s = (y_E — y_s + S_TB )/(X_E — X_s — 1) , when the scan is column- wise; and s = (x_E — x_s + S_TB)/(y_E — y_s — 1) , when the scan is row-wise.

Alternatively, the step value s may be defined as: s =(y_E— y_s + S_TB/2)/(x_E — x_s + 1) , when the scan is column-wise; and s = (x_E — x_s + S_TB/2)/(y_E — y_s + 1) , when the scan is row-wise.

In the equations above, {x_s,y_s} and {X_E>y_E} denote start and end side positions, shown in Fig.

15 and Fig. 16 respectively, for a colomn-wise and a row- wise scan. Depending on the scan, S_TB denotes height _TB (Fig. 15) or width-m (Fig. 16) of the subsampled block and is further referred to as a subsampling width Sw.

For a row- wise scan, samples of the subsampled block B(x, y) are obtained from PU samples p(x,y) as follows:

B{x,y ) = p(x_s + s · y - S_w,y_s + y)

For a column-wise scan, samples of the subsampled block B(x,y ) are obtained from PU samples p(x,y) as follows:

B(x,y ) = p(x_s + x,y_s + s · y - S_w).

Alternatively, for a row- wise scan, samples of the subsampled block B (x, y) are obtained from PU samples p(x,y) as follows:

B{x,y ) = p(x + x_s + s · g,g₅ + y)

Similarly, for a column -wise scan, samples of the subsampled block B(x,y) are obtained from PU samples p(x,y) as follows:

B(x,y) = p(x_s + x,y + y_s + s - x).

For the cases when the split results in one triangle and one pentagon, selection of the scan may depend on whether a horizontal or vertical component of the start and end side positions are closer to the corner that is aligned with the resulting triangle.

When the horizontal component is closer to the comer of the split case, x_s — XE is quantized to the closest power-of-two value and a column-wise scan is applied.

When the vertical component is closer to the corner of the split case, y_s — y_E is quantized to the closest power-of-two value and a row-wise scan is applied.

In both cases, S_w is selected in such a way that the resulting boundary region is inside the PU.

Fig. 18 shows a block diagram illustrating an example of an encoding/decoding apparatus for coding a video sequence using partitioning and prediction of a current block with a non- horizontal and non-vertical boundary between prediction partitions according to embodiments of the disclosure. The encoding/decoding apparatus 20/30 comprises an inverse transform processing unit 1810 configured to inverse transform a subsampled residual block to determine a subsampled reconstructed residual block, a filling unit 1820 configured to fill samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the sub sampled reconstructed residual block, and an obtaining unit 1840 configured to obtain a reconstructed block of the current block from a predicted block and the reconstructed residual block.

The encoding/decoding apparatus 20/30 may further comprise an inter prediction unit 1860 configured to determine the predicted block using Triangular Partitioning Mode (TPM) or Geometric Motion Partitioning (GMP).

The encoding/decoding apparatus 20/30 may further comprise a filter unit 1830 configured to apply a smoothing filter to samples of the reconstructed residual block that are adjacent to the boundary region.

The decoding apparatus 30 may further comprise an entropy decoding unit 1850 configured to parse at least one of a height or a width of the sub sampled residual block from a bitstream of the video sequence.

The inverse transform processing unit 1810, the filling unit 1820, the filter unit 1830, the obtaining unit 1840, the entropy decoding unit 1850, and the inter prediction unit 1860 may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over communication media as one or more instructions or code and executed by a hardware-based processing unit. Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term “processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.

Some particular embodiments are outlined in the following aspects of the disclosure. According to a first aspect, a coding method for a video is provided, comprising obtaining sub sampled reconstructed residual block by inverse transforming a transformed sub sampled residual block, obtaining a reconstructed residual block by filling samples of a near-boundary region of the reconstructed residual block with a corresponding value within the subsampled reconstructed residual block, and obtaining a reconstructed block from a predicted block and the reconstructed residual block.

A near-boundary region may be defined by start and end side positions, wherein the first of the side positions is located on first side of reconstructed residual block and the second side position is located on the second side of the reconstructed residual block, and wherein the first side of the reconstructed residual block is not the same as the second side of the reconstructed residual block, and the first side and the second side are respectively located either on individual top boundary, left boundary, right boundary and bottom boundary of the reconstructed residual block, or on both of connected boundary, top and left boundaries, top and right boundaries, right and bottom boundaries, or left and bottom boundaries.

Rows of the sub sampled reconstructed residual block may be filled into a set of samples from a range of rows of the near-boundary region of the reconstructed residual block, wherein the start position for the first row/column of the near-boundary region is specified as the first side position and the end position is specified for the last row/column of the near-boundary region as the second side position wherein the set of samples comprises the samples for which the distance to a subsampling position of the row is not greater than the distance threshold. The distance threshold may be set equal to half of the width of the reconstructed residual block. The width of the reconstructed residual block may be greater than the height of reconstructed residual block.

Alternatively, columns of subsampled block may be obtained by selecting a set of samples from a range of columns of a block of residual signal, wherein the start position for the first column of the range is specified as the first side position and the end position is specified for the last column of the range as the end position, and wherein a sampling position is specified for each of the columns between the first column and the last column of the range so that the sampling position is a monotonic function of the column position within a block, and wherein the set of samples comprises the samples for which the distance to the sampling position of the column is not greater than the distance threshold. The distance threshold may be set equal to half of the height of the reconstructed residual block. The height of the reconstructed residual block may be greater than the width of the reconstructed residual block.

The predicted block may be obtained using TPM and TPM split direction is from the top-left to bottom-right corner of the reconstructed residual block, and wherein the first position is aligned with the top-left corner of the block and the second position is aligned with the bottom- right corner of the reconstructed residual block.

Alternatively, the predicted block may be obtained using TPM and TPM split direction is from the top-right to botom-left comer of the reconstructed residual block, and wherein the first position is aligned with the top-right corner of the block and the second position is aligned with the botom-left comer of the reconstructed residual block.

When the reconstructed residual block is predicted by using GMP, the first side position and the second side position may be defined by intersection of a GMP split line with the boundary of the block.

When the reconstructed residual block is predicted by using GMP, the side first position and the second side position may be defined according to an angle parameter of GMP.

Samples of the reconstructed residual block that are adjacent to the near-boundary region may be smoothed by using a smooth filter. An FIR filter may be applied to the boundary samples of the near-boundary region.

The near boundary region may include non-zero samples of the reconstructed residual block.

Any one of the methods according to the above-described first aspect may be implemented by an encoding device. Any one of the methods according to the above-described first aspect may be implemented by a decoding device.

According to a further aspect, an encoder or a decoder is provided comprising processing circuitry for carrying out any one of the methods according to the above-described first aspect. According to a further aspect, a computer program product is provided comprising a program code for performing any one of the methods according to the above-described first aspect.

According to a further aspect, a decoder or an encoder is provided, comprising one or more processors, and a non-transitory computer-readable storage medium coupled to the processors and storing programming for execution by the processors, wherein the programming, when executed by the processors, configures the decoder to carry out any one of the methods according to the above-described first aspect.

According to a further aspect, a non-transitory computer-readable medium is provided carrying a program code which, when executed by a computer device, causes the computer device to perform any one of the methods according to the above-described first aspect.

Mathematical Operators

The mathematical operators used in this application are similar to those used in the C programming language. However, the results of integer division and arithmetic shift operations are defined more precisely, and additional operations are defined, such as exponentiation and real-valued division. Numbering and counting conventions generally begin from 0, i.e. "the first" is equivalent to the 0-th, "the second" is equivalent to the 1st, etc.

Arithmetic operators

The following arithmetic operators are defined as follows:

Logical operators

The following logical operators are defined as follows: x && y Boolean logical "and" of x and y x I I y Boolean logical "or" of x and y

! Boolean logical "not" x ? y : z If x is TRUE or not equal to 0, evaluates to the value of y; otherwise, evaluates to the value of z.

Relational operators

The following relational operators are defined as follows:

> Greater than

>= Greater than or equal to

< Less than

<= Less than or equal to

= = Equal to

!= Not equal to

When a relational operator is applied to a syntax element or variable that has been assigned the value "na" (not applicable), the value "na" is treated as a distinct value for the syntax element or variable. The value "na" is considered not to be equal to any other value.

Bit-wise operators

The following bit-wise operators are defined as follows:

& Bit-wise "and". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. I Bit-wise "or". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. ^{^} Bit-wise "exclusive or". When operating on integer arguments, operates on a two's complement representation of the integer value. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. x >> y Arithmetic right shift of a two's complement integer representation of x by y binary digits. This function is defined only for non-negative integer values of y. Bits shifted into the most significant bits (MSBs) as a result of the right shift have a value equal to the MSB of x prior to the shift operation. x << y Arithmetic left shift of a two's complement integer representation of x by y binary digits. This function is defined only for non-negative integer values of y. Bits shifted into the least significant bits (LSBs) as a result of the left shift have a value equal to 0.

Assignment operators

The following arithmetic operators are defined as follows:

= Assignment operator

+ + Increment, i.e., x+ + is equivalent to x = x + 1; when used in an array index, evaluates to the value of the variable prior to the increment operation.

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

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

-= Decrement by amount specified, i.e., x — = 3 is equivalent to x = x - 3, and x -= (-3) is equivalent to x = x - (-3). Range notation

The following notation is used to specify a range of values: x = y..z x takes on integer values starting from y to z, inclusive, with x, y, and z being integer numbers and z being greater than y.

Mathematical functions

The following mathematical functions are defined: x >= 0 x< 0

Asin( x ) the trigonometric inverse sine function, operating on an argument x that is in the range of-1.0 to 1.0, inclusive, with an output value in the range of -p÷2 to p÷2, inclusive, in units of radians.

Atan( x ) the trigonometric inverse tangent function, operating on an argument x, with an output value in the range of ^~p÷2 to p÷2, inclusive, in units of radians.

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

Cliply( x ) = Clip3( 0, ( 1 « BitDepthy ) - 1, x )

Cliplc( x ) = Clip3( 0, ( 1 « BitDepthc ) - 1, x ) ; z<x ; z>y ; otherwise

Cos( x ) the trigonometric cosine function operating on an argument x in units of radians.

Floor( x ) the largest integer less than or equal to x. ; b — a >= d / 2

GetCurrMsb( ; a — b > d /2 : otherwise

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

Log2( x ) the base-2 logarithm of x.

Logl0( x ) the base- 10 logarithm of x.

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

Sign(

Sin( x ) the trigonometric sine function operating on an argument x in units of radians

Sqrt( x ) = Öx

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

Tan( x ) the trigonometric tangent function operating on an argument x in units of radians

Order of operation precedence

When an order of precedence in an expression is not indicated explicitly by use of parentheses, the following rules apply:

- Operations of a higher precedence are evaluated before any operation of a lower precedence.

- Operations of the same precedence are evaluated sequentially from left to right.

The table below specifies the precedence of operations from highest to lowest; a higher position in the table indicates a higher precedence. For those operators that are also used in the C programming language, the order of precedence used in this Specification is the same as used in the C programming language.

Table: Operation precedence from highest (at top of table) to lowest (at bottom of table)

Text description of logical operations

In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0 ) statement 0 else if( condition 1 ) statement 1 else /* informative remark on remaining condition */ statement n may be described in the following manner:

... as follows / ... the following applies:

- If condition 0, statement 0

- Otherwise, if condition 1, statement 1

- Otherwise (informative remark on remaining condition), statement n

Each "If ... Otherwise, if ... Otherwise, ..." statement in the text is introduced with "... as follows" or "... the following applies" immediately followed by "If ... ". The last condition of the "If... Otherwise, if... Otherwise, ..." may always be an "Otherwise, ...". Interleaved "If... Otherwise, if ... Otherwise, ..." statements can be identified by matching "... as follows" or "... the following applies" with the ending "Otherwise, ...".

In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0a && condition Ob ) statement 0 else if( condition la | | condition lb ) statement 1 else statement n may be described in the following manner:

... as follows / ... the following applies:

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

- condition 0a condition 0b

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

- Otherwise, statement n

In the text, a statement of logical operations as would be described mathematically in the following form: if( condition 0 ) statement 0 if( condition 1 ) statement 1 may be described in the following manner:

When condition 0, statement 0 When condition 1, statement 1

Embodiments, e.g. of the encoder 20 and the decoder 30, and functions described herein, e.g. with reference to the encoder 20 and the decoder 30, may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over communication media as one or more instructions or code and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which correspond to tangible media such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which are non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium. By way of example, and not limiting, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media. Disk and disc, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term “processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.

The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

Claims

1. A method for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non-vertical boundary between prediction partitions, the method being implemented by a decoding device or an encoding device and comprising: inverse transforming (1710) a subsampled residual block to determine a subsampled reconstructed residual block; filling (1720) samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the sub sampled reconstructed residual block, and obtaining (1730) a reconstructed block of the current block from a predicted block and the reconstructed residual block.

2. The method of claim 1, further comprising setting samples outside the boundary region of the reconstructed residual block to zero.

3. The method of claim 1 or 2, further comprising deriving at least one of a height or a width of the sub sampled residual block from at least one of a height or a width of the current block.

4. The method of claim 1 or 2, further comprising signaling at least one of a height or a width of the subsampled residual block in a bitstream of the video sequence.

5. The method of claim 3 or 4, wherein the at least one of a height or a width of the sub sampled residual block is set to L/2^m wherein L is the respective one of the at least one of a height or a width of the current block, and wherein m Î {1,2,3}.

6. The method of any one of the preceding claims, wherein the boundary region is defined based on a line that partitions the current block into two non-rectangular prediction partitions.

7. The method of claim 6, wherein a start side position and an end side position of the line are determined based on intersections of the line with boundaries of the reconstructed residual block, and wherein the boundary region is defined based on the start and end side positions of the line.

8. The method of claim 6 or 7, wherein the boundary region includes samples having a distance from the line smaller than or equal to a distance threshold.

9. The method of any one of claims 6 to 8, wherein the line connects a top-left corner of the reconstructed residual block and a bottom-right comer of the reconstructed residual block or a top-right corner of the reconstructed residual block and a botom-left corner of the reconstructed residual block.

10. The method of any one of claims 6 to 8, wherein the line is defined by an angle parameter and a distance parameter.

11. The method of claim 10, wherein the angle parameter is determined using a look-up table.

12. The method of claim 10 or 11, further comprising comparing the angle parameter with a range of angles and determining whether the height or the width of the subsampled residual block is reduced as compared to the height or the width, respectively, of the reconstructed residual block based on the comparison.

13. The method of any one of the claims 8 to 12, wherein, for the case that the width of the sub sampled residual block is reduced as compared to the width of the reconstructed residual block, the boundary region comprises a range of rows of the reconstructed residual block starting from a first row corresponding to the start side position up to a last row corresponding to the end side position, and wherein filling (1720) samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block comprises: defining a sampling position for each of the rows in the range of rows so that the sampling position is a monotonic function of a row position within the reconstructed residual block, and filling a respective set of samples of each of the rows in the range of rows with values of corresponding rows of the sub sampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective row is not greater than the distance threshold.

14. The method of any one of the claims 8 to 12, wherein, for the case that the height of the sub sampled residual block is reduced as compared to the height of the reconstructed residual block, the boundary region comprises a range of columns of the reconstructed residual block starting from a first column corresponding to the start side position up to a last column corresponding to the end side position, and wherein filling (1720) samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block comprises: defining a sampling position for each of the columns in the range of columns so that the sampling position is a monotonic function of a column position within the reconstructed residual block, and filling a respective set of samples of each of the columns in the range of columns with values of corresponding columns of the subsampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective column is not greater than the distance threshold.

15. The method of claim 13, wherein the distance threshold is set equal to half of the width of the reconstructed residual block.

16. The method of claim 14, wherein the distance threshold is set equal to half of the height of the reconstructed residual block.

17. The method of any one of the claims 1 to 16, wherein the predicted block is obtained using Triangular Partitioning Mode, TPM.

18. The method of any one of the claims 1 to 16, wherein the predicted block is obtained using Geometric Motion Partitioning, GMP.

19. The method of any one of the preceding claims, further comprising applying a smoothing filter to samples of the reconstructed residual block that are adjacent to the boundary region.

20. The method of claim 19, wherein a Finite Impulse Response, FIR, filter is applied to the samples adjacent to the boundary region.

21. An encoder (20) comprising processing circuitry for carrying out the method according to any one of claims 1 to 20.

22. A decoder (30) comprising processing circuitry for carrying out the method according to any one of claims 1 to 20.

23. A computer program product comprising instructions which, when the program is executed by a computer, cause the computer to carry out the method according to any one of claims 1 to 20

24. A decoder (30), comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, wherein the instructions, when executed by the one or more processors, configure the decoder to carry out the method according to any one of claims 1 to 20.

25. An encoder (20), comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, wherein the instructions, when executed by the one or more processors, configure the encoder to carry out the method according to any one of claims 1 to 20.

26. A decoder (30) or an encoder (20) for coding a video sequence using partitioning and prediction of a current block with a non-horizontal and non-vertical boundary between prediction partitions, comprising: an inverse transform processing unit (212, 312, 1810) configured to inverse transform a subsampled residual block to determine a subsampled reconstructed residual block; a filling unit (1820) configured to fill samples of a boundary region covering the boundary between the prediction partitions of a reconstructed residual block corresponding to the current block with corresponding values from the subsampled reconstructed residual block; and an obtaining unit (1840) configured to obtain a reconstructed block of the current block from a predicted block and the reconstructed residual block.

27. The decoder (30) or the encoder (20) of claim 26, wherein the filling unit (1820) is further configured to set samples outside the boundary region of the reconstructed residual block to zero.

28. The decoder (30) or the encoder (20) of claim 26 or 27, wherein the boundary region is defined based on a line that partitions the current block into two non-rectangular prediction partitions.

29. The decoder (30) or the encoder (20) of claim 28, wherein a start side position and an end side position of the line are determined based on intersections of the line with boundaries of the reconstructed residual block, and wherein the boundary region is defined based on the start and end side positions of the line.

30. The decoder (30) or the encoder (20) of claim 28 or 29, wherein the boundary region includes samples having a distance from the line smaller than or equal to a distance threshold.

31. The decoder (30) or the encoder (20) of any one of claims 28 to 30, wherein the line connects a top-left corner of the reconstructed residual block and a bottom-right corner of the reconstructed residual block or a top-right corner of the reconstructed residual block and a botom-left comer of the reconstructed residual block.

32. The decoder (30) or the encoder (20) of any one of claims 28 to 30, wherein the line is defined by an angle parameter and a distance parameter.

33. The decoder (30) or the encoder (20) of claim 32, wherein the angle parameter is determined using a look-up table.

34. The decoder (30) or the encoder (20) of claim 32 or 33, wherein the filling unit (1820) is further configured to compare the angle parameter with a range of angles and to determine whether the height or the width of the subsampled residual block is reduced as compared to the height or the width, respectively, of the reconstructed residual block based on the comparison.

35. The decoder (30) or the encoder (20) of any one of the claims 30 to 34, wherein, for the case that the width of the sub sampled residual block is reduced as compared to the width of the reconstructed residual block, the boundary region comprises a range of rows of the reconstructed residual block starting from a first row corresponding to the start side position up to a last row corresponding to the end side position, and wherein the filling unit (1820) is configured to fill samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block by: defining a sampling position for each of the rows in the range of rows so that the sampling position is a monotonic function of a row position within the reconstructed residual block, and filling a respective set of samples of each of the rows in the range of rows with values of corresponding rows of the sub sampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective row is not greater than the distance threshold.

36. The decoder (30) or the encoder (20) of any one of the claims 30 to 34, wherein, for the case that the height of the sub sampled residual block is reduced as compared to the height of the reconstructed residual block, the boundary region comprises a range of columns of the reconstructed residual block starting from a first column corresponding to the start side position up to a last column corresponding to the end side position, and wherein the filling unit (1820) is configured to fill samples of the boundary region of the reconstructed residual block with corresponding values from the subsampled reconstructed residual block by: defining a sampling position for each of the columns in the range of columns so that the sampling position is a monotonic function of a column position within the reconstructed residual block, and filling a respective set of samples of each of the columns in the range of columns with values of corresponding columns of the subsampled reconstructed residual block; wherein the respective set of samples comprises samples for which a distance to the sampling position of the respective column is not greater than the distance threshold.

37. The decoder (30) or the encoder (20) of claim 35, wherein the distance threshold is set equal to half of the width of the reconstructed residual block.

38. The decoder (30) or the encoder (20) of claim 36, wherein the distance threshold is set equal to half of the height of the reconstructed residual block.

39. The decoder (30) or the encoder (20) of any one of the claims 26 to 38, further comprising an inter prediction unit (244, 344, 1860) configured to determine the predicted block using Triangular Partitioning Mode, TPM.

40. The decoder (30) or the encoder (20) of any one of the claims 26 to 38, further comprising an inter prediction unit (244, 344, 1860) configured to determine the predicted block using Geometric Motion Partitioning, GMP.

41. The decoder (30) or the encoder (20) of any one of the claims 26 to 40, further comprising a filter unit (1830) configured to apply a smoothing filter to samples of the reconstructed residual block that are adjacent to the boundary region.

42. The decoder (30) or the encoder (20) of claim 41, wherein the filter unit (1830) is configured to apply a Finite Impulse Response, FIR, filter to the samples adjacent to the boundary region.

43. The decoder (30) or the encoder (20) of any one of the claims 26 to 42, wherein the filling unit (1820) is further configured to derive at least one of a height or a width of the sub sampled residual block from at least one of a height or a width of the current block.

44. The decoder (30) of any one of the claims 26 to 42, further comprising an entropy decoding unit (304, 1850) configured to parse at least one of a height or a width of the sub sampled residual block from a bitstream of the video sequence.

45. The encoder (20) of any one of the claims 26 to 42, further comprising an entropy encoding unit (270) configured to encode at least one of a height or a width of the sub sampled residual block in a bitstream of the video sequence.

46. The decoder (30) of claim 43 or 44, wherein the at least one of a height or a width of the sub sampled residual block is set to L/2^m wherein L is the respective one of the at least one of a height or a width of the current block, and wherein m Î {1,2,3}.

47. The encoder (20) of claim 43 or 45, wherein the at least one of a height or a width of the sub sampled residual block is set to L/2^m wherein L is the respective one of the at least one of a height or a width of the current block, and wherein m Î {1,2,3}.