Encoder, decoder and corresponding method for intra prediction

The method simplifies MPM list construction in video coding by using flags to determine intra-prediction modes, reducing decoding complexity and improving efficiency, particularly with MRL and ISP tools, by unifying the MPM list with five candidate modes and a planar mode, thus optimizing processor load.

JP2024159767AActive Publication Date: 2024-11-08HUAWEI TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2024131240
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2019-03-27
Filing Date
2024-08-07
Publication Date
2024-11-08
Estimated Expiration
2040-03-23

Smart Images

  • Figure 2024159767000001_ABST
    Figure 2024159767000001_ABST
Patent Text Reader

Abstract

To provide devices and methods for intra prediction.SOLUTION: A method includes: a step of obtaining a value of first indication information of a current block, the value of the first indication information indicating whether an intra prediction mode of the current block is comprised in a set of most probable modes; and a step of obtaining a value of a reference index line of the current block. When the value of the first indication information indicates that the intra prediction mode of the current block is comprised in the set of most probable modes, and when the value of the reference index line indicates that a neighboring reference line closest to the current block is used, the method further includes a step of obtaining a value of second indication information of the current block, the value of the second indication information of the current block indicating whether an intra prediction mode of the current block is a planar mode. The method can improve efficiency for determining an intra prediction mode of the current block.SELECTED DRAWING: Figure 12B
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application claims priority to U.S. Provisional Application No. 62 / 822,865, filed March 23, 2019, U.S. Provisional Application No. 62 / 824,282, filed March 26, 2019, and U.S. Provisional Application No. 62 / 824,360, filed March 27, 2019, all of which are incorporated herein by reference.

[0002] Technical Field FIELD OF THE DISCLOSURE Embodiments of the present disclosure relate generally to the field of picture processing, and more particularly to intra prediction. [Background technology]

[0003] Video coding (video encoding and 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 conversation applications like video chat and video conferencing, DVDs and Blu-ray discs, video content collection and editing systems, and video cameras for security applications.

[0004] The amount of video data required to render even a relatively short video can be substantial, which can create difficulties when the data is streamed or otherwise communicated over a communications network with limited bandwidth capacity. Thus, video data is typically compressed before being communicated over modern telecommunications networks. The size of the video can also be an issue when the video is stored in a storage device, since memory resources can be limited. 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 required 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. Due to limited network resources and an ever-increasing demand for higher video quality, improved compression and decompression techniques that improve compression ratios with little or no sacrifice in picture quality are desirable.

[0005] In particular, there is a continuing demand to reduce processor load in the context of intra-prediction processing. It is known in the art to use a Most Probable Mode (MPM) list for intra-prediction mode coding. The MPM list reduces the bits required to code the intra-prediction mode of a current block. If the intra-prediction mode of a current block corresponds to an entry in the MPM list, an index is coded instead of the actual mode, thereby requiring fewer bits. However, it remains a task to select the entries for MPM list generation considering the most efficient intra-prediction coding. The proper selection of the entries significantly affects the efficiency of intra-prediction mode coding based on the MPM list.

[0006] In view of this, the objective underlying the present invention is to provide a technique for deriving intra-prediction modes based on an MPM list, which results in more efficient coding compared to the prior art. Summary of the Invention

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

[0008] These and other objects are achieved by the subject matter of the independent claims. Further implementations are evident from the dependent claims, the description and the drawings.

[0009] According to a first aspect, the present invention relates to a method performed by a decoding device, the method comprising: obtaining a value of a first indication information of a current block, the value of the first indication information indicating whether an intra-prediction mode of the current block is included in a set of most probable modes; and obtaining a value of a reference index line of the current block, the set of most probable modes including five candidate intra-prediction modes and a planar mode. If the value of the first indication information indicates that the intra-prediction mode of the current block is included in a set of most probable modes and if the value of the reference index line indicates that a neighboring reference line closest to the current block is used, the method further comprises obtaining a value of a second indication information of the current block, the value of the second indication information of the current block indicating whether an intra-prediction mode of the current block is a planar mode or not.

[0010] In the conventional method, the decoding complexity for MPM processing is high. Three different MPM lists (6 entries) are constructed depending on the use of Multiple Reference Line (MRL) and intra sub-partition coding mode (ISP) tools. In the aspects or any possible embodiment of the aspects of the present invention, the MPM list (5 entries) construction is unified with reduced decoding complexity regardless of whether MRL or ISP coding tools are used.

[0011] Furthermore, planar mode is considered a special mode due to its high frequency, and a special flag is assigned to check whether the current mode is a planar mode or not. Although it is not in the MPM list (which has 5 invented entries), it is checked whenever the mpm flag is true. In other words, the mpm flag indicates whether the intra prediction mode of the current block is in a 6-entry list consisting of planar modes and 5 MPM list entries. The 5 MPM list entries are built based on the intra prediction mode of the top-left block.

[0012] As an implementation of the first aspect, the first indication information may be indicated by a first flag, for example, intra_luma_mpm_flag. The value of the reference index line of the current block may be indicated by intra_luma_ref_idx. The second indication information may be indicated by a second flag, for example, intra_luma_not_planar_flag.

[0013] If MRL coding is not enabled, i.e., if the value of the reference index line indicates the nearest neighbor reference line to the current block, the devices parse the bitstream to obtain the value of the second indication information. If MRL coding is enabled, the value of the second indication information is obtained by a default value. In this situation, the planar mode is excluded and its corresponding flag (i.e., intra_luma_not_planar_flag) is not parsed from the bitstream and is estimated as a default value (e.g., a value of 1). In this case, a bit indicating the value of the planar flag (i.e., intra_luma_not_planar) is saved (if MRL is enabled).

[0014] According to a second aspect, the present invention relates to a method performed by an encoding device, the method comprising: determining whether an intra prediction mode of a current block is included in a set of most probable modes; and determining whether a nearest neighbor reference line of the current block is used for intra prediction. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The method further comprises encoding a bitstream, where if the intra prediction mode of the current block is included in the set of most probable modes and the nearest neighbor reference line of the current block is used for intra prediction, the bitstream includes information indicating whether the intra prediction mode of the current block is a planar mode.

[0015] As an implementation of the second aspect, the bitstream includes a first flag indicating whether the intra prediction mode of the current block is included in a set of most probable modes, and a second flag indicating whether the intra prediction mode of the current block is a planar mode. For example, the first flag is intra_luma_mpm_flag, and the second flag is intra_luma_not_planar_flag.

[0016] The method according to the first aspect of the present invention can be executed by a decoding device according to the third aspect of the present invention. The decoding device includes a first acquisition unit and a second acquisition unit. The first acquisition unit is configured to obtain a value of a reference index line of a current block and a value of a first indication information of the current block, the value of the first indication information indicating whether the intra prediction mode of the current block is included in a set of most probable modes. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The second acquisition unit is configured to obtain a value of a second indication information of the current block when the value of the first indication information indicates that the intra prediction mode of the current block is included in a set of most probable modes and when the value of the reference index line indicates that a neighboring reference line closest to the current block is used. The value of the second indication information of the current block indicates whether the intra prediction mode of the current block is a planar mode.

[0017] Further features and implementations of the method according to the third aspect of the invention correspond to the features and implementations of the apparatus according to the first aspect of the invention.

[0018] The method of the second aspect of the present invention can be performed by the encoding device of the fourth aspect of the present invention. The encoding device includes a decision unit and an encoding unit. The decision unit is configured to decide whether an intra prediction mode of a current block is included in a set of most probable modes and to decide whether a neighboring reference line closest to the current block is used for intra prediction. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The encoding unit is configured to encode a bitstream, the bitstream including information indicating whether an intra prediction mode of the current block is a planar mode if the intra prediction mode of the current block is included in the set of most probable modes and the neighboring reference line closest to the current block is used for intra prediction.

[0019] Further features and implementations of the method according to the fourth aspect of the invention correspond to the features and implementations of the apparatus according to the second aspect of the invention.

[0020] According to a fifth aspect, the present invention relates to an apparatus for decoding a video stream, the apparatus comprising a processor and a memory, the memory storing instructions for causing the processor to carry out the method according to the first aspect.

[0021] According to a sixth aspect, the present invention relates to an apparatus for encoding a video stream, the apparatus comprising a processor and a memory, the memory storing instructions for causing the processor to carry out the method according to the second aspect.

[0022] According to a seventh aspect, a computer-readable storage medium is proposed having stored thereon instructions which, when executed, cause one or more processors configured to code video data to perform a method according to the first aspect or the second aspect or any possible embodiment of the first or second aspect.

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

[0024] Planar modes have a high frequency of being used as intra prediction modes. The coding efficiency of the coding process can be improved compared to the prior art by using information indicating whether the intra prediction mode of the current block is a planar mode if the intra prediction mode of the current block is included in the set of most probable modes and the nearest neighbor reference line of the current block is used for intra prediction.

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

[0026] In the following, embodiments of the invention are explained in more detail with reference to the accompanying drawings and figures. [Figure 1A] 1 is a block diagram illustrating an example of a video coding system configured to implement embodiments of the present invention. [Figure 1B] 2 is a block diagram illustrating another example of a video coding system configured to implement embodiments of the present invention. [Diagram 2] FIG. 2 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the present invention. [Diagram 3] FIG. 2 is a block diagram illustrating an exemplary structure of a video decoder configured to implement embodiments of the present invention. [Figure 4] FIG. 2 is a block diagram showing an example of an encoding device or a decoding device. [Diagram 5] FIG. 2 is a block diagram showing another example of an encoding device or a decoding device. [Figure 6] FIG. 1 is a block diagram illustrating an example of a multiple reference line (MRL) coding tool. [Figure 7] FIG. 2 is a block diagram showing an example of division of 4×8 and 8×4 blocks. [Figure 8] FIG. 13 is a block diagram showing examples of partitioning of all blocks other than 4×8, 8×4 and 4×4. [Figure 9] FIG. 1 is a block diagram showing an example of modeling / coding of a CABAC context. [Figure 10] FIG. 2 is a block diagram showing examples of neighboring blocks to the left (L) and above (A) of a current block. [Figure 11] FIG. 13 is a block diagram illustrating intra-prediction modes. [Figure 12A]12 illustrates an embodiment of a method 1200 of intra prediction of a current block implemented by a decoding device according to the present invention. [Figure 12B] 12 illustrates an embodiment of a method 1210 of intra prediction of a current block implemented by a decoding device according to the present invention. [Figure 13] 13 illustrates an embodiment of a method 1300 for intra prediction of a current block implemented by an encoding device according to the present invention. [Figure 14] 14 shows an embodiment of a decoding device 1400 for use in an image decoder according to the present invention. [Figure 15] 15 illustrates an embodiment of an encoding device 1500 for use in an image encoder according to the present invention. [Figure 16] 31 is a block diagram showing an exemplary structure of a content delivery system 3100 for implementing a content distribution service. [Figure 17] FIG. 2 is a block diagram showing the structure of an example of a terminal device.

[0027] In the following, identical reference signs refer to identical or at least functionally equivalent features, unless expressly specified otherwise. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0028] In the following description, reference is made to the accompanying drawings, which form a part of this disclosure and which show by way of example specific aspects of embodiments of the invention or in which embodiments of the invention may be used. It is understood that the embodiments of the invention may be used in other aspects and may include structural or logical changes not shown in the drawings. Thus, 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 related to a described method may also be true of a corresponding apparatus or system configured to perform the method, and vice versa. For example, when one or more particular method steps are described, a corresponding apparatus may include one or more units, e.g., functional units, for performing the described one or more method steps (e.g., one unit performing one or more steps, or multiple units each performing one or more of the steps), even if such one or more units are not explicitly described or shown. On the other hand, for example, when a particular apparatus is described based on one or more units, e.g., functional units, a corresponding method may include a step for performing a function of the one or more units (e.g., one step for performing a function of the one or more units, or multiple steps for performing one or more functions of the multiple units, respectively), even if such one or more steps are not explicitly described or shown. Furthermore, it is understood that features of various exemplary embodiments and / or aspects described herein may be combined with each other, unless otherwise specified.

