Encoder, decoder, and corresponding method of complexity reduction in intra prediction for planar modes

Abstract

An implemented coding method is provided, which includes the following steps: calculating a value of a vertical component of an intra-predicted sample based on a height and width of a current block obtained without applying a clipping operation and a height and width of a predicted block, calculating a value of a horizontal component of the intra-predicted sample based on the height and width of the block, and generating an intra-predicted sample based on the value of the vertical component and the value of the horizontal component.

Description

[Technical Field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This patent application claims priority to PCT Application No. PCT / EP2019 / 075519, filed September 23, 2019. The disclosures of the above-referenced patent applications are incorporated herein by reference in their entireties.

[0002] FIELD Embodiments of the present disclosure relate generally to the field of picture processing, and more particularly to filter modification in a general intra-prediction process for planar modes. [Background technology]

[0003] Video coding (video encoding and video decoding) is used in a wide range of digital video applications, such as broadcast digital TV, video transmission over the Internet and mobile networks, real-time interactive applications such as video chat, video conferencing, DVD and Blu-ray® discs, video content collection and editing systems, and camcorders in security applications.

[0004] The amount of video data required to render even a relatively short video can be considerable, which can pose difficulties when the data is to be streamed or otherwise transmitted across communication networks with limited bandwidth capacity. Therefore, video data is generally compressed before being transmitted across modern telecommunications networks. Because memory resources may be limited, the size of the video can also be an issue when the video is stored in a storage device. Video compression devices often use software and / or hardware at the source to code the video data before transmission or storage, thereby reducing the amount of data needed to represent a digital video image. The compressed data is then received at the destination by a video decompression device, which decodes the video data. With limited network resources and an ever-increasing demand for higher video quality, improved compression and decompression techniques that improve compression ratios with little to no sacrifice in picture quality are desirable.

[0005] Prediction methods can play an important role in image and video coding due to their ability to reduce signal redundancy based on previously encoded samples. Main prediction techniques include intra-prediction for efficient spatial redundancy coding and motion-compensated prediction for inter-frame temporal redundancy coding. In particular, planar mode is a frequently used intra-prediction mode. However, for some blocks, planar mode intra-prediction is unnecessarily complex. Summary of the Invention [Means for solving the problem]

[0006] According to some embodiments of the present application, there are provided apparatuses and methods for coding (eg, encoding or decoding, respectively) according to the independent claims.

[0007] These and other objects are achieved by the subject matter of the independent claims. Further implementation forms are evident from the dependent claims, the description and the figures.

[0008] According to a first aspect, the invention relates to a method for decoding or encoding, the method being performed by a decoding or encoding device, comprising the step of calculating values ​​of vertical components of intra-predicted samples contained in a block of a picture, the vertical component values ​​predV[x][y] being generated using a linear filter using samples from above and below reference sample rows, the below sample row being padded using samples located at (-1, nTbH) with respect to the top-left sample of the current block. For example, predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), where predV[ x ][ y ] represents the value of the vertical component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ x ][ -1 ] represents the neighboring sample where x = 0..nTbW.

[0009] The method further includes a step of calculating values ​​of the horizontal components of the intra-predicted samples, where the horizontal component values ​​predH[x][y] are generated using a linear filter using samples from left and right reference sample columns, and the right sample column is padded using a sample located at (nTbW, -1) relative to the top-left sample of the current block.

[0010] For example, predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ), where predH[ x ][ y ] represents the value of the horizontal component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ -1 ][ y ] represents the neighboring sample where y = -1..nTbH.

[0011] The method further includes generating intra-prediction samples predSamples[x][y] based on the values ​​of the vertical and horizontal components. The intra-prediction samples are also referred to as predicted samples.

[0012] When the block height is equal to 1, the vertical component value predV[ x ][ y ] is simplified as predV[ x ][ y ] = (( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), and the horizontal component value predH[ x ][ y ] is simplified as predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ).

[0013] According to a second aspect, the invention relates to a decoding or encoding method, the method being performed by a decoding or encoding device, and including the steps of: obtaining a height and a width of a current prediction block without applying a clipping operation; calculating values ​​of vertical components of intra-prediction samples based on the height and width of the prediction block; calculating values ​​of horizontal components of the intra-prediction samples based on the height and width of the prediction block; and generating intra-prediction samples based on the values ​​of the vertical and horizontal components.

[0014] The method according to the first aspect of the invention can be performed by an apparatus according to the third aspect of the invention. Further features and implementation forms of the apparatus according to the third aspect of the invention correspond to the features and implementation forms of the method according to the first aspect of the invention.

[0015] The method according to the second aspect of the invention can be performed by an apparatus according to the fourth aspect of the invention. Further features and implementation forms of the apparatus according to the fourth aspect of the invention correspond to the features and implementation forms of the method according to the second aspect of the invention.

[0016] According to a fifth aspect, the invention relates to an apparatus for decoding or encoding a video stream, comprising a processor and a memory, the memory storing instructions for causing the processor to perform a method according to the first or second aspect.

[0017] According to a sixth aspect, there is proposed a computer-readable storage medium having stored thereon instructions that, when executed, cause one or more processors to configure for coding video data, the instructions causing the one or more processors to perform a method according to the first or second aspect or any possible embodiment of the first or second aspect.

[0018] According to a seventh aspect, the invention relates to a computer program comprising a program code for performing the method according to the first or second aspect or any possible embodiment of the first or second aspect, when the computer program is executed on a computer.

[0019] According to an eighth aspect, the invention relates to a device for intra-planar prediction in a picture, comprising a calculation unit configured to calculate values ​​of vertical components of intra-predicted samples comprised in a block of the picture, wherein the values ​​of the vertical components predV[x][y] are generated using a linear filter using samples from above and below reference sample rows, the below sample row being padded using samples located at (-1, nTbH) with respect to the top-left sample of the current block. For example, predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), where predV[ x ][ y ] represents the value of the vertical component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ x ][ -1 ] represents the neighboring sample where x = 0..nTbW.

[0020] A calculation unit further configured to calculate values ​​of horizontal components of intra-predicted samples, wherein the horizontal component values ​​predH[x][y] are generated using a linear filter using samples from left and right reference sample columns, and the right sample column is padded using a sample located at (nTbW, -1) relative to the top-left sample of the current block.

[0021] For example, predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ), where predH[ x ][ y ] represents the value of the horizontal component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ -1 ][ y ] represents the neighboring sample where y = -1..nTbH.

[0022] The device further includes a prediction unit (903) configured to generate intra-predicted samples based on the values ​​of the vertical component and the values ​​of the horizontal component.

[0023] The embodiments of the present disclosure do not perform the clipping operations nW = Max(nTbW, 2) and nH = Max(nTbH, 2) before calculating the vertical and horizontal components. Therefore, the prediction for applying the planar mode is simplified. Correspondingly, the encoding or decoding efficiency is increased.

[0024] The details of one or more embodiments are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will become apparent from the description, drawings, and claims.

[0025] In the following, embodiments of the invention will be explained in more detail with reference to the accompanying figures and drawings. [Brief explanation of the drawings]

[0026] [Figure 1A] 1 is a block diagram illustrating an example of a video coding system configured to implement embodiments of the invention. [Figure 1B] FIG. 2 is a block diagram illustrating another example of a video coding system configured to implement embodiments of the invention. [Figure 2] FIG. 1 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the invention. [Figure 3] FIG. 2 is a block diagram illustrating an example structure of a video decoder configured to implement an embodiment of the invention. [Figure 4] FIG. 1 is a block diagram illustrating an example of an encoding or decoding device. [Figure 5] FIG. 10 is a block diagram illustrating another example of an encoding or decoding device. [Figure 6] FIG. 1 is a schematic diagram illustrating intra prediction for planar mode in VVC. [Figure 7] FIG. 10 is a schematic diagram illustrating intra prediction for planar mode for an N×1 block. [Figure 8] 1 depicts a flowchart illustrating a method for intra-plane prediction of a current block in video coding. [Figure 9] 1 illustrates an example configuration of a video coding device. [Figure 10] FIG. 31 is a block diagram illustrating an example structure of a content supply system 3100 that implements a content distribution service. [Figure 11] FIG. 2 is a block diagram illustrating the structure of an example of a terminal device. DETAILED DESCRIPTION OF THE INVENTION

[0027] In the following, the same reference signs refer to identical or at least functionally equivalent features, unless explicitly specified otherwise.

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

[0029] For example, it is understood that disclosure regarding a described method may also apply to a corresponding device or system configured to perform that method, and vice versa. For example, if one or more particular method steps are described, a corresponding device may include one or more units, e.g., functional units, for performing the described one or more method steps, even if such one or more units are not explicitly described or illustrated in a figure. On the other hand, for example, if a particular apparatus is described based on one or more units, e.g., functional units, a corresponding method may include one step for performing the function of one or more units (e.g., one step for performing the function of one or more units, or multiple steps that each perform the function of one or more units), even if such one or more steps are not explicitly described or illustrated in a figure. Furthermore, it is understood that features of various exemplary embodiments and / or aspects described herein may be combined with each other, unless specifically noted otherwise.

[0030] Video coding typically refers to the processing of a sequence of pictures to form a video or a video sequence. Instead of the term "picture," the terms "frame" or "image" may be used synonymously in the field of video coding. Video coding (or, in general, coding) comprises two parts: video encoding and video decoding. Video encoding is performed at the source side and typically comprises processing the original video picture (e.g., by compression) to reduce the amount of data required to represent the video picture (for more efficient storage and / or transmission). Video decoding is performed at the destination side and typically comprises the reverse process compared to the encoder to reconstruct the video picture. Embodiments referring to "coding" a video picture (or, in general, a picture) shall be understood to relate to "encoding" or "decoding" the video picture or the respective video sequence. The combination of the encoding and decoding parts is also called CODEC (Coding and Decoding).

[0031] In the case of lossless video coding, the original video picture can be reconstructed, i.e., the reconstructed video picture has the same quality as the original video picture (assuming there is no transmission loss or other data loss during storage or transmission). In the case of lossy video coding, further compression is performed, e.g., by quantization, to reduce the amount of data representing the video picture, and the video picture cannot be perfectly reconstructed at the decoder, i.e., the quality of the reconstructed video picture is lower or worse than the quality of the original video picture.

