Video coding and decoding method and device, computer equipment and storage medium

Abstract

The embodiment of the invention provides a video encoding and decoding method and device, computer equipment and a storage medium. In a method, encoded information for a current block in a current picture of a video is received from an encoded video bitstream. The encoded information indicates that the current block is partitioned into at least a first partition and a second partition based on a geometric partition mode (GPM). The first partition is associated with an intra block copy (IBC) prediction mode, and the second partition is associated with an intra prediction mode. Prediction mode information of a first sub-block of the plurality of sub-blocks of the current block is stored. Based on whether the first sub-block is associated with one of the IBC prediction mode, the intra prediction mode, and both the IBC prediction mode and the intra prediction mode, the prediction mode information includes one of a DC mode, a planar mode, and an intra prediction mode.

Description

Incorporated herein by reference

[0001] This application claims priority to U.S. Patent Application No. 17 / 898,447, filed on August 29, 2022, entitled “Intra Prediction Mode Information Propagation with IBC and Geometric Partitioning Mode for Intra Prediction”, which claims priority to U.S. Provisional Application No. 63 / 239,221, filed on August 31, 2021, entitled “Intra Prediction Mode Information Propagation with IBC and Geometric Partitioning Mode for Intra Prediction”. The disclosure of the prior application is incorporated herein by reference in its entirety. Technical Field

[0002] This disclosure describes embodiments that generally relate to video encoding and decoding. Background Art

[0003] An uncompressed digital image and / or video may include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luma samples and associated chroma samples. The series of pictures may have a fixed or variable picture rate (also informally referred to as a frame rate), such as 60 pictures per second or 60 Hz. Uncompressed images and / or videos have specific bit rate requirements. For example, 1080p60 4:2:0 video (1920x1080 luma sample resolution at 60 Hz frame rate) with 8 bits per sample requires close to 1.5 Gbit / s of bandwidth. One hour of such video would require over 600 GB of storage space.

[0004] One purpose of image and / or video encoding and decoding is to reduce the redundancy of input image and / or video signal by compression. Compression can help reduce the requirements of the above-mentioned bandwidth and / or storage space, and in some cases can reduce it by two or more orders of magnitude. Although the description of this article uses video encoding / decoding as an illustrative example, the same technology can be applied to image encoding / decoding in a similar manner without departing from the spirit of the present disclosure. Lossless compression and lossy compression, as well as a combination of the two, can be adopted. Lossless compression refers to the technology of reconstructing an exact copy of the original signal from the compressed original signal. When lossy compression is used, the reconstructed signal may not be exactly the same as the original signal, but the distortion between the original signal and the reconstructed signal is small enough so that the reconstructed signal can be used for the intended application. Lossy compression is widely used in video. The amount of distortion allowed depends on the application. For example, users of some consumer streaming applications can tolerate higher distortion than users of television applications. The achievable compression ratio reflects that higher allowed / allowed distortion can produce higher compression ratios.

[0005] Video encoders and decoders may utilize several broad categories of techniques including, for example: motion compensation, transform processing, quantization, and entropy coding.

[0006] Video codec techniques may include known intra-frame coding techniques. In intra-frame coding, sample values ​​are represented without reference to samples or other data of previously reconstructed reference pictures. In some video codecs, pictures are spatially subdivided into sample blocks. When all sample blocks are coded and decoded in intra-frame mode, the picture may be an intra-frame picture. Intra-frame pictures and their derivatives (e.g., independent decoder refresh pictures) may be used to reset decoder states, and may therefore be used as the first picture in an encoded video bitstream and video session, or as a still image. Samples of intra-frame blocks may be used for transformation, and transform coefficients may be quantized before entropy coding. Intra-frame prediction may be a technique for minimizing sample values ​​in a pre-transform domain. In some cases, the smaller the transformed DC value and the smaller the AC coefficient, the fewer bits are required to represent the entropy-coded block at a given quantization step size.

[0007] For example, conventional intra-frame codecs used in MPEG-2 (Moving Picture Experts Group-2) codecs do not use intra-frame prediction. However, some newer video compression techniques include techniques that attempt to perform predictions based on, for example, surrounding sample data and / or metadata that are obtained during encoding and / or decoding of a block of data. Such techniques have subsequently become known as "intra-frame prediction" techniques. It should be noted that, at least in some cases, intra-frame predictions use only reference data of the current picture being reconstructed, and not reference data of reference pictures.

[0008] There can be many different forms of intra-frame prediction. When more than one such technique can be used in a given video codec technique, the specific technique used can be encoded as a specific intra-frame prediction mode that uses that specific technique. In some cases, an intra-frame prediction mode can have sub-modes and / or parameters, where these sub-modes and / or parameters can be encoded separately or contained in a mode codeword that defines the prediction mode used. Which codeword is used for a given mode, sub-mode and / or parameter combination affects the codec efficiency gain obtained through intra-frame prediction, and therefore the entropy coding technique used to convert the codeword into the bitstream.

[0009] H.264 introduced an intra prediction mode, which was improved in H.265 and further improved in newer codecs such as the Joint Exploitation Model (JEM), Versatile Video Codec (VVC), Benchmark Sets (BMS), etc. A prediction block can be formed using neighboring sample values ​​of samples that are already available. Sample values ​​of neighboring samples are copied into the prediction block in a certain direction. A reference to the direction used can be encoded in the bitstream or can itself be predicted.

[0010] Reference Figure 1A, a subset of nine known prediction directions from the 33 possible prediction directions defined by H.265 (corresponding to the 33 angular modes of the 35 intra modes) is depicted in the lower right. The point (101) where the arrows converge represents the sample being predicted. The arrows represent the direction in which the sample is being predicted. For example, arrow (102) indicates that sample (101) is predicted based on one or more samples at a 45 degree angle to the horizontal direction at the upper right. Similarly, arrow (103) indicates that sample (101) is predicted based on one or more samples at a 22.5 degree angle to the horizontal direction at the lower left.

[0011] Still reference Figure 1A , a square block (104) consisting of 4×4 samples is shown in the upper left (indicated by the thick dashed line). The square block (104) consists of 16 samples, each of which is labeled with "S" and its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample in the Y dimension (starting from the top) and the first sample in the X dimension (starting from the left). Similarly, sample S44 is the fourth sample in the block (104) in both the Y dimension and the X dimension. Since the block is a 4×4 size sample, S44 is located in the lower right corner. Reference samples following a similar numbering scheme are also shown. Reference samples are labeled with "R" and their Y position (e.g., row index) and X position (e.g., column index) relative to the block (104). In H.264 and H.265, the prediction samples are adjacent to the block being reconstructed, so there is no need to use negative values.

[0012] Intra-picture prediction can be performed by copying reference sample values ​​from neighboring samples, where the neighboring samples are indicated by a signaled prediction direction. For example, assume that the encoded video bitstream includes signaling that indicates, for this block, a prediction direction consistent with arrow (102), i.e., the sample is predicted based on the sample to the upper right at a 45 degree angle to the horizontal direction. In this case, samples S41, S32, S23, and S14 are predicted based on the same reference sample R05. Then, sample S44 is predicted based on sample R08.

[0013] In some cases, for example by interpolation, the values ​​of multiple reference samples may be combined in order to calculate the reference sample, particularly when the direction is not divisible by 45 degrees.

[0014] As video codecs have evolved, the number of possible directions has increased. In H.264 (2003), nine different directions could be represented. This increased to 33 in H.265 (2013). Currently, JEM / VVC / BMS can support up to 65 directions. Experiments have been done to identify the most likely directions, and certain techniques in entropy coding are used to represent those possible directions using a small number of bits, accepting some penalty for less likely directions. Additionally, the direction itself can sometimes be predicted based on neighboring directions used in adjacent, already decoded blocks.

[0015] Figure 1B A schematic diagram (110) is shown, which depicts 65 intra prediction directions according to JEM to illustrate the increase in the number of prediction directions over time.

[0016] The mapping of the intra-frame prediction direction bits representing directions in the encoded video bitstream can vary depending on the video codec technology. For example, such mapping can include simple direct mapping to codewords, to complex adaptive schemes including the most likely mode, and similar techniques. However, in most cases, there may be certain directions in the video content that are statistically less likely to occur than other directions. Since the purpose of video compression is to reduce redundancy, in a well-functioning video codec technology, those unlikely directions will be represented using a larger number of bits than more likely directions.

[0017] Image and / or video encoding and decoding may be performed using inter-picture prediction with motion compensation. Motion compensation may be a lossy compression technique and may involve a technique where a block of sample data from a previously reconstructed picture or part of a reconstructed picture (reference picture) is used for prediction of a newly reconstructed picture or part of a picture after being spatially shifted in a direction indicated by a motion vector (hereinafter MV). In some cases, the reference picture may be the same as the picture currently being reconstructed. The MV may have two dimensions, X and Y, or three dimensions, where the third dimension indicates the reference picture being used (the latter may indirectly be a temporal dimension).

[0018] In some video compression techniques, the MV applied to a region of sample data can be predicted based on other MVs, such as those MVs related to another region of sample data that is spatially adjacent to the region being reconstructed and that precede the MV in decoding order. Doing so can greatly reduce the amount of data required to encode and decode the MV, thereby eliminating redundancy and increasing the amount of compression. MV prediction can be done efficiently, for example, because when encoding and decoding an input video signal derived from a camera (called natural video), there is a statistical probability that regions larger than the region applicable to a single MV move in a similar direction, so in some cases, similar motion vectors derived from MVs of adjacent regions can be used for prediction. This results in the MV found for a given region being similar or identical to the MV predicted from the surrounding MVs, and after entropy encoding and decoding, it can be represented with fewer bits than the number of bits used when the MV is directly encoded and decoded. In some cases, MV prediction can be an example of lossless compression of a signal (i.e., MV) derived from the original signal (i.e., sample stream). In other cases, MV prediction itself may be lossy, for example due to rounding errors generated when calculating predicted values ​​based on several surrounding MVs.

[0019] H.265 / HEVC (ITU-T Recommendation H.265, "High Efficiency Video Codec", December 2016) describes various MV prediction mechanisms. Among the various MV prediction mechanisms provided by H.265, refer to Figure 2 Described is a technique referred to hereinafter as "spatial merging".