[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" are sometimes used synonymously in the field of video coding. Video coding (or coding in general) has two parts: video encoding and video decoding. Video encoding is performed at the source side and typically involves 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 involves the reverse processing compared to the encoder to reconstruct the video picture. Any embodiment referring to "coding" a video picture (or pictures in general) is understood to relate to "encoding" or "decoding" a video picture or a respective video sequence. The combination of the encoding and decoding parts is also called a 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 are no transmission losses or other data losses during storage or transmission). In the case of lossy video coding, further compression, e.g. by quantization, is performed to reduce the amount of data representing the video picture, which cannot be completely 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., they 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 the encoder, the video is typically processed, i.e., encoded, at the block (video block) level, for example by generating a predictive block using spatial (intra-picture) and / or temporal (inter-picture) prediction, subtracting the predictive block from a current block (the block currently being / 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). At the decoder, on the other hand, the inverse process compared to the encoder is applied to the encoded or compressed block to reconstruct the current block for representation. Furthermore, the encoder replicates the decoder processing loop, so that both generate the same predictions (eg, intra-prediction and inter-prediction) and / or reconstructions for processing, ie, coding, of subsequent blocks.

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

[0034] 1A is a schematic block diagram illustrating an example coding system 10, such as video coding system 10 (or coding system 10 for short), that can 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 example devices that can be configured to perform the techniques according to various examples described herein.

[0035] As shown in FIG. 1A, coding system 10 includes a source device 12 configured to provide encoded picture data 21 to a destination device 14, for example, which decodes 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 pre-processor (or pre-processing unit) 18 , for example a picture pre-processor 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 also be any kind of memory or storage that stores any of the above pictures.

[0038] In distinction to the pre-processor 18 and the processing performed by the pre-processing unit 18 , the picture or picture data 17 may be referred to as raw picture or raw 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 include, 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] A video encoder 20 is configured to receive the pre-processed picture data 19 and to provide encoded picture data 21 (as described in further detail below, eg, with reference to FIG. 2).

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

[0042] The destination device 14 has a decoder 30 (e.g., a video decoder 30) and may additionally, or optionally, have a communications interface or 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 a further processed version thereof), e.g. directly from the source device 12, or from any other source, e.g. a storage device, e.g. an encoded picture data storage device, and to provide the encoded picture data 21 to a decoder 30.

[0044] Communications interface 22 and communications interface 28 may be configured to transmit or receive encoded picture data 21 or encoded data 13 via a direct communications link between source device 12 and 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., into packets, and / or process the encoded picture data using any type of transmission encoding or processing for transmission over a communications link or network.

[0046] The counterpart of the communication interface 22, the communication interface 28, 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 unpackaging to obtain the 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 pointing from source device 12 to destination device 14 in FIG. 1A, or as bidirectional communication interfaces, and may be configured, for example, to send and receive messages, for example, to set up a connection, to receive, acknowledge and exchange a communication link and / or any other information related to a data transmission, for example, an encoded picture data transmission.

[0048] The decoder 30 is configured to receive the encoded picture data 21 and to provide decoded picture data 31 or a decoded picture 31 (further details are described below, e.g. with reference to FIG. 3 or FIG. 5).

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

[0050] A display device 34 of the destination device 14 is configured to receive the post-processed picture data 33 for displaying the picture, e.g., to a user or viewer. The display device 34 may be or include any type of display for presenting the reconstructed picture, e.g., an integrated or external display or monitor. The display may include, 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, an embodiment of the devices may include both or both functionality, source device 12 or corresponding functionality and destination device 14 or corresponding functionality. In such an embodiment, source device 12 or corresponding functionality and destination device 14 or corresponding functionality may be implemented using the same hardware and / or software or by separate hardware and / or software or any combination thereof.

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

[0053] The encoder 20 (e.g., video encoder 20), or the decoder 30 (e.g., video decoder 30), or both the encoder 20 and the decoder 30, may be implemented via processing circuitry as shown in FIG. 1B, e.g., 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. The encoder 20 may be implemented via processing circuitry 46 to embody various modules discussed with respect to the encoder 20 of FIG. 2 and / or any other encoder system or subsystem described herein. The decoder 30 may be implemented via processing circuitry 46 to embody various modules discussed with respect to the 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 described below. As shown in FIG. 5. If the techniques are implemented partially in software, an apparatus 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 or video decoder 30 may also be integrated within a single device as part of a combined encoder / decoder (codec), for example as shown in FIG. 1B.

[0054] The source device 12 and destination device 14 may include 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 smart phone, 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 a content delivery server), a broadcast receiver device, a broadcast transmitter device, and the like, and may use no operating system or any type of operating system.

[0055] In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices. In some cases, video coding system 10 shown in FIG. 1A is merely an example, and the techniques of the present application may be applied to video coding scenarios (e.g., video encoding or video decoding) that do not necessarily involve data communication between an encoding device and a decoding device. In other examples, data may be retrieved from local memory, streamed over a network, etc. 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 description, embodiments of the present invention are described herein with reference to, for example, High Efficiency Video Coding (HEVC) or Versatile Video Coding (VVC) reference software, the next generation video coding standards developed by the ITU-T Video Coding Experts Group (VCEG) and the ISO / IEC Motion Picture Experts Group (MPEG) Joint Collaboration Team on Video Coding (JCT-VC). Those skilled in the art will appreciate that embodiments of the present invention are not limited to HEVC or VVC.

[0057] Encoders and encoding methods FIG. 2 shows 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 has 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 partition division unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). The video encoder 20 shown in FIG. 2 may be referred to as a hybrid video encoder or a video encoder with 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. The backward signal path of the video encoder 20 corresponds to the signal path of the decoder (see video decoder 30 of 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 may also be referred to as forming an “embedded decoder” of the video encoder 20.

[0059] Picture and Picture Partitioning (Picture and Block) The encoder 20 may be configured to receive, for example, via an input 201, a picture 17 (or picture data 17), for example a picture of a sequence of pictures forming a video or a video sequence. The received picture or picture data may be a preprocessed picture 19 (or preprocessed picture data 19). For simplicity, the following description refers to the picture 17. The picture 17 may also be referred to as a current picture or a picture to be coded (particularly in video coding, to distinguish the current picture from other pictures, for example previously encoded and / or decoded pictures of the same video sequence, i.e. a video sequence that also includes the current picture).

[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 be called pixels (short for picture element) or picture elements. 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, typically three color components are used; that is, a picture is represented by or can contain three sample arrays. In an RBG format or color space, a picture contains 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, e.g. YCbCr, which contains a luminance component denoted Y (sometimes L is used instead) and two chrominance components denoted Cb and Cr. The luminance (or luma for short) component Y represents the 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 the chromaticity or color information components. Thus, a picture in YCbCr format contains 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 can be converted or transformed into YCbCr format and vice versa. This process is also known as color conversion or transformation. If the picture is monochrome, the picture may contain only a luminance sample array. Thus, a picture can be 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, for example.

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

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

[0063] Similar to the picture 17, the picture block 203 is or can be considered as a two-dimensional array or matrix of samples with intensity values ​​(sample values), albeit with smaller dimensions than the picture 17. In other words, the block 203 can contain, 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 array and two chroma arrays in the case of a color picture 17), or any other number and / or type of arrays depending on the color format applied. The number of samples in the horizontal and vertical directions (or axes) of the block 203 defines the size of the block 203. Thus, the block may be, for example, an M×N (M columns×N rows) array of samples, or an M×N array of transform coefficients.

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

[0065] 2 may be further configured to partition and / or encode pictures using slices (also referred to as video slices), where a picture may be partitioned into or encoded using one or more slices (typically non-overlapping), each of which may include one or more blocks (e.g., CTUs).

[0066] 2 may be further configured to partition and / or encode a picture 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 or encoded using one or more tile groups (typically non-overlapping), each of which may include, for example, one or more blocks (e.g., CTUs) or one or more tiles. Each tile may be, for example, rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., full or partial blocks.

[0067] Residual calculation The residual calculation unit 204 may be configured to calculate a residual block 205 (also referred to as residual 205) based on the picture block 203 and a prediction block 265 (further details about the prediction block 265 will be described later), for example by sample-by-sample (pixel-by-pixel) subtraction of sample values ​​of the prediction block 265 from sample values ​​of the picture block 203 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), to the sample values ​​of the residual block 205 to obtain transform coefficients 207 in the transform domain. The transform coefficients 207 may be referred to as transform residual coefficients and 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. In order to preserve 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 selected based on certain constraints, such as the scaling factor being a power of two for shift operations, the bit depth of the transform coefficients, a trade-off between accuracy and implementation cost, etc. A specific scaling factor may be specified, for example, for the inverse transform, for example by the inverse transform processing unit 212 (and the corresponding inverse transform, for example by the inverse transform processing unit 312 in the video decoder 30), and a corresponding scaling factor for the forward transform, for example by the transform processing unit 206 in the encoder 20, may be specified accordingly.

[0070] An embodiment of video encoder 20 (and individually transform processing unit 206) may be configured to output transform parameters, e.g., one or more types of transform, e.g., directly or encoded or compressed 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, which 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 rounded 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 sizes may be indicated by the quantization parameter (QP). The quantization parameter may, for example, be an index to 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 include a division by the quantization step size, and corresponding and / or inverse dequantization, e.g., by the inverse quantization unit 210, may include a multiplication by the quantization step size. Some standards, e.g., HEVC, embodiments may be configured to use a quantization parameter to determine the quantization step size. In general, the quantization step size may be calculated based on the quantization parameter using a fixed-point approximation of an equation that includes a division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block that may be modified due to the scaling used in the fixed-point approximation of the equation for the quantization parameter and the quantization step size. In one example implementation, the scaling of the inverse transform and the 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] An embodiment of video encoder 20 (and specifically quantization unit 208) may be configured to output a quantization parameter (QP), e.g., directly or encoded via entropy encoding unit 270, so that video decoder 30, for example, can 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 to the quantized coefficients, 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, to obtain dequantized coefficients 211. The dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211, and correspond to transform coefficients 207, although they are typically not identical to the transform coefficients due to losses due to quantization.