[0032] Some video coding standards belong to the group of "lossy hybrid video codecs" (i.e., combine spatial and temporal prediction in the sample domain with 2D transform coding to apply quantization in the transform domain). Each picture of a video sequence is typically partitioned into a set of non-overlapping blocks, and coding is typically performed at the block level. In other words, at an encoder, video is typically processed, i.e., encoded, at the block (video block) level, for example, by generating a predictive block using spatial (intra-picture) prediction and / or temporal (inter-picture) prediction, subtracting the predictive block from a current block (the block currently being processed / to be processed) to obtain a residual block, transforming the residual block, and quantizing the residual block in the transform domain to reduce the amount of data to be transmitted (compression); while at a decoder, an inverse process compared to the encoder is applied to the encoded, or compressed, block to reconstruct the current block for representation. Additionally, the encoder duplicates the decoder processing loop so that both generate the same predictions (eg, intra and inter predictions) and / or reconstructions for processing, i.e., coding, subsequent blocks.

[0033] In the following, embodiments of a video coding system 10, a video encoder 20, and a video decoder 30 will be described based on FIGS.

[0034] 1A is a schematic block diagram illustrating an example coding system 10, e.g., video coding system 10 (or coding system 10 for short), that may utilize the techniques of the present application. A video encoder 20 (or encoder 20 for short) and a video decoder 30 (or decoder 30 for short) of video coding system 10 represent examples of devices that may be configured to perform techniques according to various examples described in the present application.

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

[0036] The source device 12 comprises an encoder 20, and may additionally, i.e. optionally, comprise a picture source 16, a preprocessor (or preprocessing unit) 18, for example a picture preprocessor 18, and a communication interface or unit 22.

[0037] Picture source 16 may comprise or be any kind of picture capture device, e.g., a camera for capturing real-world pictures, and / or any kind of picture generation device, e.g., a computer graphics processor for generating computer-animated pictures, or any kind of other device for obtaining and / or providing real-world pictures, computer-generated pictures (e.g., screen content, virtual reality (VR) pictures), and / or any combination thereof (e.g., augmented reality (AR) pictures). Picture source may be any kind of memory or storage device that stores any of the above-mentioned pictures.

[0038] To distinguish from the preprocessor 18 and the processing performed by the preprocessing unit 18, the picture or picture data 17 may also be referred to as an unprocessed picture or unprocessed picture data 17.

[0039] The pre-processor 18 is configured to receive (raw) picture data 17 and perform pre-processing on the picture data 17 to obtain a pre-processed picture 19 or pre-processed picture data 19. The pre-processing performed by the pre-processor 18 may comprise, for example, cropping, color format conversion (e.g., from RGB to YCbCr), color correction, or noise removal. It can be understood that the pre-processing unit 18 may be an optional component.

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

[0041] The communications interface 22 of the source device 12 may be configured to receive the encoded picture data 21 and transmit the encoded picture data 21 (or any further processed version thereof) over the communications channel 13 to another device, such as the destination device 14 or any other device, for storage or direct reconstruction.

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

[0043] The communications interface 28 of the destination device 14 is configured to receive the encoded picture data 21 (or any further processed version thereof), for example, directly from the source device 12 or from any other source, for example, a storage device, for example, an encoded picture data storage device, and to provide the encoded picture data 21 to the decoder 30.

[0044] The communication interface 22 and the communication interface 28 may be configured to transmit or receive the encoded picture data 21 or the 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 type of network, e.g., a wired or wireless network or any combination thereof, or any type of private and public network, or any type of combination thereof.

[0045] The communications interface 22 may be configured, for example, to package the encoded picture data 21 in a suitable format, e.g., packets, and / or to process the encoded picture data using any type of transmission encoding or processing for transmission over a communications link or network.

[0046] Communications interface 28, which forms the counterpart to communications interface 22, may be configured, for example, to receive the transmitted data and process the transmitted data using any type of corresponding transmission decoding or processing and / or depackaging to obtain encoded picture data 21.

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

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

[0049] Post-processor 32 of destination device 14 is configured to post-process decoded picture data 31 (also called reconstructed picture data), e.g., decoded picture 31, to obtain post-processed picture data 33, e.g., post-processed picture 33. The post-processing performed by post-processing unit 32 may comprise, e.g., color format conversion (e.g., from YCbCr to RGB), color correction, cropping, or resampling, or any other processing to prepare decoded picture data 31 for, e.g., display by display device 34.

[0050] A display device 34 of destination device 14 is configured to receive the post-processed picture data 33 for displaying the picture, for example, to a user or viewer. Display device 34 may be or comprise any type of display for presenting the reconstructed picture, for example, an integrated or external display or monitor. The display may comprise, for example, a liquid crystal display (LCD), an organic light emitting diode (OLED) display, a plasma display, a projector, a micro-LED display, a liquid crystal on silicon (LCoS), a digital light processor (DLP), or any other type of display.

[0051] 1A depicts source device 12 and destination device 14 as separate devices, device embodiments may also include both source device 12 or corresponding functionality and destination device 14 or corresponding functionality. In such embodiments, source device 12 or corresponding functionality and destination device 14 or corresponding functionality may be realized using the same hardware and / or software, or by separate hardware and / or software, or any combination thereof.

[0052] As will be apparent to those skilled in the art based on the description, the functions of different units or the presence and (exact) division of functions within source device 12 and / or destination device 14 as depicted in FIG. 1A may vary depending on the actual device and application.

[0053] Encoder 20 (e.g., video encoder 20) or decoder 30 (e.g., video decoder 30), or both encoder 20 and decoder 30, may be implemented via processing circuitry as depicted in FIG. 1B , such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, hardware, dedicated video coding, or any combination thereof. Encoder 20 may be implemented via processing circuitry 46 to implement various modules as discussed with respect to encoder 20 of FIG. 2 and / or any other encoder system or subsystem described herein. Decoder 30 may be implemented via processing circuitry 46 to implement 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 various operations as discussed below. 5, if the techniques are implemented partially in software, a device may store instructions for the software on a suitable non-transitory computer-readable storage medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Either video encoder 20 and video decoder 30 may be integrated within a single device as part of a combined encoder / decoder (CODEC), for example, as shown in FIG. 1B.

[0054] Source device 12 and destination device 14 may comprise any of a wide range of devices, including any type of handheld or fixed device, such as a notebook or laptop computer, a mobile phone, a smartphone, a tablet or tablet computer, a camera, a desktop computer, a set-top box, a television, a display device, a digital media player, a video game console, a video streaming device (such as a content service server or content distribution server), a broadcast receiver device, a broadcast transmitter device, or the like, and may use no operating system or any type of operating system. In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices.

[0055] 1A is merely an example, and the techniques of the present application may be applied to a video coding setting (e.g., video encoding or video decoding) without necessarily including any data communication between the encoding and decoding devices. In other examples, data may be retrieved from local memory, streamed over a network, or the like. A video encoding device may encode data and store it in memory, and / or a video decoding device may retrieve data from memory and decode it. In some examples, encoding and decoding are performed by devices that do not communicate with each other, but simply encode data to memory and / or retrieve data from memory and decode it.

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

[0057] Encoders and encoding methods 2 illustrates a schematic block diagram of an exemplary video encoder 20 configured to implement the techniques of the present application. In the example of FIG. 2, the video encoder 20 includes 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, 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). The video encoder 20 illustrated in FIG. 2 may also be referred to as a hybrid video encoder or a video encoder using a hybrid video codec.

[0058] 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, while the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244, and the intra prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20, which corresponds to the signal path of a 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 as forming a “built-in decoder” of the video encoder 20.

[0059] Pictures and picture divisions (pictures and blocks) Encoder 20 may be configured to receive picture 17 (or picture data 17), e.g., a picture of a sequence of pictures forming a video or a video sequence, e.g., via input 201. The received picture or picture data may also be preprocessed picture 19 (or preprocessed picture data 19). For purposes of brevity, the following description refers to picture 17. Picture 17 may also be called a current picture or a picture to be coded (particularly in video coding, to distinguish the current picture from other pictures of the same video sequence, i.e., a video sequence that also comprises the current picture, e.g., previously encoded and / or decoded pictures).

[0060] A (digital) picture is, or can be considered as, a two-dimensional array or matrix of samples with intensity values. The samples in the array may also be called pixels (a short form of picture element) or pels. The number of samples in the horizontal and vertical directions (or axes) of the array or picture defines the size and / or resolution of the picture. For color representation, three color components are typically employed, i.e., a picture may be represented as or contain three sample arrays. In an RBG format or color space, a picture comprises corresponding red, green, and blue sample arrays. However, in video coding, each pixel is typically represented in a luminance and chrominance format or color space, such as YCbCr, which comprises a luminance component denoted by Y (sometimes L is also used instead) and two chrominance components denoted by Cb and Cr. The luminance (or luma for short) component Y represents brightness or gray-level intensity (e.g., as in a grayscale picture), while the two chrominance (or chroma for short) components Cb and Cr represent chromaticity or color information components. Thus, 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). A picture in RGB format may be converted or transformed to YCbCr format, or vice versa, a process also known as color conversion or transformation. If the picture is monochrome, the picture may comprise only a luminance sample array. Thus, 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 color formats.

[0061] Embodiments of video encoder 20 may comprise a picture partition unit (not depicted in FIG. 2 ) configured to partition picture 17 into multiple (typically non-overlapping) picture blocks 203. These blocks may also be called root blocks, macroblocks (H.264 / AVC), or coding tree blocks (CTBs) or coding tree units (CTUs) (H.265 / HEVC and VVC). The picture partition unit may be configured to use the same block size for all pictures of a video sequence and a corresponding grid defining the block sizes, or to vary the block size among pictures or subsets or groups of pictures, and to partition each picture into corresponding blocks.

[0062] In further embodiments, the video encoder may be configured to directly receive blocks 203 of picture 17, e.g., one, some, or all of the blocks that form picture 17. Picture blocks 203 may also be referred to as current picture blocks or picture blocks to be coded.