[0020] Reference Figure 2 , the current block (201) includes samples found by the encoder during motion search, which can be predicted based on a previous block of the same size that has been spatially shifted. The MV is not encoded or decoded directly, but the MV associated with any of the five surrounding samples is used to derive the MV from metadata associated with one or more reference pictures, for example, the most recent (in decoding order) reference picture. The five surrounding samples are represented by A0, A1 and B0, B1, B2 (202 to 206 respectively). In H.265, MV prediction can use the prediction value of the same reference picture being used by the neighboring blocks. Summary of the invention

[0021] Aspects of the present disclosure provide methods and apparatus for video encoding / decoding. In some examples, the apparatus for video decoding includes a processing circuit.

[0022] According to aspects of the present disclosure, a video decoding method performed in a video decoder is provided. In the method, encoded information of a current block in a current picture of a video can be received from an encoded video bitstream. The encoded information can indicate that the current block is divided into at least a first partition and a second partition based on a geometric partition mode (GPM). The first partition can be associated with an intra-block copy (IBC) prediction mode, and the second partition can be associated with an intra-prediction mode. Prediction mode information of a first sub-block of a plurality of sub-blocks of the current block can be stored. Based on whether the first sub-block is associated with the IBC prediction mode, one of the intra-prediction modes, and both the IBC prediction mode and the intra-prediction mode, the prediction mode information may include one of a DC mode, a planar mode, and an intra-prediction mode.

[0023] In the method, most probable mode (MPM) derivation may be performed on neighboring blocks of the current block using the stored prediction mode information.

[0024] In some embodiments, based on the first sub-block being associated with the IBC prediction mode, storing the prediction mode information may include storing only the planar mode among the prediction mode information of the first sub-block of the plurality of sub-blocks of the current block.

[0025] In some embodiments, based on the first subblock being associated with the intra prediction mode, storing the prediction mode information may include storing only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block.

[0026] In some embodiments, based on the first subblock being associated with both the IBC prediction mode and the intra prediction mode, storing the prediction mode information may include storing only the intra prediction mode in the prediction mode information of the first subblock of the multiple subblocks of the current block.

[0027] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the DC mode for each of the multiple subblocks of the current block may be stored.

[0028] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the planar mode for each of the multiple subblocks of the current block may be stored.

[0029] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the intra prediction mode for each of the multiple subblocks of the current block may be stored.

[0030] In some embodiments, the prediction mode information of the first subblock of the multiple subblocks of the current block may be the propagated intra mode derived by the MPM for the neighboring block of the current block, the neighboring block being predicted by the IBC prediction mode.

[0031] In some embodiments, each of the multiple sub-blocks of the current block may be a corresponding 4 by 4 pixel unit.

[0032] According to aspects of the present disclosure, a method for video encoding is provided, comprising: dividing a current block in a current picture of a video into at least a first partition and a second partition based on a geometric partition mode GPM, the first partition being associated with an intra-block copy IBC prediction mode, and the second partition being associated with an intra-prediction mode; storing prediction mode information of a first sub-block of a plurality of sub-blocks of the current block, based on whether the first sub-block is associated with the IBC prediction mode, one of the intra-prediction modes, and both the IBC prediction mode and the intra-prediction mode, the prediction mode information comprising one of a DC mode, a planar mode, and an intra-prediction mode; and generating encoding information of the current block, the encoding information indicating that the current block is divided based on the GPM.

[0033] According to an aspect of the present disclosure, a device is provided, wherein the device comprises a processing circuit, and the processing circuit can be configured to perform any one of the video encoding / decoding methods.

[0034] According to an aspect of the present disclosure, a video decoding device is provided, comprising: a receiving module, for receiving encoded information of a current block in a current picture of a video from an encoded video bitstream, the encoded information indicating that the current block is divided into at least a first partition and a second partition based on a geometric partition mode GPM, wherein the first partition is associated with an intra-block copy (IBC) prediction mode, and the second partition is associated with an intra-prediction mode; and a storage module, for storing prediction mode information of a first sub-block of a plurality of sub-blocks of the current block, the prediction mode information comprising one of a DC mode, a planar mode, and an intra-prediction mode based on whether the first sub-block is associated with the IBC prediction mode, one of the intra-prediction modes, and both the IBC prediction mode and the intra-prediction mode.

[0035] According to aspects of the present disclosure, a video encoding device is provided, comprising: a partitioning module, for partitioning a current block in a current picture of a video into at least a first partition and a second partition based on a geometric partitioning mode GPM, the first partition being associated with an intra-block copy (IBC) prediction mode, and the second partition being associated with an intra-prediction mode; a storage module, for storing prediction mode information of a first sub-block of a plurality of sub-blocks of the current block, based on whether the first sub-block is associated with the IBC prediction mode, one of the intra-prediction modes, and both the IBC prediction mode and the intra-prediction mode, the prediction mode information comprising one of a DC mode, a planar mode, and an intra-prediction mode; and a generation module, for generating encoding information of the current block, the encoding information indicating that the current block is partitioned based on the GPM.

[0036] According to aspects of the present disclosure, a computer device is provided, comprising at least one memory and at least one processor, wherein the at least one memory is used to store computer instructions, and when the computer instructions are loaded and executed by the at least one processor, the at least one processor executes any one of the video encoding / decoding methods.

[0037] Aspects of the present disclosure also provide a non-volatile computer-readable medium for storing instructions, which, when executed by a computer for video decoding, causes the computer to perform any one of the video encoding / decoding methods. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Other features, properties and various advantages of the disclosed subject matter will become further apparent from the following detailed description and accompanying drawings, in which:

[0039] Figure 1A is a schematic diagram of an exemplary subset of intra prediction modes.

[0040] Figure 1B is a schematic diagram of exemplary intra prediction directions.

[0041] Figure 2 Schematic diagram of the current block and its surrounding spatial merging candidates in an example.

[0042] Figure 3 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment.

[0043] Figure 4 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment.

[0044] Figure 5 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment.

[0045] Figure 6is a schematic diagram of a simplified block diagram of an encoder according to an embodiment.

[0046] Figure 7 A block diagram of an encoder according to another embodiment is shown.

[0047] Figure 8 A block diagram of a decoder according to another embodiment is shown.

[0048] Fig. 9 Exemplary positions of spatial merging candidates according to another embodiment are shown.

[0049] Fig.10 An exemplary redundancy check of spatial merge candidates is shown.

[0050] Fig.11 A schematic diagram showing motion vector scaling for temporal merging candidates according to an embodiment is shown.

[0051] Fig.12 Exemplary candidate positions for temporal merging candidates according to an embodiment are shown.

[0052] Fig.13 An exemplary angular distribution of a geometric partitioning pattern (GPM) is shown according to an embodiment.

[0053] Fig.14 Exemplary partition lines for a GPM are shown, according to an embodiment.

[0054] Fig.15 A flow chart outlining an exemplary decoding process according to some embodiments of the present disclosure is shown.

[0055] Fig.16 A flowchart outlining an exemplary encoding process according to some embodiments of the present disclosure is shown.

[0056] Fig.17 is a schematic diagram of a computer system according to an embodiment. DETAILED DESCRIPTION

[0057] Figure 3 An exemplary block diagram of a communication system (300) is shown. The communication system (300) includes a plurality of terminal devices that can communicate with each other via, for example, a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). Figure 3In an embodiment, a first pair of terminal devices (310) and (320) perform unidirectional data transmission. For example, the terminal device (310) may encode video data (e.g., a video picture stream collected by the terminal device (310)) for transmission to another terminal device (320) via the network (350). The encoded video data is transmitted in the form of one or more encoded video code streams. The terminal device (320) may receive the encoded video data from the network (350), decode the encoded video data to restore the video data, and display the video picture based on the restored video data. Unidirectional data transmission is more common in applications such as media services.

[0058] In another embodiment, the communication system (300) includes a second pair of terminal devices (330) and (340) for performing bidirectional transmission of encoded video data, for example, during a video conference. For bidirectional data transmission, in one example, each of the terminal devices (330) and (340) can encode video data (for example, a video picture stream collected by the terminal device) for transmission to the other of the terminal devices (330) and (340) through the network (350). Each of the terminal devices (330) and (340) can also receive the encoded video data transmitted by the other of the terminal devices (330) and (340), and can decode the encoded video data to restore the video data, and can display the video picture on an accessible display device based on the restored video data.

[0059] exist Figure 3 In the embodiment of the present disclosure, the terminal devices (310), (320), (330) and (340) may be servers, personal computers and smart phones, respectively, but the principles of the present disclosure may not be limited to this. The embodiments of the present disclosure are applicable to laptop computers, tablet computers, media players and / or dedicated video conferencing equipment. The network (350) represents any number of networks that transmit encoded video data between the terminal devices (310), (320), (330) and (340), including, for example, wired (wired) and / or wireless communication networks. The communication network (350) may exchange data in circuit switching and / or packet switching channels. The network may include a telecommunications network, a local area network, a wide area network and / or the Internet. For the purposes of the present disclosure, unless explained below, the architecture and topology of the network (350) may be irrelevant to the operation of the present disclosure.

[0060] As an example of application of the disclosed subject matter, Figure 4A video encoder and a video decoder in a streaming environment are shown. The disclosed subject matter is equally applicable to other video-enabled applications including, for example, video conferencing, digital TV, streaming services, storing compressed video on digital media including CDs, DVDs, memory sticks, etc., and the like.

