Method and apparatus for signaling the number of candidates for merge mode - Patents.com

By signaling the maximum number of geometric partitioning merge mode candidates in video decoding, the method enhances video decoding efficiency and bitstream utilization, addressing the challenges of high-quality video compression in limited bandwidth and storage scenarios.

JP7577749B2Active Publication Date: 2024-11-05HUAWEI TECH CO LTD
View PDF 10 Cites 0 Cited by

Patent Information

Application Number
JP2022542912
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2020-01-14
Filing Date
2021-01-13
Publication Date
2024-11-05
Estimated Expiration
2041-01-13

AI Technical Summary

Technical Problem

Existing video coding technologies face challenges in efficiently compressing and decompressing video data while maintaining high quality, particularly in limited bandwidth and storage scenarios, necessitating improved techniques for video encoding and decoding to optimize compression ratios without compromising picture quality.

Method used

A method and apparatus for signaling the maximum number of geometric partitioning merge mode candidates in video decoding, which involves obtaining indicators from a bitstream to conditionally signal the number of merge mode candidates, thereby enhancing bitstream utilization and decoding efficiency.

Benefits of technology

This approach improves video decoding efficiency by optimizing the number of merge mode candidates, leading to more effective use of bitstream resources and maintaining high-quality video compression and decompression.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007577749000173
    Figure 0007577749000173
  • Figure 0007577749000174
    Figure 0007577749000174
  • Figure 0007577749000175
    Figure 0007577749000175
Patent Text Reader

Abstract

A method and a video decoding apparatus for obtaining a maximum number of geometric partitioning merge mode candidates for video decoding are disclosed, the method including: obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction (MVP) candidates; obtaining a value of a second indicator according to the bitstream, the second indicator representing whether geometric partitioning-based motion compensation is enabled for the video sequence; and analyzing a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] This patent application claims priority to US 62 / 961,159, filed January 14, 2020. The disclosures of the aforementioned patent applications are incorporated herein by reference in their entireties.

[0002] FIELD Embodiments of the present application relate generally to the field of video coding, and more particularly to signaling a number of merge mode candidates. [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 such as video chat and video conferencing, DVDs and Blu-ray discs, video content collection and editing systems, and camcorders in security applications.

[0004] The amount of video data required to depict even a relatively short video can be substantial, which can become difficult when the data is streamed or otherwise communicated over a communications network that has limited bandwidth capacity. Therefore, 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 on a storage device, since memory resources may be limited. Video compression devices often use software and / or hardware at the source to code the video data prior to transmission or storage, thereby 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. With limited network resources and a constantly increasing demand for higher video quality, improved compression and decompression techniques that improve compression ratios with little sacrifice in picture quality are desirable. Summary of the Invention

[0005] Embodiments of the present application provide devices and methods for encoding and decoding according to the independent claims. 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. Particular embodiments are outlined in the accompanying independent claims, while other embodiments are outlined in the dependent claims.

[0006] A first aspect of the present invention provides a method for obtaining a maximum number of geometric partitioning merger mode candidates for video decoding, the method comprising: The method includes obtaining a bitstream for the video sequence; obtaining a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates; obtaining a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0007] According to an embodiment of the present invention, a signaling scheme of an indicator of the number of merge mode candidates is disclosed, where the maximum number of geometric partitioning merge mode candidates is conditionally signaled, thus improving bitstream utilization and decoding efficiency.

[0008] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to two when the value of the first indicator is equal to the threshold value and the value of the second indicator is equal to a preset value.

[0009] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to 0 when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value.

[0010] In one implementation, the threshold is two.

[0011] In one implementation, the preset value is 1.

[0012] In one implementation, obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

[0013] In one implementation, the first indicator is obtained by a syntax element coded in the bitstream.

[0014] In one implementation, when the value of the first indicator is greater than or equal to a threshold, a value of a second indicator is parsed from a sequence parameter set SPS of the bitstream, for example by parsing a syntax element in the sequence parameter set SPS to obtain the value of the second indicator.

[0015] In one implementation, the value of the second indicator is obtained from a sequence parameter set SPS of the bitstream, e.g., by parsing a syntax element in the sequence parameter set SPS to obtain the value of the second indicator. In one implementation, the value of the third indicator is obtained from a sequence parameter set SPS of the bitstream, e.g., by parsing a syntax element in the sequence parameter set SPS to obtain the value of the third indicator.

[0016] A second aspect of the present invention provides a video decoding apparatus, the video decoding apparatus including: a receiving module configured to obtain a bitstream for a video sequence; an acquisition module configured to obtain a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates, the acquisition module configured to obtain a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and an analysis module configured to analyze a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0017] The method according to the first aspect of the invention may be performed by a device according to the second aspect of the invention. Further features and implementations of the method according to the first aspect of the invention correspond to the features and implementations of the apparatus according to the second aspect of the invention.

[0018] In one implementation, when the value of the first indicator is equal to the threshold value and the value of the second indicator is equal to the preset value, the acquisition module is configured to set a value of the maximum number of geometric partitioning merge mode candidates to two.

[0019] In one implementation, when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value, the acquisition module is configured to set a value of the maximum number of geometric partitioning merge mode candidates to 0.

[0020] In one implementation, the threshold is two.

[0021] In one implementation, the preset value is 1.

[0022] In one implementation, obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

[0023] In one implementation, when the value of the first indicator is greater than or equal to a threshold, the value of the second indicator is parsed from a sequence parameter set SPS of the bitstream.

[0024] In one implementation, the value of the second indicator is obtained from a sequence parameter set SPS of the bitstream.

[0025] In one implementation, the value of the third indicator is obtained from a sequence parameter set SPS of the bitstream.

[0026] In one implementation, a method is disclosed for obtaining a maximum number of geometric partitioning merge mode candidates for video decoding, the method comprising: The method includes obtaining a bitstream for the video sequence; obtaining a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates; obtaining a value of a second indicator according to the bitstream only if the obtained value of the first indicator is greater than a threshold, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream only if the value of the first indicator is greater than the threshold and the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0027] A third aspect of the present invention provides a method for encoding a maximum number of geometric partitioning merger mode candidates, the method comprising the steps of: The method includes determining a value of a first indicator, the first indicator representing a maximum number of merging motion vector prediction MVP candidates; determining a value of a second indicator, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and encoding a value of a third indicator into the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0028] According to an embodiment of the present invention, a signaling scheme of an indicator of the number of merge mode candidates is disclosed, where the maximum number of geometric partitioning merge mode candidates is conditionally signaled, thus improving bitstream utilization and decoding efficiency.

[0029] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to two when the value of the first indicator is equal to the threshold value and the value of the second indicator is equal to a preset value.

[0030] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to 0 when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value.

[0031] In one implementation, the threshold is two.

[0032] In one implementation, the preset value is 1.

[0033] In one implementation, determining the value of the second indicator is performed after determining the value of the first indicator.

[0034] In one implementation, when the value of the first indicator is greater than or equal to a threshold, the value of the second indicator is encoded into a sequence parameter set SPS of the bitstream.

[0035] In one implementation, the value of the second indicator is encoded into a sequence parameter set SPS of the bitstream.

[0036] In one implementation, the value of the third indicator is encoded into the sequence parameter set SPS of the bitstream.

[0037] A fourth aspect of the present invention provides a video encoding apparatus, the video encoding apparatus comprising: a decision module configured to determine a value of a first indicator according to a bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates, the decision module configured to determine a value of a second indicator, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and an analysis module configured to analyze a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0038] The method according to the third aspect of the invention may be performed by an apparatus according to the fourth aspect of the invention. 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 fourth aspect of the invention.

[0039] In one implementation, the decision module is configured to set a value of the maximum number of geometric partitioning merge mode candidates to two when the value of the first indicator is equal to a threshold value and the value of the second indicator is equal to a preset value.

[0040] In one implementation, the decision module is configured to set a value of the maximum number of geometric partitioning merge mode candidates to 0 when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value.

[0041] In one implementation, the threshold is two.

[0042] In one implementation, the preset value is 1.

[0043] In one implementation, determining the value of the second indicator is performed after determining the value of the first indicator.

[0044] In one implementation, when the value of the first indicator is greater than or equal to a threshold, the value of the second indicator is encoded into a sequence parameter set SPS of the bitstream.

[0045] In one implementation, the value of the second indicator is encoded into a sequence parameter set SPS of the bitstream.

[0046] In one implementation, the value of the third indicator is encoded into the sequence parameter set SPS of the bitstream.

[0047] A fifth aspect of the present invention provides a decoder including a processing circuit for carrying out a method according to the first aspect and any of the implementations of the first aspect.

[0048] A sixth aspect of the present invention provides an encoder including a processing circuit for implementing a method according to the third aspect and any of the implementations of the third aspect.

[0049] A seventh aspect of the present invention provides a computer program product comprising program code for, when executed on a computer or processor, performing a method according to the first aspect, the third aspect and any implementation of the first aspect or the third aspect.

[0050] An eighth aspect of the present invention provides a decoder including one or more processors and a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configures the decoder to perform a method according to any of the first aspect, any of the third aspect, and any of the implementations of the first aspect, any of the third aspect.

[0051] A ninth aspect of the present invention provides a non-transitory computer readable medium carrying program code which, when executed by a computing device, causes the computing device to perform a method according to either the first aspect, or the third aspect, and any implementation of the first aspect, or the third aspect.

[0052] A tenth aspect of the present invention provides an encoder including a processing circuit for performing a method according to the third aspect and any of the implementations of the third aspect.

[0053] An eleventh aspect of the present invention provides an encoder including one or more processors and a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming which, when executed by the processor, configures the encoder to perform a method according to any of the third aspect and any of the implementations of the third aspect.

[0054] A twelfth aspect of the present invention provides a non-transitory storage medium comprising a bitstream encoded / decoded by the method of any of the above embodiments.