[0063] Like picture 17, picture block 203 again can be considered as a two-dimensional array or matrix of samples having intensity values ​​(sample values), but with smaller dimensions than picture 17. In other words, block 203 may comprise, for example, one sample array (e.g., a luma array in the case of a monochrome picture 17, or a luma or chroma array in the case of a color picture), or three sample arrays (e.g., a luma and two chroma arrays in the case of a color picture 17), or any other number and / or type of arrays depending on the applied color format. The number of samples in the horizontal and vertical directions (or axes) of block 203 defines the size of block 203. Thus, a block may be, for example, an M×N (M columns by N rows) array of samples, or an M×N array of transform coefficients.

[0064] An embodiment of video encoder 20 such as that depicted in FIG. 2 may be configured to encode picture 17 block by block, eg, encoding and prediction is performed for each block 203.

[0065] An embodiment of video encoder 20 such as that depicted in FIG. 2 may be further configured to partition and / or encode pictures by using slices (also referred to as video slices), where a picture may be partitioned into or encoded using one or more (typically non-overlapping) slices, each of which may comprise one or more blocks (e.g., CTUs).

[0066] An embodiment of video encoder 20 as depicted in FIG. 2 may further be configured to partition and / or encode a picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where a picture may be partitioned into or encoded using one or more (typically non-overlapping) tile groups, each of which may comprise, for example, one or more blocks (e.g., CTUs) or one or more tiles, and each tile may be, for example, rectangular in shape and may comprise one or more blocks (e.g., CTUs), e.g., full or fragmentary blocks.

[0067] Residual calculation The residual calculation unit 204 may be configured to calculate the residual block 205 (also referred to as the residual 205) based on the picture block 203 and the prediction block 265 (further details about the prediction block 265 will be provided later), for example, by subtracting the sample values ​​of the prediction block 265 from the sample values ​​of the picture block 203 on a sample-by-sample (pixel-by-pixel) basis to obtain the residual block 205 in the sample domain.

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

[0069] The transform processing unit 206 may be configured to apply an integer approximation of a DCT / DST, such as the transform specified for H.265 / HEVC. Compared to an orthogonal DCT transform, such an integer approximation is typically scaled by a factor. To maintain the norm of the residual blocks processed by the forward and inverse transforms, an additional scaling factor is applied as part of the transform process. The scaling factor is typically chosen based on certain constraints, such as the scaling factor being a power of two due to shift operations, the bit depth of the transform coefficients, a trade-off between accuracy and implementation cost, etc. For example, a particular scaling factor may be specified for, e.g., the inverse transform by the inverse transform processing unit 212 (and the corresponding inverse transform by, e.g., the inverse transform processing unit 312 in the video decoder 30), and a corresponding scaling factor for the forward transform by, e.g., the transform processing unit 206 in the encoder 20 may be specified accordingly.

[0070] An embodiment of video encoder 20 (respectively, transform processing unit 206) may be configured to output transform parameters, e.g., one or more types of transform, encoded or compressed, e.g., directly or via entropy encoding unit 270, so that, for example, video decoder 30 may receive and use the transform parameters for decoding.

[0071] quantization The quantization unit 208 may be configured to quantize the transform coefficients 207, for example, by applying scalar quantization or vector quantization, to obtain quantized coefficients 209. The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209.

[0072] 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 truncated to an m-bit transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a Quantization Parameter (QP). For example, for scalar quantization, different scaling may be applied to achieve finer or coarser quantization. A smaller quantization step size corresponds to finer quantization, while a larger quantization step size corresponds to coarser quantization. The applicable quantization step size may be indicated by the quantization parameter (QP). The quantization parameter may, for example, be an index into a predefined set of applicable quantization step sizes. For example, a small quantization parameter may correspond to fine quantization (small quantization step size) and a large quantization parameter may correspond to coarse quantization (large quantization step size), or vice versa. Quantization may involve division by a quantization step size, and corresponding and / or inverse dequantization, e.g., by the inverse quantization unit 210, may involve multiplication by the quantization step size. Some standards, e.g., HEVC, embodiments may be configured to determine the quantization step size using a quantization parameter. Generally, the quantization step size may be calculated based on the quantization parameter using a fixed-point approximation of a formula involving division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which may be modified due to the scaling used in the fixed-point approximation of the formula for the quantization step size and quantization parameter. In one example implementation, the scaling of the inverse transform and dequantization may be combined. Alternatively, customized quantization tables may be used and signaled, e.g., in the bitstream, from the encoder to the decoder. Quantization is a lossy operation, and the loss increases with increasing quantization step size.

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

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

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

[0076] Reconstruction The reconstruction unit 214 (e.g., an adder or summator 214) is configured to add the transform block 213 (i.e., the reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in the sample domain, for example, by adding the sample values ​​of the reconstructed residual block 213 and the sample values ​​of the prediction block 265, sample by sample.

[0077] Filtering The loop filter unit 220 (or “loop filter” 220 for short) is configured to filter the reconstructed block 215 to obtain a filtered block 221, or generally, to filter the reconstructed samples to obtain filtered samples. The loop filter unit is configured, for example, to smooth pixel transitions or otherwise improve video quality. The loop filter unit 220 may comprise one or more loop filters, such as a deblocking 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 filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is depicted 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.

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

[0079] Decoded Picture Buffer Decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or reference picture data in general, for encoding video data by video encoder 20. 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. Decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may further be configured to store other previously filtered blocks, e.g., previously reconstructed, filtered blocks 221, e.g., previously reconstructed pictures, of the same current picture or of a different picture, e.g., may provide a previously reconstructed, i.e., decoded, complete picture (and corresponding reference blocks and samples) and / or a partially reconstructed current picture (and corresponding reference blocks and samples), e.g., for inter-prediction. If the reconstructed blocks 215 are not filtered by the loop filter unit 220 or are any other further processed versions of the reconstructed blocks or samples, 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.

[0080] Mode Selection (Segmentation and Prediction) The mode selection unit 260 includes a partitioning unit 262, an inter prediction unit 244, and an intra prediction unit 254, and is configured to receive or obtain original picture data, e.g., original block 203 (current block 203 of current picture 17), and reconstructed picture data, e.g., filtered and / or unfiltered reconstructed samples or blocks, of the same (current) picture and / or from one or more previously decoded pictures, e.g., from the decoded picture buffer 230 or other buffers (e.g., line buffers, 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.

[0081] The mode selection unit 260 may be configured to determine or select a partition and a prediction mode (e.g., intra or inter prediction mode) for the current block prediction mode (which does not include partitions) and generate a corresponding prediction block 265 that is used for calculating the residual block 205 and for reconstructing the reconstructed block 215.

[0082] Embodiments of the mode selection unit 260 may be configured to select a partition and prediction mode (e.g., from those supported by or available to the mode selection unit 260) that provides the best match, or in other words, the smallest residual (smallest residual means better compression for transmission or storage), or the smallest signaling overhead (smallest signaling overhead means better compression for transmission or storage), or that considers or balances both. The mode selection unit 260 may be configured to determine the partition and prediction mode based on Rate Distortion Optimization (RDO), i.e., select a prediction mode that provides the smallest rate distortion. Terms such as “best,” “minimum,” “optimal,” etc. in this context do not necessarily refer to an overall “best,” “minimum,” “optimal,” etc., but may refer to the satisfaction of a termination or selection criterion, such as a value above or below a threshold or other constraint, potentially leading to a “suboptimal selection,” but reducing complexity and processing time.

[0083] 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), for example using quad-tree partitioning (QT), binary partitioning (BT), or triple-tree partitioning (TT), or any combination thereof, iteratively, and to perform prediction for each of the block partitions or sub-blocks, for example, wherein the mode selection comprises selecting a tree structure of the partitioned block 203, and a prediction mode is applied to each of the block partitions or sub-blocks.

[0084] Below, the partitioning (eg, by partitioning unit 260) and prediction processes (by inter-prediction unit 244 and intra-prediction unit 254) performed by example video encoder 20 will be described in more detail.

[0085] classification The partitioning unit 262 may partition (or divide) the current block 203 into smaller partitions, e.g., smaller blocks of square or rectangular size. These smaller blocks (which may also be called sub-blocks) may be further partitioned into even smaller partitions. This is also called tree partitioning or hierarchical tree partitioning; for example, a root block at root tree level 0 (hierarchical level 0, depth 0) may be recursively partitioned, e.g., into two or more blocks at the next lower tree level, e.g., nodes at tree level 1 (hierarchical level 1, depth 1), which may again be partitioned into two or more blocks at the next lower level, e.g., tree level 2 (hierarchical level 2, depth 2), etc., until, e.g., a termination criterion is met, e.g., the maximum tree depth or minimum block size is reached, and partitioning is terminated. Blocks that are not further partitioned are also called leaf blocks or leaf nodes of the tree. A tree that uses a partition into two partitions is called a Binary-Tree (BT), a tree that uses a partition into three partitions is called a Ternary-Tree (TT), and a tree that uses a partition into four partitions is called a Quad-Tree (QT).

[0086] As previously mentioned, the term "block" as used herein may refer to a portion of a picture, particularly a square or rectangular portion. For example, with reference to HEVC and VVC, a block may be or correspond to a coding tree unit (CTU), a coding unit (CU), a prediction unit (PU), and a transform unit (TU), and / or a corresponding block, such as a coding tree block (CTB), a coding block (CB), a transform block (TB), or a prediction block (PB).

[0087] For example, a coding tree unit (CTU) may be or comprise a CTB of luma samples for a picture having three sample arrays, two corresponding CTBs of chroma samples, or a CTB of samples for a monochrome picture or a picture coded using three separate color planes, and a syntax structure used to code the samples. Correspondingly, a coding tree block (CTB) may be an N×N block of samples for some values ​​of N such that the division of the components into CTBs is partitioned. A coding unit (CU) may be or comprise a coding block of luma samples for a picture having three sample arrays, two corresponding coding blocks of chroma samples, or a coding block of samples for a monochrome picture or a picture coded using three separate color planes, and a syntax structure used to code the samples. Correspondingly, a coding block (CB) may be an M×N block of samples for some values ​​of M and N such that the division of the CTB into coding blocks is partitioned.

[0088] For example, in an HEVC embodiment, a coding tree unit (CTU) may be divided into CUs by using a quadtree structure denoted as a coding tree. The decision of whether a picture area should be coded using (temporal) inter-picture prediction or (spatial) intra-picture prediction is made at the CU level. Each CU may be further divided into one, two, or four PUs according to a PU partition type. Within one PU, the same prediction process is applied, and related information is transmitted to the decoder for each PU. After obtaining residual blocks by applying a prediction process based on the PU partition type, the CU may be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU.

[0089] For example, in an embodiment according to the latest video coding standard currently under development, called Versatile Video Coding (VVC), a combined quad-tree and binary tree (QTBT) partitioning is used, for example, to partition coding blocks. 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 node is further partitioned by a binary tree or ternary tree (or triple tree) structure. The partitioning tree leaf node is called a coding unit (CU), and its segmentation is used for prediction and transform processing without further partitioning. This means that CUs, PUs, and TUs have the same block size in the QTBT coding block structure. In parallel, multiple partitions, for example, triple tree partitioning, can be used with the QTBT block structure.

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

[0091] As described above, video encoder 20 is configured to determine or select a best or optimal prediction mode from a (e.g., predetermined) set of prediction modes, which may comprise, for example, intra-prediction modes and / or inter-prediction modes.

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

[0093] The intra prediction unit 254 is configured to use reconstructed samples of neighboring blocks of the same current picture to generate an intra prediction block 265 according to an intra prediction mode of the set of intra prediction modes.

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

[0095] Inter Prediction The set of inter prediction modes (or possible inter prediction modes) is determined by the available reference pictures (i.e., e.g., D PB230), and other inter prediction parameters, such as whether the entire reference picture is used to search for the best matching reference block or only a portion of the reference picture, e.g., a search window area around the area of ​​the current block, is used, and / or whether pixel interpolation, e.g., half / semi-pel and / or quarter-pel interpolation, is applied.

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

[0097] 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 a picture block 203 (current picture block 203 of current picture 17) and a decoded picture 231, or at least one or more previously reconstructed blocks, e.g., reconstructed blocks of one or more other / different previously decoded pictures 231, for motion estimation. For example, a video sequence may comprise the current picture and the previously decoded picture 231, or in other words, the current picture and the previously decoded picture 231 may be part of or form a sequence of pictures that form a video sequence.

[0098] The encoder 20 may be configured to, for example, select a reference block from multiple reference blocks of the same or different pictures among multiple other pictures, and provide the 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 to the motion estimation unit as inter-prediction parameters. This offset is also called a motion vector (MV).

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

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

[0101] 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, binarization, context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding, or another entropy encoding methodology or technique), or bypass (without compression), on the quantized coefficients 209, the inter-prediction parameters, the intra-prediction parameters, the loop filter parameters, and / or other syntax elements to obtain encoded picture data 21, which can be output via output 272, for example, in the form of an encoded bitstream 21, so that, for example, video decoder 30 may receive and use the parameters for decoding. The encoded bitstream 21 may be transmitted to the video decoder 30 or stored in memory for later transmission or retrieval by the video decoder 30 .