[0061] The streaming system may include an acquisition subsystem (413), which may include a video source (401) such as a digital camera, which creates an uncompressed video picture stream (402). In an embodiment, the video picture stream (402) includes samples taken by a digital camera. Compared to the encoded video data (404) (or the encoded video bitstream), the video picture stream (402) is depicted as a thick line to emphasize the high data volume of the video picture stream, and the video picture stream (402) can be processed by an electronic device (420), which includes a video encoder (403) coupled to the video source (401). The video encoder (403) may include hardware, software, or a combination of hardware and software to implement or implement various aspects of the disclosed subject matter as described in more detail below. Compared to the video picture stream (402), the encoded video data (404) (or the encoded video bitstream) is depicted as a thin line to emphasize the lower data volume, which can be stored on the streaming server (405) for future use. One or more streaming client subsystems, such as Figure 4 The client subsystem (406) and the client subsystem (408) in the streaming server (405) can access the streaming server (405) to retrieve the copy (407) and the copy (409) of the encoded video data (404). The client subsystem (406) may include, for example, a video decoder (410) in the electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and generates an output video picture stream (411) that can be presented on a display (412) (e.g., a display screen) or another presentation device (not depicted). In some streaming systems, the encoded video data (404), (407) and (409) (e.g., a video bitstream) can be encoded according to certain video encoding / compression standards. Examples of such standards include ITU-T H.265. In an embodiment, the video codec standard under development is informally referred to as Versatile Video Coding (VVC), and the disclosed subject matter can be used in the context of the VVC standard.

[0062] It should be noted that the electronic device (420) and the electronic device (430) may include other components (not shown). For example, the electronic device (420) may include a video decoder (not shown), and the electronic device (430) may also include a video encoder (not shown).

[0063] Figure 5 An exemplary block diagram of a video decoder (510) is shown. The video decoder (510) may be disposed in an electronic device (530). The electronic device (530) may include a receiver (531) (eg, a receiving circuit). The video decoder (510) may be used to replace Figure 4 A video decoder (410) of an embodiment.

[0064] The receiver (531) may receive one or more encoded video sequences to be decoded by the video decoder (510). In one embodiment, the encoded video sequences are received one at a time, wherein the decoding of each encoded video sequence is independent of the decoding of other encoded video sequences. The encoded video sequence may be received from a channel (501), which may be a hardware / software link to a storage device storing the encoded video data. The receiver (531) may receive the encoded video data as well as other data, such as encoded audio data and / or auxiliary data streams that may be forwarded to their respective consuming entities (not shown). The receiver (531) may separate the encoded video sequence from the other data. To prevent network jitter, a buffer memory (515) may be coupled between the receiver (531) and the entropy decoder / parser (520) (hereinafter referred to as "parser (520)"). In some applications, the buffer memory (515) is part of the video decoder (510). In other cases, the buffer memory (515) may be provided external to the video decoder (510) (not shown). In other cases, a buffer memory (not shown) is provided outside the video decoder (510) to prevent network jitter, for example, and another buffer memory (515) may be configured inside the video decoder (510) to handle broadcast timing, for example. When the receiver (531) receives data from a storage / forward device with sufficient bandwidth and controllability or from an isochronous network, it may not be necessary to configure the buffer memory (515), or the buffer memory may be made smaller. Of course, in order to use on a service packet network such as the Internet, a buffer memory (515) may also be required, and the buffer memory may be relatively large and have an adaptive size, and may be at least partially implemented in an operating system or a similar element (not shown) outside the video decoder (510).

[0065] The video decoder (510) may include a parser (520) to reconstruct symbols (521) from the encoded video sequence. The types of symbols include information used to manage the operation of the video decoder (510) and potential information used to control a display device such as a display device (512) (e.g., a display screen) that is not part of the electronic device (530) but can be coupled to the electronic device (530), such as Figure 5As shown in . The control information for the display device may be a parameter set fragment (not indicated) of Supplemental Enhancement Information (SEI) message or Video Usability Information (VUI). The parser (520) may parse / entropy decode the received coded video sequence. The encoding of the coded video sequence may be performed according to a video coding technique or standard, and may follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and the like. The parser (520) may extract a subgroup parameter set of at least one subgroup of the subgroups of pixels in the video decoder from the coded video sequence based on at least one parameter corresponding to the group. The subgroup may include a Group of Pictures (GOP), a picture, a tile, a slice, a macroblock, a Coding Unit (CU), a block, a Transform Unit (TU), a Prediction Unit (PU), and the like. The parser (520) may also extract information from the encoded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, and so on.

[0066] The parser (520) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (515), thereby creating symbols (521).

[0067] Depending on the type of coded video picture or portion of coded video picture (e.g., inter- and intra-pictures, inter- and intra-blocks) and other factors, the reconstruction of the symbol (521) may involve multiple different units. Which units are involved and how they are involved may be controlled by subgroup control information parsed by the parser (520) from the coded video sequence. For the sake of brevity, such subgroup control information flow between the parser (520) and the multiple units below is not described.

[0068] In addition to the functional blocks already mentioned, the video decoder (510) can be conceptually subdivided into several functional units as described below. In a practical embodiment operating under commercial constraints, many of these units interact closely with each other and can be integrated with each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the following functional units is appropriate.

[0069] The first unit is a sealer / inverse transform unit (551). The sealer / inverse transform unit (551) receives quantized transform coefficients as symbols (521) from the parser (520) and control information, including which transform method to use, block size, quantization factor, quantization scaling matrix, etc. The sealer / inverse transform unit (551) can output a block including sample values, which can be input into an aggregator (555).

[0070] In some cases, the output samples of the scaler / inverse transform unit (551) may belong to an intra-coded block. An intra-coded block is a block that does not use predictive information from a previously reconstructed picture, but may use predictive information from a previously reconstructed portion of the current picture. Such predictive information may be provided by an intra-picture prediction unit (552). In some cases, the intra-picture prediction unit (552) generates a block of the same size and shape as the block being reconstructed using surrounding reconstructed information extracted from a current picture buffer (558). For example, the current picture buffer (558) buffers a partially reconstructed current picture and / or a fully reconstructed current picture. In some cases, the aggregator (555) adds the prediction information generated by the intra-picture prediction unit (552) to the output sample information provided by the scaler / inverse transform unit (551) on a per-sample basis.

[0071] In other cases, the output samples of the scaler / inverse transform unit (551) may belong to an inter-frame coded and potentially motion compensated block. In this case, the motion compensated prediction unit (553) may access the reference picture memory (557) to extract samples for prediction. After the extracted samples are motion compensated according to the symbols (521), these samples may be added to the output of the scaler / inverse transform unit (551) (in this case referred to as residual samples or residual signals) by the aggregator (555) to generate output sample information. The acquisition of the predicted samples by the motion compensated prediction unit (553) from the address in the reference picture memory (557) may be controlled by a motion vector, and the motion vector is provided to the motion compensated prediction unit (553) in the form of the symbols (521), for example, including X, Y and reference picture components. Motion compensation may also include interpolation of sample values ​​extracted from the reference picture memory (557) when using sub-sample accurate motion vectors, motion vector prediction mechanisms, and the like.

[0072] The output samples of the aggregator (555) may be employed by various loop filtering techniques in a loop filter unit (556). The video compression techniques may include in-loop filter techniques controlled by parameters included in the coded video sequence (also referred to as the coded video bitstream) and available to the loop filter unit (556) as symbols (521) from the parser (520). The video compression may also be responsive to meta-information obtained during decoding of a coded picture or a previous (in decoding order) portion of the coded video sequence, and to previously reconstructed and loop filtered sample values.

[0073] The output of the loop filter unit (556) may be a sample stream that may be output to a display device (512) and stored in a reference picture memory (557) for subsequent inter-picture prediction.

[0074] Once fully reconstructed, certain coded pictures may be used as reference pictures for future prediction. For example, once the coded picture corresponding to the current picture is fully reconstructed, and the coded picture is identified as a reference picture (e.g., by the parser (520)), the current picture buffer (558) may become part of the reference picture memory (557), and a new current picture buffer may be reallocated before starting to reconstruct a subsequent coded picture.

[0075] The video decoder (510) may perform decoding operations according to a predetermined video compression technology or standard such as ITU-T H.265. The encoded video sequence may conform to the syntax specified by the video compression technology or standard used in the sense that the encoded video sequence follows the syntax of the video compression technology or standard and the profile recorded in the video compression technology or standard. Specifically, the profile may select certain tools from all the tools available in the video compression technology or standard as the only tools available for use under the profile. For compliance, the complexity of the encoded video sequence is also required to be within the range defined by the hierarchy of the video compression technology or standard. In some cases, the hierarchy limits the maximum picture size, the maximum frame rate, the maximum reconstruction sampling rate (measured in, for example, mega samples per second), the maximum reference picture size, etc. In some cases, the limits set by the hierarchy may be further limited by the Hypothetical Reference Decoder (HRD) specification and the metadata of the HRD buffer management signaled in the encoded video sequence.

[0076] In an embodiment, the receiver (531) may receive additional (redundant) data along with the encoded video. The additional data may be part of the encoded video sequence. The additional data may be used by the video decoder (510) to properly decode the data and / or more accurately reconstruct the original video data. The additional data may be in the form of, for example, temporal, spatial or signal-to-noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, etc.

[0077] Figure 6 An exemplary block diagram of a video encoder (603) is shown. The video encoder (603) is disposed in an electronic device (620). The electronic device (620) includes a transmitter (640) (eg, a transmission circuit). The video encoder (603) may be used to replace Figure 6 A video encoder (603) in an embodiment.

[0078] The video encoder (603) can be used to obtain the video source (601) (not Figure 6 In another embodiment, the video source (601) is a part of the electronic device (620) to receive video samples, and the video source can collect video images to be encoded by the video encoder (603). In another embodiment, the video source (601) is a part of the electronic device (620).

[0079] The video source (601) may provide a source video sequence in the form of a digital video sample stream to be encoded by the video encoder (603), wherein the digital video sample stream may have any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 Y CrCB, RGB, ...), and any suitable sampling structure (e.g., Y CrCb 4:2:0, Y CrCb 4:4:4). In a media service system, the video source (601) may be a storage device storing previously prepared videos. In a video conferencing system, the video source (601) may be a camera that captures local image information as a video sequence. The video data may be provided as a plurality of separate pictures that are given motion when viewed sequentially. The pictures themselves may be constructed as a spatial pixel array, wherein each pixel may include one or more samples depending on the sampling structure, color space, etc. used. The relationship between pixels and samples may be easily understood by those skilled in the art. The following description focuses on samples.