[0055] A thirteenth aspect of the present invention provides a bitstream encoded for a video signal by including a plurality of syntax elements, the plurality of syntax elements including a second indicator (such as sps_geo_enabled_flag), and a third indicator sps_max_num_merge_cand_minus_max_num_geo_cand being conditionally signaled based at least in part on the value of sps_geo_enabled_flag.

[0056] A fourteenth aspect of the present invention provides a non-transitory storage medium comprising an encoded bitstream decoded by an image decoding device, the bitstream being generated by dividing a frame of a video or image signal into a plurality of blocks and comprising a plurality of syntax elements, the plurality of syntax elements comprising a third indicator (such as sps_max_num_merge_cand_minus_max_num_geo_cand) according to any of the preceding aspects.

[0057] A fifteenth aspect of the present invention provides a method for video decoding, comprising: The method includes obtaining a bitstream for the video sequence, obtaining a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates, obtaining a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence, and parsing a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator; constructing a merge candidate list for a current coding block according to motion vectors of neighboring blocks of the current coding block; Obtaining a merge index according to the value of a third indicator; and Obtaining a motion vector of a current coding block according to the merge index and the merger candidate list; reconstructing the current coding block according to the motion vector of the current coding block.

[0058] A sixteenth aspect of the present invention provides a video decoding apparatus, comprising: a receiving module configured to obtain a bitstream for a video sequence; an obtaining module configured to obtain a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates, the obtaining module configured to obtain a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and an analysis module configured to analyze a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator. a merge candidate list construction module configured to construct a merge candidate list for a current coding block according to motion vectors of neighboring blocks of the current coding block; a retrieval module configured to retrieve the merge index according to a value of the third indicator; a motion vector module configured to obtain a motion vector of a current coding block according to the merge index and the merger candidate list; and a pixel reconstruction module configured to reconstruct the current coding block according to the motion vector of the current coding block.

[0059] For details or examples regarding the fifteenth aspect of the present invention and the sixteenth aspect of the present invention, reference may be made to the above examples disclosed in the first to fourteenth aspects of the present invention.

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

[0061] In the following, embodiments of the invention will be described in more detail with reference to the accompanying figures and drawings.

[0062] [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] 1 is a block diagram illustrating an example of a video coding system configured to implement embodiments of the present invention. [Diagram 2] FIG. 1 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the present invention. [Diagram 3] 2 is a block diagram illustrating an exemplary structure of a video decoder configured to implement embodiments of the present invention. [Figure 4] FIG. 1 is a block diagram showing an example of an encoding device or a decoding device. [Diagram 5]FIG. 13 is a block diagram showing another example of an encoding device or a decoding device. [Figure 6] 13 is a flow chart for weighted predictive coder side decision making and parameter estimation. [Figure 7] 4 illustrates an example of a triangular prediction mode. [Figure 8] 4 illustrates an example of a geometric prediction mode. [Figure 9] 4 illustrates another example of a geometric prediction mode. [Figure 10] 31 is a block diagram showing an exemplary structure of a content delivery system 3100 for implementing a content distribution service. [Figure 11] FIG. 2 is a block diagram showing the structure of an example of a terminal device. [Figure 12] 1 is a block diagram illustrating an example of an inter prediction method according to the present application. [Figure 13] 1 is a block diagram illustrating an example of an apparatus for inter prediction according to the present application. [Figure 14] 1 is a block diagram illustrating another example of an apparatus for inter prediction according to the present application. [Figure 15] 1 is a flow chart illustrating an embodiment of a method according to the present invention. [Figure 16] FIG. 1 is a block diagram showing an apparatus according to the present invention;

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

[0064] In the following description, reference is made to the accompanying drawings, which form a part of this disclosure, and which are intended to illustrate certain aspects of the embodiments of the present invention or in which the embodiments of the present invention may be used. It is understood that the embodiments of the present invention may be used in other ways and include structural or logical changes not shown in the drawings. Therefore, the following detailed description should not be taken in a limiting sense, and the scope of the present invention is defined by the appended claims.

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

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

[0067] 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 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, but it 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.

[0068] 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, a video is typically processed, i.e., encoded, at the block (video block) level, e.g., by generating a predictive block using spatial (intra-picture) prediction and / or temporal (inter-picture) prediction, subtracting the predictive block from a current block (the block currently being / to be processed) to obtain a residual block, transforming the residual block and quantizing the residual block in the transform domain to reduce (compress) the amount of data to be transmitted, while at the decoder, the inverse processing compared to the encoder is applied to the coded or compressed block to reconstruct the current block for presentation. Additionally, the encoder replicates the decoder processing loop so that both generate the same predictions (e.g., intra-prediction and inter-prediction) and / or processing, i.e., reconstructions for coding subsequent blocks.

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

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

[0071] 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 decoding, for example, encoded picture data 13.

[0072] The source device 12 includes an encoder 20 , and may additionally include a picture source 16 , a pre-processor (or pre-processing unit) 18 , such as a picture pre-processor 18 , and a communication interface or unit 22 .

[0073] Picture source 16 may include 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 for storing any of the above mentioned pictures.

[0074] To distinguish between the preprocessor 18 and the processing performed by the preprocessing unit 18 , the picture or picture data 17 may also be referred to as a raw picture or raw picture data 17 .

[0075] The pre-processor 18 is configured to receive (raw) picture data 17 and perform pre-processing on the picture data 17 to obtain pre-processed picture data 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 may be understood that the pre-processing unit 18 may be any component.

[0076] A video encoder 20 is configured to receive pre-processed picture data 19 and provide encoded picture data 21 (eg, as described in further detail below with reference to FIG. 2).

[0077] 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) via the communications channel 13 to another device, such as the destination device 14 or any other device, for storage or direct reconstruction.

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

[0079] 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. a coded picture data storage device, and to provide the encoded picture data 21 to a decoder 30.

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

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

[0082] The communications interface 28, forming a counterpart to the communications interface 22, may for example be configured to receive the transmitted data and process the transmitted data using any kind of corresponding transmission decoding or processing and / or unpackaging to obtain the encoded picture data 21.

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

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

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

[0086] A display device 34 of 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 display or an external display or monitor. The display may include, e.g., 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 type of other display.

[0087] 1A depicts source device 12 and destination device 14 as separate devices, an embodiment of the devices may include both or both functionality of 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 by the same hardware and / or software, separate hardware and / or software, or any combination thereof.

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

[0089] The encoder 20 (e.g., video encoder 20), the decoder 30 (e.g., video decoder 30), or both the encoder 20 and the decoder 30 may be implemented by processing circuitry such as that shown in FIG. 1B, 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 as described 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 as described 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. If the techniques are implemented partially in software, as shown in Figure 5, a device may store instructions for the software on a suitable non-transitory computer-readable storage medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Either video encoder 20 or video decoder 30 may be integrated as part of a combined encoder / decoder (CODED) in a single device, as shown, for example, in Figure 1B.

[0090] 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 smartphone, a tablet or tablet computer, a camera, a desktop computer, a set-top box, a television, a display device, a digital media player, a video game console, a video streaming device (such as a content service server or content delivery server), a broadcast receiver device, a broadcast transmitter device, etc., and may use no operating system at all or any type. 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.

[0091] In some cases, the 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 settings (e.g., video encoding or video decoding) that do not necessarily include any 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 in memory and / or retrieve and decode data from memory.

[0092] For ease of explanation, embodiments of the present invention are described herein with reference to, for example, High Efficiency Video Coding (HEVC) or Generic Video Coding (VVC) reference software, the next generation video encoding standard developed by the ITU-T Video Coding Experts Group (VCEG) and the ISO / IEC Motion Picture Coding 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.

[0093] Encoder and encoding method

[0094] 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 includes an input 201 (or an 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 coding unit 270, and an output 272 (or an output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254, and a partitioning unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). The video encoder 20 shown in FIG. 2 may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.

[0095] The residual computation unit 204, the transform processing unit 206, the quantization unit 208, and the mode selection unit 260 are sometimes 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 are sometimes referred to as forming a backward signal path of the video encoder 20, which corresponds to the signal path of a decoder (see video decoder 30 in FIG. 3). The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DRB) 230, the inter prediction unit 244, and the intra prediction unit 254 are also sometimes referred to as forming a “built-in decoder” of the video encoder 20.

[0096] Picture & Picture Partitioning (Picture & Block)

[0097] The encoder 20 may be arranged 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 called the current picture or the picture to be coded (especially in video coding to distinguish the current picture from other pictures, for example previously coded and / or decoded pictures of the same video sequence, i.e. a video sequence which also includes the current picture).

[0098] 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 are sometimes also called pixels (an abbreviated form of picture element) or pels. The number of samples in the horizontal and vertical directions (or axes) of the array or picture defines the size and / or resolution of the picture. In color representation, typically three color components are used; that is, a picture may be represented with or 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 luma and chroma format or color space, e.g. YCbCr, which contains a luma component denoted by Y (although L is sometimes used instead), and two chroma components denoted by Cb and Cr. The luma (or luma for short) component Y represents the brightness or gray level intensity (e.g. in a grayscale picture), while the two chroma (or chroma for short) components Cb and Cr represent the color difference or color information components. Thus, a picture in YCbCr format contains a luma sample array of luma sample values ​​(Y) and two chroma sample arrays of chroma values ​​(Cb and Cr). A picture in RGB format may be converted or transformed into YCbCr format and vice versa, a process also known as color transform or conversion. If the picture is monochrome, the picture may contain only a luma sample array. Thus, a picture may be, for example, an array of luma samples in monochrome format, or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color formats.

[0099] An embodiment of the video encoder 20 may include a picture partitioning unit (not shown in FIG. 2) configured to partition a picture 17 into multiple (typically non-overlapping) picture blocks 203. These blocks may also be called root blocks, macroblocks (H.264 / AVC) or coding tree blocks (CTBs) or coding tree units (CTUs) (H.265 / HEVC and VVC). The picture 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 sizes, or to vary the block size between pictures, or between subsets or groups of pictures, and to partition each picture into corresponding blocks.