[0102] 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 for a block or frame without the transform processing unit 206. In another implementation, the encoder 20 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.

[0103] Decoder and decoding method 3 illustrates an example of a video decoder 30 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), for example, encoded by encoder 20, to obtain a decoded picture 331. The encoded picture data or bitstream comprises information for decoding the encoded picture data, for example, data representing picture blocks of an encoded video slice (and / or tile group or tile), and associated syntax elements.

[0104] In the example of FIG. 3, the decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g., summer 314), a loop filter 320, and a decoded picture buffer (D PB ) 330, a mode application unit 360, an inter prediction unit 344, and an intra prediction unit 354. The inter prediction unit 344 may be or may include a motion compensation unit. Video decoder 30 may, in some examples, perform a decoding path that is generally complementary to the encoding path described with respect to video encoder 100 from FIG. 2.

[0105] As described with respect to encoder 20, inverse quantization unit 210, inverse transform processing unit 212, reconstruction unit 214, loop filter 220, decoded picture buffer (DPB) 230, inter prediction unit 344, and intra prediction unit 354 are also referred to as forming a “built-in decoder” of video encoder 20. Accordingly, inverse quantization unit 310 may be identical in function to inverse quantization unit 110, inverse transform processing unit 312 may be identical in function to inverse transform processing unit 212, reconstruction unit 314 may be identical in function to reconstruction unit 214, loop filter 320 may be identical in function to loop filter 220, and decoded picture buffer 330 may be identical in function to decoded picture buffer 230. Accordingly, the descriptions provided for the respective units and functions of video encoder 20 apply correspondingly to the respective units and functions of video decoder 30.

[0106] Entropy Decoding The entropy decoding unit 304 is configured to parse the bitstream 21 (or encoded picture data 21 in general), e.g., perform entropy decoding on the encoded picture data 21, e.g., to obtain quantized coefficients 309 and / or decoded coding parameters (not shown in FIG. 3 ), e.g., any or all of inter-prediction parameters (e.g., reference picture indices and motion vectors), intra-prediction parameters (e.g., intra-prediction modes or indices), transform parameters, quantization parameters, loop filter parameters, and / or other syntax elements. The entropy decoding unit 304 may be configured to apply a decoding algorithm or scheme corresponding to an encoding scheme such as described with respect to the entropy encoding unit 270 of the encoder 20. The entropy decoding unit 304 may be further configured to provide the 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. The video decoder 30 may receive syntax elements at a video slice level and / or a video block level. In addition to or as an alternative to slices and their respective syntax elements, tile groups and / or tiles and their respective syntax elements may be received and / or used.

[0107] inverse quantization Inverse quantization unit 310 may be configured to receive a quantization parameter (QP) (or generally, information regarding inverse quantization) and quantized coefficients from encoded picture data 21 (e.g., by parsing and / or decoding by entropy decoding unit 304), and apply inverse quantization on decoded quantized coefficients 309 based on the quantization parameter to obtain dequantized coefficients 311, which may also be referred to as transform coefficients 311. The inverse quantization process may involve use of a quantization parameter determined by video encoder 20 for each video block in a video slice (or tile or tile group) to determine the degree of quantization, and similarly, the degree of inverse quantization to be applied.

[0108] Inverse transformation The inverse transform processing unit 312 may be configured to receive the dequantized coefficients 311, also referred to as transform coefficients 311, and apply a transform to the dequantized coefficients 311 to obtain the reconstructed residual block 213 in the sample domain. The reconstructed residual block 213 may also be referred to as the transform block 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 further be configured to receive transform parameters or corresponding information from the encoded picture data 21 (e.g., by parsing and / or decoding by the entropy decoding unit 304) to determine the transform to be applied to the dequantized coefficients 311.

[0109] Reconstruction The reconstruction unit 314 (e.g., an adder or summator 314) may be configured to add the reconstructed residual block 313 to the prediction block 365, for example, by adding the sample values ​​of the reconstructed residual block 313 and the sample values ​​of the prediction block 365, to obtain a reconstructed block 315 in the sample domain.

[0110] Filtering Loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter reconstructed block 315 to obtain filtered block 321, e.g., to smooth pixel transitions or otherwise improve video quality. Loop filter unit 320 may comprise one or more loop filters, such as a deblocking 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 filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although loop filter unit 320 is depicted in FIG. 3 as being an in-loop filter, in other configurations, loop filter unit 320 may be implemented as a post-loop filter.

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

[0112] The decoder 30 is arranged to output the decoded pictures 311, for example via output 312, for presentation or viewing to a user.

[0113] prediction The inter prediction unit 344 may be identical to the inter prediction unit 244 (especially the motion compensation unit), and the intra prediction unit 354 may be identical in function to the inter prediction unit 254, performing the partition or partition decision and prediction based on the partition and / or prediction parameters or respective information received (e.g., by parsing and / or decoding by the entropy decoding unit 304) from the encoded picture data 21. The mode application unit 360 may be configured to perform prediction (intra or inter prediction) for each block based on the (filtered or unfiltered) reconstructed picture, block, or respective sample to obtain a prediction block 365.

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

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

[0116] An embodiment of the video decoder 30 as depicted in FIG. 3 may be configured to partition and / or decode a picture by using slices (also referred to as video slices), where a picture may be partitioned into or decoded using one or more (typically non-overlapping) slices, each of which may comprise one or more blocks (e.g., CTUs).

[0117] An embodiment of video decoder 30 such as that depicted in FIG. 3 may be configured to partition and / or decode a picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where a picture may be partitioned into or decoded using one or more (typically non-overlapping) tile groups, each of which may comprise, for example, one or more blocks (e.g., CTUs) or one or more tiles, and each tile may be, for example, rectangular in shape and may comprise one or more blocks (e.g., CTUs), e.g., full or fractional blocks.

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

[0119] It should be understood that the processing result of the current step may be further processed and then output to the next step in the encoder 20 and the decoder 30. For example, after the interpolation filtering, motion vector derivation, or loop filtering, further operations such as clipping or shifting may be performed on the processing result of the interpolation filtering, motion vector derivation, or loop filtering.

[0120] It should be noted that further operations may be applied to the derived motion vector of the current block (including, but not limited to, control point motion vectors in affine mode, sub-block motion vectors in affine, planar, and ATMVP modes, temporal motion vectors, etc.). For example, the value of a motion vector is constrained to a predefined range according to its representation bits. If the representation bits of a motion vector are bitDepth, the range is -2^(bitDepth-1) to 2^(bitDepth-1)-1, where "^" means exponentiation. For example, if bitDepth is set equal to 16, the range is -32768 to 32767, and if bitDepth is set equal to 18, the range is -131072 to 131071. For example, the value of a derived motion vector (e.g., the MVs of four 4x4 sub-blocks in one 8x8 block) is constrained so that the maximum difference between the integer parts of the four 4x4 sub-block MVs is not greater than N pixels, such as not greater than 1 pixel. Here, we provide two methods for constraining motion vectors according to bitDepth.