[0080] According to an embodiment, the video encoder (603) may encode and compress pictures of a source video sequence into an encoded video sequence (643) in real time or under any other time constraints as required. Implementing an appropriate encoding speed is a function of the controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to these units. For the sake of brevity, couplings are not shown in the figure. The parameters set by the controller (650) may include rate control related parameters (picture skipping, quantizer, lambda value of rate-distortion optimization technology, etc.), picture size, group of pictures (group of pictures, GOP) layout, maximum motion vector search range, etc. The controller (650) can be used to have other suitable functions that are related to the video encoder (603) optimized for a certain system design.

[0081] In some embodiments, the video encoder (603) operates in a coding loop. As a simple description, in embodiments, the coding loop may include a source encoder (630) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be encoded and a reference picture) and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create sample data in a manner similar to how the (remote) decoder creates sample data. The reconstructed sample stream (sample data) is input to a reference picture memory (634). Since the decoding of the symbol stream produces bit-accurate results that are independent of the decoder location (local or remote), the contents of the reference picture memory (634) are also bit-accurate between the local encoder and the remote encoder. In other words, the reference picture samples "seen" by the prediction part of the encoder are exactly the same as the sample values ​​that the decoder will "see" when using the prediction during decoding. This basic principle of reference picture synchronization (and the drift that occurs when synchronization cannot be maintained, such as due to channel errors) is also used in some related technologies.

[0082] The operation of the "local" decoder (633) can be combined with the above Figure 5 The "remote" decoder described in detail for the video decoder (510) is identical. However, additional brief reference is made to Figure 5 , when symbols are available and the entropy encoder (645) and parser (520) are capable of losslessly encoding / decoding the symbols into an encoded video sequence, the entropy decoding portion of the video decoder (510), including the buffer memory (515) and the parser (520), may not be fully implemented in the local decoder (633).

[0083] In an embodiment, decoder techniques other than parsing / entropy decoding present in a decoder are present in the corresponding encoder in the same or substantially the same functional form. Therefore, the disclosed subject matter focuses on decoder operation. The description of encoder techniques can be simplified because encoder techniques are reciprocal to the decoder techniques described comprehensively. A more detailed description in some areas is provided below.

[0084] During operation, in some embodiments, the source encoder (630) may perform motion compensated predictive coding. The motion compensated predictive coding predictively encodes an input picture with reference to one or more previously encoded pictures from a video sequence designated as "reference pictures." In this manner, the encoding engine (632) encodes the differences between pixel blocks of the input picture and pixel blocks of a reference picture that may be selected as a prediction reference for the input picture.

[0085] The local video decoder (633) may decode the encoded video data that may be designated as a reference picture based on the symbol created by the source encoder (630). The operation of the encoding engine (632) may be a lossy process. When the encoded video data is available at the video decoder ( Figure 6 When the video sequence is decoded at a remote location (not shown), the reconstructed video sequence may typically be a copy of the source video sequence with some errors. The local video decoder (633) replicates the decoding process that may be performed by the video decoder on the reference picture and may cause the reconstructed reference picture to be stored in the reference picture memory (634). In this way, the video encoder (603) may locally store a copy of the reconstructed reference picture that has common content (absent transmission errors) with the reconstructed reference picture to be obtained by the remote video decoder.

[0086] The predictor (635) may perform a prediction search for the encoding engine (632). That is, for a new picture to be encoded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata, such as reference picture motion vectors, block shapes, etc., that may serve as appropriate prediction references for the new picture. The predictor (635) may operate pixel-by-pixel based on sample blocks to find a suitable prediction reference. In some cases, based on the search results obtained by the predictor (635), it may be determined that the input picture may have prediction references taken from a plurality of reference pictures stored in the reference picture memory (634).

[0087] The controller (650) may manage encoding operations of the source encoder (630), including, for example, setting parameters and subgroup parameters for encoding video data.

[0088] The outputs of all the above functional units may be entropy encoded in an entropy encoder (645). The entropy encoder (645) applies lossless compression to the symbols generated by the various functional units according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc., thereby converting the symbols into a coded video sequence.

[0089] The transmitter (640) may buffer the encoded video sequence created by the entropy encoder (645) in preparation for transmission over a communication channel (660), which may be a hardware / software link to a storage device where the encoded video data will be stored. The transmitter (640) may combine the encoded video data from the video encoder (603) with other data to be transmitted, such as encoded audio data and / or ancillary data streams (source not shown).

[0090] The controller (650) may manage the operation of the video encoder (603). During encoding, the controller (650) may assign a certain coded picture type to each coded picture, but this may affect the coding techniques that can be applied to the corresponding picture. For example, a picture may generally be assigned to any of the following picture types:

[0091] An intra picture (I picture) may be a picture that can be encoded and decoded without using any other picture in the sequence as a prediction source. Some video codecs allow different types of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of the variations of I pictures and their corresponding applications and features.

[0092] A predictive picture (P picture) may be a picture that can be encoded and decoded using intra prediction or inter prediction, which uses at most one motion vector and a reference index to predict sample values ​​for each block.

[0093] Bidirectional predictive pictures (B pictures), which can be pictures that can be encoded and decoded using intra prediction or inter prediction, which uses up to two motion vectors and reference indices to predict the sample values ​​of each block. Similarly, multiple predictive pictures can use more than two reference pictures and associated metadata for reconstruction of a single block.

[0094] The source picture may typically be spatially subdivided into blocks of samples (e.g., blocks of 4×4, 8×8, 4×8, or 16×16 samples), and coded block by block. These blocks may be predictively coded with reference to other (already coded) blocks, which are determined according to the coding allocation applied to the block's corresponding picture. For example, blocks of an I picture may be non-predictively coded, or the blocks may be predictively coded (spatial prediction or intra prediction) with reference to already coded blocks of the same picture. Blocks of pixels of a P picture may be predictively coded by spatial prediction with reference to one previously coded reference picture or by temporal prediction. Blocks of a B picture may be predictively coded by spatial prediction with reference to one or two previously coded reference pictures or by temporal prediction.

[0095] The video encoder (603) may perform encoding operations according to a predetermined video encoding technique or standard, such as ITU-T H.265 Recommendation. In operation, the video encoder (603) may perform various compression operations, including predictive encoding operations that exploit temporal and spatial redundancy in an input video sequence. Thus, the encoded video data may conform to the syntax specified by the video encoding technique or standard used.

[0096] In an embodiment, the transmitter (640) may transmit additional data when transmitting the encoded video. The source encoder (630) may include such data as part of the encoded video sequence. The additional data may include other forms of redundant data such as temporal / spatial / SNR enhancement layers, redundant pictures and slices, supplemental enhancement information (SEI) messages, visual usability information (VUI) parameter set fragments, etc.

[0097] The captured video may be taken as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often simplified to intra-prediction) exploits spatial correlations in a given picture, while inter-picture prediction exploits (temporal or other) correlations between pictures. In an embodiment, a particular picture being encoded / decoded is divided into blocks, and the particular picture being encoded / decoded is referred to as the current picture. When a block in the current picture is similar to a reference block in a reference picture that was previously encoded in the video and is still buffered, the block in the current picture may be encoded by a vector called a motion vector. The motion vector points to a reference block in a reference picture, and in the case where multiple reference pictures are used, the motion vector may have a third dimension that identifies the reference picture.

[0098] In some embodiments, bidirectional prediction techniques may be used in inter-picture prediction. According to the bidirectional prediction technique, two reference pictures are used, for example, a first reference picture and a second reference picture that are both before the current picture in the video in decoding order (but may be in the past and future in display order, respectively). A block in the current picture may be encoded by a first motion vector pointing to a first reference block in the first reference picture and a second motion vector pointing to a second reference block in the second reference picture. Specifically, the block may be predicted by a combination of the first reference block and the second reference block.

[0099] In addition, merge mode technology can be used in inter-picture prediction to improve coding efficiency.

[0100] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed in blocks. For example, according to the HEVC standard, pictures in a video picture sequence are divided into coding tree units (CTUs) for compression, and the CTUs in the pictures have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are a luminance CTB and two chrominance CTBs. Furthermore, each CTU can be split into one or more coding units (CUs) using a quadtree. For example, a 64×64 pixel CTU can be split into a 64×64 pixel CU, or 4 32×32 pixel CUs, or 16 16×16 pixel CUs. In an embodiment, each CU is analyzed to determine the prediction type for the CU, such as an inter-prediction type or an intra-prediction type. In addition, depending on temporal and / or spatial predictability, the CU is split into one or more prediction units (PUs). Typically, each PU includes a luma prediction block (PB) and two chroma PBs. In an embodiment, the prediction operation in encoding (encoding / decoding) is performed in units of prediction blocks. Taking the luma prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values ​​(e.g., luma values), such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

[0101] Figure 7 An exemplary schematic diagram of a video encoder (703) is shown. The video encoder (703) is configured to receive a processed block (e.g., a prediction block) of sample values ​​within a current video picture in a video picture sequence and encode the processed block into an encoded picture that is part of an encoded video sequence. In this embodiment, the video encoder (703) is configured to replace Figure 4 A video encoder (403) in an embodiment.

[0102] In an HEVC embodiment, a video encoder (703) receives a matrix of sample values ​​for a processing block, such as a prediction block of 8×8 samples. The video encoder (703) uses, for example, rate-distortion optimization to determine whether to use intra mode, inter mode, or bidirectional prediction mode to encode the processing block. When encoding the processing block in intra mode, the video encoder (703) may use intra prediction techniques to encode the processing block into an encoded picture; and when encoding the processing block in inter mode or bidirectional prediction mode, the video encoder (703) may use inter prediction or bidirectional prediction techniques to encode the processing block into an encoded picture, respectively. In some video encoding techniques, the merge mode may be an inter-picture prediction submode, in which a motion vector is derived from one or more motion vector predictors without the aid of an encoded motion vector component external to the predictor. In some other video encoding techniques, there may be a motion vector component applicable to the subject block. In an embodiment, the video encoder (703) includes other components, such as a mode decision module (not shown) for determining the processing block mode.

[0103] exist Figure 7 In an embodiment of the present invention, the video encoder (703) includes: Figure 7 Shown are an inter-frame encoder (730), an intra-frame encoder (722), a residual calculator (723), a switch (726), a residual encoder (724), a general controller (721), and an entropy encoder (725) coupled together.