[0100] In a further embodiment, the video encoder may be configured to directly receive blocks 203 of picture 17, e.g., one, several 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.

[0101] Similar to the picture 17, the picture block 203 is or is considered to be a two-dimensional array or matrix of samples with intensity values ​​(sample values), although again with smaller dimensions than the picture 17. In other words, the block 203 may contain, for example, one sample array (e.g. a luma array in case of a monochrome picture 17, a luma or chroma array in case of a color picture) or three sample arrays (e.g. a luma and two chroma arrays in case of a color picture 17) or any other number and / or type of arrays depending on the color format applied. The orientation of the block 203 and the number of samples in the vertical direction (or axis) define the size of the block 203. Thus, the block may be, for example, an MxN (M columns by N rows) array of samples, or an MxN array of transform coefficients.

[0102] The embodiment of video encoder 20 shown in FIG. 2 may be configured to encode picture 17 on a block-by-block basis, eg, encoding and prediction is performed on a block-by-block basis 203 .

[0103] The embodiment of video encoder 20 shown in FIG. 2 may be further configured to partition and / or encode a picture by using slices (also referred to as video slices), where a picture may be partitioned or encoded using one or more slices (typically non-overlapping), and each slice may include one or more blocks (e.g., CTUs).

[0104] The embodiment of video encoder 20 shown in FIG. 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), where each tile group may, for example, include one or more blocks (e.g., CTUs) or one or more tiles, where each tile may, for example, be rectangular in shape and include one or more blocks (e.g., CTUs), e.g., full blocks or partial blocks.

[0105] Residual calculation

[0106] 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 the prediction block 265 (further details about the prediction block 265 will be described later) on a sample-by-sample (pixel-by-pixel) basis, for example by subtracting 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.

[0107] Transform

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

[0109] The transform processing unit 206 may be configured to apply an integer approximation of the 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 particular 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 a scaling factor that is a power of two for shift operations, the bit depth of the transform coefficients, a trade-off between accuracy and implementation cost, etc. A particular scaling factor may be specified for the inverse transform, e.g., by the inverse transform processing unit 212 (and a corresponding inverse transform, e.g., by the inverse transform processing unit 312 in the video decoder 30), and a corresponding scaling factor for the forward transform may be specified accordingly in the encoder 20, e.g., by the transform processing unit 206.

[0110] An embodiment of video encoder 20 (respectively, transform processing unit 206) may be configured to output, e.g., a type of transform or parameters of multiple transforms, either directly or encoded or compressed, e.g., via entropy coding unit 270, such that video decoder 30 may receive and use the transform parameters for decoding.

[0111] Quantization

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

[0113] 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, in scalar quantization, different scaling may be applied to achieve finer or coarser quantization. A smaller quantization step size corresponds to finer quantization and 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 division by the quantization step size, and corresponding and / or inverse dequantization, e.g., by the inverse quantization unit 210, may include 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 involving division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which may be modified due to the scaling used in the fixed-point approximation of the quantization step size and quantization parameter equations. In one example, the inverse transform and dequantization scaling may be combined. Alternatively, customized quantization tables may be used and signaled from the encoder to the decoder, e.g., in the bitstream. Quantization is a lossy operation where the loss increases with increasing quantization step size.

[0114] An embodiment of video encoder 20 (respectively, quantization unit 208) may be configured to output the encoded quantization parameters, e.g., directly or via entropy encoding unit 270, such that video decoder 30, for example, may receive and apply the quantization parameters for decoding.

[0115] inverse quantization

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

[0117] Inverse Transform

[0118] 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), an inverse discrete sine transform, 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 is also referred to as a transform block 213.

[0119] Reconstruction

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

[0121] filtering

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

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

[0124] Decoded Picture Buffer

[0125] The decoded picture buffer (DRB) 230 may be a memory that stores reference pictures or, in general, reference picture data for encoding the 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 memories, including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The decoded picture buffer 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, for example, a fully 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) for inter prediction. The decoded picture buffer (DRB) 230 may also be configured to store one or more unfiltered reconstructed blocks 215, or in general, unfiltered reconstructed samples, e.g., if the reconstructed blocks 215 have not been filtered by the loop filter unit 220 or are any other further processed version of a reconstructed block or sample.

[0126] Mode Selection (Partitioning & Prediction)

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

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

[0129] An embodiment of the mode selection unit 260 may be configured to select a partitioning and prediction mode (e.g., from those supported or available by the mode selection unit 260) that provides the best match, in other words, the smallest residual (smallest residual means better compression for transmission or storage), or the smallest signaling overhead (smallest signaling means better compression for transmission or storage), or a consideration or balance of 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", "lowest", "optimal" in this context do not necessarily refer to an overall "best", "lowest", "optimal", etc., but may refer to a termination criterion or selection criteria, such as, for example, a value above or below a threshold, or the fulfillment of other constraints that may lead to a "suboptimal selection" but reduce complexity and processing time.

[0130] In other words, the partitioning unit 262 may be configured to partition the block 203 into smaller block partitions or sub-blocks (again forming a block), e.g., using quad tree partitioning (QT), binary partitioning (BT), triple tree partitioning (TT) or any combination thereof in an iterative manner, and to perform, e.g., prediction for each block partition or sub-block, wherein the mode selection includes selection of a tree structure of the partitioned block 203, and a prediction mode is applied to each of the block partitions or sub-blocks.

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

[0132] Partitioning

[0133] 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 (also called sub-blocks) may be partitioned into even smaller partitions. This is also called tree partitioning or hierarchical tree partitioning, where a root block, e.g., root tree level 0 (hierarchical level 0, depth 0), may be partitioned recursively into two or more blocks at the next lower tree level, e.g., nodes at tree level 1 (hierarchical level 1, depth 1), which may be partitioned again into two or more blocks at the next lower level, e.g., tree level 2 (hierarchical level 2, depth 2), until the partitioning is terminated, e.g., 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).

[0134] As mentioned above, the term "block" as used herein may refer to a portion of a picture, particularly a square or rectangular portion. For example, with reference to HEVC and VVC, a block may correspond to a coding tree unit (CTU), a coding unit (CU), a prediction unit (PU), and a transform unit, 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).

[0135] For example, a coding tree unit (CTU) may be or may include a CTB of luma samples, two corresponding CTBs of chroma samples for a picture with three sample arrays, 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 NxN block of samples of N of a certain value, such that the division of a component into CTBs is a partitioning. A coding unit (CU) may be or may include a CTB of luma samples, two corresponding coding blocks of chroma samples for a picture with three sample arrays, 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 NxN block of samples of M and N of a certain value, such that the division of a CTB into coding blocks is a partitioning.

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

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

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

[0139] As mentioned above, video encoder 20 may be configured to determine or select a best or optimal prediction mode from a set of (e.g., predetermined) prediction modes. The set of prediction modes may include, for example, intra-prediction modes and / or inter-prediction modes.

[0140] Intra prediction

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

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

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

[0144] Inter Prediction

[0145] The set of inter predictions (or possible inter prediction modes) depends on the available reference pictures (i.e., at least partially decoded pictures stored, e.g., in DBP230) and other inter prediction parameters, e.g., whether the entire reference picture or only a part of the reference picture, e.g., a search window area around the area of ​​the current block, is used to search for the best matching reference block, and / or, e.g., whether pixel interpolation, e.g., half / semi-pel and / or quarter-pel interpolation, is applied.

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

[0147] The inter prediction unit 244 may include a motion estimation (ME) unit and a motion compensation (MC) unit (both not shown in FIG. 2). The motion estimation unit may be configured to receive or obtain a picture block 203 (current picture block 203 of current picture 17) and a decoded picture 231, or at least one or more previously reconstructed blocks, e.g. reconstructed blocks of one or more other / different previously decoded pictures 231, for motion estimation. For example, a video sequence may include the current picture and the previously decoded picture 231, in other words the current picture and the previously decoded picture 231 may be part of pictures forming a video sequence or may form a sequence of pictures.

[0148] The encoder 20 may be configured, for example, to select a reference block from multiple reference blocks of the same or different pictures from 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, where this offset is also called a motion vector (MV).

[0149] The motion compensation unit is configured to obtain, e.g., receive, inter prediction parameters and perform inter prediction based on or using the inter prediction parameters to obtain an inter prediction block 265. The motion compensation performed by the motion compensation unit may involve fetching or generating a prediction block based on the motion / block vectors determined by motion estimation, possibly performing interpolation up to sub-pixel accuracy. Interpolation filtering can 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 the motion vector for the PU of the current picture block, the motion compensation unit may locate the prediction block to which the motion vector points in one of the reference picture lists.

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

[0151] Entropy Coding

[0152] The entropy coding unit 270 may, for example, apply an entropy coding algorithm or scheme (e.g., a variable length coding (VLC) scheme, a context-adaptive VLC scheme (CAVLC), an arithmetic coding scheme, binarization, context-adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding, or another entropy coding methodology or technique) or bypass (non-compression) to the quantized coefficients 209, inter-prediction parameters, intra-prediction parameters, loop filter parameters, and / or other syntax elements to obtain coded picture data 21, which may be output via output 272, for example, in the form of a coded bitstream 21, so that, for example, the video decoder 30 can receive and use the parameters for decoding. The coded bitstream 21 may be transmitted to the video decoder 30 or may be stored in a memory for later transmission or retrieval by the video decoder 30.

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

[0154] Decoder and decoding method

[0155] 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 picture data 21 (e.g., encoded bitstream 21) encoded by, for example, encoder 20 to obtain a decoded picture 331. The encoded picture data or bitstream includes information for decoding the encoded picture data, for example data representing picture blocks (and / or tile groups or tiles) of an encoded video slice and associated syntax elements.