[0075] Reverse 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 (or corresponding dequantized coefficients 213) in the sample domain. 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, e.g., by adding sample values ​​of the reconstructed residual block 213 and 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 in general, 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 include one or more loop filters, such as a deblocking filter, a sample adaptive offset (SAO) filter, or one or more other filters, such as a bilateral filter, an adaptive loop filter (ALF), a sharpening filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is illustrated as an in-loop filter in FIG. 2, 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 (and individually 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, so that, for example, decoder 30 can receive and apply the same loop filter parameters or respective loop filters for decoding.

[0079] Decode Picture Buffer The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures or, in general, reference picture data for encoding video data by the video encoder 20. The DPB 230 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may further be configured to store other previously filtered blocks, e.g., previously reconstructed and filtered blocks 221, of the same current picture or of a different picture, e.g., a previously reconstructed picture, and may provide a complete previously reconstructed, i.e., decoded 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. The decoded picture buffer (DPB) 230 may be configured to store one or more unfiltered reconstructed blocks 215, for example if the reconstructed blocks 215 are not filtered by the loop filter unit 220, or unfiltered reconstructed samples in general, or any other further processed version of the reconstructed blocks or samples.

[0080] Mode Selection (Partitioning and Prediction) The mode selection unit 260 has 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 a decoded picture buffer 230 or other buffer (e.g., line buffer, not shown). The reconstructed picture data is used as reference picture data for prediction, e.g., inter prediction or intra prediction, to obtain a prediction block 265 or predictor 265.

[0081] The mode selection unit 260 may be configured to determine or select a partitioning (including no partitioning) and a prediction mode (e.g., intra or inter prediction mode) for the current block prediction mode and generate a corresponding prediction block 265 used for calculation of the residual block 205 and reconstruction of the reconstruction block 215.

[0082] An embodiment of the mode selection unit 260 may be configured to select a partitioning and prediction mode (e.g., from those supported by or available to the mode selection unit 260) that provides the best match, i.e., 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 partitioning and prediction mode based on rate-distortion optimization (RDO), i.e., to select the prediction mode that provides the smallest rate-distortion. Terms such as “best”, “minimum”, “optimum”, etc. in this context do not necessarily refer to an overall “best”, “minimum”, “optimum”, etc., but may also refer to the termination, or achievement of a selection criterion, such as a value above or below a threshold, or other constraint, potentially leading to a “non-optimal 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 still constitute blocks), e.g., using quad-tree partitioning (QT), binary partitioning (BT) or ternary tree partitioning (TT) or any combination thereof iteratively, and to perform, e.g., prediction on each of the block partitions or sub-blocks, where the mode selection includes 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] The partitioning (eg, by partitioning unit 260) and prediction processes (eg, by inter prediction unit 244 and intra prediction unit 254) performed by exemplary video encoder 20 are described in more detail below.

[0085] Partitioning The partitioning unit 262 may partition (or split) 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, where e.g., 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 a 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 a next, lower level, e.g., tree level 2 (hierarchical level 2, depth 2), and so on, until the partitioning is terminated because a termination criterion is met, e.g., a maximum tree depth or a minimum block size is reached. Blocks that are not further partitioned are also called leaf blocks or leaf nodes of the tree. A tree that uses a partitioning into two partitions is called a binary tree (BT), a tree that uses a partitioning into three partitions is called a ternary tree (TT), and a tree that uses a partitioning into four partitions is called a quad tree (QT).

[0086] As mentioned above, the term "block" as used herein may refer to a portion of a picture, particularly a square or rectangular portion. With reference to HEVC and VVC, for example, 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 may include 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 picture coded using three separate color planes and syntax structures used to code a monochrome picture or sample. Correspondingly, a coding tree block (CTB) may be an N×N block of samples for some value of N such that the division of a component into CTBs is a partition division. A coding unit (CU) may be or may include 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 picture coded using three separate color planes and syntax structures used to code a monochrome picture or sample. Correspondingly, a coding block (CB) may be an M×N block of samples for some value of M and N such that the division of a CTB into coding blocks is a partition division.

[0088] In an embodiment, for example according to HEVC, a coding tree unit (CTU) may be divided into CUs by using a quadtree structure, denoted as coding tree. The decision of whether to code a picture region using inter-picture (temporal) or intra-picture (spatial) prediction is made at the CU level. Each CU can 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 a residual block by applying a prediction process based on the PU partition type, the CU can be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU.

[0089] In an embodiment, according to the latest video coding standard currently under development, for example referred to as Versatile Video Coding (VVC), a combined quad-tree and binary tree (QTBT) partitioning is used to partition, for example, coding blocks. In the QTBT block structure, the CUs can have either a square or rectangular shape. For example, a coding tree unit (CTU) is first partitioned by a quad-tree structure. The quad-tree leaf nodes are further partitioned by a binary or ternary tree (or tri-probe) structure. The partitioning tree leaf nodes are called coding units (CUs), and their segmentation is used for prediction and transform processing without further partitioning. This means that in the QTBT coding block structure, CUs, PUs, and TUs have the same block size. In parallel, multi-partitioning, for example ternary tree partitioning, may also be used together with the QTBT block structure.

[0090] In one example, mode selection 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 may be configured to determine or select a best or optimal prediction mode from a (e.g., predetermined) set of prediction modes, which may include, for example, intra-prediction modes and / or inter-prediction modes.

[0092] Intra prediction The set of intra prediction modes may include, for example, 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 include, for example, 67 different intra prediction modes, e.g., non-directional modes such as DC (or average) mode and planar mode, or directional modes, as defined in 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 from a set of intra prediction modes.

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

[0095] Inter Prediction The set (or possible) inter prediction modes depend on available reference pictures (i.e., previous, at least partially decoded pictures, e.g., stored in DBP 230) and other inter prediction parameters, such as whether the entire reference picture is used to look for the best matching reference block or only a portion of the reference picture is used, e.g., a search window area around that region of the current block, and / or whether pixel interpolation, e.g., half / semi-pixel and / or quarter-pixel 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 (neither of which is shown in FIG. 2). The motion estimation unit may be configured to receive or obtain the picture block 203 (current picture block 203 of current picture 17) and the 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 include 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 forming 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 ones of 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 as an inter-prediction parameter to the motion estimation unit, this offset also being 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 with the inter prediction parameters to obtain an inter prediction block 265. The motion compensation performed by the motion compensation unit may include performing interpolation, possibly to sub-pixel accuracy, based on the motion / block vectors determined by motion estimation to fetch or generate a prediction block. Interpolation filtering may generate additional pixel samples from known pixel samples, thus potentially increasing the number of candidate prediction 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 prediction block to which the motion vector points in one of the reference picture lists.

[0100] The motion compensation unit may also generate syntax elements relating to 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 the 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, for example, apply 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 other entropy encoding method or technique) or bypass (non-compression) to 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. The encoded picture data 21 can be output via an output 272, for example in the form of an encoded bitstream 21, so that, for example, the video decoder 30 can receive and use those parameters for decoding. The encoded bitstream 21 can be transmitted to the video decoder 30 or stored in a memory for later transmission or retrieval by the video decoder 30.

[0102] Other structural variations of the video encoder 20 may be used to encode the video stream. For example, a non-transform-based encoder 20 may quantize the residual signal directly for certain blocks or frames without the transform processing unit 206. In another implementation, the encoder 20 may 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), e.g., encoded by encoder 20, to obtain a decoded picture 331. The encoded picture data or bitstream includes information for decoding the encoded picture data, e.g., data representing picture blocks and associated syntax elements of an encoded video slice (and / or tile group or tile).

[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, a decoded picture buffer (DBP) 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. The video decoder 30, in some examples, may perform a decoding path that is generally inverse to the encoding path described with respect to the 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 an “embedded decoder” of video encoder 20. Thus, inverse quantization unit 310 may be functionally identical to inverse quantization unit 110, inverse transform processing unit 312 may be functionally identical to inverse transform processing unit 212, reconstruction unit 314 may be functionally identical to reconstruction unit 214, loop filter 320 may be functionally identical to loop filter 220, and decoded picture buffer 330 may be functionally identical to decoded picture buffer 230. Thus, the descriptions provided for the respective units and functions of video encoder 20 correspondingly apply 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 generally, the encoded picture data 21) and, for example, perform entropy decoding on the encoded picture data 21 to obtain, for example, quantized coefficients 309 and / or decoded coding parameters (not shown in FIG. 3 ), for example, any or all of inter prediction parameters (e.g., reference picture indexes 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 the encoding schemes mentioned 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. Video decoder 30 may receive syntax elements at the video slice level and / or the 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, in general, 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 based on the quantization parameter to the decoded quantized coefficients 309 to obtain dequantized coefficients 311. The dequantized coefficients 311 may also be referred to as transform coefficients 311. The inverse quantization process may use the 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] Reverse 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 a reconstructed residual block 213 in the sample domain. The reconstructed residual block 213 may also be referred to as a 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 to obtain a reconstructed block 315 in the sample domain, e.g., by adding sample values ​​of the reconstructed residual block 313 and the prediction block 365.

[0110] filtering Loop filter unit 320 (in coding loop or post 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 include 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 illustrated as an in-loop filter in FIG. 3, in other configurations loop filter unit 320 may be implemented as a post-loop filter.

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

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

[0113] prediction The inter prediction unit 344 may be identical to the inter prediction unit 244 (in particular the motion compensation unit), and the intra prediction unit 354 may be identical in function to the inter prediction unit 254 and performs the partitioning or partitioning decision and prediction based on partitioning and / or prediction parameters or respective information received (e.g. by parsing and / or decoding, e.g. by the entropy decoding unit 304) from the encoded picture data 21. The mode application unit 360 may be configured to perform block-wise prediction (intra prediction or inter prediction) based on the reconstructed picture, block or respective sample (filtered or unfiltered) 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 a prediction 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 generate a prediction block 365 for a video block of the current video slice based on the motion vector and other syntax elements received from entropy decode unit 304. For inter prediction, the prediction block may be generated 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 for or by 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). For example, 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 the current video slice by parsing the motion vectors or related information and other syntax elements, and use the prediction information to generate a prediction block for the current video block to be decoded. For example, mode application unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra prediction or inter prediction) used to code the video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for the slice, motion vectors for each inter encoded video block of the slice, inter prediction status for each inter coded video block of the slice, and other information for decoding video blocks in the current video slice. The same or similar may apply for or by embodiments that use tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or instead of slices (e.g., video slices). For example, video may be coded using I, P or B tile groups and / or tiles.

[0116] 3 may be configured to partition and / or decode pictures using slices (also referred to as video slices), where a picture may be partitioned into or decoded using one or more slices (typically non-overlapping), each of which may include one or more blocks (e.g., CTUs).

[0117] 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 tile groups (typically non-overlapping), each of which may be, for example, rectangular in shape and may contain one or more blocks (e.g., CTUs), e.g., full or partial 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 generate 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 certain blocks or frames without the inverse transform processing unit 312. In another embodiment, 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 in the encoder 20 and the decoder 30, the processing result of the current step may be further processed and then output to the next step. For example, after the interpolation filtering, the motion vector derivation, or the loop filtering, further operations such as clipping or shifting may be performed on the processing result of the interpolation filtering, the motion vector derivation, or the 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, ATMVP modes, temporal motion vectors, etc.). For example, the value of the motion vector is constrained to a predefined range according to its representation bits. If the representation bits of the motion vector are bitDepth, the range is -2^(bitDepth-1) to 2^(bitDepth-1)-1. 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 the derived motion vector (e.g., MVs of four 4x4 sub-blocks in one 8x8 block) is constrained such that the maximum difference between the integer parts of the four 4x4 sub-block MVs is less than or equal to N pixels, e.g., less than or equal to 1 pixel. Here we provide two methods for constraining motion vectors according to bitDepth.

[0121] Method 1: Remove the overflow MSB (Most Significant Bit) using flow arithmetic

number

number

[0122] Method 2: Remove the overflow MSB by clipping the value.

number

number

[0123] 4 is a schematic diagram of a video coding apparatus 400 according to an embodiment of the present disclosure. The video coding apparatus 400 is suitable for implementing the disclosed embodiments described herein. In an embodiment, the video coding apparatus 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.