[0121] Method 1: Remove the overflow MSB (Most Significant Bit) by flow operation. 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 the horizontal component of the motion vector of the image block or sub-block, mvy is the vertical component of the motion vector of the image block or sub-block, and ux and uy denote intermediate values.

[0122] For example, if the value of mvx is -32769, then after applying equations (1) and (2), the resulting value is 32767. In computer systems, decimal numbers are stored as two's complement numbers. 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, which is the same as the output by applying equations (1) and (2) (decimal number is 32767). 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-1 ) ? ( uy - 2 bitDepth ) : uy (8)

[0123] As shown in equations (5) to (8), the operation can be applied between the sum of mvp and mvd.

[0124] 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 the horizontal component of the motion vector of the image block or sub-block, vy is the vertical component of the motion vector of the image block or sub-block, x, y, and z correspond to the three input values ​​of the MV clipping process, respectively, and the definition of the function Clip3 is as follows:

[0125]

number

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

[0127] Video coding device 400 comprises an ingress port 410 (or input port 410) and a receiver unit (Rx) 420 for receiving data, a processor, logic unit, or central processing unit (CPU) 430 for processing the data, a transmitter unit (Tx) 440 and an egress port 450 (or output port 450) for transmitting the data, and a memory 460 for storing the data. Video coding device 400 may also comprise optical-to-electrical (OE) and electrical-to-optical (EO) components coupled to ingress port 410, receiver unit 420, transmitter unit 440, and egress port 450 for the egress or ingress of optical or electrical signals.

[0128] The processor 430 is implemented in hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGA, ASIC, and DSP. The processor 430 is in communication with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460. The processor 430 includes a coding module 470. The coding module 470 implements the disclosed embodiments described above. For example, the coding module 470 implements, processes, prepares, or provides various coding operations. Thus, the inclusion of the coding module 470 provides significant improvements to the functionality of the video coding device 400 and results in the transformation of the video coding device 400 into different states. Alternatively, the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430.

[0129] Memory 460 may comprise one or more disks, tape drives, and solid-state drives, and may be used as an overflow data storage device for storing programs when such programs are selected for execution and for storing instructions and data read during program execution. Memory 460 may be, for example, volatile and / or non-volatile, and may be read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and / or static random-access memory (SRAM).

[0130] FIG. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of source device 12 and destination device 14 from FIG. 1, according to an example embodiment.

[0131] The processor 502 in the apparatus 500 may be a central processing unit. Alternatively, the processor 502 may be any other type of device or devices, now existing or later developed, capable of manipulating or processing information. While the disclosed implementations may be implemented using a single processor, e.g., processor 502, as shown, advantages in speed and efficiency may be achieved using more than one processor.

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

[0133] The apparatus 500 may also include one or more output devices, such as a display 518. The display 518, in one example, may be a touch-sensitive display that combines a display with touch-sensitive elements operable to sense touch input. The display 518 may be coupled to the processor 502 via the bus 512.

[0134] Although depicted here as a single bus, bus 512 of device 500 may be comprised of multiple buses. Additionally, secondary storage 514 may be directly coupled to other components of device 500 or may be accessed over a network, and may comprise a single integrated unit such as a memory card, or multiple units such as multiple memory cards. Thus, device 500 may be implemented in a wide variety of configurations.

[0135] Background Technology of Intra Prediction To capture any edge direction presented in natural video, the number of directional intra modes in VTM6 is expanded from 33 as used in HEVC to 65. Planar and DC modes remain the same. Specifically, the values ​​of all intra prediction modes are defined in Table 8-1.

[0136] [Table 1]

[0137] Intra prediction for planar modes After the reference sample filtering process, as defined in the VVC specification of the Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO / IEC JTC 1 / SC 29 / WG 11, entitled "Versatile Video Coding (Draft 6)" (available under http: / / phenix.it-sudparis.eu / jvet / , document number JVET-O2001-vE), the reference samples are ready. Using these reference samples, intra-prediction samples (which may also be called intra-predicted samples) can be generated. If the intra-mode of the current block is planar or DC mode, a corresponding intra-prediction process is defined. If the intra-prediction mode is angular (i.e., neither planar nor DC), prediction using angular mode is activated.

[0138] Planar mode is a frequently used intra-prediction mode. Figure 6 shows the concept for intra-prediction, where the width and height of the prediction block are set to N. A predicted sample has a horizontal component and a vertical component. The horizontal component is a linear weighted combination from the corresponding left and right reference samples (see sub-drawing a of Figure 6). The vertical component is a linear weighted combination from the corresponding above and below reference samples (see sub-drawing b of Figure 6). Note that the right column shown in sub-drawing a is padded with the top-right reference sample p[N][-1], and the bottom row shown in sub-drawing b is padded with the bottom-left reference sample p[-1][N]. p[0][0] is located at the top-left corner of the current (predicted) block. After the generation of the horizontal and vertical components, the predicted output sample is a weighted combination of the horizontal and vertical components (see sub-drawing c of Figure 6).

[0139] More specifically, planar mode prediction is defined as follows:

[0140] INTRA_PLANAR intra prediction mode specification The inputs to this process are: - variable nTbW specifying the transform block width, - variable nTbH, which specifies the transformation block height; - The neighboring samples p[x][y] are x = -1, y = -1..nTbH and x = 0..nTbW, y = -1.

[0141] The output of this process is the predicted samples predSamples[x][y], where x = 0..nTbW - 1, y = 0..nTbH - 1.

[0142] The variables nW and nH are derived as follows: nW = Max( nTbW, 2 ) (8-135) nH = Max( nTbH, 2 ) (8-136)

[0143] The predicted sample values ​​predSamples[ x ][ y ], where x = 0..nTbW - 1 and y = 0..nTbH - 1, are derived as follows: predV[ x ][ y ] = ( ( nH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nW ) (8-137) predH[ x ][ y ] = ( ( nW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nH ) (8-138) predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nW * nH ) >> (Log2 ( nW ) + Log2 ( nH ) + 1 ) (8-139)

[0144] In this example, for the sample to be predicted at coordinate (x, y), ·p[-1][y] represents the reference sample in the corresponding left column. p[nTbW][-1] represents the reference sample of the corresponding right column. Note that the reference samples of the right column are the same and are padded with p[nTbW][-1]. p[nTbW][-1] is the sample located at the intersection of the right reference sample column and the reference sample row above. ·p[x][-1] represents the reference sample in the corresponding upper row. p[-1][nTbH] represents the reference sample of the corresponding row below. Note that the reference samples of the row below are the same and are padded with p[-1][nTbH]. p[-1][nTbH] is the sample located at the intersection of the reference sample row below and the reference sample column to the left.

[0145] Figure 7 illustrates the locations of these reference samples, with the output reference samples predSamples[x][y] corresponding to the samples within the current prediction block enclosed by the dashed rectangle. The lower dashed rectangle is used to illustrate samples p(0,0) to p(15,0) located within the current prediction block. The reference samples represented by solid lines are adjacent to the current prediction block. In the example illustrated in Figure 7, p(-1)(-1) to p(-1,1) and p(0,-1) to p(15)(-1) are reference samples. nTbW and nTbH represent the width and height of the prediction block, respectively. In this particular example, the current block (prediction block or transform block) has a height of one pixel, nTbH. The prediction block represents a rectangular MxN block of samples resulting from either inter- or intra-prediction, where M and N are non-zero positive integers. Similarly, a transform block represents a rectangular K×L block of samples resulting from a transform, where K and L are non-zero positive integers. Typically, after a predictive block is generated, a transform block of the same size and with the same position is generated using the transform (or inverse transform in decoding). However, the size and position of a predictive block may not always be the same as its associated transform block.

[0146] In particular, it is asserted that for blocks with height equal to 1, planar mode intra prediction is unnecessarily complex.

[0147] The current VVC specification involves five multiplications and three shift operations for planar mode per predicted sample. The five multiplications include two in generating the vertical component, two in generating the horizontal component, and one in calculating the output sample. The three shift operations are distributed among one each in generating the vertical and horizontal components, and one in generating the output sample (predSamples).

[0148] The current VVC specification also ensures that the vertical and horizontal components are generated using bilinear filters by ensuring that the minimum height (nH) and minimum width (nW) in Equation 8-139 are 2.

[0149] In some embodiments of the present invention, it is proposed to simplify the prediction of the planar mode for blocks with height equal to 1. That is, for this type of block, the generation of the vertical component uses the reference sample row below, padded by p[-1][nTbH]. Specifically, the generation of the vertical sample is calculated according to the following formula: predV[ x ][ y ] = (( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nW ) (8-137') predH[ x ][ y ] = ( ( nW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) (8-138') predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nW ) >> (Log2 ( nW ) +1 ) (8-139')

[0150] In this way, for a block with height equal to 1 (nTbH=1), there are only three multiplication and two shift operations in planar mode prediction.

[0151] In one embodiment, the prediction of the planar mode is modified as follows:

[0152] INTRA_PLANAR intra prediction mode specification The inputs to this process are: - variable nTbW specifying the block width, - variable nTbH specifying the block height, - The neighboring samples p[x][y] are x = -1, y = -1..nTbH and x = 0..nTbW, y = -1.

[0153] The output of this process is the predicted samples predSamples[x][y], where x = 0..nTbW - 1, y = 0..nTbH - 1.

[0154] The variables nW and nH are derived by applying clipping operations to nTbW and nTbH, respectively. nW = Max( nTbW, 2 ) (8-135) nH = Max( nTbH, 2 ) (8-136)

[0155] The predicted sample values ​​predSamples[ x ][ y ], where x = 0..nTbW - 1 and y = 0..nTbH - 1, are derived as follows:

[0156] If nTbH is equal to 1, predV[ x ][ y ] = (( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nW ) (8-137') predH[ x ][ y ] = ( ( nW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) (8-138') predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nW ) >> (Log2 ( nW ) +1 ) (8-139') Otherwise (nTbH is not equal to 1), predV[ x ][ y ] = ( ( nH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nW ) (8-137) predH[ x ][ y ] = ( ( nW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nH ) (8-138) predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nW * nH ) >> (Log2 ( nW ) + Log2 ( nH ) + 1 ) (8-139)

[0157] In another embodiment, the prediction of the planar mode is modified as follows:

[0158] The inputs to this process are: - variable nTbW specifying the block width, - variable nTbH specifying the block height, - The neighboring samples p[x][y] are x = -1, y = -1..nTbH and x = 0..nTbW, y = -1.

[0159] The output of this process is the predicted samples predSamples[x][y], where x = 0..nTbW - 1, y = 0..nTbH - 1.

[0160] The predicted sample values ​​predSamples[ x ][ y ], where x = 0..nTbW - 1 and y = 0..nTbH - 1, are derived as follows: predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ) (8-137'') predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ) (8-138'') predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nTbW * nTbH ) >> (Log2 ( nTbW ) + Log2 ( nTbH ) + 1 ) (8-139'')