[0156] 3, 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 330, a mode application unit 360, an inter prediction unit 344, and an intra prediction unit 354. Inter prediction unit 344 may be or may include a motion compensation unit. Video decoder 30 may, in some examples, perform a decoding path that is generally the reverse of the encoding path described with respect to video encoder 100 from FIG. 2.

[0157] 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 (DRB) 230, inter prediction unit 344, and intra prediction unit 354 are also referred to as forming a "built-in 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 decoder 30 apply to the respective units and functions of video encoder 20.

[0158] Entropy Decoding

[0159] The entropy decoding unit 304 is configured to analyze the bitstream 21 (or in general, the coded picture data 21) and, for example, perform entropy decoding on the coded picture data 21 to obtain, for example, the quantization 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 scheme, as described with respect to the entropy coding 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 to provide 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 or used.

[0160] inverse quantization

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

[0162] Inverse Transform

[0163] The inverse transform processing unit 312 may be configured to receive the dequantized coefficients 311, also referred to as transform coefficients 311, and to 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 213. The transform may be an inverse transform, e.g., an inverse DCT, an inverse DST, an inverse integer transform, or a conceptually similar inverse transform process. The inverse transform processing unit 312 may be further configured to receive transform parameters or corresponding information from the coded picture data 21 (e.g., by analysis and / or decoding, e.g., by the entropy decoding unit 304) to determine a transform to be applied to the dequantized coefficients 311.

[0164] Reconstruction

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

[0166] filtering

[0167] Loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter reconstructed block 315 to obtain filtered block 321, e.g., to smooth pixel transitions or otherwise improve video quality. Loop filter unit 320 may 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.

[0168] Decoded Picture Buffer

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

[0170] The decoder 30 is arranged to output the decoded picture 311, for presentation or viewing to a user, eg via an output 312.

[0171] prediction

[0172] 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 intra prediction unit 254 and makes the splitting or partitioning decision and prediction based on partitioning and / or prediction parameters or respective information received from the decoded picture data 21 (e.g. by analysis and / or decoding, e.g. by the entropy decoding unit 304). The mode application unit 360 may be configured to make a prediction (intra prediction or inter prediction) for each block based on the reconstructed picture, block or respective samples (filtered or unfiltered) to obtain a prediction block 365.

[0173] When the video slice is coded as an intra-coded (I) slice, intra prediction unit 354 of mode application unit 360 is configured to generate 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 the 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 decoding 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 to 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), e.g., video may be coded using I, P or B tile groups and / or tiles.

[0174] Mode application unit 360 is configured to determine prediction information for video blocks of the current video slice by analyzing the motion vectors or relationship information and other syntax elements, and generate a prediction block for the current video block to be decoded using the prediction information. For example, mode application unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) to be used to code the video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), configuration information of one or more of a reference picture list for the slice, a motion vector for each inter coded video block of the slice, an inter prediction status for each inter coded video block of the slice, and other information for decoding the video blocks in the current video slice. The same or similar may apply to or be applied 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), e.g., video may be coded using I, P or B tile groups and / or tiles.

[0175] The embodiment of video encoder 30 shown in FIG. 3 may be further configured to partition and / or encode a picture by using slices (also referred to as video slices), where a picture may be partitioned or encoded using one or more slices (typically non-overlapping), and each slice may include one or more blocks (e.g., CTUs).

[0176] The embodiment of video decoder 30 shown in FIG. 3 may be configured to partition and / or decode 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 decoded using one or more tile groups (typically non-overlapping), where each tile group may include, for example, one or more blocks (e.g., CTUs) or one or more tiles, where each tile may be, for example, rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., full blocks or partial blocks.

[0177] 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 directly inverse quantize the residual signal for a particular block or frame without the inverse transform processing unit 312. In another implementation, the video decoder 30 may have the inverse quantization unit 310 and the inverse transform processing unit 312 combined into a single unit.

[0178] It should be understood that the encoder 20 and the decoder 30 may further process the processing result of the current step and output it 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.

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

[0180] Method 1: Remove the overflow MSB (most significant bit) using flow calculation.

number

number

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

number

number

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

[0183] 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 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 include optical-to-electrical (OE) and electrical-to-optical (EO) components coupled to the ingress port 410, the receiver unit 420, the transmitter unit 440, and the egress port 450 for the entry and exit of optical or electrical signals. The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., multi-core processors), FPGAs, ASICs, and DSPs. The processor 430 is in communication with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460. The processor 430 includes a coding module 470. The coding module 470 implements the disclosed embodiments described above. For example, the coding module 470 implements, processes, prepares, or provides various coding operations. Thus, the inclusion of the coding module 470 provides a substantial improvement to the functionality of the video coding device 400, resulting in the transformation of the video coding device 400 into different states. Alternatively, the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430.

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

[0185] FIG. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of the source device 12 and destination device 14 from FIG. 1 in accordance with an example embodiment.

[0186] The processor 502 in the apparatus 500 may be a central processing unit. Alternatively, the processor 502 may be any other type of device or devices now existing or later developed capable of manipulating or processing information. Although the disclosed implementations may be implemented using a single processor, such as processor 502, as shown, advantages in speed and efficiency may be achieved using multiple processors.

[0187] The memory 504 in the device 500 may be a read-only memory (ROM) device or a random access memory (RAM) device in implementation. Any other suitable type of storage device may be used as the memory 504. The memory 504 may include code and data 506 that is accessed by the processor 502 using a bus 512. The memory 504 may further include an operating system 508 and application programs 510, which include at least one program that 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.

[0188] The apparatus 500 may also further 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 a touch-sensitive element operable to sense touch input. The display 518 may be coupled to the processor 502 via the bus 512.

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

[0190] Triangular Partitioning Mode (TPM) and Geometric Motion Partitioning (GEO), also known as Triangular Merge Mode and Geometric Merge Mode, respectively, are partitioning techniques that allow non-horizontal and non-vertical boundaries between prediction partitions, where prediction unit PU1 and prediction unit PU2 are combined in regions using a weighted averaging procedure of subsets of their samples that pertain to different color components. TPM allows boundaries between prediction partitions along rectangular block diagonals, while with GEO the boundaries may be located at any position. In regions where the weighted averaging procedure is applied, the integers in the squares represent the weights W applied to the luma component of prediction unit PU1. PU1 In one example, the weights W applied to the luma component of prediction unit PU2 are PU2 is calculated as follows:

number