[0124] The video coding device 400 includes 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 data; and a memory 460 for storing data. The video coding device 400 may also have optical-to-electrical (OE) and electrical-to-optical (EO) components coupled to the ingress port 410, receiver unit 420, transmitter unit 440, and egress port 450 for entering and leaving optical or electrical signals.

[0125] The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGA, ASIC, and DSP. The processor 430 communicates with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460. The processor 430 has a coding module 470. The coding module 470 implements the above disclosed embodiments. For example, the coding module 470 implements, processes, prepares, or provides various coding operations. Thus, the inclusion of the coding module 470 substantially improves the functionality of the video coding device 400 and realizes 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.

[0126] Memory 460 may include one or more disks, tape drives, and solid state drives, may be used as overflow data storage, may store programs when the programs are selected for execution, and may store 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).

[0127] FIG. 5 is a simplified block diagram of a device 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.

[0128] The processor 502 in the device 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 that are capable of manipulating or processing information. Although the disclosed implementations can be practiced using a single processor as shown, such as processor 502, advantages in speed and efficiency can be achieved using multiple processors.

[0129] The memory 504 in the device 500 may be a read-only memory (ROM) device or a random access memory (RAM) device in some implementations. 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 allows the processor 502 to perform the methods described herein. For example, the application programs 510 may include applications 1-N, which further include a video coding application that performs the methods described herein.

[0130] The device 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.

[0131] Although shown 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 include 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.

[0132] Background Intra-Prediction Mode Coding In the current VTM 4.0, a 6-MPM (Most Probable Modes) list is constructed for intra prediction mode coding. The MPM list is introduced to reduce the bits required to code the intra prediction mode of the current block. The 6-MPM list is constructed based on the intra prediction modes of the neighboring blocks of the current block. If the intra prediction mode of the current block falls in the MPM list, an index is coded instead of the actual mode, which allows using fewer bits. If the intra prediction mode of the current block does not fall in the MPM list, truncated binarization is used to code the intra prediction mode of the current block. The MPM list provides a good prediction of the intra prediction mode of the current block.

[0133] MPM List for Multiple Reference Lines (MRL) In VTM 4.0, the Multiple Reference Line (MRL) coding tool can use one of several neighboring reference lines to predict samples of the current block. If the value of the MRL line index is equal to 0 (i.e., the nearest neighboring reference line, i.e., reference line 0, is used as shown in Figure 6), the regular 6-MPM list including planes and DC is used. If the value of the MRL line index is not equal to 0, the 6-MPM list excluding planes (i.e., value of 0) and DC (i.e., value of 1) is used.

[0134] MPM List for Intra-Subpartition Coding Mode (ISP) The intra sub-partition (ISP) coding mode is a new tool in VTM4.0 (JVET-M0102). The luma intra prediction block is divided into two or four sub-partitions vertically or horizontally depending on the block size dimension, as shown in Table 1. Figures 7 and 8 show examples of two possibilities. All sub-partitions satisfy the condition that they have at least 16 samples. [Table 1]

[0135] When intra subpartition coding mode is enabled, VTM 4.0 uses a different MPM list than DC mode. When the value of Multiple Reference Line Index is equal to 0 (i.e., MRL does not apply to the current intra prediction block), intra subpartition mode can be applied. Since all subpartitions share a single intra prediction mode, the MPM list is built once for the intra block and shared by all subpartitions.

[0136] The construction of MPM may depend on the partition mode of ISP. Two partition modes are determined: horizontal or vertical. They are shown as in Figure 7 and Figure 8, where horizontal partition / partition is shown on top and vertical partition / partition is shown on bottom.

[0137] Table 2 below summarizes the characteristics of the 3MPM list used in VTM 4.0. [Table 2]

[0138] Background on CABAC Context Modeling / Coding As shown in Figure 9, CABAC coding consists of binarization, context modeling, and binary arithmetic coding. Binarization maps syntax elements to binary symbols (bins). Context modeling estimates the probability of each non-bypassed (i.e., normally coded) bin based on some specific context. Finally, binary arithmetic coding compresses the bins into bits according to the estimated probabilities.

[0139] By decomposing each non-binary syntax element value into a sequence of bins, the further processing of each bin value in CABAC depends on the associated coding mode decision, which can be selected as normal mode or bypass mode. The latter bypass mode is chosen for bins that are assumed to be uniformly distributed, so that for those bins, the entire normal binary arithmetic encoding (and decoding) process is simply bypassed. In the normal coding mode, each bin value is encoded using a normal binary arithmetic coding engine. Here, the associated probability model is determined by a fixed selection based on the type of syntax element and the bin position or bin index (binIdx) in the binarized representation of the syntax element, or is adaptively selected from two or more probability models depending on the relevant side information.

[0140] The selection of a probabilistic model is called context modeling. Each probabilistic model in CABAC is addressed by a unique context index (ctxIdx), which is either determined by a fixed assignment or calculated by a context derivation logic, thereby specifying a given context model.

[0141] Some background on how to determine the left and top neighbors The intra prediction mode coding of VVC depends on the intra prediction mode of its neighboring blocks, i.e., the blocks to the left and above the current block. Their positions are shown in Figure 10.

[0142] MPM index signaling A flag (i.e., MPM flag) is used to indicate whether the intra prediction mode of the current block is in the MPM list. If the MPM flag is true (i.e., a value of 1), the intra prediction mode can be determined using the MPM index. The MPM index is coded using a truncated unary code as shown in Table 3 below when the length of the MPM list is 6. If the MPM flag is not true, the intra prediction mode of the current block is not in the MPM list and the mode is coded using a truncated binary code. Another example of an MPM index when the MPM list is configured with five modes is shown in Table 4. The bin string for the coding index is called a truncated unary code (not a truncated binary code for coding non-MPM modes). Note that for the truncated unary code, bin 0 and bin 1 are interchangeable without loss of generality. In one example, the MPM index when the MPM list is configured with five modes can also be coded as shown in Table 5.

[0143] [Table 3] [Table 4] [Table 5]

[0144] Background on planar, DC, horizontal, vertical, and angular modes: Intra prediction modes, planar (value of 0) and DC (value of 1). The other intra prediction modes are called angular prediction modes.

[0145] In VTM 4.0, the following syntax design, as shown in Table 6, is used to signal intra-prediction mode information. [Table 6]

[0146] intra_luma_ref_idx[x0][y0] can have three values: 0, 1, or 2, indicating which reference line is used. If intra_luma_ref_idx[x0][y0] is not present, it is inferred to be equal to 0. intra_subpartitions_mode_flag[x0][y0] equal to 1 specifies that the current intra-coded unit is further partitioned (i.e., ISP mode is enabled). intra_subpartitions_mode_flag[x0][y0] equal to 0 specifies that the current intra-coded unit is not partitioned into subpartitions into rectangular transform blocks. If intra_subpartitions_mode_flag[x0][y0] is not present, it is inferred to be equal to 0. The syntax elements intra_luma_mpm_flag[x0][y0], intra_luma_mpm_idx[x0][y0], and intra_luma_mpm_remainder[x0][y0] specify the intra prediction mode for luma samples. intra_luma_mpm_flag[x0][y0] indicates whether the intra prediction mode of the current block is derived from the MPM list. If the value of intra_luma_mpm_flag[x0][y0] is 1, it indicates that the intra prediction mode of the current block is derived from the MPM list, and if the value of intra_luma_mpm_flag[x0][y0] is 0, it indicates that the intra prediction mode of the current block is not derived from the MPM list. If intra_luma_mpm_flag[x0][y0] is not present, it is inferred to be equal to 1. intra_luma_mpm_flag[x0][y0] corresponds to the MPM flag in Table 3. The intra_luma_mpm_idx corresponds to the MPM index in Table 3 and uses the unary code truncated as shown in Table 3. The intra_luma_mpm_remainder represents the truncated binary code of the modes not in the MPM list.

[0147] In embodiment 1, syntax elements intra_luma_planar_flag and ctx are disclosed.

[0148] According to an embodiment of the present invention, a flag intra_luma_planar_flag is introduced. If the value of intra_luma_mpm_flag is true (e.g., its value is 1), the decoder parses intra_luma_planar_flag to determine whether the intra prediction mode of the current block is planar mode or not. If the value of intra_luma_planar_flag is 1, the intra prediction mode of the current block is planar mode. If the value of intra_luma_planar_flag is 0, the intra prediction mode of the current block is not planar mode. If intra_luma_planar_flag is not present (e.g., if intra_luma_mpm_flag is equal to 0, this flag cannot be parsed from the bitstream), the value of intra_luma_planar_flag is inferred to be 0.

[0149] If written in the style of the VVC working draft specification, the intra prediction mode of the current block IntraPredModeY[xCb][yCb] is derived by applying the following steps: - if intra_luma_mpm_flag[xCb][yCb] is equal to 1, - if intra_luma_planar_flag[xCb][yCb] is equal to 1, intraPredModeY[xCb][yCb] is set equal to INTRA_PLANAR - Otherwise, IntraPredModeY[xCb][yCb] is set equal to candModeList[intra_luma_mpm_idx[xCb][yCb]].

[0150] If the intra prediction mode is not a planar mode (ie, the value of intra_luma_planar_flag is 0), the decoder further parses the syntax element intra_luma_mpm_idx.

[0151] In one example, the value of intra_luma_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder uses the context to parse the flag based on whether the current block is a normal intra block or not.

[0152] In one example, the value of intra_luma_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is an intra block with multiple reference lines (MRL) enabled.

[0153] In one example, the value of intra_luma_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder decodes the flag using a context based on whether the current block is an intra block with intra sub-partition (ISP) coding mode enabled.

[0154] In one example, the position of the intra_luma_planar_flag is arranged as shown in Table 7. [Table 7]

[0155] Embodiment 2: intra_luma_not_planar_flag and ctx According to one embodiment of the present invention, the syntax element intra_luma_not_planar_flag is introduced.

[0156] If the value of intra_luma_mpm_flag is true (e.g., its value is 1), the decoder parses intra_luma_not_planar_flag to determine whether the intra prediction mode of the current block is planar mode. If the value of intra_luma_not_planar_flag is 1, the intra prediction mode of the current block is not planar mode, and if the value of intra_luma_not_planar_flag is 0, the intra prediction mode of the current block is planar mode. If intra_luma_not_planar_flag is not present in the bitstream, the value of intra_luma_not_planar_flag is inferred to be 1. In one example, the position of intra_luma_not_planar_flag is arranged as shown in Table 8.

[0157] If the intra prediction mode of the current block is not a planar mode (ie, the value of intra_luma_not_planar_flag is 1), the decoder further parses the syntax element intra_luma_mpm_idx.

[0158] If written in the style of the VVC Working Draft Specification, the intra prediction mode of the current block IntraPredModeY[xCb][yCb] is derived by applying the following steps: - if intra_luma_mpm_flag[xCb][yCb] is equal to 1, - if intra_luma_not_planar_flag[xCb][yCb] is equal to 0, intraPredModeY[xCb][yCb] is set equal to INTRA_PLANAR - Otherwise, IntraPredModeY[xCb][yCb] is set equal to candModeList[intra_luma_mpm_idx[xCb][yCb]].

[0159] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is a normal intra block or not.

[0160] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is an intra block with multiple reference lines (MRL) enabled.

[0161] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is an intra block with intra sub-partition (ISP) coding mode enabled. [Table 8]