[0161] In fact, the equations in the if-else branches in the first embodiment can be integrated into the equations expressed in this embodiment. Compared with Equations 8-137 to 8-139, the complexity remains the same, but the clipping operations for nTbW and nTbH are removed.

[0162] In the above embodiment, nTbW may represent the width of the prediction block or the transform block. As mentioned above, according to some embodiments, the transform block size and the prediction block size may be the same. However, the present disclosure is not limited to such examples.

[0163] In the above embodiment, nTbH may represent the height of the prediction block or the transform block.

[0164] In particular, the following methods and embodiments are provided, which are implemented by a decoding or encoding device: The decoding device may be the video decoder 30 of FIG. 1A or the decoder 30 of FIG. 3; The encoding device may be the video encoder 20 of FIG. 1A or the encoder 20 of FIG. 2.

[0165] According to one embodiment 800 (see FIG. 8), a device determines that the intra-prediction mode for a current block is planar in block 801. The current one may be a predicted block or a transform block.

[0166] The device may also determine whether the height or width of the block is equal to 1. The reference sample row below the block may be padded with p[-1][nTbH] and / or the reference sample column to the right of the block may be padded with p[nTbW][-1].

[0167] In block 802, the device calculates values ​​of vertical components of intra-predicted samples of the current block.

[0168] The vertical component value predV[ x ][ y ] is generated using a linear filter using samples from the reference sample rows above and below, where the lower sample row is padded using a sample located at (-1, nTbH) with respect to the top-left sample of the current block. For example, predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), where predV[ x ][ y ] represents the vertical component value at x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ x ][ -1 ] represents the neighboring sample at x = 0..nTbW.

[0169] In particular, when the block height is equal to 1, predV[ x ][ y ] = (( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ).

[0170] When the block width is equal to 1, predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ).

[0171] From the above description, the block width is nTbW and the block height is nTbH. Before calculating predV[x][y], there is no clipping operation nW = Max(nTbW, 2) or clipping operation nH = Max(nTbH, 2).

[0172] In block 803, the device calculates values ​​of the horizontal components of the intra-predicted samples of the current block.

[0173] The horizontal component values ​​predH[x][y] are generated using a linear filter using samples from the left and right reference sample columns, where the right sample column is padded using a sample located at (nTbW, -1) relative to the top-left sample of the current block.

[0174] For example, predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ), where predH[ x ][ y ] represents the value of the horizontal component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ -1 ][ y ] represents the neighboring sample where y = -1..nTbH.

[0175] In particular, when the block height is equal to 1, predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ).

[0176] When the block width is equal to 1, predH[ x ][ y ] = ( ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ).

[0177] Similarly, there is no clipping operation nW = Max(nTbW, 2) or clipping operation nH = Max(nTbH, 2) before calculating predH[x][y].

[0178] There is no limitation on the sequence between blocks 802 and 803. In other words, the function of block 802 may be performed before, simultaneously with, or after block 803.

[0179] In block 804, the device generates intra-prediction samples based on the values ​​of the vertical and horizontal components.

[0180] For example, the intra prediction samples are Calculated as predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nTbW * nTbH ) >> (Log2 ( nTbW ) + Log2 ( nTbH ) + 1 ).

[0181] Detailed information about intra-plane prediction is provided in the above-mentioned embodiments.

[0182] Figure 9 illustrates an embodiment of a device 900. The device 900 may be the video decoder 30 of Figure 1A or the decoder 30 of Figure 3, or may be the video encoder 20 of Figure 1A or the encoder 20 of Figure 2. The device 900 can be used to implement the embodiment 800 and the other embodiments described above.

[0183] The device 900 for intra-planar prediction includes a determining unit 901, a calculating unit 902, and a predicting unit 903. The determining unit 901 is configured to determine that the intra-prediction mode for a block is planar. The calculating unit 902 is configured to calculate values ​​of vertical components of intra-predicted samples included in the block of the picture. The vertical component values ​​predV[x][y] are generated using a linear filter using samples from above and below reference sample rows, and the below sample row is padded using samples located at (-1, nTbH) with respect to the top-left sample of the current block. For example, predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), where predV[ x ][ y ] represents the value of the vertical component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ x ][ -1 ] represents the neighboring sample where x = 0..nTbW.

[0184] A calculation unit further configured to calculate values ​​of horizontal components of intra-predicted samples, wherein the horizontal component values ​​predH[x][y] are generated using a linear filter using samples from left and right reference sample columns, and the right sample column is padded using a sample located at (nTbW, -1) relative to the top-left sample of the current block.

[0185] For example, predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ), where predH[ x ][ y ] represents the value of the horizontal component where x = 0..nTbW - 1 and y = 0..nTbH - 1, nTbH represents the height of the block, nTbW represents the width of the block, and p[ -1 ][ y ] represents the neighboring sample where y = -1..nTbH.

[0186] When the block height is equal to 1, the vertical and horizontal component values ​​are predV[ x ][ y ] = ( ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), A calculation unit (902) configured to calculate by predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ).

[0187] When the block width is equal to 1, the vertical and horizontal component values ​​are predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ), A calculation unit (902) configured to calculate by predH[ x ][ y ] = ( ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ).

[0188] A prediction unit 903 configured to generate intra-predicted samples based on values ​​of vertical and horizontal components, for example, by: A prediction unit (903) configured to generate predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nTbW * nTbH ) >> (Log2 ( nTbW ) + Log2 ( nTbH ) + 1 ).

[0189] The device may further include a padding unit (904) configured to pad a reference sample row below the block or transform block by p[-1][nTbH], particularly when the height of the block or transform block is equal to 1, or to pad a reference sample column to the right of the block by p[nTbW][-1], particularly when the width of the block is equal to 1.

[0190] As discussed above, in the conventional case of intra-prediction in planar mode, determining a predicted block sample for some blocks is unnecessarily complicated. Before calculating the values ​​of the vertical and horizontal components, two variables nW and nH must be derived by applying clipping operations to nTbW and nTbH. Some embodiments of this disclosure do not perform the clipping operations nW = Max(nTbW, 2) and nH = Max(nTbH, 2) before calculating the vertical and horizontal components. Therefore, prediction applying planar mode is simplified. Correspondingly, encoding or decoding efficiency is increased.

[0191] Additionally, the following embodiments are provided herein:

[0192] Embodiment 1. According to one aspect, the invention relates to a method for decoding or encoding, the method being performed by a decoding or encoding device. The method includes: when the height of the prediction block is equal to 1, calculating a value of a vertical component of an intra-predicted sample by using a reference sample row below the prediction block without using a reference sample column to the left of the prediction block; calculating a value of a horizontal component of the intra-predicted sample; and generating the intra-predicted sample based on the value of the vertical component and the value of the horizontal component.