[0191] The syntax details for the TPM are presented in Table 1, where four syntax elements are used to signal information about the TPM. MergeTriangleFlag is a flag that identifies whether a TPM is selected ("0" means that a TPM is not selected, otherwise a TPM is selected). merge_triangle_split_dir is the split direction flag for the TPM ('0' means the split direction is from the top left corner to the bottom right corner, else the split direction is from the top right corner to the bottom left corner). merge_triangle_idx0 and merge_triangle_idx1 are the indices of merge candidates 0 and 1 used for the TPM. [Table 1] JPEG0007577749000007.jpg45123 In one example, the TPM This is described in RL. Liao and CS Lim, "CE10.3.1.b: Triangular prediction unit mode", contribution JVET-L0124 to the 12th JVET meeting, Macao, China, October 2018. GEO is This is described in the paper TIFF0007577749000008.tif39151. The disclosed method for harmonizing the TPM and / or GEO with the WP is to disable the TPM and / or GEO when the WP is applied. The first implementation is shown in Table 2, where the coding unit is checked to see if the value of the weightedPredFlag variable is equal to 0. The variable weightedPredFlag is derived as follows. - if slice_type is equal to P, weightedPredFlag is set equal to pps_weighted_pred_flag. - Otherwise (slice_type is equal to B), weightedPredFlag is set equal to pps_weighted_bipred_flag. The weighted prediction process can be switched at the picture level and slice level using the pps_weigheded_pred_flag and sps_weigheded_pred_flag syntax elements, respectively. As disclosed above, the variable weightedPredFlag indicates whether slice-level weighted prediction should be used when obtaining inter-predicted samples for a slice. [Table 2] TIFF0007577749000010.tif83169ciip_flag[x0][y0] specifies whether a combination of inter-picture merging and intra-picture prediction is applied for the current coding unit. The array indices x0, y0 specify the position (x0,y0) of the top-left luma sample of the considered coding block with respect to the top-left luma sample of the picture. When ciip_flag[x0][y0] is not present, it is inferred as follows: - cip_flag[x0][y0] is inferred to be equal to 1 if all of the following conditions are true: - sps_ciip_enabled_flag is equal to 1. - general_merge_flag[x0][y0] is equal to 1. - merge_subblock_flag[x0][y0] is equal to 0. - regular_merge_flag[x0][y0] is equal to 0. - cbWidth is less than 128. - cbHeight is less than 128. - cbWidth*cbHeight is greater than or equal to 64. - Otherwise, ciip_flag[x0][y0] is inferred to be equal to 0. When ciip_flag[x0][y0] is equal to 1, the variable IntraPredModeY[x][y], where x = x0..x0 + cbWidth-1 and y = y0..y0 + cbHeight-1, is set equal to INTRA_PLANAR. The variable MergeTriangleFlag[x0][y0] specifies whether triangle shape-based motion compensation is used to generate the prediction samples for the current coding unit when decoding a B slice, and is derived as follows: - MergeTriangleFlag[x0][y0] is set to 1 if all of the following conditions are true: - sps_triangle_enabled_flag is equal to 1. - slice_type equals B. - general_merge_flag[x0][y0] is equal to 1. - MaxNumTriangleMergeCand is greater than or equal to 2. - cbWidth*cbHeight is greater than or equal to 64. - regular_merge_flag[x0][y0] is equal to 0. - merge_subblock_flag[x0][y0] is equal to 0. - cip_flag[x0][y0] is equal to 0. - weigedPredFlag is equal to 0. - Otherwise, MergeTriangleFlag[x0][y0] is set equal to 0. A second implementation is presented in Table 3. If weightedPredFlag is equal to 1, the syntax element max_num_merge_cand_minus_max_num_triangle_cand is not present and is inferred with a value such that MaxNumTriangleMergeCand is less than 2. [Table 3] In particular, the following semantics may be used for the second implementation: max_num_merge_cand_minus_max_num_triangle_cand specifies the maximum number of triangle merge mode candidates supported in a slice subtracted from MaxNumMergeCand. When max_num_merge_cand_minus_max_num_triangle_cand is not present, sps_triangle_enabled_flag is equal to 1, slice_type is equal to B, weightedPredFlag is equal to 0, and MaxNumMergeCand is 2 or greater, max_num_merge_cand_minus_max_num_triangle_cand is inferred to be equal to pps_max_num_merge_cand_minus_max_num_triangle_cand_minus1+1. When max_num_merge_cand_minus_max_num_triangle_cand is not present, sps_triangle_enabled_flag is equal to 1, slice_type is equal to B, weightedPredFlag is equal to 1, and MaxNumMergeCand is 2 or greater, max_num_merge_cand_minus_max_num_triangle_cand is inferred to be equal to pMaxNumMergeCand or MaxNumMergeCand-1. The maximum number of triangle merge mode candidates, MaxNumTriangleMergeCand, is derived as follows: MaxNumTriangleMergeCand=MaxNumMergeCand―max_num_merge_cand_minus_max_num_triangle_cand When max_num_merge_cand_minus_max_num_triangle_cand is present, the value of MaxNumTriangleMergeCand shall be in the range from 2 to MaxNumMergeCand, inclusive. When max_num_merge_cand_minus_max_num_triangle_cand is not present (and sps_triangle_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumTriangleMergeCand is set equal to 0. When MaxNumTriangleMergeCand is equal to 0, triangle merge mode is not allowed for the current slice. The disclosed mechanism is applicable not only to TPM and GEO, but also to other non-rectangular prediction and partitioning modes, such as combined intra-inter prediction with triangular partitions. Since TPM and GEO are only applied in B slices, the variable weightedPredFlag in the above embodiment can be directly replaced by the variable pps_weighted_bipred_flag. A third implementation is shown in Table 6, in which the value of the weightedPredFlag variable for a coding unit is checked to see if it is equal to 0. The variable weightedPredFlag is derived as follows. - weightedPredFlag is set to 0 if all of the following conditions are met: luma_weight_l0_flag[i] is equal to 0 for i from 0 to NumRefIdxActive[0]. luma_weight_l1_flag[i] is equal to 0 for i from 0 to NumRefIdxActive[1]. chroma_weight_l0_flag[i] is equal to 0 for i from 0 to NumRefIdxActive[0]. chroma_weight_l0_flag[i] is equal to 0 for i from 0 to NumRefIdxActive[1]. - Otherwise, weightedPredFlag is set to 1. The derivation process of weightedPredFlag is such that if all weighting flags for the luma and chroma components and all reference indexes of the current slice are 0, then weighted prediction is disabled in the current slice; otherwise, weighted prediction may be used for the current slice. As disclosed above, the variable weightedPredFlag indicates whether slice-level weighted prediction should be used when obtaining inter-predicted samples for a slice. A fourth implementation is shown in Table 2, in which weightedPredFlag is replaced by slice_weighted_pred_flag, which is signaled in the slice header as shown in Table 4. As disclosed above, the syntax slice_weighted_pred_flag indicates whether slice-level weighted prediction should be used when obtaining inter-predicted samples for the slice. [Table 4] In particular, the following semantics may be used for the fourth implementation: slice_weighted_pred_flag equal to 0 specifies that weighted prediction is not applied to the current slice. slice_weighted_pred_flag equal to 1 specifies that weighted prediction is applied to the current slice. When not present, the value of slice_weighted_pred_flag is inferred to be 0. A fifth implementation is to disable the TPM at the block level due to compatibility constraints. For TPM coded blocks, there should be no weighting factors for the luma and chroma components of the reference pictures for the inter predictors P0 710 and P1 720 (as shown in FIG. 7). In more detail, refIdxA and predListFlagA specify the reference index and reference picture list of inter predictor P0, and refIdxB and predListFlagB specify the reference index and reference picture list of inter predictor P1. The variables lumaWeightedFlag and chromaWeightedFlag are derived as follows.

number

number

number

number

number

Number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

Equation

number

number

number

[0192] In one example, the decision of whether TPM or GEO is enabled is performed taking into account the reference picture lists that a block may use for non-rectangular weighted prediction: When the merge list for a block contains elements from only one reference picture list k, the value of the variable WPDisabled[k] determines whether this merge mode is enabled.

[0193] In one example, a merge list for a non-rectangular prediction mode is configured to include only elements for which weighted prediction is not enabled.

[0194] The remainder of the specification illustrates this example. The inputs to this process are: - the luminance position (xCb, yCb) of 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; - The variable cbHeight that specifies the height of the current coding block in luma samples. The output of this process is: - the availability flags availableFlagA0, availableFlagA1, availableFlagB0, availableFlagB1, and availableFlagB2 of the adjacent coding units - the reference indices refIdxLXA0, refIdxLXA1, refIdxLXB0, refIdxLXB1, and refIdxLXB2 of the adjacent coding units, - the utilization flags predFlagLXA0, predFlagLXA1, predFlagLXB0, predFlagLXB1, and predFlagLXB2 of adjacent coding units; - motion vectors of adjacent coding units with 1 / 16 fractional sample accuracy mvLXA0, mvLXA1, mvLXB0, mvLXB1 and mvLXB2, - Half-sample interpolation filter indices hpelIfIdxA0, hpelIfIdxA1, hpelIfIdxB0, hpelIfIdxB1, and hpelIfIdxB2, - Bidirectional prediction weight indices bcwIdxA0, bcwIdxA1, bcwIdxB0, bcwIdxB1, and bcwIdxB2. For the derivation of availableFlagB1, refIdxLXB1, predFlagLXB1, mvLXB1, hpelIfIdxB1, and bcwIdxB1, the following applies: - The luminance position (xNbB1, yNbB1) in the neighboring luma coding block is set equal to (xCb+cbWidth-1, yCb-1). - The derivation process for adjacent block availability as specified in clause 6.4.4 is called with inputs the current luminance position (xCurr, yCurr) set equal to (xCb, yCb), the adjacent luminance positions (xNbB1, yNbB1), CheckPredModeY set equal to true, and cIdx set equal to 0, and the output is assigned to the block availability flag availableB1. The variables availableFlagB1, refIdxLXB1, predFlagLXB1, mvLXB1, hpelIfIdxB1, and bcwIdxB1 are derived as follows: If availableB1 is equal to false, then availableFlagB1 is set equal to 0, both components of mvLXB1 are set equal to 0, refIdxLXB1 is set equal to -1, predFlagLXB1 is set equal to 0, X is 0 or 1, hpelIfIdxB1 is set to 0, and bcwIdxB1 is set equal to 0. - Otherwise, availableFlagB1 is set equal to 1 and the following allocation is made:

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

number

[0195] In one implementation as shown in FIG. 15 , a method for obtaining a maximum number of geometric partitioning merger mode candidates for video decoding is disclosed, the method including: A bitstream for a video sequence is obtained (S1501).

[0196] The bit stream may be obtained according to a wireless or wired network. The bit stream may be transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line, or infrared, radio, microwave, WIFI, Bluetooth, LTE, or 5G wireless technologies.

[0197] In one embodiment, the bitstream is a sequence of bits in the form of a Network Abstraction Layer (NAL) unit stream or byte stream that forms a representation of a sequence of access units (AUs) that form one or more Coded Video Sequences (CVSs).

[0198] In some embodiments, for a decoding process, a decoder side reads the bitstream and derives the decoded picture from the bitstream, and for an encoding process, an encoder side generates the bitstream.

[0199] Typically, a bitstream will contain syntax elements that are formed by a syntax structure. Syntax element: An element of data represented in a bitstream. Syntax structure: zero or more syntax elements that occur together in a bitstream in a specified order.

[0200] In a particular example, a bitstream format specifies the relationship between Network Abstraction Layer (NAL) unit streams and byte streams, both of which are referred to as bitstreams.

[0201] A bitstream can be in one of two formats: the NAL unit stream format or the byte stream format. The NAL unit stream format is conceptually the more "basic" type. The NAL unit stream format contains a sequence of syntactic structures called NAL units. This sequence is ordered in decoding order. There are constraints imposed on the decoding order (and) of the NAL units in a NAL unit stream.

[0202] The byte stream format may be constructed from the NAL unit stream format by ordering the NAL units in decoding order and prefixing each NAL unit with a start code prefix and zero or more zero-valued bytes to form a stream of bytes. The NAL unit stream format may be extracted from the byte stream format by searching for the location of a unique start code prefix pattern in this stream of bytes.

[0203] This term specifies the relationship between the source and the decoded pictures provided via the bitstream.

[0204] The video source represented by a bitstream is a sequence of pictures in decoding order.

[0205] The source and decoded pictures each consist of one or more sample arrays. - Luminance (Y) only (monochrome). - Luminance and two chrominances (YCbCr or YCgCo). - Green, Blue, Red (GBR, also known as RGB). - An array representing a sampling of other unspecified monochrome or tristimulus colors (e.g., also known as YZX, XYZ).

[0206] The variables and terms associated with these arrays are called Luminance (or L or Y) and Chrominance, and the two Chrominance arrays are called Cb and Cr, regardless of the actual color representation method used, which may be indicated in the syntax specified in the VUI parameters as specified in ITU-T H.SEI|ISO / IEC 23002-7.

[0207] The value of the first indicator is obtained according to the bit stream (S1502).

[0208] The first indicator represents the maximum number of MVP candidates to merge for a motion vector prediction MVP candidate.

[0209] In one example, the first indicator is represented according to a variable MaxNumMergeCand.

[0210] In one example, the maximum number of merging MVP candidates, MaxNumMergeCand, is derived as follows:

number

[0211] The value of the second indicator is obtained according to the bit stream (S1503). The second indicator represents whether geometric partition based motion compensation is enabled for the video sequence.

[0212] In one example, the second indicator is represented according to sps_geo_enabled_flag (sps_gpm_enabled_flag). sps_geo_enabled_flag equal to 1 specifies that geometric partition based motion compensation is enabled for the CLVS, and merge_gpm_partition_idx, merge_gpm_idx0, and merge_gpm_idx1 can be present in the CLVS coding unit syntax. sps_geo_enabled_flag equal to 0 specifies that geometric partition based motion compensation is disabled for the CLVS, and merge_gpm_partition_idx, merge_gpm_idx0, and merge_gpm_idx1 are not present in the CLVS coding unit syntax. When not present, the value of sps_geo_enabled_flag is inferred to be equal to 0.

[0213] In one implementation, obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

[0214] In one implementation, the value of the second indicator is obtained from a sequence parameter set SPS of the bitstream.

[0215] In one implementation, a value of the second indicator is parsed from a sequence parameter set SPS of the bitstream when the value of the first indicator is greater than or equal to a threshold value, the threshold value being an integer value, and in one example, the threshold value is 2.

[0216] For example, the value of the second indicator sps_gpm_enabled_flag is obtained according to the following: Sequence Parameter Set RBSP Syntax [Table 53]

[0217] The value of the third indicator is analyzed from the bit stream (S1504).

[0218] In one implementation, when the value of the first indicator is greater than a threshold value and when the value of the second indicator is equal to a preset value, a value of a third indicator is parsed from the bitstream, the third indicator representing a maximum number of geometric partitioning merge mode candidates subtracted from the value of the first indicator. The threshold value is an integer value and the preset value is an integer value. In one example, the threshold value is 2.

[0219] In one example, the preset value is one.

[0220] In one example, the value of the third indicator is obtained from a sequence parameter set SPS of the bitstream.

[0221] In one example, the third indicator is expressed according to sps_max_num_merge_cand_minus_max_num_geo_cand(sps_max_num_merge_cand_minus_max_num_gpm_cand). For example, the value of the third indicator sps_max_num_merge_cand_minus_max_num_gpm_cand is obtained according to the following: Sequence Parameter Set RBSP Syntax [Table 54]

[0222] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to two when the value of the first indicator is equal to the threshold value and the value of the second indicator is equal to a preset value.

[0223] In one implementation, the method further includes setting a value of the maximum number of geometric partitioning merge mode candidates to 0 when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value.

[0224] In one example, sps_max_num_merge_cand_minus_max_num_gpm_cand specifies the maximum number of geometric partitioning merge mode candidates supported by the SPS, subtracted from MaxNumMergeCand. The value of sps_max_num_merge_cand_minus_max_num_gpm_cand shall be in the range of 0 to MaxNumMergeCand-2 (inclusive). The maximum number of geometric partitioning merge mode candidates, MaxNumGpmMergeCand (MaxNumGeoMergeCand), is derived as follows:

number

[0225] In an implementation as shown in FIG. 16 , a video decoding device 1600 is disclosed, the video decoding device including: a receiving module 1601 configured to obtain a bitstream for a video sequence; an obtaining module 1602 configured to obtain a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates, the obtaining module 1602 configured to obtain a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and an analyzing module 1603 configured to analyze a value of a third indicator from the bitstream when the value of the first indicator is greater than a threshold and when the value of the second indicator is equal to a preset value, the third indicator representing the maximum number of geometric partitioning merging mode candidates subtracted from the value of the first indicator.

[0226] In one implementation, the determination module 1602 is configured to set a value of the maximum number of geometric partitioning merge mode candidates to two when the value of the first indicator is equal to a threshold value and the value of the second indicator is equal to a preset value.

[0227] In one implementation, the determination module 1602 is configured to set a value of the maximum number of geometric partitioning merge mode candidates to 0 when the value of the first indicator is less than a threshold value or the value of the second indicator is not equal to a preset value.

[0228] In one implementation, the threshold is two.

[0229] In one implementation, the preset value is 1.

[0230] In one implementation, obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

[0231] In one implementation, when the value of the first indicator is greater than or equal to a threshold, the value of the second indicator is parsed from a sequence parameter set SPS of the bitstream.

[0232] In one implementation, the value of the second indicator is obtained from a sequence parameter set SPS of the bitstream.

[0233] In one implementation, the value of the third indicator is obtained from a sequence parameter set SPS of the bitstream.

[0234] For further details regarding the receiving module 1601, the acquiring module 1602, and the analyzing module 1603, reference may be made to the above method examples and implementations.

[0235] Example 1. A method of video coding including signaling a number of merge mode candidates, comprising: - indicating the number of merge mode candidates for the normal mode (MaxNumMergeCand); - indicating whether non-rectangular mode is enabled via the non-rectangular merging enabled flag (sps_geo_enabled_flag); - indicating a number of non-rectangular merge mode candidates (sps_max_num_merge_cand_minus_max_num_geo_cand) when the non-rectangular merge enable flag value is non-zero and the number of merge mode candidates for a normal merge mode exceeds a first threshold; - indicating a non-rectangular merging valid flag when the number of merge mode candidates for the normal mode exceeds a second threshold (1); Example 2. The method of Example 1, wherein the non-rectangular merge enable flag value is determined after the process of deriving the MaxNumMergeCand value from the sps_six_minus_max_num_merge_cand syntax element is completed. Example 3. The method of the previous example, where the threshold check is a comparison of whether the number of merge mode candidates against the normal merge mode is greater than 2. Example 4. The method of example 1 or example 2, wherein the first threshold check is a comparison of whether the number of merge mode candidates against the normal merge mode is greater than 3.

[0236] In one example, an inter prediction method is disclosed, the method including: determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; obtaining one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and obtaining a prediction value for a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, where one of the inter prediction mode parameters indicates reference picture information for the current block, and the group of blocks includes the current block.

[0237] In one example, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and the non-rectangular inter prediction mode is disabled when weighted prediction is enabled.

[0238] In a possible implementation, the non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0239] In one example, determining that the non-rectangular inter prediction mode is allowed indicates that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0240] In one example, the group of blocks comprises a picture, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in a picture header of the picture.