[0162] Embodiment 3: intra_luma_planar_flag and MRL, and bypass decoding According to one embodiment of the invention, a flag intra_luma_planar_flag is introduced.

[0163] If the value of intra_luma_mpm_flag is true (for example, its value is 1), the decoder parses whether the value of the reference index line (intra_luma_ref_idx) is 0 or not. If the value of the reference index line is 0, the value of intra_luma_planar_flag is parsed to determine whether the intra prediction mode of the current block is planar mode or not. If the value of intra_luma_planar_flag is 1, the intra prediction mode of the current block is planar mode. If the value of intra_luma_planar_flag is 0, the intra prediction mode of the current block is not planar mode. If intra_luma_planar_flag is not present, the value of intra_luma_planar_flag is inferred to be 0.

[0164] If the intra prediction mode of the current block is not planar (i.e., the value of intra_luma_planar_flag is 0), the decoder further parses intra_luma_mpm_idx.

[0165] In one example, the value of intra_luma_planar_flag is CABAC bypass coded (i.e., not CABAC context coded), and the decoder parses the flag without using any CABAC context.

[0166] The position of intra_luma_planar_flag is as shown in Table 9. [Table 9]

[0167] Embodiment 4: intra_luma_not_planar_flag and MRL, and bypass decoding According to an embodiment of the present invention, a flag intra_luma_not_planar_flag is introduced. If the value of intra_luma_mpm_flag is true (e.g., its value is 1), the decoder parses whether the value of the reference index line is 0 or not. If the value of the reference index line is 0, intra_luma_not_planar_flag is parsed to determine whether the intra prediction mode of the current block is a planar mode or not. If the value of intra_luma_not_planar_flag is 1, the intra prediction mode of the current block is not a planar mode. If the value of intra_luma_planar_flag is 0, the intra prediction mode of the current block is a planar mode. If intra_luma_not_planar_flag is not present, the value of intra_luma_not_planar_flag is inferred to be 1.

[0168] If the intra prediction mode of the current block is not a planar mode (ie, the value of intra_luma_not_planar_flag is 1), the decoder further parses intra_luma_mpm_idx.

[0169] In one example, the value of intra_luma_not_planar_flag is CABAC bypass coded (i.e., not CABAC context coded) and the decoder parses the flag without using any CABAC context.

[0170] The position of intra_not_luma_planar_flag is as shown in Table 10. [Table 10]

[0171] Embodiment 5: intra_luma_not_planar_flag, MRL, and CABAC context type coded (the difference from embodiment 4 is that intra_luma_not_planar_flag is not bypass coded but is CABAC context type coded).

[0172] According to one embodiment of the invention, a flag intra_luma_not_planar_flag is introduced.

[0173] The decoder parses the value indicating the reference line index used. If the value of the reference index line is 0, the decoder parses the value of intra_luma_mpm_flag. If the value of intra_luma_mpm_flag is true (e.g., its value is 1), the decoder checks whether the value of the reference index line is 0 or not. If the value of the reference index line is 0, the intra_luma_not_planar_flag is parsed to determine whether the intra prediction mode of the current block is planar mode or not. If the value of intra_luma_not_planar_flag is 1, the intra prediction mode of the current block is not planar mode. If the value of intra_luma_not_planar_flag is 0, the intra prediction mode of the current block is planar mode. If intra_luma_not_planar_flag is not present, the value of intra_luma_not_planar_flag is inferred to be 1.

[0174] If the intra prediction mode of the current block is not planar (ie, the value of intra_luma_not_planar_flag is 1), the decoder further parses intra_luma_mpm_idx.

[0175] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is a normal intra block or not.

[0176] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is an intra block with multiple reference lines (MRL) enabled.

[0177] In one example, the value of intra_luma_not_planar_flag is CABAC context coded (i.e., not CABAC bypass coded) and the decoder parses the flag using a context based on whether the current block is an intra block with intra sub-partition (ISP) coding mode enabled.

[0178] The position of intra_not_luma_planar_flag is as shown in Table 11. [Table 11]

[0179] If intra_luma_not_planar_flag[x0][y0] is not present, it is inferred to be equal to 1.

[0180] Table 12 below shows an example of the assignment of ctxInc to syntax elements with context-coded bins. [Table 12]

[0181] In one embodiment, the MPM list is constructed according to the following process.

[0182] 8.4.2 Luma Intra Prediction Mode Derivation Process The inputs to this process are: - a luma position (xCb, yCb) that specifies the top-left sample of the current luma coding block relative to the top-left luma sample of the current picture, - the variable cbWidth, which specifies the width of the current coding block in luma samples; - Variable cbHeight that specifies the height of the current coding block in luma samples.

[0183] In this process, the luma intra prediction mode IntraPredModeY[xCb][yCb] is derived.

[0184] Table 13 specifies values ​​and associated names for the intra prediction modes IntraPredModeY[xCb][yCb]. [Table 13] NOTE: INTRA_LT_CCLM, INTRA_L_CCLM and INTRA_T_CCLM are only applicable to chroma components.

[0185] IntraPredModeY[xCb][yCb] is derived as follows: - If intra_luma_not_planar_flag[xCb][yCb] is equal to 1, the following ordered steps are applied:

[0186] 1. The neighborhood positions (xNbA, yNbA) and (xNbB, yNbB) are set equal to (xCb-1, yCb+cbHeight-1) and (xCb+cbWidth-1, yCb-1), respectively.

[0187] 2. When X is replaced by either A or B, the variable candIntraPredModeX is derived as follows: - The availability derivation process for the block is called: The neighborhood block availability check process is called with the position (xCurr, yCurr) set equal to (xCb, yCb) and the neighborhood position (xNbY, yNbY) set equal to (xNbX, yNbX) as inputs, and the output is assigned to avalableX. - The candidate intra prediction mode candIntraPredModeX is derived as follows: - If one or more of the following conditions are true, candIntraPredModeX is set equal to INTRA_PLANAR - The variable availableX is equal to FALSE - CuPredMode[xNbX][yNbX] is not equal to MODE_INTRA and ciip_flag[xNbX][yNbX] is not equal to 1 - pcm_flag[xNbX][yNbX] is equal to 1 - X is equal to B and yCb - 1 is less than ((yCb >> CtbLog2SizeY) << CtbLog2SizeY) - Otherwise, candIntraPredModeX is set equal to IntraPredModeY[xNbX][yNbX]. Here, X is replaced by the neighborhood block A or B, the luma position (xCb, yCb) specifies the top - left sample of the current luma coding block relative to the top - left luma sample of the current picture, the position of neighborhood A (xNbA, yNbA) is set equal to (xCb - 1, yCb + cbHeight - 1), the position of neighborhood B (xNbB, yNbB) is set equal to (xCb + cbWidth - 1, yCb - 1), the variable cbWidth specifies the width of the current coding block, the variable cbHeight specifies the height of the current coding block in luma sample units, CuPredMode represents the current prediction mode, and SizeY represents the size of the Y component of the coding tree block.

[0188] 3. candModeList[x] for x=0..4 is derived as follows: - If candIntraPredModeB is equal to candIntraPredModeA and candIntraPredModeA is greater than INTRA_DC, then candModeList[x] for x=0..4 is derived as follows: candModeList[0]=candIntraPredModeA (8-10) candModeList[1]=2+((candIntraPredModeA+61)%64) (8-12) candModeList[2]=2+((candIntraPredModeA-1)%64) (8-13) candModeList[3]=INTRA_DC (8-11) candModeList[4]=2+((candIntraPredModeA+60)%64) (8-14) - Otherwise, if candIntraPredModeB is not equal to candIntraPredModeA, and candIntraPredModeA or candIntraPredModeB is greater than INTRA_DC, the following applies: - The variables minAB and maxAB are derived as follows: minAB=Min(candIntraPredModeA,candIntraPredModeB) (8-24) maxAB=Max(candIntraPredModeA, candIntraPredModeB) (8-25) - If both candIntraPredModeA and candIntraPredModeB are greater than INTRA_DC, candModeList[x] for x=0..4 is derived as follows: candModeList[0]=candIntraPredModeA (8-27) candModeList[1]=candIntraPredModeB (8-29) candModeList[2]=INTRA_DC (8-29) - if maxAB-minAB is in the range 2 to 62 (inclusive), the following applies: candModeList[3]=2+((maxAB+61)%64) (8-30) candModeList[4]=2+((maxAB-1)%64) (8-31) - Otherwise the following applies: candModeList[3]=2+((maxAB+60)%64) (8-32) candModeList[4]=2+((maxAB)%64) (8-33) - Otherwise (candIntraPredModeA or candIntraPredModeB is greater than INTRA_DC), candModeList[x] for x=0..4 is derived as follows: candModeList[0]=maxAB (8-65) candModeList[1]=INTRA_D (8-66) candModeList[2]=2+((maxAB+61)%64) (8-66) candModeList[3]=2+((maxAB-1)%64) (8-67) candModeList[4]=2+((maxAB+60)%64) (8-68) - Otherwise the following applies: candModeList[0]=INTRA_DC (8-71) candModeList[1]=INTRA_ANGULAR50 (8-72) candModeList[2]=INTRA_ANGULAR18 (8-73) candModeList[3]=INTRA_ANGULAR46 (8-74) candModeList[4]=INTRA_ANGULAR54 (8-75)

[0189] 4. IntraPredModeY[xCb][yCb] is derived by applying the following steps: - if intra_luma_mpm_flag[xCb][yCb] is equal to 1, IntraPredModeY[xCb][yCb] is set equal to candModeList[intra_luma_mpm_idx[xCb][yCb]]. Otherwise, IntraPredModeY[xCb][yCb] is derived by applying the following ordered steps: 1. If candModeList[i] is greater than candModeList[j] for i=0..3 and for each i, j=(i+1)..4, then both values ​​are swapped as follows: (candModeList[i],candModeList[j])=Swap(candModeList[i],candModeList[j]) (8-94) 2. IntraPredModeY[xCb][yCb] is derived by the following ordered steps: i. IntraPredModeY[xCb][yCb] is set equal to intra_luma_mpm_remainder[xCb][yCb]. ii. The value of IntraPredModeY[xCb][yCb] is incremented by 1. iii. For i equal to 0..4, if IntraPredModeY[xCb][yCb] is greater than or equal to candModeList[i], then the value of IntraPredModeY[xCb][yCb] is incremented by 1. - Otherwise (intra_luma_not_planar_flag[xCb][yCb] is equal to 0), IntraPredModeY[xCb][yCb] is set equal to INTRA_PLANAR.

[0190] The variable IntraPredModeY[x][y], where x=xCb..xCb+cbWidth-1 and y=yCb..yCb+cbHeight-1, is set equal to IntraPredModeY[xCb][yCb].

[0191] In one example, the intra prediction mode of the current block (e.g., the variable name luma_intra_mode) is neither a planar mode nor an intra prediction mode in the 5-MPM list, and its value is derived and prediction for this intra prediction mode is performed as follows: 1. The value of intra_luma_mpm_remainder is derived from the bitstream and luma_intra_mode is set to the value of intra_luma_mpm_remainder. 2. The value of IntraPredModeY[xCb][yCb] is incremented by 1. 3. For i = 0..4 (compared to each entry in the 5-MPM list), if luma_intra_mode is greater than or equal to MPM[i] (where MPM[0] is the first entry in the MPM list, MPM[1] is the second entry in the MPM list, etc.), the value of luma_intra_mode is incremented by 1. 4. Perform intra prediction using the derived intra prediction mode (luma_intra_mode) and the corresponding reference samples.