[0193] Embodiment 2. The vertical component value predV[x][y] is predV[ x ][ y ] = (( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nW ), 2. The method of embodiment 1, wherein x = 0..nTbW - 1, y = 0..nTbH - 1, nTbH represents the height of the prediction block or transform block, nTbW represents the width of the prediction block or transform block, and nW represents the clipped value after applying clipping to the width of the prediction block.

[0194] Embodiment 3. The horizontal component value predH[ x ][ y ] is It is calculated by predH[ x ][ y ] = ( ( nW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ), 3. The method of embodiment 1 or 2, wherein x = 0..nTbW - 1, y = 0..nTbH - 1, nTbH represents the height of the prediction block or transform block, nTbW represents the width of the prediction block or transform block, and nW represents the clipped value after applying clipping to the width of the prediction block.

[0195] Embodiment 4. The intra-predicted samples predSamples[ x ][ y ] are predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nW ) >> generated by (Log2 ( nW ) +1 ) ,fruit Embodiments 1~3 One of How to do it.

[0196] Embodiment 5. The method of any one of embodiments 1 to 4, wherein the reference sample row below is padded by p[ −1 ][ nTbH ].

[0197] Embodiment 6. According to another aspect, the invention relates to a method for decoding or encoding, the method being performed by a decoding or encoding device, and includes the steps of: calculating a value of a vertical component of an intra-predicted sample based on a height and a width of a current prediction block obtained without applying a clipping operation and a height and a width of the prediction block; calculating a value of a horizontal component of the intra-predicted sample based on the height and width of the prediction block; and generating the intra-predicted sample based on the value of the vertical component and the value of the horizontal component.

[0198] Embodiment 7. The value of the vertical component predV[x][y] is predV[ x ][ y ] = ( ( nTbH - 1 - y ) * p[ x ][ -1 ] + ( y + 1 ) * p[ -1 ][ nTbH ] ) << Log2 ( nTbW ), 7. The method of embodiment 6, wherein x = 0..nTbW - 1, y = 0..nTbH - 1, where nTbH represents the height of the prediction block or transform block, and nTbW represents the width of the prediction block or transform block.

[0199] Embodiment 8. The horizontal component value predH[ x ][ y ] is predH[ x ][ y ] = ( ( nTbW - 1 - x ) * p[ -1 ][ y ] + ( x + 1 ) * p[ nTbW ][ -1 ] ) << Log2 ( nTbH ), 8. The method of embodiment 6 or 7, wherein x = 0..nTbW - 1, y = 0..nTbH - 1, nTbH represents the height of the prediction block or transform block, and nTbW represents the width of the prediction block or transform block.

[0200] Embodiment 9. The intra-predicted samples predSamples[ x ][ y ] are predSamples[ x ][ y ] = ( predV[ x ][ y ] + predH[ x ][ y ] + nTbW * nTbH ) >> generated by (Log2 ( nTbW ) + Log2 ( nTbH ) + 1 ) ,fruit Embodiment 6~8 One of How to do it.

[0201] Embodiment 10. The method of any one of embodiments 5 to 9, wherein the reference sample row below the prediction block is padded by p[ −1 ][ nTbH ].

[0202] Embodiment 11. The method of any one of embodiments 5 to 10, wherein the width of the prediction block is obtained without applying a clipping operation nW = Max(nTbW, 2).

[0203] Embodiment 12. The method of any one of embodiments 5 to 11, wherein the height of the predicted block is obtained without applying a clipping operation nH = Max(nTbH, 2).

[0204] The following is a description of the encoding method and the decoding method as presented in the above-mentioned embodiments, and the application of the system using them.

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

[0206] The capture device 3102 may generate data and encode the data by the encoding method as described in the above embodiment. Alternatively, the capture device 3102 may deliver the data to a streaming server (not shown), which encodes the data and transmits the encoded data to the terminal device 3106. The capture device 3102 may include, but is not limited to, a camera, a smartphone or pad, a computer or laptop, a video conferencing system, a PDA, a vehicle-mounted device, or any combination thereof, or the like. For example, the capture device 3102 may include the source device 12 described above. When the data includes video, a video encoder 20 included in the capture device 3102 may actually perform the video encoding process. When the data includes audio (i.e., voice), an audio encoder included in the capture device 3102 may actually perform the audio encoding process. For some practical scenarios, the capture device 3102 delivers the encoded video and audio data by multiplexing them together. In other practical scenarios, for example, in a video conferencing system, the encoded audio data and the encoded video data are not multiplexed, and the capture device 3102 delivers the encoded audio data and the encoded video data to the terminal device 3106 separately.

[0207] In the content delivery system 3100, a terminal device 3106 receives and plays the encoded data. The terminal device 3106 can be a device having data reception and recovery capabilities, such as a smartphone or pad 3108, a computer or laptop 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a TV 3114, a set top box (STB) 3116, a video conferencing system 3118, a video surveillance system 3120, a personal digital assistant (PDA) 3122, a vehicle-mounted device 3124, or any combination thereof, capable of decoding the encoded data described above. For example, the terminal device 3106 may include the destination device 14 described above. When the encoded data includes video, the video decoder 30 included in the terminal device is prioritized to perform video decoding. When the encoded data includes audio, an audio decoder included within the terminal device is prioritized to perform the audio decoding process.

[0208] For a terminal device having a display, such as a smartphone or pad 3108, a computer or laptop 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a TV 3114, a personal digital assistant (PDA) 3122, or a vehicle-mounted device 3124, the terminal device can provide the decoded data to its display. For a terminal device not equipped with a display, such as an STB 3116, a video conferencing system 3118, or a video surveillance system 3120, an external display 3126 is contacted thereto to receive and display the decoded data.

[0209] When each device in this system performs encoding or decoding, a picture encoding device or a picture decoding device can be used as shown in the above-mentioned embodiments.

[0210] 11 is a diagram illustrating the structure of an example of the terminal device 3106. After the terminal device 3106 receives a stream from the capture device 3102, a protocol progression unit 3202 analyzes the transmission protocol of the stream. The protocol may include, but is not limited to, Real Time Streaming Protocol (RTSP), Hyper Text Transfer Protocol (HTTP), HTTP Live streaming protocol (HLS), MPEG-DASH, Real-time Transport protocol (RTP), Real Time Messaging Protocol (RTMP), or any type of combination thereof, or the like.

[0211] After the protocol progression unit 3202 processes the stream, a stream file is generated. The file is output to the demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into encoded audio data and encoded video data. As described above, in some practical scenarios, for example, in a video conferencing system, the encoded audio data and encoded video data are not multiplexed. In this situation, the encoded data is transmitted to the video decoder 3206 and the audio decoder 3208 without passing through the demultiplexing unit 3204.

[0212] Through the demultiplexing process, a video elementary stream (ES), an audio ES, and optionally subtitles are generated. A video decoder 3206, which may include the video decoder 30 as described in the above-mentioned embodiment, decodes the video ES by the decoding method as shown in the above-mentioned embodiment to generate video frames, and supplies this data to a synchronization unit 3212. An audio decoder 3208 decodes the audio ES to generate audio frames, and supplies this data to a synchronization unit 3212. Alternatively, the video frames may be stored in a buffer (see FIG. 1) before being supplied to the synchronization unit 3212. 11 Similarly, an audio frame may be stored in a buffer (not shown in FIG. 32) before providing it to the synchronization unit 3212. 11 The data can be stored in a memory location (not shown).

[0213] The synchronization unit 3212 synchronizes the video and audio frames and provides the video / audio to the video / audio display 3214. For example, the synchronization unit 3212 synchronizes the presentation of video and audio information. The information may be coded in the syntax using timestamps related to the presentation of the coded audio and visual data and timestamps related to the delivery of the data stream itself.

[0214] If subtitles are included in the stream, a subtitle decoder 3210 decodes the subtitles, synchronizes them with the video and audio frames, and provides the video / audio / subtitles to a video / audio / subtitle display 3216 .

[0215] The present invention is not limited to the above-described system, and either the picture encoding device or the picture decoding device in the above-described embodiments can be incorporated into other systems, for example, automobile systems.

[0216] 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 more precisely defined, and additional operations such as exponentiation and real division are defined. Numbering and counting conventions generally start at 0, e.g., "first" is equivalent to 0th, "second" is equivalent to 1st, etc.

[0217] Arithmetic operators The following arithmetic operators are defined as follows: + Addition. - Subtraction (as an operator of two arguments) or negation (as a unary prefix operator). * Multiplication, including matrix multiplication. x y Exponentiation. Specifies x to the yth power. In other contexts, such notation is used to make a superscript not intended for interpretation as a power. / Integer division with truncation of the result towards 0. For example, 7 / 4 and -7 / -4 round down to 1, and -7 / 4 and 7 / -4 round down to -1. ÷ Used to denote division in mathematical expressions, where no truncation or rounding is intended.

[0218]

number

[0219] Used to denote division in mathematical expressions where no truncation or rounding is intended.

[0220]

number

[0221] The sum of f(i), where i is all integers from x to y inclusive. x % y modulo. The remainder when x is divided by y, defined only for integers x and y, with x>=0 and y>0.

[0222] Logical operators The following logical operators are defined as follows: x && y The Boolean logic "connection" of x and y. x || y The Boolean logic "disjunction" of x and y. ! "Not" in Boolean logic. x ? y : zIf x is TRUE, i.e. not equal to 0, evaluates to the value of y, otherwise evaluates to the value of z.

[0223] 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.

[0224] 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 special value for that syntax element or variable. The value "na" is not considered equal to any other value.

[0225] Bitwise Operators The following bitwise operators are defined as follows: & Bitwise "and". When operating on integer arguments, it operates on the 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 appending the more significant bits equal to 0. Bitwise "logical or". When operating on integer arguments, it operates on the two's complement representation of the integer values. When operating on a binary argument that contains fewer bits than another argument, the shorter argument is extended by appending its more significant bits equal to 0. ^ Bitwise "exclusive or". When operating on integer arguments, it operates on the 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 appending more significant bits equal to 0. x >> y Arithmetic right shift of the two's complement integer representation of x by y binary places. This function is defined only for non-negative integer values ​​of y. The bit shifted into the most significant bit (MSB) as a result of the right shift has a value equal to the MSB of x before the shift operation. x << y: Arithmetic left shift of the two's complement integer representation of x by y binary places. This function is defined only for non-negative integer values ​​of y. The bit that is shifted into the least significant bit (LSB) as a result of the left shift has value equal to 0.

[0226] assignment operator The following arithmetic operators are defined as follows: = assignment operator. ++ increment, i.e., x++ is equivalent to x = x + 1, and when used in an array index, evaluates to the value of the variable before the increment operation. -- Decrement, i.e., x--, is equivalent to x = x - 1, and when used in an array index, evaluates to the value of the variable before the decrement operation. += Increment by the specified amount, i.e., x += 3 is equivalent to x = x + 3 and x += (-3) is equivalent to x = x + (-3). -= Decrement by the specified amount, i.e., x -= 3 is equivalent to x = x - 3, and x -= (-3) is equivalent to x = x - (-3).

[0227] Range Notation The following notation is used to specify a range of values: x=y..zx takes integer values ​​starting from y up to and including z, where x, y, and z are integers and z is greater than y.

[0228] Mathematical Functions The following mathematical functions are defined:

[0229]

number

[0230] Asin(x) The trigonometric arc sine function, operating on an argument x in the inclusive range of -1.0 to 1.0, and with an output value in the inclusive range of -π÷2 to π÷2 in radians. Atan(x) The trigonometric arctangent function, operating on the argument x, with output values ​​in the range -π÷2 to π÷2 inclusive, in radians.

[0231]

number

[0232] Ceil(x) The smallest integer greater than or equal to x. Clip1 Y ( x ) = Clip3( 0, ( 1 << BitDepth Y ) - 1, x ) Clip1 C ( x ) = Clip3( 0, ( 1 << BitDepth C ) - 1, x )

[0233]

number

[0234] Cos(x) The trigonometric cosine function, operating on the argument x in radians. Floor(x) The largest integer less than or equal to x.

[0235]

number

[0236] Ln(x) The natural logarithm of x (logarithm to base e, where e is the base constant of the natural logarithm, 2.718 281 828...). Log2(x) The base 2 logarithm of x. Log10(x) The base 10 logarithm of x.

[0237]

number

[0238] Round( x ) = Sign( x ) * Floor( Abs( x ) + 0.5 )

[0239]

number

[0240] Sin(x) The trigonometric sine function, operating on the argument x in radians.

[0241]

number

[0242] Swap( x, y ) = ( y, x ) Tan(x) The trigonometric tangent function, operating on the argument x in radians.

[0243] Order of operation precedence When the order of precedence in an expression is not explicitly indicated by the use of parentheses, the following rules apply: - An operation with higher precedence is evaluated before any operation with lower precedence. - Operations of equal precedence are evaluated sequentially from left to right.

[0244] The following table specifies the precedence of operations from highest to lowest, with higher positions in the table indicating higher precedence.

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

[0246] [Table 2]

[0247] Logical operations in text In the text, statements of logical operations that are to be written mathematically in the following form: if(condition0) Statement 0 else if(condition 1) Statement 1 ... else / * explanatory notes for remaining conditions * / Statement n can be explained in the following form: ...as follows / ...the following applies - If condition 0, then statement 0 - Otherwise, if condition 1, then statement 1 - ... - Otherwise (explanatory note in the remaining condition), statement n

[0248] Each "if, otherwise, then, otherwise" statement in the text is introduced with "as follows" or "the following applies", followed immediately by an "if." The final condition of an "if, otherwise, then, otherwise" is always "otherwise." Interleaved "if, otherwise, then, otherwise" statements can be identified by matching the "as follows" or "the following applies" with the closing "otherwise."

[0249] In the text, statements of logical operations that are to be written mathematically in the following form: if(condition0a && condition0b) Statement 0 else if(condition 1a || condition 1b) Statement 1 ... else Statement n can be explained in the following form: ...as follows / ...the following applies - Statement 0 if all of the following conditions are true: - Condition 0a - Condition 0b - Otherwise, if one or more of the following conditions are true, then statement 1: - Condition 1a - Condition 1b - ... - Otherwise, statement n

[0250] In the text, statements of logical operations that are to be written mathematically in the following form: if(condition0) Statement 0 if(condition1) Statement 1 can be explained in the following form: If condition 0, then statement 0 If condition 1, then statement 1

[0251] Although embodiments of the invention are primarily described based on video coding, it should be noted that embodiments of coding system 10, encoder 20, and decoder 30 (and correspondingly, system 10), as well as other embodiments described herein, may also be configured for still picture processing or coding, i.e., processing or coding of individual pictures independent of any preceding or successive pictures, as in video coding. Generally, when picture processing coding is limited to a single picture 17, only inter prediction units 244 (encoder) and 344 (decoder) may not be available. All other functions (also called tools or techniques) of the video encoder 20 and the video decoder 30 may be equally used for still picture processing, e.g., residual calculation 204 / 304, transform 206, quantization 208, inverse quantization 210 / 310, (inverse) transform 212 / 312, partitioning 262 / 362, intra prediction 254 / 354, and / or loop filtering 220, 320, and entropy coding 270 and entropy decoding 304.

[0252] For example, embodiments of the encoder 20 and the decoder 30, and functions described herein 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 a communication medium as one or more instructions or code and executed by a hardware-based processing unit. The computer-readable medium may include a computer-readable storage medium, which corresponds to a tangible medium such as a data storage medium, or a communication medium, which includes any medium that facilitates transfer of a computer program from one place to another, for example, according to a communication protocol. In this form, the computer-readable medium may generally correspond to (1) a tangible computer-readable storage medium that is non-transitory, or (2) a communication medium such as a signal or carrier wave. The data storage medium may be any available medium that can be accessed by one or more computers or one or more processors to retrieve instructions, code, and / or data structures for implementing the techniques described in this disclosure. A computer program product may include the computer-readable medium.

[0253] By way of example, and not limitation, such computer-readable storage media may 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 coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included within the definition of medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but instead cover non-transitory tangible storage media. As used herein, disk and disc include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where disks typically reproduce data magnetically while discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0254] The instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general-purpose microprocessors, application-specific integrated circuits (ASICs), field-programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term "processor" as used herein may refer to any of the above structures or any other structure suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided in dedicated hardware and / or software modules configured for encoding and decoding, or incorporated into a combined codec. Also, the techniques may be fully implemented within one or more circuits or logic elements.