[0241] In one example, the group of blocks comprises a slice, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in the slice header of the slice.

[0242] In one example, the non-rectangular inter prediction mode is a triangle partitioning mode.

[0243] In one example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0244] In one example, weighted prediction parameters are used for slice-level luminance correction.

[0245] In one example, weighted prediction parameters are used for block-level luminance correction.

[0246] In one example, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0247] In one example, an apparatus for inter prediction is disclosed, the apparatus including a non-transitory memory having processor-executable instructions stored therein, and a processor coupled to the memory, the processor configured to execute the processor-executable instructions to facilitate any one of the example methods.

[0248] In one example, a bitstream for inter prediction is disclosed, the bitstream including indication information for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks, and one or more inter prediction modes and weighted prediction parameters for the group of blocks, where a prediction value for a current block is obtained based on the one or more inter prediction mode parameters and the weighted prediction parameters, one of the inter prediction mode parameters indicating reference picture information for the current block, and the group of blocks including the current block.

[0249] In one example, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and the non-rectangular inter prediction mode is disabled when weighted prediction is enabled.

[0250] In one example, the non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0251] In one example, the indication includes that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0252] In one example, the group of blocks comprises a picture, and the weighted prediction parameters and indication information are in a picture header of the picture.

[0253] In one example, the group of blocks comprises a slice, and the weighted prediction parameters and indication information are in a slice header of the picture.

[0254] In one example, the non-rectangular inter prediction mode is a triangle partitioning mode.

[0255] In one example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0256] In one example, weighted prediction parameters are used for slice-level luminance correction.

[0257] In one example, weighted prediction parameters are used for block-level luminance correction.

[0258] In one example, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0259] In one example, an inter prediction device is disclosed that includes a determination module configured to determine whether a non-rectangular inter prediction mode is allowed for a group of blocks; an acquisition module configured to acquire one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and a prediction module configured to acquire a prediction value for a current block based on the one or more inter prediction mode parameters and the weighted prediction parameters, where one of the inter prediction mode parameters indicates reference picture information for the current block and the group of blocks includes the current block.

[0260] In one example, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and the non-rectangular inter prediction mode is disabled when weighted prediction is enabled.

[0261] In one example, the non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0262] In one example, the decision module is specifically configured to indicate that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0263] In one example, the group of blocks comprises a picture, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in a picture header of the picture.

[0264] In one example, the group of blocks comprises a slice, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in the slice header of the slice.

[0265] In one example, the non-rectangular inter prediction mode is a triangle partitioning mode.

[0266] In one example, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0267] In one example, weighted prediction parameters are used for slice-level luminance correction.

[0268] In one example, weighted prediction parameters are used for block-level luminance correction.

[0269] In one example, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0270] Embodiments provide efficient encoding and / or decoding using signal relationship information in slice headers only for slices that allow or enable bidirectional inter prediction, e.g., in bidirectional (B) predictive slices, also referred to as B slices.

[0271] The following describes application of the encoding method and decoding method shown in the above embodiment and a system using them.

[0272] 10 is a block diagram showing a content supply system 3100 for implementing a content distribution service. The content supply 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 via 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, etc.

[0273] The capture device 3102 may generate data and encode the data by the encoding method shown in the above embodiment. Alternatively, the capture device 3102 may distribute 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, an in-vehicle 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, the video encoder 20 included in the capture device 3102 may actually perform the video encoding process. If the data includes audio (i.e., voice), the audio encoder included in the capture device 3102 may actually perform the audio encoding process. In some practical scenarios, the capture device 3102 distributes the encoded video and audio data by multiplexing them together. In other practical scenarios, for example, in a video conferencing system, the encoded audio data and the encoded video data are not multiplexed. The capture device 3102 separately delivers the encoded audio data and the encoded video data to the terminal device 3106 .