[0104] The inter-frame encoder (730) is used to receive samples of a current block (e.g., a processing block), compare the block with one or more reference blocks in a reference picture (e.g., blocks in a previous picture and a subsequent picture), generate inter-frame prediction information (e.g., redundant information description according to an inter-frame coding technique, motion vectors, merge mode information), and calculate an inter-frame prediction result (e.g., a predicted block) based on the inter-frame prediction information using any suitable technique. In some embodiments, the reference picture is a decoded reference picture decoded based on the encoded video information.

[0105] The intra-frame encoder (722) is used to receive samples of a current block (e.g., a processing block), compare the block with an encoded block in the same picture in some cases, generate quantization coefficients after transformation, and in some cases also generate intra-frame prediction information (e.g., intra-frame prediction direction information according to one or more intra-frame coding techniques). In an embodiment, the intra-frame encoder (722) also calculates an intra-frame prediction result (e.g., a predicted block) based on the intra-frame prediction information and a reference block in the same picture.

[0106] The general controller (721) is used to determine the general control data and control other components of the video encoder (703) based on the general control data. In an embodiment, the general controller (721) determines the mode of the block and provides a control signal to the switch (726) based on the mode. For example, when the mode is intra mode, the general controller (721) controls the switch (726) to select the intra mode result for use by the residual calculator (723) and controls the entropy encoder (725) to select intra prediction information and add the intra prediction information to the bitstream; and when the mode is inter mode, the general controller (721) controls the switch (726) to select the inter prediction result for use by the residual calculator (723) and controls the entropy encoder (725) to select the inter prediction information and add the inter prediction information to the bitstream.

[0107] The residual calculator (723) is used to calculate the difference (residual data) between the received block and the prediction result selected from the intra-frame encoder (722) or the inter-frame encoder (730). The residual encoder (724) is used to operate based on the residual data to encode the residual data to generate a transform coefficient. In an embodiment, the residual encoder (724) is used to convert the residual data from the spatial domain to the frequency domain and generate a transform coefficient. The transform coefficient is then processed by quantization to obtain a quantized transform coefficient. In various embodiments, the video encoder (703) also includes a residual decoder (728). The residual decoder (728) is used to perform an inverse transform and generate decoded residual data. The decoded residual data can be used appropriately by the intra-frame encoder (722) and the inter-frame encoder (730). For example, the inter-frame encoder (730) can generate a decoded block based on the decoded residual data and the inter-frame prediction information, and the intra-frame encoder (722) can generate a decoded block based on the decoded residual data and the intra-frame prediction information. The decoded blocks are appropriately processed to generate a decoded picture, and in some embodiments, the decoded picture may be buffered in a memory circuit (not shown) and used as a reference picture.

[0108] The entropy encoder (725) is used to format the bitstream to produce encoded blocks. The entropy encoder (725) includes various information in the bitstream according to a suitable standard such as the HEVC standard. In an embodiment, the entropy encoder (725) is used to obtain general control data, selected prediction information (such as intra-frame prediction information or inter-frame prediction information), residual information, and other suitable information in the bitstream. It should be noted that according to the disclosed subject matter, when the block is encoded in the inter-frame mode or the merge sub-mode of the bidirectional prediction mode, there is no residual information.

[0109] Figure 8An exemplary schematic diagram of a video decoder (810) is shown. The video decoder (810) is used to receive an encoded image as part of an encoded video sequence and decode the encoded image to generate a reconstructed picture. In an embodiment, the video decoder (810) is used to replace Figure 4 A video decoder (410) of an embodiment.

[0110] exist Figure 8 In one embodiment, the video decoder (810) includes: Figure 8 An entropy decoder (871), an inter-frame decoder (880), a residual decoder (873), a reconstruction module (874) and an intra-frame decoder (872) coupled together are shown in FIG.

[0111] The entropy decoder (871) may be used to reconstruct certain symbols from the encoded picture, which represent syntax elements constituting the encoded picture. Such symbols may include, for example, a mode for encoding the block (e.g., intra mode, inter mode, bidirectional prediction mode, a merged submode of the latter two, or another submode), prediction information (e.g., intra prediction information or inter prediction information) that may identify certain samples or metadata for prediction by the intra decoder (872) or the inter decoder (880), respectively. Such symbols may also include residual information in the form of, for example, quantized transform coefficients, and the like. In an embodiment, when the prediction mode is an inter or bidirectional prediction mode, the inter prediction information is provided to the inter decoder (880); and when the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information may be inverse quantized and provided to the residual decoder (873).

[0112] The inter-frame decoder (880) is used to receive the inter-frame prediction information and generate an inter-frame prediction result based on the inter-frame prediction information.

[0113] The intra-frame decoder (872) is used to receive intra-frame prediction information and generate a prediction result based on the intra-frame prediction information.

[0114] The residual decoder (873) is used to perform inverse quantization to extract dequantized transform coefficients, and process the dequantized transform coefficients to convert residual information from the frequency domain to the spatial domain. The residual decoder (873) may also require some control information (to obtain the quantizer parameter QP), and this information can be provided by the entropy decoder (871) (the data path is not indicated because this is only low-volume control information).

[0115] The reconstruction module (874) is used to combine the residual information output by the residual decoder (873) with the prediction result (which can be output by the inter-frame prediction module or the intra-frame prediction module) in the spatial domain to form a reconstructed block, which can be part of a reconstructed picture, which in turn can be part of a reconstructed video. It should be noted that other suitable operations such as deblocking operations can be performed to improve visual quality.

[0116] It should be noted that the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (810) may be implemented using any suitable technology. In an embodiment, the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (610) may be implemented using one or more integrated circuits. In another embodiment, the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (810) may be implemented using one or more processors that execute software instructions.

[0117] The present disclosure includes embodiments related to geometric partition mode (GPM) with intra block copy (IBC), such as signaling, processing, and storing block vector (BV) information for IBC, and processing BV merge candidate lists for GPM with IBC.

[0118] ITU-T VCEG (Q6 / 16) and ISO / IEC MPEG (JTC 1 / SC 29 / WG 11) released the H.265 / HEVC (High Efficiency Video Codec) standard in 2013 (version 1), 2014 (version 2), 2015 (version 3), and 2016 (version 4). In 2015, the two standard organizations jointly established JVET (Joint Video Exploration Team) to explore the potential of developing the next generation video codec standard beyond HEVC. In October 2017, the two standard organizations issued a "Joint Call for Proposals (CfP) for Video Compression with Capabilities Beyond HEVC". As of February 15, 2018, 22 CfP responses for Standard Dynamic Range (SDR), 12 CfP responses for High Dynamic Range (HDR), and 12 CfP responses for 360 video categories were submitted. In April 2018, at the 122MPEG / 10th JVET meeting, all received CfP replies were evaluated. As a result of this meeting, JVET officially launched the standardization process of the next generation video codec beyond HEVC. The new standard was named Versatile Video Codec (VVC), and JVET was renamed the Joint Video Experts Group. In 2020, ITU-T VCEG (Q6 / 16) and ISO / IEC MPEG (JTC 1 / SC 29 / WG 11) released the VVC video codec standard (version 1).

[0119] In inter prediction, for each inter prediction coding unit (CU), motion parameters are required for the coding features of VVC, for example, for inter prediction sample generation. Motion parameters may include motion vectors, reference picture indices, reference picture list usage indices, and / or additional information. Motion parameters may be signaled explicitly or implicitly. When a CU is encoded using skip mode, the CU may be associated with one PU, and significant residual coefficients, encoded motion vector increments, and / or reference picture indices may not be required. When a CU is encoded using merge mode, the motion parameters of the CU may be obtained from neighboring CUs. Neighboring CUs may include spatial and temporal candidates, as well as additional schedules (or additional candidates) such as those introduced in VVC. Merge mode may be applied to any inter prediction CU, not just to skip mode. An alternative to merge mode is explicit transmission of motion parameters, where motion vectors, corresponding reference picture indices for each reference picture list, reference picture list usage flags, and / or other required information may be explicitly signaled for each CU.

[0120] In VVC, the VVC Test Model (VTM) reference software may include a number of new and improved inter-frame prediction coding tools, which may include one or more of the following: (1) Extended Merger Forecast (2) Merged Motion Vector Difference (MMVD) (3) AMVP mode with symmetric MVD signaling (4) Affine Motion Compensated Prediction (5) Sub-block based temporal motion vector prediction (SbTMVP) (6) Adaptive Motion Vector Resolution (AMVR) (7) Motion field storage: 1 / 16 brightness sample MV storage and 8x8 motion field compression (8) Bidirectional prediction with CU-level weights (BCW) (9) Bidirectional Optical Flow (BDOF) (10) Decoder-side motion vector correction (DMVR) (11) Combined Inter and Intra Prediction (CIIP) (12) Geometric Partitioning Model (GPM)

[0121] For example, in VTM 4, the merge candidate list can be constructed by including five types of candidates. The merge candidate list can be constructed in the following order: 1) spatial motion vector prediction (MVP) from spatially neighboring CUs, 2) Temporal motion vector prediction (MVP) from the co-located CU, 3) History-based Motion Vector Prediction (MVP) from a First-In-First-Out (FIFO) table, 4) Pairwise Mean Motion Vector Prediction (MVP), and 5) Zero MV.

[0122] The size of the merge list is signaled in the slice header. For example, in VTM 4, the maximum allowed size of the merge list is 6. For each CU encoded in merge mode, the index of the best merge candidate can be encoded, for example, using truncated unary binarization. The first bin of the merge index can be encoded using context, while the other bins are encoded using bypass coding.