[0255] 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 chipset). Various components, modules, or units are described in this disclosure to highlight functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require implementation by different hardware units. Rather, as described above, the various units may be combined in a codec hardware unit or provided by a collection of interoperable hardware units, including one or more processors as described above, along with suitable software and / or firmware. [Explanation of symbols]

[0256] 10. Video Coding System 12 Source Devices 13 Communication Channels 14 Destination Device 16 Picture Source 17 Picture, Picture Data, Raw Picture, Raw Picture Data 18 Preprocessor, preprocessing unit 19 Preprocessed Picture, Preprocessed Picture Data 20 Video Encoder 21 Encoded Picture Data 22 Communication interface, communication unit 28 Communication interface, communication unit 30 Video Decoder 31 Decoded Picture, Decoded Picture Data 32 Post-processor, post-processing unit 33 Post-Processed Picture, Post-Processed Picture Data 34 Display Devices 46 Processing Circuit 201 Input, input interface 203 Picture Block 204 Residual Calculation Unit 205 Residual Block, Residual 206 Conversion Processing Unit 207 Conversion Factor 208 quantization units 209 Quantized Coefficients, Quantized Transform Coefficients, Quantized Residual Coefficients 210 Inverse Quantization Unit 211 Dequantized coefficients, dequantized residual coefficients 212 Inverse Transformation Processing Unit 213 reconstructed residual block, corresponding dequantized coefficients, transform block 214 Reconstruction Unit 215 reconstructed blocks 220 Loop Filter Unit 221 filtered blocks, filtered reconstructed blocks 230 Decoded Picture Buffer 231 decoded pictures 244 Inter Prediction Units 254 intra prediction units 260 Mode Selection Unit 262 division units 265 prediction block, predictor 266 Syntax Elements 270 Entropy Encoding Unit 272 Output, Output Interface 304 Entropy Decoding Unit 309 Quantized Coefficients 310 Inverse Quantization Unit 311 transform coefficients, dequantized coefficients 312 Inverse Transformation Processing Unit 313 Reconstructed residual block, transform block 314 Reconstruction Unit 315 reconstructed blocks 320 Loop Filter Unit 321 Filtered Blocks 330 Decoded Picture Buffer 331 Decoded Picture 344 Inter Prediction Unit 354 Intra Prediction Units 360 mode application unit 365 predicted blocks 400 Video Coding Device 410 inlet port, input port 420 receiver unit 430 Processors, Logic Units, Central Processing Units 440 transmitter unit 450 outlet port, output port 460 memory 470 Coding Module 500 devices 502 processor 504 memory 506 Code and Data 508 Operating Systems 510 Application Program 512 Bus 514 Secondary storage 518 Display 900 devices 901 Decision Unit 902 Computational Units 903 Prediction Units 904 padding unit 3100 Contents Supply System 3102 Capture Device 3104 Communication Links 3106 Terminal Device 3108 Smartphone / Pad 3110 Computer / Laptop 3112 Network Video Recorder / Digital Video Recorder 3114 TV 3116 Set-top Box 3118 Video Conference System 3120 Video Surveillance System 3122 Mobile Information Terminals 3124 Vehicle-mounted devices 3126 Display 3202 Protocol Progression Unit 3204 Demultiplexing Unit 3206 Video Decoder 3208 Audio Decoder 3210 Subtitle Decoder 3212 Synchronous Unit 3214 Video / Audio Display 3216 Video / Audio / Subtitle Display

Claims

1. A method of intra-plane prediction with block height equal to 1, comprising: Calculating vertical component values ​​predV[x][y] of intra-predicted samples contained in the block without applying a clipping operation nH = Max(nTbH, 2) to the height value of the block, wherein the vertical component values ​​predV[x][y] satisfy predV[x][y] = ((y + 1) * p[-1][nTbH]) << Log2(nTbW); Calculating a horizontal component value predH[x][y] of the intra predicted sample without applying a clipping operation nW = Max(nTbW, 2) to the width value of the block, wherein the horizontal component value predH[x][y] is predH[x][y] = ((nTbW - 1 - x) * p[-1][y] + (x + 1) * p[nTbW][-1]); generating the intra-predicted samples based on the values ​​of the vertical component and the values ​​of the horizontal component; wherein nTbH represents the height of the block, nTbW represents the width of the block, nTbH is equal to 1, and p[ x ][ y ] represents the neighboring samples with x = -1, y = -1..nTbH and x = 0..nTbW, y = -1.

2. The method of claim 1 , wherein the reference sample row below the block is padded with p[ −1 ][ nTbH ].

3. The method of claim 1 or 2, wherein the block is a transform block or a predicted block.

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

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

6. A computer program comprising a program code for performing the method according to any one of claims 1 to 3.

7. A decoder comprising: one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the decoder to perform the method of any one of claims 1 to 3.

8. 1. An encoder comprising: one or more processors; and a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the encoder to perform the method of any one of claims 1 to 3.

9. A device for intra-plane prediction in which the height of a block in a picture is equal to 1, comprising: a calculation unit (902) configured to calculate values ​​of vertical components predV[x][y] of intra-predicted samples included in a block of the picture without applying a clipping operation nH = Max(nTbH, 2) to a height value of the block and to calculate values ​​of horizontal components predH[x][y] of the intra-predicted samples without applying a clipping operation nW = Max(nTbW, 2) to a width value of the block, wherein the values ​​of the vertical components predV[x][y] are such that predV[x][y] = ((y + 1) * p[-1][nTbH]) << Log2(nTbW) and the values ​​of the horizontal components predH[x][y] are such that predH[x][y] = ((nTbW - 1 - x) * p[-1][y] + (x + 1) * p[nTbW][-1 ]), nTbH represents the height of the block, nTbW represents the width of the block, nTbH is equal to 1, and p[x][y] represents the neighboring samples with x=-1, y=-1..nTbH and x=0..nTbW, y=-1; a prediction unit (903) configured to generate the intra-predicted samples based on the values ​​of the vertical component and the values ​​of the horizontal component.

10. 10. The device of claim 9, further comprising a padding unit (904), wherein the padding unit (904) is configured to pad a reference sample row below the block by p[-1][nTbH].

11. 11. The device according to claim 9 or 10, wherein the device is a decoder.

12. 11. The device of claim 9, wherein the device is an encoder.

13. 11. The device of claim 9 or 10, wherein the block is a transform block or a prediction block.

Images