[0192] In one implementation of the above embodiments, the planar mode may be implicitly always considered to be the first entry in an implicit 6-MPM list, which consists of the planar (always the first entry) and five other modes (which can be explicitly described as a 5-MPM list).

[0193] This is because if the planar mode is always in the first position of the implicit 6-MPM list, it can be split out of the implicit MPM list and assigned a special flag (e.g., the flag intra_luma_planar_flag or the flag intra_luma_not_planar_flag) to indicate whether the intra prediction mode of the current block is planar or not.

[0194] In one example, consider introducing intra_luma_not_planar_flag[x0][y0] as a special flag indicating whether the planar mode is equal to the intra prediction mode of the current block. If so, intra_luma_not_planar_flag is set to 0, otherwise it is set to 1. In this case, the first bin of mpm_idx is equivalent to the special flag intra_luma_not_planar_flag.

[0195] If the intra prediction mode of the current block is planar, the MPM index is equal to 0 and the coded bin is 0. If the intra prediction mode of the current block is non-planar, the MPM index is not equal to 0 and the first bin of the MPM index is always equal to 1.

[0196] In one example, intra_luma_mpm_idx is coded using a truncated uni-ary (TR) code. Value TR Mpm_idx 0 0 Mpm_idx 1 10 Mpm_idx 2 110 Mpm_idx 3 1110 Mpm_idx 4 1111

[0197] According to one embodiment of the invention (non-angular branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode is not an angular mode and above_mode is not an angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (eg, N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.). MPM[1]:DC MPM[2]: Vertical mode (i.e. 50) MPM[3]: Horizontal mode (i.e. 18) MPM[4]: Vertical -4 (i.e. 46) MPM[5]: Vertical +4 (i.e. 54) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0198] According to one embodiment of the invention, (non-angular branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode is not an angular mode and above_mode is not an angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (eg, N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.). MPM[1]:DC MPM[2]: Vertical mode (i.e. 50) MPM[3]: Horizontal mode (i.e. 18) MPM[4]:66 MPM[5]:2 ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0199] According to one embodiment of the invention, (non-angular branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode is not an angular mode and above_mode is not an angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (eg, N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.). MPM[1]:DC MPM[2]: Vertical mode (i.e. 50) MPM[3]: Horizontal mode (i.e. 18) MPM[4]:2 MPM[5]:34 ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0200] According to one embodiment of the invention, (non-angular branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode is not an angular mode and above_mode is not an angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (eg, N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.). MPM[1]:DC MPM[2]: Vertical mode (i.e. 50) MPM[3]: Horizontal mode (i.e. 18) MPM[4]:66 MPM[5]:34 ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0201] According to one embodiment of the invention, (One angle branch, one angled and one non-angled): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, One of left_mode and above_mode is an angular mode, and the other is a non-angular mode. A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): We define the angle mode as ang and get it as follows: ang=left mode if left_mode is angle mode Otherwise (above mode is angle mode) ang=above mode MPM[1]:ang MPM[2]:DC MPM[3]:2+((ang+61)%64) MPM[4]:2+((ang-1)%64) MPM[5]:2+((ang+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0202] According to one embodiment of the invention, (One angle branch, one angled and one non-angled): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, One of left_mode and above_mode is an angular mode, and the other is a non-angular mode. A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): We define the angle mode as ang and get it as follows: ang=left mode if left_mode is angle mode Otherwise (above mode is angle mode) ang=above mode MPM[1]:DC MPM[2]:ang MPM[3]:2+((ang+61)%64) MPM[4]:2+((ang-1)%64) MPM[5]:2+((ang+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0203] According to one embodiment of the invention, (One angle branch, one angled and one non-angled): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, One of left_mode and above_mode is an angular mode, and the other is a non-angular mode. A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): We define the angle mode as ang and get it as follows: ang=left mode if left_mode is angle mode Otherwise (above mode is angle mode) ang=above mode MPM[1]:ang MPM[2]:2+((ang+61)%64) MPM[3]:DC MPM[4]:2+((ang-1)%64) MPM[5]:2+((ang+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0204] According to one embodiment of the invention, (One angle branch, one angled and one non-angled): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, One of left_mode and above_mode is an angular mode and the other is a non-angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): We define the angle mode as ang and get it as follows: ang=left mode if left_mode is angle mode Otherwise (above mode is angle mode) ang=above mode MPM[0]:Plane MPM[1]:ang MPM[2]:2+((ang+61)%64) MPM[3]:2+((ang-1)%64) MPM[4]:DC MPM[5]:2+((ang+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0205] According to one embodiment of the invention, (One angle branch, one angled and one non-angled): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, One of left_mode and above_mode is an angular mode and the other is a non-angular mode A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): We define the angle mode as ang and get it as follows: ang=left mode if left_mode is angle mode Otherwise (above mode is angle mode) ang=above mode MPM[1]:ang MPM[2]:2+((ang+61)%64) MPM[3]:2+((ang-1)%64) MPM[4]:2+((ang+60)%64) MPM[5]:DC ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0206] According to one embodiment of the present invention, (one angle branch, two same angle modes): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · Both left_mode and above_mode are angle modes and are the same A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]: left mode MPM[2]:2+((left mode+61)%64) MPM[3]:2+((left mode-1)%64) MPM[4]:DC MPM[5]:2+((left mode+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0207] According to one embodiment of the present invention, (one angle branch, two same angle modes): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · Both left_mode and above_mode are angle modes and are the same A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]:DC MPM[2]: left mode MPM[3]:2+((left mode+61)%64) MPM[4]:2+((left mode-1)%64) MPM[5]:2+((left mode+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0208] According to one embodiment of the present invention, (one angle branch, two same angle modes): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · Both left_mode and above_mode are angle modes and are the same A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]: left mode MPM[2]:DC MPM[3]:2+((left mode+61)%64) MPM[4]:2+((left mode-1)%64) MPM[5]:2+((left mode+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0209] According to one embodiment of the present invention, (one angle branch, two same angle modes): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · Both left_mode and above_mode are angle modes and are the same A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]: left mode MPM[2]:2+((left mode+61)%64) MPM[3]:DC MPM[4]:2+((left mode-1)%64) MPM[5]:2+((left mode+60)%64) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0210] According to one embodiment of the present invention, (one angle branch, two same angle modes): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · Both left_mode and above_mode are angle modes and are the same A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]: left mode MPM[2]:2+((left mode+61)%64) MPM[3]:2+((left mode-1)%64) MPM[4]:2+((left mode+60)%64) MPM[5]:DC ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0211] According to one embodiment of the present invention, (two angle branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode and above_mode are two different angle modes A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]:left_mode MPM[2]:above_mode MPM[3]:DC - The variables minAB and maxAB are derived as follows: minAB=Min(above_mode,left_mode) maxAB=Max(above_mode,left_mode) - if maxAB-minAB is in the range 2 to 62 (inclusive), the following applies: MPM[4]=2+((maxAB+61)%64) (8-30) MPM[5]=2+((maxAB-1)%64) (8-31) - Otherwise the following applies: MPM[4]=2+((maxAB+60)%64) (8-32) MPM[5]=2+((maxAB)%64) (8-33) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0212] According to one embodiment of the present invention, (two angle branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode and above_mode are two different angle modes A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]:above_mode MPM[2]:left_mode MPM[3]:DC - The variables minAB and maxAB are derived as follows: minAB=Min(above_mode,left_mode) maxAB=Max(above_mode,left_mode) - if maxAB-minAB is in the range 2 to 62 (inclusive), the following applies: MPM[4]=2+((maxAB+61)%64) (8-30) MPM[5]=2+((maxAB-1)%64) (8-31) - Otherwise the following applies: MPM[4]=2+((maxAB+60)%64) (8-32) MPM[5]=2+((maxAB)%64) (8-33) ● Step 6: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0213] According to one embodiment of the present invention, (two angle branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode and above_mode are two different angle modes A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]:left_mode MPM[2]:DC MPM[3]:above_mode - The variables minAB and maxAB are derived as follows: minAB=Min(above_mode,left_mode) maxAB=Max(above_mode,left_mode) - if maxAB-minAB is in the range 2 to 62 (inclusive), the following applies: MPM[4]=2+((maxAB+61)%64) (8-30) MPM[5]=2+((maxAB-1)%64) (8-31) - Otherwise the following applies: MPM[4]=2+((maxAB+60)%64) (8-32) MPM[5]=2+((maxAB)%64) (8-33) ● Step 4: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0214] According to one embodiment of the present invention, (two angle branching): ● Step 1: Obtain the intra prediction mode of the left neighboring block and the intra prediction mode of the above neighboring block according to Fig. 10. If the intra prediction mode of the neighboring block is not available (e.g., the neighboring block is outside the picture boundary or the neighboring block is inter-coded), the intra prediction mode of the neighboring block is set as planar. The intra prediction mode of the left neighboring block is denoted as left_mode, and the intra prediction mode of the above neighboring block is denoted as above_mode. ● Step 2: Determine whether the intra prediction mode of the neighboring block is an angular mode. ● Stage 3: If all of the following conditions (items in bullets) are evaluated as true, · left_mode and above_mode are two different angle modes A list of intra prediction modes is constructed containing N entries of intra prediction modes as follows (e.g., N is equal to 5, the first entry corresponds to MPM[1], the second entry corresponds to MPM[2], etc.): MPM[1]:above_mode MPM[2]:DC MPM[3]:left_mode - The variables minAB and maxAB are derived as follows: minAB=Min(above_mode,left_mode) maxAB=Max(above_mode,left_mode) - if maxAB-minAB is in the range 2 to 62 (inclusive), the following applies: MPM[4]=2+((maxAB+61)%64) (8-30) MPM[5]=2+((maxAB-1)%64) (8-31) - Otherwise the following applies: MPM[4]=2+((maxAB+60)%64) (8-32) MPM[5]=2+((maxAB)%64) (8-33) ● Step 6: Predict the current block based on its index (denoted as MPM index) and the entries in the constructed list.

[0215] In one implementation of this embodiment, N is set equal to six.

[0216] In one implementation of this embodiment, N is set equal to 6. In this case, the list of intra-prediction modes above includes the first five entries above, instead of the sixth entry.

[0217] In one implementation of this embodiment, N is set equal to 4. In this case, the list of intra-prediction modes above includes the first four entries above, instead of the fifth and sixth entries.

[0218] In one implementation of this embodiment, the list of intra prediction modes is called an MPM list.

[0219] In one implementation, the list index (MPM index) is signaled in the bitstream as an indicator. Advantageously, the MPM index can be coded with a context-adaptive entropy coder (CABAC), which may code the MPM index according to a different number of probability models (in other words, contexts).

[0220] As an example, the first bin of the codeword for mpm_index is CABAC context coded. In one example, the context is determined based on whether the current intra block applies multiple reference lines, ISP or normal intra block. A total of three contexts are created for the CABAC context of the first bin of the codeword for mpm_index.

[0221] If the MPM list includes both planar and DC modes, the MPM list that excludes the planar and DC modes from the constructed MPM list is used by the multiple reference line coding tool. In this case, the 4-MPM list is used by the intra-prediction mode coding of the multiple reference line. In one example, after the construction of the MPM list, the MPM list is {PLANAR (value of 0), DC (value of 1), VER (value of 50), HOR (value of 18), VER-4 (value of 46), VER+4 (value of 54)}, and then the 4-MPM list of {VER, HOR, VER-4, VER+4} is used by the intra-prediction mode coding when the multiple reference line is enabled.