[0123] In the derivation of spatial candidates, for example in VVC, the derivation of spatial merge candidates may be the same or similar to the derivation of spatial merge candidates in HEVC. Fig. 9 Select the maximum number of merge candidates (for example, four merge candidates) from the candidates at the positions shown. Fig. 9As shown, the current block (901) may include neighboring blocks (902)-(906) located at positions A0, A1, B0, B1, and B2, respectively. The derivation order of spatial merge candidates may be B1, A1, B0, A0, and B2. Position B2 may be considered only when any CU (or block) at position A0, B0, B1, or A1 is unavailable (for example, because the CU belongs to another slice or tile) or is intra-coded. After adding the candidate (or block) at position A1, a redundancy check may be performed on the addition of the remaining candidates (or blocks). The redundancy check may ensure that candidates with the same motion information are excluded from the merge list, thereby improving encoding and decoding efficiency. In order to reduce computational complexity, the redundancy check may not consider all possible candidate pairs. Instead, only those with the same motion information may be considered. Fig.10 . For example, redundancy check can be applied to 5 candidate pairs, such as candidate pairs of A1 and B1, and candidate pairs of A1 and A0. A candidate can be added to the merge list only if the corresponding candidate used for redundancy check does not include the same motion information. For example, candidate B0 can be added to the merge list only if the corresponding candidate B1 does not include the same motion information.

[0124] In the derivation of temporal candidates, only one candidate can be added to the merge list. For example, Fig.11 As shown, in the derivation of the temporal merge candidate of the current CU (1114), the scaled motion vector can be derived based on the co-located CU (1104) belonging to the co-located reference picture (1112). The reference picture list used to derive the co-located CU (1104) can be explicitly signaled in the slice header. Fig.11 As shown by the dotted line (1102) in , a scaled motion vector of a temporal merge candidate can be obtained, which is scaled from the motion vector of the co-located CU (1104) using picture order count (POC) distances tb and td. tb can be defined as the POC difference between the reference picture (e.g., Curr_ref) (1106) of the current picture and the current picture (e.g., Curr_pic) (1108). td can be defined as the POC difference between the reference picture (e.g., Col_ref) (1110) of the co-located picture and the co-located picture (e.g., Col_pic) (1112). The reference picture index of the temporal merge candidate can be set equal to zero.

[0125] The position of the temporal candidate can be selected between candidates C0 and C1, such as Fig.12 As shown. For example, if the CU at position C0 is not available, is intra-coded, or is outside the current row of the CTU, position C1 can be used. Otherwise, position C0 can be used in the derivation of the temporal merge candidate.

[0126] GPM can be applied to inter prediction. GPM can be applied only to CUs of a certain size, such as CUs with a size of 8x8 or larger. GPM can be signaled, for example, using a CU level flag, and can be used as a merge mode. Other merge modes may include a regular merge mode, an MMVD mode, a CIIP mode, and / or a sub-block merge mode.

[0127] When using GPM, the CU can be divided into two geometric partitions using one of a variety of partitioning methods. The partitioning methods can be distinguished by angles and / or edges. In one embodiment, 64 different partitioning methods can be applied in GPM. These 64 different partitioning methods can be distinguished by 24 angles, which are non-uniformly quantized between 0° and 360°, and a maximum of 4 edges relative to the center of the CU. Fig.13 Twenty-four exemplary angles applied in the GPM are shown. Fig.14 Four exemplary possible partition edges associated with the angle indexed 3 in the CU (1402) are shown, where each partition edge can be associated with a corresponding distance index. The distance index can indicate the distance relative to the center of the CU (1402). In GPM, each geometric partition in the CU can use its own motion vector for inter-frame prediction. In addition, each partition only allows unidirectional prediction. For example, each partition can have one motion vector and one reference index. The constraint of only allowing unidirectional prediction motion for each partition can ensure that only two motion compensated predictions are required for each CU, which also applies to traditional bidirectional prediction.

[0128] If GPM is used for the current CU, a signal indicating a geometric partition index and two merge indexes (one for each partition) may be further signaled. The maximum GPM candidate size may be explicitly signaled, for example, at the slice level. The maximum GPM candidate size may specify a syntactic binarization of the GPM merge index. After predicting each of the two geometric partitions, a blending process with adaptive weights may be used to adjust sample values ​​along the edges of the geometric partitions. Thus, after the blending process, a prediction signal for the entire CU may be generated. In other prediction modes, a transform and quantization process may be further applied to the entire CU. In addition, the motion field of the CU predicted using GPM may be stored.

[0129] The implementation cost of IBC may be high for the entire reconstructed area of ​​the current picture. For example, a disadvantage of the IBC concept in HEVC is that additional memory is required in the decoded picture buffer (DPB). Therefore, external memory is usually used in the hardware implementation of IBC. The additional external memory access may increase with the increase of memory bandwidth.

[0130] In some embodiments it may be necessary to reduce implementation costs. For example, VVC can use fixed memory, which can significantly reduce memory bandwidth requirements and hardware complexity by implementing IBC using on-chip memory. In addition, the block vector (BV) encoding of IBC can adopt the concept of merge lists for inter-frame prediction. The IBC list construction process can consider the BVs of two spatial neighbors and five history-based BVs (HBVPs), where when the first HBVP is added to the candidate list (or IBC list), only the first HBVP can be compared with the spatial candidates (e.g., the BVs of two spatial candidates).

[0131] To further improve compression efficiency, for example in VVC, template matching (TM) with motion correction at the decoder side can be used. In TM mode, motion is corrected by building a template based on adjacent reconstructed samples to the left and above, and the closest match between the template in the current picture and the reference frame can be determined.

[0132] TM can be applied to GPM. When encoding a CU with GPM, it can be determined whether to apply TM to correct each motion of the geometric partition. When TM is selected, the template can be constructed using the neighboring samples on the left and above, and the motion can be further corrected by finding the best match between the current template and the reference area with the same template pattern in the reference frame. The corrected motion can be used to perform motion compensation on the geometric partition and can be further stored in the motion field.

[0133] GPM can be used to support inter-frame and intra-frame prediction to enhance codec performance beyond VVC. For example, in addition to the motion vectors from the merge candidate list for each geometric partition in the CU to which GPM is applied, a predefined intra-frame prediction mode for (or about) the geometric partition line can also be selected. The intra-frame prediction mode or the inter-frame prediction mode can be determined for each geometric partition based on a flag. When inter-frame prediction is selected, a unidirectional prediction signal can be generated by MV from the merge candidate list. Otherwise, if the intra-frame prediction mode is selected, a unidirectional prediction signal can be generated from neighboring samples, which are predicted according to the specified index of the intra-frame prediction mode. The variation of possible intra-frame prediction modes may be limited by the geometry. Finally, the two unidirectional prediction signals can be mixed in the same way as ordinary GPM.

[0134] In order to reduce complexity and signaling overhead, changes in possible intra-frame prediction modes can be studied (or defined). For example, for two exemplary configurations, the impact of changes in possible intra-frame prediction modes on GPMs using inter-frame and intra-frame prediction is studied. The first configuration only tries parallel and perpendicular intra-frame directional modes for (or about) geometric partition lines. In addition to parallel and perpendicular intra-frame angular modes for (or about) geometric partition lines, planar modes are also tested in the second configuration. For geometric partitions in GPMs using inter-frame and intra-frame prediction, two or three possible intra-frame prediction modes are tested.

[0135] In template-based intra mode derivation (TIMD), such as in JVET-V0098, for each intra mode in the MPM, the sum of absolute transform differences (SATD) between the predicted and reconstructed samples of the template area of ​​the current CU can be calculated, and the intra mode with the minimum SATD cost can be selected for the current CU. Instead of selecting only one intra mode with the minimum SATD cost, the first two modes with the minimum SATD cost derived using TIMD can also be selected for the current CU, such as in JVET-W0123. The two selected modes can be further fused with weights, and the weighted intra prediction can be used as the intra prediction value of the current CU. Among the two selected modes, if the cost of the selected intra mode with the minimum SATD cost is greater than half the cost of the other selected intra mode, fusion can be applied. Otherwise, only the intra mode with the minimum SATD cost can be selected. If fusion is applied, the weight value can be derived from the SATD costs of the two modes.

[0136] In the present disclosure, a GPM adopting IBC and intra prediction modes may be provided to combine two geometric partitions generated for the IBC and intra prediction modes, respectively.

[0137] To improve coding efficiency, the use of intra modes within a CU using inter prediction (e.g., MODE_INTER prediction mode) can be stored and propagated as neighboring intra information for MPM derivation of neighboring blocks of the CU, such as in JVET-W0123. However, when an IBC block is encoded as a GPM using IBC and intra prediction, the use of intra modes within a CU using IBC can also be stored and propagated as neighboring intra information for MPM derivation.

[0138] In the present disclosure, intra-frame prediction mode information of a GPM using IBC and intra-frame prediction may be stored. For example, the current block may be divided into a first partition and a second partition. The first partition may be IBC encoded, and the second partition may be intra-frame encoded. Intra-frame prediction mode information of the second partition may be stored, such as an intra-frame prediction mode for predicting the second partition. When the prediction mode of a neighboring block of the current block is IBC, the stored intra-frame mode information may be further used as the neighboring intra-frame mode information. Therefore, the stored intra-frame mode information may be used as a propagated intra-frame mode of a neighboring block encoded by IBC. When the neighboring block is a reference block of a block, the intra-frame mode of the block may be derived from the stored intra-frame prediction mode information. The stored intra-frame prediction mode information may also be applied to the MPM derivation of the current block, which is encoded as a GPM using IBC and intra-frame prediction.

[0139] In an embodiment, intra prediction mode information of a GPM using IBC and intra prediction may be stored in an N×N unit (e.g., a 4×4 sample unit) of a current block. For example, the current block may be divided into a plurality of N×N units. Intra prediction mode information of each of the plurality of N×N units may be stored in a corresponding storage unit (or units).

[0140] In one embodiment, for each geometric partition, the planar mode or the selected intra mode for the geometric partition using intra prediction in the CU (or the current block) may be stored in N×N cells (e.g., 4×4 cells) of the current block. In one example, if the GPM-based geometric partition of the current block is generated using IBC (or the geometric partition is predicted based on IBC), the planar mode may be stored in the corresponding N×N cells (e.g., 4×4 cells) of the geometric partition. Thus, for the N×N cells in the geometric partition generated using IBC, the planar mode may be stored for each of the N×N cells in the geometric partition. In another example, when the GPM-based geometric partition of the current block is generated using intra prediction, the encoded intra mode (or the intra mode used to predict the geometric partition) may be stored in the corresponding N×N cells (e.g., 4×4 cells) of the geometric partition. Thus, for the N×N cells in the geometric partition generated using intra prediction, the encoded intra mode may be stored for each of the N×N cells in the geometric partition. The encoded intra mode may be a DC mode, a planar mode, or an angular mode. In yet another example, for an N×N cell along (or across) a geometric boundary of a current block based on a GPM, an encoded intra mode for a geometric partition in the current block that employs intra prediction may be stored for the N×N cell along the geometric boundary. Thus, for an N×N cell across a geometric boundary of a current block, where a first partition is IBC encoded and a second partition is intra encoded, an intra mode for predicting the second partition may be stored.