[0274] In the content supply system 3100, the terminal device 310 receives and plays the encoded data. The terminal device 3106 can be a device having data receiving and recovery capability and capable of decoding the aforementioned encoded data, 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 3116, a video conferencing system 3118, a video surveillance system 3120, a Personal Digital Assistant (PDA) 3122, an in-vehicle device 3124, or any combination thereof. For example, the capture device 3106 may include the source device 14 as 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.

[0275] In a terminal device with 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. In a 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 show the decoded data.

[0276] If each device in the system performs encoding or decoding, it can use a picture encoding device or a picture decoding device as shown in the previous embodiment.

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

[0278] After the protocol progression unit 3202 processes the stream, a stream file is generated. The file is output to the demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into encoded audio data and encoded video data. As mentioned above, in some practical scenarios, such as 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.

[0279] 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 described in the previous embodiment decodes the video ES by the decoding method shown in the above embodiment to generate video frames, and transmits the data to a synchronization unit 3212. An audio decoder 3208 decodes the audio ES to generate audio frames, and transmits the data to a synchronization unit 3212. Alternatively, the video frames may be stored in a buffer (not shown in FIG. 11 ) before being supplied to the synchronization unit 3212. Alternatively, the audio frames may be stored in a buffer (not shown in FIG. 11 ) before being supplied to the synchronization unit 3212.

[0280] The synchronization unit 3212 synchronizes the video and audio frames and provides the video / audio to the video / audio display 3214. For example, the synchronization unit 3212 synchronizes the presentation of video and audio information. The information can be coded in a syntax using time stamps for the presentation of the encoded audio and visual data and time stamps for the delivery of the data stream itself. If subtitles are included in the stream, the subtitle decoder 3210 decodes the subtitles, synchronizes it with the video and audio frames, and provides the video / audio / subtitles to the video / audio / subtitle display 3216.

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

[0282] 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-valued division are defined. The numbering and counting conventions generally start at 0. For example, "first" is equivalent to number 0, "second" is equivalent to number 1, etc.

[0283] Arithmetic Operators The following arithmetic 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 the power of the exponent y of x. In other contexts, such notations are used as superscripts that are not intended to be interpreted as powers. / Integer division with the result 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.

[0284]

number

[0285]

number

[0286] Logical Operators The following logical operators are defined as follows: x&&y The Boolean logic "and" of x and y x||y The Boolean logic "or" of x and y Boolean logic "negation" x?y:zIf x is TRUE or not 0, it is evaluated with the value of y, otherwise it is evaluated with the value of z.

[0287] 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 distinct value for that syntax element or variable. The value "na" is considered unequal to any other value.

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

[0289] Assignment operators The following assignment operators are defined as follows. = is the assignment operator ++ is increment, i.e., x++ is equivalent to x=x+1, and when used as an array index, it is evaluated with the value of the variable before the increment operation. -- is decrement, i.e., x++ is equivalent to x=x+1, and when used as an array index, it is evaluated with 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).

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

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

[0292]

number

[0293]

number

[0294]

number

[0295]

number

[0296]

number

[0297]

number

[0298] Operation precedence order If the precedence of an expression is not stated explicitly 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. The following table specifies the priority of operations from highest to lowest, with a higher position in the table indicating a higher priority. For those operators that are also used in the C programming language, the precedence used herein is the same as the precedence used in the C programming language.

[0299] [Table 55] Table: Operation precedence from highest (top of table) to lowest (bottom of table)

[0300] Logical operations in text In this text, a description of logical operations written mathematically in the form

[0301]

number

[0302]

number

[0303]

number

[0304]

number

[0305]

number

[0306]

number

[0307] By way of example, and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage devices, 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. Any connection is also 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, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of media. However, computer-readable storage media and data storage media should be understood not to include connections, carrier waves, signals, or other transitory media, but instead to non-transitory, tangible storage media. Disks, as used herein, include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where disks typically reproduce data magnetically and disks reproduce data optically with a laser. Combinations of the above should also be included within the scope of computer readable media.

[0308] 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 other structures suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided in dedicated hardware and / or software modules configured for encoding and decoding, or may be incorporated into a combined codec. Also, the techniques may be implemented entirely in one or more circuit or logic elements.

[0309] The techniques of the present disclosure may be implemented in a wide variety of devices or apparatuses, including wireless handsets, integrated circuits (ICs), or sets of ICs (e.g., chipsets). In this disclosure, various components, modules, or units are described to highlight functional aspects of devices 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 interoperable hardware units, including one or more processors as described above, along with appropriate software and / or firmware.

[0310] Below further embodiments of the present invention are provided. Please note that the numbering used in the following sections does not necessarily conform to the numbering used in the previous sections.

[0311] Embodiment 1: A method for inter-prediction of a block of a picture, in which signaling of weighted prediction parameters and enabling of non-rectangular inter-prediction is performed for a group of predictive blocks, the method including: obtaining inter-prediction mode parameters for a block, the obtaining including checking whether non-rectangular inter-prediction mode is enabled for the group of blocks including the predictive block; and obtaining weighted prediction parameters associated with the block and inter-prediction mode parameters for the block, in which a reference picture is indicated for the block and the weighted prediction parameters are specified for the group of blocks. Embodiment 2: The method of embodiment 1, wherein enabling non-rectangular inter prediction is performed by indicating a maximum number of triangle merge candidates (MaxNumTriangleMergeCand) greater than one. Embodiment 3: The method according to embodiment 1 or 2, wherein non-rectangular inter prediction is inferred to be disabled when the weighted prediction parameters specify a valid weighted prediction for at least one reference index. Embodiment 4: The method according to any one of embodiments 1 to 3, wherein the group of blocks is a picture and enabling the weighted prediction parameters and the non-rectangular inter prediction mode parameters is indicated in the picture header. Embodiment 5: A method according to any one of embodiments 1 to 4, wherein the group of blocks is a slice, and enabling the weighted prediction parameters and the non-rectangular mode parameters of inter prediction is indicated in a slice header. Embodiment 6: The method of any one of embodiments 1 to 5, wherein the inter prediction mode parameters include a reference index used to determine a reference picture and motion vector information used to determine a position of a reference block within the reference picture. Embodiment 7: The method of any one of embodiments 1 to 6, wherein the non-rectangular merging mode is a triangle partitioning mode. Embodiment 8: The method of any one of embodiments 1 to 7, wherein the non-rectangular merge mode is a GEO mode. Embodiment 9: The method of any one of embodiments 1 to 8, wherein the weighted prediction is a slice-level illumination compensation mechanism (such as global weighted prediction). Embodiment 10: The method of any one of embodiments 1 to 9, wherein the weighted prediction is a block-level luminance compensation mechanism (such as local luminance prediction) (LIC). Embodiment 11: The method of embodiments 1 to 10, wherein the weighted prediction parameters include a set of flags indicating whether weighted prediction is applied to the luminance and chrominance components of the prediction block, and linear model parameters α and β that specify a linear transformation of the values ​​of the prediction block.

[0312] In one aspect of the present application, as shown in FIG. 12, an inter prediction method 1200 is disclosed, the method including: determining whether a non-rectangular inter prediction mode is allowed for a group of blocks (S1201); obtaining one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks (S1202); and obtaining a prediction value for a current block based on the one or more inter prediction mode parameters and weighted prediction parameters, where one of the inter prediction mode parameters indicates reference picture information for the current block, and the group of blocks includes the current block (S1203).

[0313] In a possible implementation, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and non-rectangular inter prediction modes are disabled if weighted prediction is enabled.

[0314] In a possible implementation, non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0315] In a possible implementation, determining that the non-rectangular inter prediction mode is allowed indicates that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0316] In a possible implementation, the group of blocks comprises a picture, and the weighted prediction parameters and the indication for determining that a non-rectangular prediction mode is allowed are in the picture header of the picture.

[0317] In a possible implementation, the group of blocks comprises a slice, and the weighted prediction parameters and the indication for determining that a non-rectangular prediction mode is allowed are in the slice header of the slice.

[0318] In a possible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode.

[0319] In a possible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0320] In a possible implementation, the weighted prediction parameters are used for slice-level luminance correction.

[0321] In a possible implementation, the weighted prediction parameters are used for block-level luminance correction.

[0322] In a possible implementation, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block, and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0323] In a second aspect of the present application, an apparatus 1300 for inter prediction as shown in FIG. 13 includes a non-transitory memory 1301 storing processor-executable instructions and a processor 1302 coupled to the memory 1301, the processor 1302 being configured to execute the processor-executable instructions to facilitate any one of the possible implementations of the first aspect of the present application.

[0324] In a third aspect of the present application, a bitstream for inter prediction is disclosed, the bitstream including indication information for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks, and one or more inter prediction modes and weighted prediction parameters for the group of blocks, where a prediction value of a current block is obtained based on the one or more inter prediction mode parameters and the weighted prediction parameters, one of the inter prediction mode parameters indicating reference picture information for the current block, and the group of blocks including the current block.

[0325] In a possible implementation, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and non-rectangular inter prediction modes are disabled if weighted prediction is enabled.

[0326] In a possible implementation, non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0327] In a possible implementation, the indication includes that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0328] In a possible implementation, the group of blocks comprises a picture, and the weighted prediction parameters and indication information are in the picture header of the picture.

[0329] In a possible implementation, the group of blocks comprises a slice, and the weighted prediction parameters and indication information are in the slice header of the picture.

[0330] In a possible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode.

[0331] In a possible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0332] In a possible implementation, the weighted prediction parameters are used for slice-level luminance correction.

[0333] In a possible implementation, the weighted prediction parameters are used for block-level luminance correction.