[0222] If the MPM list includes a planar mode but not a DC mode, the MPM list that excludes the planar from the constructed MPM list is used by the multiple reference line coding tool. In this case, the 5-MPM list is used by the multiple reference line intra-prediction mode coding. In one example, the MPM list is {Planar, VER, HOR, 43, 60, 3} after the MPM list construction, and then when multiple reference lines are enabled, the 5-MPM list of {VER, HOR, 43, 60, 3} is used by the intra-prediction mode coding.

[0223] In another example, syntax modification may be required for MPM lists without DC mode. If an MPM list does not contain DC, DC mode will be used very frequently in non-MPM branches (i.e., mpm flag is false). In this case, a new syntax DC_mode is introduced. DC_mode equal to 1 indicates that the intra prediction mode of the current block is DC mode. DC_mode equal to 0 indicates that the intra prediction mode of the current block is not DC mode.

[0224] That is, the old syntax for non-MPMs is: if(mpm_flag) … else intra_mode (use TB) from, if(mpm_flag) … else DC_mode If(DC_mode==0) intra_mode (use TB) will be changed to.

[0225] The construct DC_mode can be coded using the Context Adaptive Entropy Coder (CABAC). DC_mode can be coded by CABAC according to a number of different probability models (in other words, contexts). With the introduction of DC_Mode, the maximum value for the truncated binary is 60, i.e., 67 (total number of modes) - 6 (MPM) - 1 (DC). Without the introduction of DC_mode, the maximum value for the truncated binary is 61, i.e., 67 (total number of modes) - 6 (MPM).

[0226] In particular, the following method of predictive coding of a current block is provided herein, which is implemented by a decoding device or an encoding device, where the decoding device is the video decoder 30 of Fig. 1A or the decoder 30 of Fig. 3, and the encoding device is the video encoder 20 of Fig. 1A or the encoder 20 of Fig. 2.

[0227] According to an embodiment 1200 (see FIG. 12A), a method of intra prediction of a current block implemented by a decoding device includes the following steps: In step 1201, the device obtains a value of a first indication information of the current block, and the value of the first indication information indicates whether the intra prediction mode of the current block is included in a set of most probable modes. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The first indication information is indicated by a first flag, for example, intra_luma_mpm_flag. As mentioned above, when the value of intra_luma_mpm_flag is equal to 1, the intra prediction mode of the current block is included in a set of most probable modes.

[0228] In step 1202, the device obtains a value of a reference index line of the current block. The value of the reference index line of the current block may be indicated by intra_luma_ref_idx. If the value of the reference index line of the current block is equal to 0, i.e., intra_luma_ref_idx[x0][y0]==0, the nearest neighbor reference line to the current block is used. There is no order between steps 1201 and 1202.

[0229] In step 1203, the apparatus determines whether the value of the first indication information indicates that the intra-prediction mode of the current block is included in a set of most probable modes.

[0230] In step 1204, the apparatus determines whether the value of the reference index line indicates the nearest neighbor reference line to the current block. There is no order between steps 1203 and 1204.

[0231] In step 1205, if the value of the first indication information indicates that the intra prediction mode of the current block is included in the set of most probable modes and the value of the reference index line indicates that the nearest neighbor reference line to the current block is used, the device obtains a value of the second indication information of the current block. The value of the second indication information of the current block indicates whether the intra prediction mode of the current block is a planar mode or not. The value of the second indication information is context-adaptive binary arithmetic coding (CABAC) context decoded. The second indication information may be indicated by a second flag, for example, intra_luma_not_planar_flag. The device parses the second flag using a context based on whether the current block is an intra block with an intra sub-partition (ISP) coding mode enabled.

[0232] If MRL coding is not enabled, i.e., if the value of the reference index line indicates that the nearest neighbor reference line to the current block is used, the device parses the bitstream to obtain the value of the second indication information.

[0233] It has been found that the planar mode is not efficient when MRL is enabled (i.e., the reference line index is not equal to 0). In an embodiment of the present invention, the value of the second indication information is taken by a default value when MRL coding is enabled. In this situation, the planar mode is excluded and its corresponding flag (i.e., intra_luma_not_planar_flag) is not parsed from the bitstream but is inferred as a default value (e.g., a value of 1). In this case, a bit indicating the value of the planar flag (i.e., intra_luma_not_planar) is saved when MRL is enabled.

[0234] Detailed information about this embodiment 1200 is provided in the above embodiments.

[0235] According to embodiment 1210 (see FIG. 12B), the method of intra prediction of a current block implemented by a decoding device includes the following steps.

[0236] In step 1211, the apparatus obtains a value of a reference index line of the current block. The value of the reference index line of the current block may be indicated by intra_luma_ref_idx. If the value of the reference index line of the current block is equal to 0, i.e., intra_luma_ref_idx[x0][y0]==0, the nearest neighbor reference line to the current block is used.

[0237] In step 1212, the apparatus determines whether the value of the reference index line indicates that the nearest neighbor reference line to the current block is to be used.

[0238] In step 1213, if the value of the reference index line indicates that the nearest neighbor reference line to the current block is used, the device obtains a value of a first indication information of the current block. The value of the first indication information indicates whether the intra prediction mode of the current block is included in a set of most probable modes. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The first indication information is indicated by a first flag, for example, intra_luma_mpm_flag. As described above, if the value of intra_luma_mpm_flag is equal to 1, the intra prediction mode of the current block is included in a set of most probable modes.

[0239] In step 1214, the apparatus determines whether the value of the first indication information indicates that the intra-prediction mode of the current block is included in a set of most probable modes.

[0240] In step 1215, if the value of the first indication information indicates that the intra prediction mode of the current block is included in the set of most probable modes and the value of the reference index line indicates that the nearest neighbor reference line to the current block is used, the device obtains a value of the second indication information of the current block. The value of the second indication information of the current block indicates whether the intra prediction mode of the current block is a planar mode or not. The value of the second indication information is context-adaptive binary arithmetic coding (CABAC) context decoded. The second indication information may be indicated by a second flag, for example, intra_luma_not_planar_flag. The device parses the second flag using a context based on whether the current block is an intra block with an intra sub-partition (ISP) coding mode enabled.

[0241] Detailed information about this embodiment 1210 is provided in the above embodiments.

[0242] According to embodiment 1300 (see FIG. 13), a method of intra prediction of a current block implemented by an encoding device includes the following steps: In step 1301, the device determines whether the intra prediction mode of the current block is included in a set of most probable modes. The set of most probable modes includes five candidate intra prediction modes and a planar mode. In step 1302, the device determines whether a neighboring reference line closest to the current block is used for intra prediction. There is no order between 1301 and 1302.

[0243] In step 1303, the device encodes a bitstream, where the bitstream includes information indicating whether the intra-prediction mode of the current block is a planar mode if the intra-prediction mode of the current block is included in a set of most probable modes and the nearest neighbor reference line of the current block is used for intra-prediction. The device further sends the encoded bitstream to a decoding device.

[0244] The bitstream includes a first flag indicating whether the intra prediction mode of the current block is included in the set of most probable modes, and a second flag indicating whether the intra prediction mode of the current block is a planar mode. As mentioned above, the first flag is intra_luma_mpm_flag. When the value of intra_luma_mpm_flag is equal to 1, the intra prediction mode of the current block is included in the set of most probable modes. The value of the second indication information is a context-adaptive binary arithmetic coding (CABAC) context decoded. The second indication information may be indicated by a second flag, for example, intra_luma_not_planar_flag. The device parses the second flag using a context based on whether the current block is an intra block with an intra sub-partition (ISP) coding mode enabled.

[0245] The bitstream may also include an indication for indicating the value of the reference index line of the current block, for example indicated by intra_luma_ref_idx. If the value of the reference index line of the current block is equal to 0, i.e., intra_luma_ref_idx[x0][y0]==0, the nearest neighbor reference line of the current block is used.

[0246] Detailed information about this embodiment 1300 is provided in the above embodiments.

[0247] FIG. 14 illustrates an embodiment of a decoding device 1400. The decoding device 1400 may be the video decoder 30 of FIG. 1A or the decoder 30 of FIG. 3, and the decoding device 1400 can be used to implement the embodiment 1200 and other embodiments mentioned above. The device includes a first obtaining unit 1401 and a second obtaining unit 1402. The first obtaining unit 1401 is configured to obtain a value of a reference index line of a current block and a value of a first indication information of the current block, where the value of the first indication information indicates whether the intra-prediction mode of the current block is included in a set of most probable modes. The set of most probable modes includes five candidate intra-prediction modes and a planar mode. The second obtaining unit 1402 is configured to obtain a value of a second indication information of the current block when the value of the first indication information indicates that the intra-prediction mode of the current block is included in a set of most probable modes and when the value of the reference index line indicates that a neighboring reference line nearest to the current block is used. The value of the second indication information of the current block indicates whether the intra prediction mode of the current block is a planar mode.

[0248] The apparatus 1400 further includes a parsing unit 1403 (not shown in FIG. 14 ), configured to parse the second flag using a context based on whether the current block is an intra block with an intra sub-partition (ISP) coding mode enabled.

[0249] Fig. 15 shows an embodiment of an encoding device 1500 for intra prediction. The encoding device 1500 may be the video encoder 20 of Fig. 1A or the encoder 20 of Fig. 2, and the encoding device 1500 may be used to implement the embodiment 1300 and other embodiments described above.

[0250] The apparatus 1500 includes a determining unit 1501 and an encoding unit 1502. The determining unit 1501 is configured to determine whether an intra prediction mode of a current block is included in a set of most probable modes, and determine whether a neighboring reference line closest to the current block is used for intra prediction. The set of most probable modes includes five candidate intra prediction modes and a planar mode. The encoding unit 1502 is configured to encode a bitstream, where the bitstream includes information indicating whether an intra prediction mode of the current block is a planar mode if the intra prediction mode of the current block is included in the set of most probable modes and the neighboring reference line closest to the current block is used for intra prediction.

[0251] The following is a description of the applications of the encoding and decoding methods shown in the above embodiments and the systems using them.

[0252] 16 is a block diagram showing a content delivery system 3100 for implementing a content delivery 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 through 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.

[0253] The capture device 3102 may generate data and encode the data by the encoding method as shown in the above embodiments. 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. For example, the capture device 3102 may include a source device 12 as described above. If the data includes video, a video encoder 20 included in the capture device 3102 may actually perform the video encoding process. If 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 videoconferencing system, the encoded audio data and the encoded video data are not multiplexed: the capture device 3102 delivers the encoded audio data and the encoded video data separately to the terminal device 3106.

[0254] In the content delivery system 3100, the terminal device 310 receives and plays the encoded data. The terminal device 3106 may be a device having data receiving and restoring 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 of these, that can decode the encoded data described above. For example, the terminal device 3106 may include the destination device 14 described above. If the encoded data includes video, the video decoder 30 included in the terminal device is prioritized to perform video decoding. If the encoded data includes audio, the audio decoder included in the terminal device is prioritized to perform audio decoding processing.

[0255] 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 without a display, such as a 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.

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