[0141] In another embodiment, when a CU is encoded with GPM using IBC and intra mode, a DC mode may be stored for all N×N units (e.g., 4×4 units) within the CU (or current block). Thus, a DC mode may be stored for each of the N×N units within the current block. The corresponding N×N unit may be located in a partition encoded using IBC, a partition encoded using intra mode, or along a geometric boundary between a partition encoded using IBC and a partition encoded using intra mode.

[0142] In another embodiment, when a CU is encoded with GPM using IBC and intra mode, a planar mode may be stored for all NxN units (e.g., 4x4 units) within the CU. Each of the NxN units may be located in a partition encoded using IBC, a partition encoded using intra mode, or along a geometric boundary between a partition encoded using IBC and a partition encoded using intra mode.

[0143] In yet another embodiment, for all N×N units (e.g., 4×4 units) within a CU, only the selected intra modes for geometric partitions in the CU using intra prediction may be stored. The CU may be encoded with GPM using IBC and intra mode. The selected intra mode may be a DC mode, a planar mode, or an angular mode, which is used to predict geometric partitions of the CU encoded with GPM using IBC and intra mode. Thus, for each of the N×N units within a CU, the selected intra mode may be stored for the corresponding N×N unit. The corresponding N×N unit may be located in a partition encoded using IBC, a partition encoded using intra mode, or along a geometric boundary between a partition encoded using IBC and a partition encoded using intra mode.