[0334] In a possible implementation, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block, and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0335] In a fourth aspect of the present application, as shown in FIG. 14, an inter prediction device 1400 is disclosed, the device including: a determination module 1401 configured to determine whether a non-rectangular inter prediction mode is allowed for a group of blocks; an acquisition module 1402 configured to acquire one or more inter prediction mode parameters and weighted prediction parameters for the group of blocks; and a prediction module 1403 configured to acquire a prediction value of a current block based on the one or more inter prediction mode parameters and the weighted prediction parameters, where one of the inter prediction mode parameters indicates reference picture information for the current block, and the group of blocks includes the current block.

[0336] In a possible implementation, the reference picture information includes whether weighted prediction is enabled for the reference picture index, and non-rectangular inter prediction modes are disabled if weighted prediction is enabled.

[0337] In a possible implementation, non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0338] In a possible implementation, the determining module 1401 is specifically configured to indicate that the maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0339] In a possible implementation, the group of blocks comprises a picture, and the weighted prediction parameters and the indication for determining that a non-rectangular prediction mode is allowed are in the picture header of the picture.

[0340] In a possible implementation, the group of blocks comprises a slice, and the weighted prediction parameters and the indication for determining that a non-rectangular prediction mode is allowed are in the slice header of the slice.

[0341] In a possible implementation, the non-rectangular inter prediction mode is a triangular partitioning mode.

[0342] In a possible implementation, the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0343] In a possible implementation, the weighted prediction parameters are used for slice-level luminance correction.

[0344] In a possible implementation, the weighted prediction parameters are used for block-level luminance correction.

[0345] In a possible implementation, the weighted prediction parameters include a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block, and linear model parameters specifying a linear transformation of the values ​​of the prediction block.

[0346] The prior art methods can be summarized in the following list of aspects.

[0347] Aspect 1. An inter prediction method, comprising: determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; obtaining one or more inter prediction mode parameters and weighted prediction parameters for a group of blocks; and obtaining a prediction value for a current block based on one or more inter-prediction mode parameters and a weighted prediction parameter, where one of the inter-prediction mode parameters indicates reference picture information for the current block and the group of blocks includes the current block.

[0348] Aspect 2. The method of aspect 1, wherein the reference picture information includes whether weighted prediction is enabled for the reference picture index, and the non-rectangular inter prediction mode is disabled if weighted prediction is enabled.

[0349] Aspect 3. The method of aspect 1 or 2, wherein the non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0350] Aspect 4. Determining that a non-rectangular inter prediction mode is allowed comprises: The method according to any one of aspects 1 to 3, comprising indicating that a maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than one.

[0351] Aspect 5. A method according to any one of aspects 1 to 4, wherein the group of blocks comprises a picture, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in a picture header of the picture.

[0352] Aspect 6. A method according to any one of aspects 1 to 4, wherein the group of blocks comprises a slice, and the weighted prediction parameters and the indication information for determining that a non-rectangular prediction mode is allowed are in a slice header of the slice.

[0353] Aspect 7. The method of any one of aspects 1 to 6, wherein the non-rectangular inter prediction mode is a triangular partitioning mode.

[0354] Aspect 8. The method of any one of aspects 1 to 6, wherein the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0355] Aspect 8a. A method according to any one of aspects 1 to 8, wherein a syntax element relating to the number of merge mode candidates (indicating information for determining non-rectangular inter prediction) is signaled in a sequence parameter set (SPS).

[0356] Example 8b. The method of any one of examples 1 to 8a, wherein the picture header is signaled in the slice header when the picture includes only one slice.

[0357] Example 8c. The method of any one of examples 1 to 8b, wherein the picture header is signaled in the slice header when the picture includes only one slice.

[0358] Aspect 8d. The method of any one of aspects 1 to 8c, wherein the picture parameter set includes a flag, the value of the flag defining whether the weighting parameter is present in the picture header or the slice header.

[0359] A method according to any one of the corresponding claims 1 to 8d, wherein a flag in the picture header indicates whether a non-intra type slice is present and whether inter prediction mode parameters are signaled for this slice.

[0360] Aspect 9. The method according to any one of aspects 1 to 8, wherein the weighted prediction parameters are used for slice-level luminance compensation.

[0361] Aspect 10. The method according to any one of aspects 1 to 8, wherein the weighted prediction parameters are used for block-level illumination compensation.

[0362] Aspect 11. The weighted prediction parameters are a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block; and linear model parameters specifying a linear transformation of values ​​of the prediction block.

[0363] Aspect 12. An apparatus for inter prediction, comprising: a non-uniform memory having processor-executable instructions stored therein; An apparatus comprising: a processor coupled to the memory, the processor executing processor-executable instructions to facilitate any one of aspects 1-11.

[0364] Aspect 13. A bitstream for inter prediction, comprising: an indication for determining whether a non-rectangular inter prediction mode is allowed for a group of blocks; and one or more inter prediction modes and weighted prediction parameters for the group of blocks, wherein a prediction value for the current block is obtained based on the one or more inter prediction mode parameters and the weighted prediction parameters, one of the inter prediction mode parameters indicating reference picture information for the current block, and the group of blocks includes the current block.

[0365] Aspect 14. The bitstream of aspect 13, wherein the reference picture information includes whether weighted prediction is enabled for the reference picture index, and the non-rectangular inter prediction mode is disabled if weighted prediction is enabled.

[0366] Example 15. The bitstream of example 13 or 14, wherein the non-rectangular inter prediction mode is enabled when weighted prediction is disabled.

[0367] Aspect 16. The bitstream of any one of aspects 13 to 15, wherein the instruction information is such that a maximum number of triangle merge candidates (MaxNumTriangleMergeCand) is greater than 1.

[0368] Aspect 17. The bitstream according to any one of aspects 13 to 16, wherein the group of blocks comprises a picture, and the weighted prediction parameters and the indication information are in a picture header of the picture.

[0369] Aspect 18. The bitstream according to any one of aspects 13 to 17, wherein the group of blocks comprises a slice, and the weighted prediction parameters and the indication information are in a slice header of the picture.

[0370] Example 19. The bitstream of any one of examples 13 to 18, wherein the non-rectangular inter prediction mode is a triangular partitioning mode.

[0371] Example 20. The bitstream of any one of examples 13 to 19, wherein the non-rectangular inter prediction mode is a geometric (GEO) partitioning mode.

[0372] Example 21. The bitstream according to any one of examples 13 to 20, wherein the weighted prediction parameters are used for slice-level illumination compensation.

[0373] Example 22. The bitstream according to any one of examples 13 to 20, wherein the weighted prediction parameters are used for block-level illumination compensation.

[0374] Aspect 23. The weighted prediction parameters are a flag indicating whether weighted prediction is applied to the luma and / or chroma components of the prediction block; 23. The bitstream of any one of aspects 13 to 22, further comprising: linear model parameters that specify a linear transformation of values ​​of the prediction block.

Claims

1. 1. A method for obtaining a maximum number of geometric partitioning merge mode candidates for video decoding, comprising: Obtaining a bitstream for a video sequence; obtaining a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates; obtaining a value of a second indicator according to the bitstream, the second indicator indicating whether geometric partition based motion compensation is enabled for the video sequence; and parsing a value of a third indicator from the bitstream when a value of the first indicator is greater than a threshold and when a value of the second indicator is equal to a preset value, the third indicator representing a maximum number of the geometric partitioning merge mode candidates subtracted from the value of the first indicator; obtaining a maximum number of the geometric partitioning merge mode candidates according to the value of the first indicator and the value of the third indicator; (i) setting a value of the maximum number of geometric partitioning merge mode candidates to two when a value of the first indicator is equal to the threshold value and (ii) a value of the second indicator is equal to the preset value.

2. The method of claim 1 , wherein the threshold is two.

3. The method according to claim 1 or 2, wherein the preset value is one.

4. The method according to any one of claims 1 to 3, wherein obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

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

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

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

8. 1. A video decoding device, comprising: a receiving module configured to obtain a bitstream for a video sequence; a obtaining module configured to obtain a value of a first indicator according to the bitstream, the first indicator representing a maximum number of merging motion vector prediction MVP candidates; the acquisition module is configured to acquire a value of a second indicator according to the bitstream, the second indicator representing whether geometric partition based motion compensation is enabled for the video sequence; and an analysis module configured to analyze a value of a third indicator from the bitstream when a value of the first indicator is greater than a threshold and when a value of the second indicator is equal to a preset value, the third indicator representing a maximum number of geometric partitioning merge mode candidates subtracted from a value of the first indicator; a maximum number of geometric partitioning merge mode candidates is obtained according to the value of the first indicator and the value of the third indicator; the obtaining module is configured to set a value of the maximum number of geometric partitioning merge mode candidates to 2 when (i) the value of the first indicator is equal to the threshold value, and (ii) the value of the second indicator is equal to the preset value.

9. The video decoding apparatus of claim 8 , wherein the threshold is two.

10. The video decoding device according to claim 8 or 9, wherein the preset value is one.

11. A video decoding apparatus according to any one of claims 8 to 10, wherein obtaining the value of the second indicator is performed after obtaining the value of the first indicator.

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

13. Video decoding apparatus according to any one of claims 8 to 12, wherein the value of the second indicator is obtained from a sequence parameter set SPS of the bitstream.

14. Video decoding apparatus according to any one of claims 8 to 13, wherein the value of the third indicator is obtained from a sequence parameter set SPS of the bitstream.

15. A computer program comprising a program code for performing the method according to any one of claims 1 to 7, when the computer program is run on a computer or a processor.

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

Citation Information

Patent Citations

  • METHOD AND APPARATUS FOR VIDEO CODING - Patent application

    JP2022531443A

  • Merge Mode, Adaptive Motion Vector Accuracy, and Transform Skip Syntax

    JP2023508020A

  • Image encoding / decoding method and device using sequence parameter set including information on maximum number of merge candidates, and bitstream transmission method

    JP2023510846A

  • Method and apparatus for matching weighted prediction with non-rectangular merge modes

    JP2023510858A

  • Global motion constrained motion vector in inter prediction

    US20210021863A1