[0257] 17 is a diagram showing the structure of an example of the terminal device 3106. After the terminal device 3106 receives the stream from the capture device 3102, the protocol progression unit 3202 analyzes the transmission protocol of the stream. The protocol includes, but is not limited to, Real Time Streaming Protocol (RTSP), Hypertext Transfer Protocol (HTTP), HTTP Live Streaming Protocol (HLS), MPEG-DASH, Real Time Transport Protocol (RTP), Real Time Messaging Protocol (RTMP), or any kind of combination thereof. After the protocol proceeding 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 mentioned above, for some practical scenarios, for example in a video conferencing system, the encoded audio data and the encoded video data are not multiplexed. In this situation, the encoded data is sent to the video decoder 3206 and the audio decoder 3208 without passing through the demultiplexing unit 3204.

[0258] Through the demultiplexing process, a video elementary stream (ES), an audio ES, and optionally subtitles are generated. A video decoder 3206 including the video decoder 30 as described in the above-mentioned embodiments decodes the video ES by the decoding method as shown in the above-mentioned embodiments to generate video frames, and provides the data to a synchronization unit 3212. An audio decoder 3208 decodes the audio ES to generate audio frames, and provides the data to a synchronization unit 3212. Alternatively, the video frames may be stored in a buffer (not shown in FIG. Y) before being provided to the synchronization unit 3212. Similarly, the audio frames may be stored in a buffer (not shown in FIG. Y) before being provided to the synchronization unit 3212.

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

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

[0261] The present invention is not limited to the above-mentioned system, and any of the picture encoding devices or picture decoding devices in the above-mentioned embodiments can be incorporated into other systems, for example, an automobile system.

[0262] 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 value division are defined. Numbering and counting conventions generally start at 0. For example, "first" is equivalent to 0th, "second" is equivalent to 1st, and so on.

[0263] Arithmetic Operators The following operators are defined as follows: + Add - Subtraction (as a two-argument operator) or negation (as a unary prefix operator) * Multiplication, including matrix multiplication x y Power. Specifies x to the power of y. In other contexts, such notation is used for superscripts where interpretation as a power is not intended. / Integer division. The result is truncated towards zero. For example, 7 / 4 and -7 / -4 round down to 1, and -7 / 4 and 7 / -4 round down to -1. ÷ Used to indicate division in mathematical expressions where truncation or rounding is not intended.

number

number

[0264] Logical Operators The following logical operators are defined as follows: x && y Boolean logic "and" of x and y x||y The Boolean "or" of x and y ! Boolean logic "not" x?y:zIf x is true or not equal to 0, then it evaluates to the value of y, otherwise it evaluates to the value of z.

[0265] Relational Operators The following relational operators are defined as follows: > Greater than >= Greater than or equal to < Less than <= less than or equal == Equal != Not equal 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 unique value for that syntax element or variable. The value "na" is not considered equal to any other value.

[0266] Bitwise operator The following bitwise operators are defined as follows: & Bitwise 'and'. When acting on integer arguments, it acts on the two's complement representation of the integer value. When acting on a binary argument containing fewer bits than the other argument, the shorter argument is extended by adding additional significant bits equal to 0. | Bitwise 'or'. When acting on integer arguments, it acts on the two's complement representation of the integer value. When acting on a binary argument containing fewer bits than the other argument, the shorter argument is extended by adding additional significant bits equal to 0. ^ Bitwise 'exclusive or'. When acting on integer arguments, it acts on the two's complement representation of the integer value. When acting on a binary argument containing fewer bits than the other argument, the shorter argument is extended by adding additional significant bits equal to 0. x>>y An arithmetic right shift of y binary digits of the two's complement integer representation of x. This function is defined only for non-negative integer values of y. The bits shifted into the most significant bits (MSB) as a result of the right shift have the same value as the MSB of x before the shift operation. x<<y An arithmetic left shift of y binary digits of the two's complement integer representation of x. This function is defined only for non-negative integer values of y. The bits shifted into the least significant bits (LSB) as a result of the left shift have a value equal to 0.

[0267] Assignment operator The following arithmetic operators are defined as follows: = Assignment operator ++ Increment, i.e., x++ is equivalent to x=x+1; when used in an array index, it is evaluated to the value of the variable before the increment operation. -- Decrement, i.e., x-- is equivalent to x=x-1; when used in an array index, it is evaluated 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).

[0268] Range notation The following notation is used to specify a range of values: x=y…zx runs on integer values ​​starting from y to z (inclusive), where x, y, and z are integers and z is greater than y.

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

number

number

number

number

number

[0270] Operation priority order If the order of precedence in an expression is not explicitly stated using parentheses, the following rules apply: -Operations with higher precedence are evaluated before operations with lower precedence. -Operations of equal precedence are evaluated sequentially from left to right.

[0271] Table 14 below specifies the precedence of operations from highest to lowest; a higher position in Table 14 indicates a higher precedence. For operators that are also used in the C programming language, the precedence order used herein is the same as that used in the C programming language. Table 14: Operation precedence from highest (top of table) to lowest (bottom of table) [Table 14]

[0272] Text description of logical operations In the text, mathematically it has the following form: if(condition 0) statement 0 else if(condition 1) statement 1 … else / * informative comment about remaining conditions * / statement n A logical statement written in may also be written as follows: …as follows / …the following applies: -If condition 0, then statement 0 - Otherwise, if condition 1, then statement 1 -… -otherwise (informative comment regarding the remaining conditions) statement n.

[0273] Each "if ... then, otherwise, if ..., otherwise" statement in the text is introduced by "... it is" or "... the following applies" and is immediately followed by "If ...". The final condition in an "if ... then, otherwise, if ..., otherwise" may always be "Otherwise". Intervening "if ... then, otherwise, if ..., otherwise" statements can be identified by matching "it is" or "it applies" with the final "Otherwise".

[0274] In the text, mathematically it has the following form: if(condition0a & condition0b) statement 0 else if(condition 1a || condition 1b) statement 1 … else statement n A logical statement written in may also be written as follows: …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 -… - If not, statement n.

[0275] In the text, mathematically it has the following form: if(condition 0) statement 0 if(condition1) statement 1 A logical statement written in may also be written as follows: If condition 0, then statement 0 If condition 1, then statement 1.

[0276] Although the embodiments of the present disclosure have been described primarily in terms of video coding, it should be noted that the embodiments of coding system 10, encoder 20 and decoder 30 (and correspondingly system 10), as well as other embodiments described herein, may be configured for processing or coding of still pictures, i.e., processing or coding of individual pictures independent of any preceding or subsequent pictures, as in video coding. In general, 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 features (also referred to as tools or techniques) of video encoder 20 and video decoder 30 may be used equally for still picture processing. The other functions are, for example, 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.

[0277] The embodiments of, for example, the encoder 20 and the decoder 30, and the functions described herein with reference to, for example, 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. A 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 manner, a 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. A 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 implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.

[0278] By way of example, and not limitation, such computer-readable storage media may include 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 referred to as 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 waves, and microwaves, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio waves, and microwaves are included within the definition of media. 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 are instead directed to 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.

[0279] 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. Thus, the term "processor" as used herein may refer to any of the foregoing structures, or any other structure suitable for implementation of the techniques described herein. Furthermore, in some aspects, the functionality described herein may be provided in dedicated hardware and / or software modules configured for encoding and decoding, or may be incorporated into a combined codec. Also, these techniques may be implemented entirely in one or more circuit or logic elements.

[0280] 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). In this disclosure, various components, modules, or units are described to highlight functional aspects of an apparatus configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, the various units may be combined in a codec hardware unit or may be provided by a collection of interoperating hardware units that include one or more processors as described above in association with suitable software and / or firmware.

Claims

1. 1. A coding apparatus for performing intra prediction, the apparatus comprising: one or more processors; a non-transitory computer-readable storage medium coupled to the processor storing programming for execution by the processor, the programming, when executed by the processor, causing the apparatus to: obtaining a value of second indication information of a current block, the value of the second indication information indicating whether an intra prediction mode of the current block is a planar mode, and the second indication information is indicated by a second flag; determining an intra prediction mode of a current block according to a value of the second indication information of the current block; predicting the current block according to the intra prediction mode of the current block; The method is configured to execute Device.

2. If the nearest neighbor reference line of the current block is not used for intra prediction, the second flag is equal to a default value, and the default value is used to indicate that the intra prediction mode of the current block is not a planar mode.

2. The apparatus of claim 1.

3. The device of claim 1, wherein the second flag is included in the bitstream when the value of the first indication information indicates that the intra prediction mode of the current block is included in a set of most probable modes and the nearest neighbor reference line to the current block is used for intra prediction.

4. The apparatus of claim 1 , wherein the second flag is an intra_luma_not_planar_flag.

5. The apparatus of claim 3 , wherein the first indication information is indicated by a first flag intra_luma_mpm_flag.

6. The apparatus of claim 3 , wherein the set of most probable modes includes five candidate intra-prediction modes and a planar mode.

7. The apparatus of claim 6, wherein if the intra-prediction mode of the current block is not a planar mode, an index indicating which of the five candidate intra-prediction modes is used for the intra-prediction mode of the current block is included in the bitstream.

8. The apparatus of claim 5 , wherein the flag intra_luma_mpm_flag is equal to a default value if the closest neighboring reference line to the current block is not used for intra prediction.

9. 1. A method of intra prediction implemented by a coding device, comprising: obtaining a value of second indication information of a current block, the value of the second indication information indicating whether an intra prediction mode of the current block is a planar mode, and the second indication information is indicated by a second flag; determining an intra prediction mode of a current block according to a value of the second indication information of the current block; predicting the current block according to the intra prediction mode of the current block; Including, method.

10. If the nearest neighbor reference line of the current block is not used for intra prediction, the second flag is equal to a default value, and the default value is used to indicate that the intra prediction mode of the current block is not a planar mode.

10. The method of claim 9.

11. The method of claim 9, wherein the second flag is included in the bitstream when the value of the first indication information indicates that the intra prediction mode of the current block is included in a set of most probable modes and the nearest neighboring reference line to the current block is used for intra prediction.

12. 12. The method of claim 9, wherein the second flag is an intra_luma_not_planar_flag.

13. The method of claim 11 , wherein the first indication information is indicated by a first flag intra_luma_mpm_flag.

14. The method of claim 11 , wherein the set of most probable modes includes five candidate intra-prediction modes and a planar mode.

15. The method of claim 14, wherein if the intra-prediction mode of the current block is not a planar mode, an index indicating which of the five candidate intra-prediction modes is used for the intra-prediction mode of the current block is included in the bitstream.

16. The method of claim 13 , wherein if the closest neighboring reference line to the current block is not used for intra prediction, the flag intra_luma_mpm_flag is equal to a default value.

17. An encoder having processing circuitry for carrying out the method according to any one of claims 9 to 16.

18. A decoder having processing circuitry for carrying out the method according to any one of claims 9 to 16.

19. A non-transitory computer readable storage medium, characterized in that it comprises a set of instructions for carrying out the method according to any one of claims 9 to 16.

20. 1. A non-transitory storage medium comprising a bitstream, the bitstream comprising: Indication information indicating whether a nearest neighbor reference line of the current block is not used for intra prediction, and if the nearest neighbor reference line of the current block is not used for intra prediction, the indication information indicating that the intra prediction mode of the current block is not a planar mode; and if the intra prediction mode of the current block is not a planar mode, an index indicating which intra prediction mode in the set of most probable modes is used for the intra prediction mode of the current block. storage medium.

Citation Information

Patent Citations

  • MPM list-based intra prediction method and device

    WO2020171632A1

  • Method for coding image on basis of intra prediction using MPM list and apparatus therefor

    WO2020197203A1