[0144] Fig.15 A flow chart outlining an exemplary decoding process (1500) according to some embodiments of the present disclosure is shown. Fig.16 A flowchart outlining an exemplary encoding process (1600) according to some embodiments of the present disclosure is shown. The proposed process can be used alone or in combination in any order. In addition, each of the process (or embodiment), encoder, and decoder can be implemented by a processing circuit (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program stored in a non-volatile computer-readable medium.

[0145] The operations of the process (eg, (1500) and (1600)) may be combined or arranged in any number or order as desired. In an embodiment, two or more operations of the process (eg, (1500) and (1600)) may be performed in parallel.

[0146] The process (e.g., (1500) and (1600)) can be used for reconstruction and / or encoding of a block, thereby generating a prediction block for the block being reconstructed. In various embodiments, the process (e.g., (1500) and (1600)) is performed by a processing circuit, such as a processing circuit in a terminal device (310), (320), (330) and (340), a processing circuit that performs the function of a video encoder (403), a processing circuit that performs the function of a video decoder (410), a processing circuit that performs the function of a video decoder (510), or a processing circuit that performs the function of a video encoder (603). In some embodiments, the process (e.g., (1500) and (1600)) is implemented in software instructions, so when the processing circuit executes the software instructions, the processing circuit performs the process (e.g., (1500) and (1600)).

[0147] like Fig.15 As shown, the process (1500) starts from (S1501) and proceeds to (S1510). At (S1510), encoded information of a current block in a current picture of a video may be received from an encoded video bitstream. The encoded information may indicate that the current block is divided into at least a first partition and a second partition based on a geometric partition mode (GPM). The first partition may be associated with an intra block copy (IBC) prediction mode, and the second partition may be associated with an intra prediction mode.

[0148] At (S1520), prediction mode information of a first subblock of the plurality of subblocks of the current block may be stored. The prediction mode information may include one of a DC mode, a planar mode, and an intra prediction mode based on whether the first subblock is associated with the IBC prediction mode, one of the intra prediction modes, or both the IBC prediction mode and the intra prediction mode.

[0149] In the process (1500), most probable mode (MPM) derivation may be performed on neighboring blocks of the current block using the stored prediction mode information.

[0150] In some embodiments, based on the first sub-block being associated with the IBC prediction mode, storing the prediction mode information may include storing only the planar mode among the prediction mode information of the first sub-block of the plurality of sub-blocks of the current block.

[0151] In some embodiments, based on the first subblock being associated with the intra prediction mode, storing the prediction mode information may include storing only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block.

[0152] In some embodiments, based on the first subblock being associated with both the IBC prediction mode and the intra prediction mode, storing the prediction mode information may include storing only the intra prediction mode in the prediction mode information of the first subblock of the multiple subblocks of the current block.

[0153] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the DC mode for each of the multiple subblocks of the current block may be stored.

[0154] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the planar mode for each of the multiple subblocks of the current block may be stored.

[0155] In one embodiment, based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the intra prediction mode for each of the multiple subblocks of the current block may be stored.

[0156] In some embodiments, the prediction mode information of the first subblock of the multiple subblocks of the current block may be the propagated intra mode derived by the MPM for the neighboring block of the current block, the neighboring block being predicted by the IBC prediction mode.

[0157] In some embodiments, each of the multiple sub-blocks of the current block may be a corresponding 4 by 4 pixel unit.

[0158] After (S1520), the process proceeds to (S1599) and ends.

[0159] The process (1500) may be modified as appropriate. One or more steps in the process (1500) may be modified and / or omitted. One or more other steps may be added. Any suitable order of implementation may be used.

[0160] like Fig.16 As shown, the process (1600) starts from (S1601) and proceeds to (S1610). At (S1610), a current block in a current picture may be divided into at least a first partition and a second partition based on a geometric partition mode (GPM). The first partition may be associated with an intra block copy (IBC) prediction mode, and the second partition may be associated with an intra prediction mode.

[0161] At (S1620), prediction mode information of a first subblock of the plurality of subblocks of the current block may be stored. The prediction mode information may include one of a DC mode, a planar mode, and an intra prediction mode based on whether the first subblock is associated with the IBC prediction mode, one of the intra prediction modes, or both the IBC prediction mode and the intra prediction mode.

[0162] At (S1630), encoding information of the current block is generated. The encoding information may indicate that the current block is divided based on the GPM.

[0163] The process then proceeds to (S1699) and ends.

[0164] The process (1600) may be appropriately modified. One or more steps in the process (1600) may be modified and / or omitted. One or more other steps may be added. Any suitable order of implementation may be used.

[0165] The above techniques may be implemented as computer software via computer-readable instructions and physically stored in one or more computer-readable media. Fig.17 A computer system (1700) is shown that is suitable for implementing certain embodiments of the disclosed subject matter.

[0166] The computer software may be encoded in any suitable machine code or computer language, and may be assembled, compiled, linked, or the like to create a code comprising instructions, which may be directly executed by one or more computer central processing units (CPUs), graphics processing units (GPUs), etc., or executed by decoding, microcode, or the like.

[0167] The instructions may be executed on various types of computers or components thereof, including, for example, personal computers, tablets, servers, smartphones, gaming devices, IoT devices, etc.

[0168] Fig.17 The components shown for the computer system (1700) are exemplary in nature and are not intended to impose any limitations on the scope of use or functionality of computer software implementing the disclosed embodiments. Nor should the configuration of the components be interpreted as having any dependency or requirement on any one or combination of components shown in the exemplary embodiment of the computer system (1700).

[0169] The computer system (1700) may include certain human-computer interface input devices. Such human-computer interface input devices may respond to input from one or more human users through tactile input (e.g., keyboard input, sliding, data glove movement), audio input (e.g., sound, applause), visual input (e.g., gestures), and olfactory input (not shown). The human-computer interface devices may also be used to capture certain media that are not necessarily directly related to human conscious input, such as audio (e.g., speech, music, ambient sound), images (e.g., scanned images, photographic images obtained from a still image camera), and videos (e.g., two-dimensional video, three-dimensional video including stereoscopic video).

[0170] The human-computer interface input device may include one or more of the following (only one of which is drawn): keyboard (1701), mouse (1702), touchpad (1703), touch screen (1710), data gloves (not shown), joystick (1705), microphone (1706), scanner (1707), camera (1708).

[0171] The computer system (1700) may also include certain human-computer interface output devices. Such human-computer interface output devices may stimulate one or more human user senses through, for example, tactile output, sound, light, and smell / taste. Such human-computer interface output devices may include tactile output devices (e.g., tactile feedback through a touch screen (1710), a data glove (not shown), or a joystick (1705), but there may also be tactile feedback devices that are not used as input devices), audio output devices (e.g., speakers (1709), headphones (not shown)), visual output devices (e.g., screens (1710) including cathode ray tube screens, liquid crystal screens, plasma screens, organic light emitting diode screens, each of which has or does not have a touch screen input function, each of which has or does not have a tactile feedback function - some of which can output two-dimensional visual output or output of more than three dimensions through means such as stereoscopic picture output; virtual reality glasses (not shown), holographic displays, and smoke boxes (not shown)) and printers (not shown).

[0172] The computer system (1700) may also include human-accessible storage devices and their associated media, such as optical media including high-density read-only / rewritable compact disks (CD / DVD ROM / RW) (1720) with CD / DVD or similar media (1721), thumb drives (1722), removable hard disk drives or solid state drives (1723), traditional magnetic media such as tapes and floppy disks (not shown), special-purpose ROM / ASIC / PLD-based devices such as security software protectors (not shown), and the like.

[0173] Those skilled in the art should also understand that the term "computer-readable media" used in connection with the disclosed subject matter does not include transmission media, carrier waves, or other transient signals.

[0174] The computer system (1700) may also include an interface (1754) to one or more communication networks (1755). For example, the network may be wireless, wired, or optical. The network may also be a local area network, a wide area network, a metropolitan area network, an in-vehicle network, an industrial network, a real-time network, a delay-tolerant network, and the like. The network also includes local area networks such as Ethernet, wireless local area networks, cellular networks (GSM, 3G, 4G, 5G, LTE, etc.), television wired or wireless wide area digital networks (including cable television, satellite television, and terrestrial broadcast television), in-vehicle and industrial networks (including CANBus), and the like. Some networks typically require an external network interface adapter for connecting to some universal data port or peripheral bus (1749) (e.g., a USB port of the computer system (1700)); other systems are typically integrated into the core of the computer system (1700) by connecting to a system bus as described below (e.g., an Ethernet interface integrated into a PC computer system or a cellular network interface integrated into a smart phone computer system). By using any of these networks, the computer system (1700) can communicate with other entities. The communication can be one-way, for receiving only (e.g., wireless television), one-way for sending only (e.g., CAN bus to certain CAN bus devices), or two-way, such as to other computer systems via a local or wide area digital network. Each of the above networks and network interfaces can use certain protocols and protocol stacks.

[0175] The above-mentioned human-machine interface devices, human-accessible storage devices, and network interfaces may be connected to the core (1740) of the computer system (1700).

[0176] The core (1740) may include one or more central processing units (CPUs) (1741), graphics processing units (GPUs) (1742), dedicated programmable processing units in the form of field programmable gate arrays (FPGAs) (1743), hardware accelerators for specific tasks (1744), graphics adapters (1750), etc. These devices, as well as read-only memory (ROM) (1745), random access memory (1746), internal mass storage (e.g., internal non-user accessible hard disk drives, solid-state drives, etc.) (1747), etc., may be connected via a system bus (1748). In some computer systems, the system bus (1748) may be accessed in the form of one or more physical plugs so that it may be expanded by additional central processing units, graphics processing units, etc. Peripheral devices may be directly attached to the core's system bus (1748), or connected via a peripheral bus (1749). In an example, a screen (1710) may be connected to a graphics adapter (1750). The architecture of the peripheral bus includes a peripheral controller interface PCI, a universal serial bus USB, etc.

[0177] The CPU (1741), GPU (1742), FPGA (1743) and accelerator (1744) can execute certain instructions, which can be combined to form the above-mentioned computer code. The computer code can be stored in ROM (1745) or RAM (1746). Transition data can also be stored in RAM (1746), while permanent data can be stored in, for example, internal mass storage (1747). Fast storage and retrieval of any memory device can be achieved by using a cache memory, which can be closely associated with one or more CPUs (1741), GPUs (1742), mass storage (1747), ROM (1745), RAM (1746), etc.

[0178] The computer readable medium may have computer code thereon for performing various computer-implemented operations. The medium and computer code may be specially designed and constructed for the purposes of the present disclosure, or may be the medium and code well known and available to those skilled in the art of computer software.

[0179] As an embodiment and not limitation, a computer system (1700) having an architecture, in particular a core (1740), can be provided as a processor (including a CPU, a GPU, an FPGA, an accelerator, etc.) to execute software contained in one or more tangible computer-readable media. Such a computer-readable medium can be a medium associated with the above-mentioned user-accessible mass storage, as well as a specific memory of the core (1740) having non-volatility, such as a core internal mass storage (1747) or a ROM (1745). Software implementing various embodiments of the present disclosure can be stored in such a device and executed by the core (1740). Depending on specific needs, the computer-readable medium may include one or more storage devices or chips. The software can enable the core (1740), in particular the processor therein (including a CPU, a GPU, an FPGA, etc.) to perform a specific process or a specific part of a specific process described herein, including defining a data structure stored in the RAM (1746) and modifying such a data structure according to a software-defined process. Additionally or alternatively, the computer system may provide functionality hardwired in logic or otherwise contained in circuitry (e.g., accelerator (1744)) that may operate in place of or in conjunction with software to perform specific processes or specific portions of specific processes described herein. Where appropriate, references to software may include logic and vice versa. Where appropriate, references to computer-readable media may include circuitry (such as an integrated circuit (IC)) storing execution software, circuitry containing execution logic, or both. The present disclosure includes any suitable combination of hardware and software. Appendix A: Acronyms JEM: Joint Exploration Model VVC: universal video coding BMS: Benchmark Set MV: Motion Vector HEVC: High Efficiency Video Coding SEI: Supplementary Enhancement Information VUI: Video Usability Information GOPs: Groups of Pictures TUs: Transform Units PUs: Prediction Units CTUs: Coding Tree Units CTBs: Coding Tree Blocks PBs: Prediction Blocks HRD: Hypothetical Reference Decoder SNR: Signal Noise Ratio CPUs: Central Processing Units GPUs: Graphics Processing Units CRT: Cathode Ray Tube LCD: Liquid-Crystal Display OLED: Organic Light-Emitting Diode CD: Compact Disc DVD: Digital Video Disc ROM: Read-Only Memory RAM: Random Access Memory ASIC: Application-Specific Integrated Circuit PLD: Programmable Logic Device LAN: Local Area Network GSM: Global System for Mobile communications LTE: Long-Term Evolution CANBus: Controller Area Network Bus USB: Universal Serial Bus PCI: Peripheral Component Interconnect FPGA: Field Programmable Gate Areas SSD: solid-state drive IC:Integrated Circuit CU: Coding Unit

[0180] Although the present disclosure has described a number of exemplary embodiments, various changes, arrangements and various equivalent substitutions of the embodiments are within the scope of the present disclosure. It should therefore be understood that those skilled in the art are capable of designing a variety of systems and methods, which, although not explicitly shown or described herein, embody the principles of the present disclosure and are therefore within the spirit and scope of the present disclosure.

Claims

1. A video encoding method, characterized in that: The method comprises: Divide a current block in a current picture into at least a first partition and a second partition based on a geometric partition mode GPM, wherein the first partition is associated with an intra block copy (IBC) prediction mode and the second partition is associated with an intra prediction mode; and storing prediction mode information of a first subblock among the plurality of subblocks of the current block based on whether the first subblock is associated with the IBC prediction mode, one of the intra prediction modes, or both the IBC prediction mode and the intra prediction mode, the prediction mode information comprising one of a DC mode, a planar mode, and the intra prediction mode associated with the second partition; The current block is encoded and encoding information of the current block is generated, the encoding information indicating that the current block is divided into at least the first partition and the second partition based on the GPM, and the encoded current block and the generated encoding information are included in an encoded video bitstream.

2. The method according to claim 1, characterized in that Further including: The stored prediction mode information is used to perform most probable mode (MPM) derivation on neighboring blocks of the current block.

3. The method according to claim 1, characterized in that Based on the association of the first subblock with the IBC prediction mode, only the planar mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

4. The method according to claim 1, characterized in that Based on the association of the first subblock with the intra prediction mode, only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

5. The method according to claim 1, characterized in that Based on the first subblock being associated with both the IBC prediction mode and the intra prediction mode, only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

6. The method according to claim 1, characterized in that Further including: Based on a first partition of the current block being associated with the IBC prediction mode and a second partition of the current block being associated with the intra prediction mode, the DC mode is stored for each of a plurality of subblocks of the current block.

7. The method according to claim 1, characterized in that Further including: Based on a first partition of the current block being associated with the IBC prediction mode and a second partition of the current block being associated with the intra prediction mode, the planar mode for each of a plurality of subblocks of the current block is stored.

8. The method according to claim 1, characterized in that Further including: Based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the intra prediction mode for each of a plurality of subblocks of the current block is stored.

9. The method according to claim 2, characterized in that: The prediction mode information of a first subblock of the multiple subblocks of the current block is the propagated intra mode derived by the MPM for a neighboring block of the current block, and the neighboring block is predicted by the IBC prediction mode.

10. A video encoding device, characterized in that: comprising a processing circuit, the processing circuit being configured to: Dividing a current block in a current picture into at least a first partition and a second partition based on a geometric partition mode GPM, wherein the first partition is associated with an intra block copy IBC prediction mode and the second partition is associated with an intra prediction mode; storing prediction mode information of a first subblock among the plurality of subblocks of the current block based on whether the first subblock is associated with the IBC prediction mode, one of the intra prediction modes, or both the IBC prediction mode and the intra prediction mode, the prediction mode information comprising one of a DC mode, a planar mode, and the intra prediction mode associated with the second partition; as well as The current block is encoded and encoding information of the current block is generated, the encoding information indicating that the current block is divided into at least the first partition and the second partition based on the GPM, and the encoded current block and the generated encoding information are included in an encoded video bitstream.

11. The device according to claim 10, characterized in that The processing circuit is further configured to: An execution module is used to perform most probable mode (MPM) derivation on neighboring blocks of the current block using the stored prediction mode information.

12. The device according to claim 10, characterized in that The processing circuit is configured to: Based on the association of the first subblock with the IBC prediction mode, only the planar mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

13. The device according to claim 10, characterized in that The processing circuit is configured to: Based on the association of the first subblock with the intra prediction mode, only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

14. The device according to claim 10, characterized in that The processing circuit is configured to: Based on the first subblock being associated with both the IBC prediction mode and the intra prediction mode, only the intra prediction mode among the prediction mode information of the first subblock of the plurality of subblocks of the current block is stored.

15. The device according to claim 10, characterized in that The processing circuit is configured to: Based on a first partition of the current block being associated with the IBC prediction mode and a second partition of the current block being associated with the intra prediction mode, the DC mode is stored for each of a plurality of subblocks of the current block.

16. The device according to claim 10, characterized in that The processing circuit is configured to: Based on a first partition of the current block being associated with the IBC prediction mode and a second partition of the current block being associated with the intra prediction mode, the planar mode for each of a plurality of subblocks of the current block is stored.

17. The device according to claim 10, characterized in that The processing circuit is configured to: Based on the first partition of the current block being associated with the IBC prediction mode and the second partition of the current block being associated with the intra prediction mode, the intra prediction mode for each of a plurality of subblocks of the current block is stored.

18. A computer device comprising at least one memory and at least one processor, wherein the at least one memory is used to store computer instructions, and when the computer instructions are loaded and executed by the at least one processor, the at least one processor executes the method according to any one of claims 1 to 9.

19. A non-volatile computer-readable storage medium, used to store instructions, which, when executed by at least one processor, cause the at least one processor to perform the method according to any one of claims 1 to 9.

20. A method for processing a video stream, characterized in that: A video code stream is stored on a non-volatile computer-readable medium, wherein the video code stream is generated based on the video encoding method according to any one of claims 1 to 9.

Images