Method, apparatus and program for geometric partitioning mode with intra block copying

Abstract

In response to the current block being divided into a first partition and a second partition based on the geometric partition mode, a first prediction type for the first partition and a second prediction type for the second partition are determined based on a flag associated with one of intra prediction, inter prediction, and intra block copy (IBC). Each of the first and second prediction types is one of intra prediction, inter prediction, and IBC. A first prediction mode for the first partition of the current block is determined based on the first prediction type. A second prediction mode for the second partition of the current block is determined based on the second prediction type. The first partition of the current block is reconstructed based on the first prediction mode, and the second partition of the current block is reconstructed based on the second prediction mode.

Description

[Technical field]

[0001] Incorporation by Reference This application claims the benefit of priority to U.S. Patent Application No. 17 / 877,812, entitled "Geometric Partitioning Modes with Intra Block Copy," filed July 29, 2022, which claims the benefit of priority to U.S. Provisional Application No. 63 / 228,329, entitled "Geometric Partitioning Modes with Intra Block Copy," filed August 2, 2021. The disclosures of these earlier applications are incorporated herein by reference in their entireties.

[0002] Technical Field This disclosure describes embodiments generally relating to video coding. [Background technology]

[0003] The background discussion provided herein is intended to generally present the context of the present disclosure. Work of the inventors named in this application, to the extent that their work is described in this background section, and aspects of this description that may not otherwise qualify as prior art at the time of filing, are not admitted, either explicitly or implicitly, as prior art to the present disclosure.

[0004] Uncompressed digital video may contain a series of pictures, each having spatial dimensions of, for example, 1920x1080 luminance samples and associated chrominance samples. The series of pictures may have a fixed or variable picture rate (also informally known as frame rate), for example, 60 pictures per second or 60 Hz. Uncompressed video has specific bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luminance sample resolution at a frame rate of 60 Hz) with 8 bits per sample requires a bandwidth approaching 1.5 Gbit / s. One hour of such video requires more than 600 Gbytes of storage space.

[0005] One goal of video encoding and decoding may be the reduction of redundancy in the input video signal through compression. Compression may help reduce the aforementioned bandwidth and / or storage space requirements, in some cases by more than one order of magnitude. Both lossless and lossy compression, as well as combinations thereof, may be used. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When lossy compression is used, the reconstructed signal may not be identical to the original signal, but the distortion between the original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. For video, lossy compression is widely used. The amount of acceptable distortion depends on the application, e.g., users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The achievable compression ratio may reflect that a higher tolerable / acceptable distortion can result in a higher compression ratio.

[0006] Video encoders and decoders may utilize techniques from several broad categories, including motion compensation, transform, quantization, and entropy coding.

[0007] Video codec techniques can include a technique known as intra-coding. In intra-coding, sample values ​​are represented without reference to samples or other data from a previously reconstructed reference picture. In some video codecs, a picture is spatially divided into blocks of samples. If all blocks of samples are coded in intra mode, the picture may be an intra picture. Intra pictures and their derivatives, such as independent decoder refresh pictures, can be used to reset the decoder state and thus can be used as the first picture in a coded video bitstream and video session or as a still image. Samples of an intra block may be subjected to a transform, and the transform coefficients may be quantized before entropy coding. Intra prediction may be a technique that minimizes sample values ​​in the pre-transform domain. In some cases, the smaller the DC value and the smaller the AC coefficients after the transform, the fewer bits are required for a given quantization step size to represent the block after entropy coding.

[0008] Traditional intra-coding, e.g. as known from MPEG-2 generation coding techniques, does not use intra-prediction. However, some newer video compression techniques include techniques that attempt to do so from surrounding sample data and / or metadata obtained during the encoding and / or decoding of blocks of data that are spatially neighbors and that precede them in decoding order. Such techniques are referred to below as "intra-prediction" techniques. It should be noted that, at least in some cases, intra-prediction uses only reference data from the current picture being reconstructed and not from reference pictures.

[0009] There may be various forms of intra prediction. If more than one such technique is available for a given video coding technique, the technique used may be coded in an intra prediction mode. In some cases, a mode may have sub-modes and / or parameters, which may be coded separately or may be included in a mode codeword. Which codeword to use for a given mode, sub-mode and / or parameter combination may affect the coding efficiency gain through intra prediction, as well as the entropy coding technique used to convert the codeword into a bitstream.

[0010] Certain modes of intra prediction were introduced in H.264, refined in H.265, and further refined in newer coding techniques such as the Joint Exploration Model (JEM), Versatile Video Coding (VVC), and Benchmark Set (BMS). A predictor block can be formed using neighboring sample values ​​belonging to already available samples. The sample values ​​of the neighboring samples are copied to the predictor block according to a certain direction. The reference to the direction used can be coded in the bitstream or may itself be predicted.

[0011] Referring to FIG. 1A, at the bottom right, a subset of 9 known predictor directions from the 33 possible predictor directions (corresponding to the 33 angle modes of the 35 intra modes) of H.265 is depicted. The point (101) where the arrows converge represents the sample to be predicted. The arrows represent the direction in which the sample is predicted. For example, arrow (102) indicates that sample (101) is predicted from the sample(s) to the top right and at an angle of 45 degrees from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from the sample(s) to the bottom left of sample (101), at an angle of 22.5 degrees from the horizontal.

[0012] Continuing to refer to FIG. 1A, at the top left, a square block (104) of 4×4 samples is depicted (indicated by a thick dashed line). The square block (104) contains 16 samples, each labeled with an “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 (from the top) in the Y dimension and the first sample (from the left) in the X dimension. Similarly, sample S44 is the fourth sample in the block (104) in both the Y and X dimensions. Since the block is 4×4 samples in size, S44 is at the bottom right. Additionally, reference samples are shown that follow a similar numbering scheme. The reference samples are labeled with R and their Y position (e.g., row index) and X position (column index) relative to the block (104). In both H.264 and H.265, the predicted samples are neighbors of the block being reconstructed, so there is no need to use negative values.

[0013] Intra-picture prediction can work by copying reference sample values ​​from neighboring samples that are filled by the signaled prediction direction. For example, assume that the coded video bitstream includes signaling for this block that indicates a prediction direction that is consistent with the arrow (102). That is, the sample is predicted from the top right prediction sample(s) at an angle of 45 degrees from the horizontal. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Sample S44 is then predicted from reference sample R08.

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

[0015] As video coding technology develops, 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), and JEM / VVC / BMS at the time of this disclosure can support up to 65 directions. Experiments are performed to identify the most likely directions, and certain techniques in entropy coding are used to represent those likely directions with a small number of bits while accepting some penalty for the less likely directions. Furthermore, the direction itself may be predictable from nearby directions used in nearby already decoded blocks.

[0016] FIG. 1B shows a schematic diagram (110) depicting 65 intra prediction directions with JEM to illustrate the increasing number of prediction directions over time.

[0017] The mapping of intra-prediction direction bits in the coded video bitstream to represent directions can vary from one video coding technique to another, ranging from a simple direct mapping of prediction directions to intra-prediction modes, to complex adaptation schemes involving codewords, most probable modes, and similar techniques. In any case, however, there may be certain directions that are statistically less likely to occur in the video content than certain other directions. Because the goal of video compression is to reduce redundancy, in a well-performing video coding technique, these less likely ways are represented by more bits than the more likely directions.

[0018] Video encoding and decoding can be performed using inter-picture prediction with motion compensation. Motion compensation can be a lossy compression technique and can refer to a technique in which blocks of sample data from a previously reconstructed picture or part thereof (reference picture) are spatially shifted in a direction indicated by a motion vector (hereafter MV) and then used for the prediction of a newly reconstructed picture or picture partition. In some cases, the reference picture can be the same as the picture currently being reconstructed. The MV can have two dimensions, X and Y, or three dimensions, with the third dimension being an indication of the reference picture used (which can indirectly be the temporal dimension).

[0019] In some video compression techniques, the MV applicable to a region of sample data can be predicted from other MVs, for example from an MV associated with another region of sample data that is spatially adjacent to the region being reconstructed and precedes it in decoding order. By doing so, the amount of data required to encode the MV can be significantly reduced, thereby removing redundancy and increasing compression. MV prediction can work in a directed manner because, for example, when encoding an input video signal derived from a camera (known as natural video), there is a statistical probability that regions larger than the region to which a single MV is applicable move in a similar direction and can therefore, in some cases, be predicted using similar motion vectors derived from the MVs of nearby regions. As a result, the MV found for a given region will be similar or identical to the MV predicted from the surrounding MVs, which, after entropy encoding, can be represented with fewer bits than would be used to directly encode the MVs. In some cases, MV prediction can be an example of lossless compression of a signal (i.e., an MV) derived from the original signal (i.e., a sample stream). In other cases, the MV prediction itself may be irreversible, for example due to rounding errors in computing the predictor from several surrounding MVs.

[0020] Various MV prediction mechanisms are described in H.265 / HEVC (ITU-T Rec. H.265, "High Efficiency Video Coding", December 2016). Among the many MV prediction mechanisms provided by H.265, a technique hereafter referred to as "spatial merge" is described herein.

[0021] Referring to Figure 2, a current block (201) contains samples that the encoder found during the motion search process to be predictable from a spatially shifted previous block of the same size. Instead of directly encoding its MV, the MV can be derived from metadata associated with one or more reference pictures, for example from the most recent reference picture (in decoding order) using MVs associated with any of the five surrounding samples, denoted A0, A1, and B0, B1, B2 (202 to 206, respectively). In H.265, MV prediction can use predictors from the same reference picture that neighboring blocks use. Summary of the Invention [Problem to be solved by the invention]

[0022] Aspects of the present disclosure provide a method and apparatus for video encoding / decoding. In some examples, an apparatus for video decoding includes a processing circuit. [Means for solving the problem]

[0023] According to an aspect of the present disclosure, a method of video decoding 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 current block can be divided into a first partition and a second partition based on a geometric partition mode (GPM). In response to determining that the current block is encoded with GPM, a first prediction type for the first partition of the current block and a second prediction type for the second partition of the current block can be determined based on at least one flag associated with a prediction type including one of intra prediction, inter prediction, and intra block copy (IBC), where each of the first and second prediction types can be one of intra prediction, inter prediction, and BC. Based on the determined first prediction type, a first prediction mode for the first partition of the current block can be determined. Based on the determined second prediction type, a second prediction mode for the second partition of the current block can be determined. A first partition of the current block can be reconstructed based on a first prediction mode, and a second partition of the current block can be reconstructed based on a second prediction mode.

[0024] To determine the first prediction type, in one example, the first prediction type for the first partition of the current block can be determined as intra prediction based on a first flag of the at least one flag being true. In one example, the first prediction type for the first partition of the current block can be determined as IBC based on a first flag of the at least one flag being false and a second flag of the at least one flag being true. In another example, the first prediction type for the first partition of the current block can be determined as inter prediction based on a first flag being false and a second flag being false.

[0025] To determine a first prediction mode, an intra prediction mode for a first partition of a current block can be determined based on a first syntax element included in the coded information in response to a first flag of the at least one flag being true, an IBC block vector for the first partition of a current block can be determined based on a second syntax element included in the coded information in response to a second flag of the at least one flag being true, and an inter prediction mode for a first partition of a current block can be determined based on a third syntax element included in the coded information in response to a first flag of the at least one flag and a second flag of the at least one flag being false.

[0026] In one example, a first prediction mode for a first partition can be determined to be associated with one of a first intra prediction mode and a first block vector of the IBC, and a second prediction mode for a second partition can be determined to be associated with one of a second intra prediction mode and a second block vector of the IBC.

[0027] In one example, a first prediction mode for a first partition can be determined to be associated with one of a first inter prediction mode and a first block vector of an IBC, and a second prediction mode for a second partition can be determined to be associated with one of a second inter prediction mode and a second block vector of an IBC.

[0028] In response to the first prediction type being IBC and the second prediction type being IBC, samples along a boundary between the first partition and the second partition may not be blended.

[0029] In some embodiments, the encoded information may include an intra prediction bit indicating whether one of the first prediction type and the second prediction type is intra prediction. The encoded information may include an inter prediction bit indicating whether one of the first prediction type and the second prediction type is inter prediction. The encoded information may also include an IBC prediction bit indicating whether one of the first prediction type and the second prediction type is IBC prediction.

[0030] In the method, in response to the first prediction type being IBC, a first partition of the current block can be predicted by a merge mode of IBC.

[0031] In one embodiment, in response to the motion store type being 0 or 1, one of the inter prediction motion vectors and the IBC block vectors can be stored in units of 4x4 pixels. In another embodiment, in response to the motion store type being 2, in one example, a first motion vector associated with the first partition and a second motion vector associated with the second partition can be stored in units of 4x4 pixels. In another example, the motion vector associated with the first partition and the block vector associated with the second partition can be stored in units of 4x4 pixels. In yet another example, one of the first block vector associated with the first partition and the second block vector associated with the second partition can be stored in 4x4 pixels.

[0032] In response to the first prediction type being IBC, a first block vector associated with the first partition can be determined as a first merge candidate in the IBC merge list, and in response to the second prediction type being IBC, a second block vector associated with the second partition can be determined as a second merge candidate in the IBC merge list.

[0033] According to another aspect of the present disclosure, there is provided an apparatus, the apparatus including a processing circuit, the processing circuit being configured to perform any of the above methods for video encoding / decoding.

[0034] Aspects of the present disclosure also provide a non-transitory computer-readable medium storing instructions that, when executed by a computer for video decoding, cause the computer to perform any of the above methods for video encoding / decoding. [Brief description of the drawings]

[0035] Further features, nature and various advantages of the disclosed subject matter will become more apparent from the following detailed description and the accompanying drawings.

[0036] [Figure 1A] FIG. 2 is a schematic diagram of an example subset of intra-prediction modes.

[0037] [Figure 1B] FIG. 2 is an illustration of an exemplary intra-prediction direction.

[0038] [Diagram 2] FIG. 2 is a schematic diagram of a current block and its surrounding spatial merging candidates in one example.

[0039] [Diagram 3] FIG. 1 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment.

[0040] [Figure 4] FIG. 4 is a schematic diagram of a simplified block diagram of a communication system (400) according to an embodiment.

[0041] [Diagram 5] FIG. 2 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment.

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

[0043] [Figure 7] 4 shows a block diagram of an encoder according to another embodiment;

[0044] [Figure 8] 4 shows a block diagram of a decoder according to another embodiment;

[0045] [Figure 9] 13 illustrates exemplary locations of spatial merging candidates in another embodiment.

[0046] [Figure 10] 1 illustrates an exemplary redundancy check of spatial merge candidates.

[0047] [Figure 11] 1 shows a schematic diagram of motion vector scaling for temporal merging candidates according to an embodiment.

[0048] [Figure 12] 1 illustrates exemplary candidate positions for temporal merge candidates, according to an embodiment.

[0049] [Figure 13] 1 illustrates an example angular distribution for a geometric partition mode in accordance with an embodiment.

[0050] [Figure 14] 1 illustrates an example division line for a GPM, according to an embodiment.

[0051] [Figure 15A] 1 shows a first schematic diagram of the GPM mode for intra-coded frames;

[0052] [Figure 15B]1 shows a second schematic diagram of the GPM mode for intra-coded frames.

[0053] [Figure 15C] 13 shows a third schematic diagram of the GPM mode for intra-coded frames.

[0054] [Figure 16] 1 shows a flowchart outlining an exemplary decoding process according to some embodiments of the present disclosure.

[0055] [Figure 17] 1 shows a flowchart outlining an exemplary encoding process according to some embodiments of the present disclosure.

[0056] [Figure 18] 1 is a schematic diagram of a computer system according to one embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0057] FIG. 3 illustrates a simplified block diagram of a communication system (300) according to an embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices that can communicate with each other, for example, via a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the example of FIG. 3, the first pair of terminal devices (310) and (320) perform a unidirectional transmission of data. For example, the terminal device (310) may encode video data (e.g., a stream of video pictures captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data can be transmitted in the form of one or more encoded video bitstreams. The terminal device (320) may receive the encoded video data from the network (350), decode the encoded video data to recover a video picture, and display the video picture according to the recovered video data. One-way data transmission may be common in media service applications, etc.

[0058] In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) performing bidirectional transmission of encoded video data, such as may occur during a video conference. For the bidirectional transmission of data, in one example, each of the terminal devices (330) and (340) may encode video data (e.g., a stream of video pictures captured by the terminal device) for transmission to the other of the terminal devices (330) and (340) over the network (350). Each of the terminal devices (330) and (340) may receive the encoded video data transmitted by the other of the terminal devices (330) and (340), decode the encoded video data to recover the video pictures, and display the video pictures on an accessible display device in accordance with the recovered video data.

[0059] In the example of FIG. 3, terminal devices (310), (320), (330), and (340) may be depicted as a server, a personal computer, and a smartphone, although the principles of the present disclosure may not be so limited. Embodiments of the present disclosure find application in laptop computers, tablet computers, media players, and / or dedicated video conferencing equipment. Network (350) represents any number of networks that convey encoded video data between terminal devices (310), (320), (330), and (340), including, for example, wired and / or wireless communication networks. Communication network (350) may exchange data in circuit-switched and / or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks, and / or the Internet. For purposes of the present discussion, the architecture and topology of network (350) may not be important to the operation of the present disclosure, unless otherwise described below.

[0060] 4 illustrates an arrangement of a video encoder and a video decoder in a streaming environment as an example of an application for the disclosed subject matter. The disclosed subject matter may be equally applicable to other video-enabled applications including, for example, video conferencing, digital TV, storage of compressed video on digital media including CDs, DVDs, memory sticks, etc.

[0061] The streaming system may include a video source (401), e.g., a digital camera, and may include a capture subsystem (413) that generates, e.g., a stream of uncompressed video pictures (402). In one example, the stream of video pictures (402) includes samples captured by a digital camera. The stream of video pictures (402), depicted as a thick line to emphasize its high data volume compared to the encoded video data (404) (or encoded video bitstream), may be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) may include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter, as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), depicted as a thin line to emphasize its lower data volume compared to the stream of video pictures (402), can be stored in a streaming server (405) for future use. One or more streaming client subsystems, such as the client subsystems (406) and (408) of FIG. 4, can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). The client subsystem (406) can include a video decoder (410), for example within the electronic device (430). The video decoder (410) decodes the incoming copy of the encoded video data (407) and generates an outgoing stream of video pictures (411) that can be rendered on a display (412) (e.g., a display screen) or other rendering device (not shown). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., a video bitstream) may be encoded according to some video encoding / compression standard.Examples of these standards include ITU-T Recommendation H.265. In one example, a video coding standard under development is informally known as VVC. The disclosed subject matter may be used in the context of Versatile Video Coding (VVC).

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

[0063] 5 shows a block diagram of a video decoder (510) according to an embodiment of the present disclosure. The video decoder (510) can be included in an electronic device (530). The electronic device (530) can include a receiver (531) (e.g., a receiving circuit). The video decoder (510) can be used in place of the video decoder (310) in the example of FIG. 4.

[0064] The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510); in the same or another embodiment, one coded video sequence at a time, and the decoding of each coded video sequence is independent of the other coded video sequences. The coded video sequences may be received from a channel (501), which may be a hardware / software link to a storage device that stores the encoded video data. The receiver (531) may receive the encoded video data together with other data, such as coded audio data and / or auxiliary data streams, which may be forwarded to respective usage entities (not shown). The receiver (531) may separate the coded video sequences from the other data. To combat network jitter, a buffer memory (515) may be coupled between the receiver (531) and the entropy decoder / parser (520) (hereinafter the "parser"). In some applications, the buffer memory (515) is part of the video decoder (510). In other applications, it may be external to the video decoder (510) (not shown). In still other applications, there may be a buffer memory (not shown) external to the video decoder (510), e.g. to combat network jitter, and yet another buffer memory (515) internal to the video decoder (510), e.g. to handle playback timing. If the receiver (531) is receiving data from a storage / forwarding device of sufficient bandwidth and controllability, or from an isochronous network, the buffer memory (515) may not be required or may be small. For use in best-effort packet networks such as the Internet, the buffer memory (515) may be required and may be relatively large, advantageously of adaptive size, and may be implemented, at least in part, in an operating system or similar element (not shown) external to the video decoder (510).

[0065] The video decoder (510) may include a parser (520) for reconstructing symbols (521) from the coded video sequence. These categories of symbols include information used to manage the operation of the video decoder (510) and potentially information for controlling a rendering device such as a render device (512) (e.g., a display screen). The render device may not be an integral part of the electronic device (530) as shown in FIG. 5, but may be coupled to the electronic device (530). The control information for the rendering device(s) may be in the form of Supplementary Enhancement Information (SEI) messages or Video Usability Information (VUI) parameter set fragments (not shown). The parser (520) may parse / entropy decode the received coded video sequence. The coding of the coded video sequence may follow a video coding technique or standard and may follow various principles including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, etc. The parser (520) can extract from the coded video sequence a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder based on at least one parameter corresponding to the group. The subgroups can 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), etc. The parser (520) can also extract information from the coded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, etc.

[0066] The parser (520) performs an entropy decoding / parsing operation on the video sequence received from the buffer memory (515), thereby generating symbols (521).

[0067] The reconstruction of symbols (521) can involve several different units, depending on the type of coded video picture or its parts (e.g., inter and intra pictures, inter and intra blocks) and other factors. Which units are involved and how can be controlled by subgroup control information parsed by the parser (520) from the coded video sequence. The flow of such subgroup control information between the parser (520) and the following units is not depicted for clarity.

[0068] In addition to the functional blocks already mentioned, the video decoder (510) may be conceptually divided into a number of functional units, as described below. In a practical implementation working within commercial constraints, many of these units may interact closely with each other and may be at least partially integrated with each other. However, for purposes of describing the disclosed subject matter, the following conceptual subdivision into functional units is appropriate.

[0069] The first unit is a scaler / inverse transform unit (551). The scaler / inverse transform unit (551) receives quantized transform coefficients and control information as symbol(s) (521) from the parser (520). The control information includes which transform to use, block size, quantization factor, quantization scaling matrix, etc. The scaler / inverse transform unit (551) can output a block containing sample values ​​that can be input to an aggregator (555).

[0070] In some cases, the output samples of the scaler / inverse transform (551) may relate to intra-coded blocks, i.e. blocks that do not use prediction information from a previously reconstructed picture, but may use prediction information from a previously reconstructed part of the current picture. Such prediction 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 already reconstructed information taken from a current picture buffer (558). The current picture buffer (558) may, for example, buffer a partially reconstructed current picture and / or a fully reconstructed current picture. The aggregator (555) may add, possibly on a sample-by-sample basis, the prediction information generated by the intra prediction unit (552) to the output sample information provided by the scaler / inverse transform unit (551).

[0071] In other cases, the output samples of the scaler / inverse transform unit (551) may relate to an inter-coded, potentially motion-compensated block. In such cases, the motion compensation prediction unit (553) may access a reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples according to the symbols (521) for the block, these samples may be added by an aggregator (555) to the output of the scaler / inverse transform unit (in this case referred to as residual samples or residual signals) to generate output sample information. The addresses in the reference picture memory (557) from which the motion compensation unit (553) fetches the prediction samples may be controlled by a motion vector available to the motion compensation unit (553) in the form of a symbol (521). The symbol may have, for example, X, Y, and reference picture components. Motion compensation may include interpolation of sample values ​​fetched from the reference picture memory (557) when subsample accurate motion vectors are used, motion vector prediction mechanisms, etc.

[0072] The output samples of the aggregator (555) can be subjected to various loop filtering techniques in a loop filter unit (556). Video compression techniques can include in-loop filter techniques that are controlled by parameters contained in the coded video sequence (also called coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to meta-information obtained during decoding of a previous part (in decoding order) of the coded picture or coded video sequence, as well as to previously reconstructed loop filtered sample values.

[0073] The output of the loop filter unit (556) can be a sample stream, which can be output to a render device (512) or can be stored in a reference picture memory (557) for use in future inter-picture prediction.

[0074] Once an encoded picture is fully reconstructed, it can be used as a reference picture for future predictions. For example, once an encoded picture corresponding to a current picture is fully reconstructed and the encoded picture is identified (e.g., by the parser (520)) as a reference picture, the current picture buffer (558) can become part of the reference picture memory (557) and a fresh current picture buffer can be reallocated before starting the reconstruction of a subsequent encoded picture.

[0075] The video decoder (510) may perform decoding operations according to a given video compression technique in a standard, such as ITU-T Recommendation H.265. The coded video sequence may conform to the syntax prescribed by the video compression technique or standard being used, in the sense that the coded video sequence conforms to the syntax of the video compression technique or standard and the profile documented in the video compression technique or standard. Specifically, the profile may select certain tools from all tools available in the video compression technique or standard as the only tools available for use under that profile. Compliance may also require that the complexity of the coded video sequence be within a range defined by the level of the video compression technique or standard. In some cases, the level constrains the maximum picture size, maximum frame rate, maximum reconstruction sample rate (e.g., measured in units of megasamples per second), maximum reference picture size, etc. The limits set by the level may be further constrained through a Hypothetical Reference Decoder (HRD) specification and metadata for HRD buffer management, possibly signaled in the coded video sequence.

[0076] In some embodiments, the receiver (531) may receive additional (redundant) data along with the encoded video. The additional data may be included as part of the encoded video sequence(s). The additional data may be used by the video decoder (510) to properly decode the data and / or to 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) improvement layers, redundant slices, redundant pictures, forward error correction codes, etc.

[0077] 6 shows a block diagram of a video encoder (603) according to an embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., a transmission circuit). The video encoder (603) can be used in place of the video encoder (403) in the example of FIG. 4.

[0078] The video encoder (603) can receive video samples from a video source (601) (which is not part of the electronic device (620) in the example of FIG. 6) that can capture video images to be encoded by the video encoder (603). In another example, the video source (601) is part of the electronic device (620).

[0079] The video source (601) may provide a source video sequence to be encoded by the video encoder (603) in the form of a digital video sample stream that may be of any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 YCrCB, RGB, ...) and any suitable sampling structure (e.g., YCrCb 4:2:0, YCrCb 4:4:4). In a media service system, the video source (601) may be a storage device that stores pre-prepared video. In a video conferencing system, the video source (601) may be a camera that captures image information locally as a video sequence. The video data may be provided as a number of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, each of which may contain one or more samples depending on the sampling structure, color space, etc. in use. Those skilled in the art can easily understand the relationship between pixels and samples. The following description focuses on samples.

[0080] According to an embodiment, the video encoder (603) can encode and compress pictures of a source video sequence into an encoded video sequence (643) in real-time or under any other time constraint required by an application. Enforcing an appropriate encoding rate is one function of the controller (650). In some embodiments, the controller (650) controls and is operatively coupled to other functional units, such as those described below. Such couplings are not depicted for clarity. Parameters set by the controller (650) can include parameters related to rate control (picture skip, quantizer, lambda value for rate-distortion optimization techniques, ...), picture size, group of pictures (GOP) layout, maximum motion vector search range, etc. The controller (650) can be configured with other suitable functions for the video encoder (603) optimized for a certain system design.

[0081] In some embodiments, the video encoder (603) is configured to operate in an encoding loop. As a simplistic description, in one example, the encoding loop can include a source encoder (630) (e.g., responsible for generating symbols such as a symbol stream based on an input picture to be encoded and a reference picture(s)) and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to generate sample data in a similar manner that a (remote) decoder would also generate (in the video compression techniques considered in the disclosed subject matter, any compression between the symbols and the encoded video bitstream is lossless). 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 regardless of the decoder location (local or remote), the contents of the reference picture memory (634) are also bit-accurate between the local and remote encoders. In other words, the prediction part of the encoder "sees" exactly the same sample values ​​as the reference picture samples that the decoder "sees" when using the prediction during decoding. This basic principle of reference picture synchrony (and the resulting drift when synchrony cannot be maintained, e.g., due to channel errors) is also used in several related technologies.

[0082] The operation of the "local" decoder (633) may be the same as the operation of a "remote" decoder, e.g., the video decoder (410), already described in detail above in connection with Figure 5. However, referring also briefly to Figure 5, since symbols are available and the encoding / decoding of symbols into a coded video sequence by the entropy coder (645) and parser (420) may be lossless, the entropy decoding portion of the video decoder (410), including the buffer memory (415) and the parser (420), may not be fully implemented in the local decoder (633).

[0083] An observation that can be made at this point is that any decoder technique, except for parsing / entropy decoding, that exists in the decoder must exist in substantially the same functional form in the corresponding encoder. For this reason, the disclosed subject matter focuses on the decoder operation. The description of the encoder techniques can be abbreviated since they are the inverse of the decoder techniques, which are described generically. Only in certain areas is more detailed explanation necessary, and is provided below.

[0084] During operation, in some examples, the source encoder (630) may perform motion-compensated predictive encoding, which 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 differences between pixel blocks of the input picture and pixel blocks of the reference picture(s) that may be selected as predictive references for the input picture.

[0085] The local video decoder (633) can decode the coded video data of pictures that may be designated as reference pictures based on the symbols generated by the source encoder (630). The operation of the coding engine (632) can advantageously be a lossy process. When the coded video data can be decoded by a video decoder (not shown in FIG. 6), the reconstructed video sequence can typically be a copy of the source video sequence with some errors. The local video decoder (633) can replicate the decoding process that may be performed on the reference pictures by the video decoder and store the reconstructed reference pictures in a reference picture cache (634). In this way, the video encoder (603) can locally store copies of reconstructed reference pictures that have common content (in the absence of transmission errors) as the reconstructed reference pictures that would be obtained by the far-end video decoder.

[0086] The predictor (635) may perform a prediction search for the coding engine (632). That is, for a new picture to be coded, 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 suitable prediction references for the new picture. The predictor (635) may operate on a sample block-by-pixel block basis to find suitable prediction references. In some cases, as determined by the search results obtained by the predictor (635), the input picture may have prediction references derived from multiple reference pictures stored in the reference picture memory (634).

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

[0088] The output of all the above functional units can be subjected to entropy coding in an entropy coder (645), which converts the symbols produced by the various functional units into a coded video sequence by losslessly compressing the symbols according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc.

[0089] The transmitter (640) can buffer the coded video sequence produced by the entropy encoder (645) and prepare it for transmission over a communication channel (660), which may be a hardware / software link to a storage device that stores the encoded video data. The transmitter (640) can merge the coded video data from the video encoder (630) with other data to be transmitted, such as coded audio data and / or auxiliary data streams (sources not shown).

[0090] A controller (650) may manage the operation of the video encoder (603). During encoding, the controller (650) may assign a coding picture type to each coded picture. The coding picture type may affect the coding technique that may be applied to each picture. For example, pictures may often be assigned as one of the following picture types:

[0091] An intra picture (I picture) may be one that can be coded and decoded without using other pictures in a sequence as a source of prediction. Some video codecs allow different types of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art will recognize these variations of I pictures, as well as their respective uses and characteristics.

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

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

[0094] A source picture is usually spatially divided into multiple sample blocks (e.g., blocks of 4x4, 8x8, 4x8, or 16x16 samples each) and may be coded block by block. Blocks may be predictively coded with reference to other (already coded) blocks, as determined by the coding assignment applied to the respective picture of the block. For example, blocks of an I picture may be non-predictively coded or predictively coded with reference to already coded blocks of the same picture (spatial or intra prediction). Pixel blocks of a P picture may be predictively coded via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of a B picture may be predictively coded via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

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

[0096] In some embodiments, the sender (640) may transmit additional data along with the encoded video. The source encoder (630) may include such data as part of the encoded video sequence. The additional data may include temporal / spatial / SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, etc.

[0097] Video may be captured as multiple source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated as intra-prediction) exploits spatial correlations in a given picture, while inter-picture prediction exploits correlations (temporal or otherwise) between pictures. In one example, a particular picture to be encoded / decoded, called the current picture, is divided into blocks. If a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, that block in the current picture can be coded by a vector called a motion vector. The motion vector points to a reference block in the reference picture, and may have a third dimension that identifies the reference picture if multiple reference pictures are used.

[0098] In some embodiments, bi-prediction techniques can be used in inter-picture prediction. According to bi-prediction techniques, two reference pictures are used, such as a first reference picture and a second reference picture, both of which precede the current picture in decode order (but may be past and future, respectively, in display order) in the video. A block in the current picture can be coded with a first motion vector that points to a first reference block in the first reference picture and a second motion vector that points to a second reference block in the second reference picture. A block can be predicted by a combination of the first and second reference blocks.

[0099] Furthermore, to improve coding efficiency, merge mode techniques can be used in inter-picture prediction.

[0100] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed on a block-by-block basis. For example, according to the HEVC standard, pictures in a sequence of video pictures are divided into coding tree units (CTUs) for compression, and the CTUs in a picture 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), one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree partitioned into one or more coding units (CUs). For example, a CTU of 64×64 pixels can be partitioned into one CU of 64×64 pixels, or four CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In one example, each CU is analyzed to determine a prediction type for that CU, such as an inter prediction type or an intra prediction type. A CU is divided into one or more prediction units (PUs) depending on temporal and / or spatial predictability. Generally, each PU includes a luma prediction block (PB) and two chroma PBs. In an embodiment, the prediction operation in encoding / decoding is performed in units of a prediction block. Taking a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values ​​(e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, etc.

[0101] 7 shows a diagram of a video encoder (703) according to another embodiment of the present disclosure. The video encoder (703) is configured to receive a processed block of sample values ​​(e.g., a predictive block) in a current video picture in a sequence of video pictures and to encode the processed block into a coded picture that is part of a coded video sequence. In one example, the video encoder (703) is used in place of the video encoder (403) in the example of FIG. 4.

[0102] In an HEVC example, the video encoder (703) receives a matrix of sample values ​​for a processing block, such as a predictive block, such as 8×8 samples. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or bi-predictive mode, e.g., using rate-distortion optimization. If the processing block is coded in intra mode, the video encoder (703) may use intra prediction techniques to encode the processing block into a coded picture; if the processing block is coded in inter mode or bi-predictive mode, the video encoder (703) may use inter prediction techniques or bi-predictive techniques, respectively, to encode the processing block into a coded picture. In certain video coding techniques, a merge mode may be an inter-picture prediction submode in which motion vectors are derived from one or more motion vector predictors, but without the benefit of coded motion vector components outside the predictors. In certain other video coding techniques, there may be motion vector components applicable to the current block. In one example, the video encoder (703) includes other components, such as a mode decision module (not shown) for determining a mode of a processing block.

[0103] In the example of FIG. 7, the video encoder (703) includes an inter-encoder (730), an intra-encoder (722), a residual calculator (723), a switch (726), a residual encoder (724), a general controller (721), and an entropy coder (725), coupled together as shown in FIG.

[0104] The inter encoder (730) is configured 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 previous and subsequent pictures), generate inter prediction information (e.g., a description of redundant information due to inter encoding techniques, motion vectors, merge mode information), and calculate an inter prediction result (e.g., a predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference picture is a decoded reference picture that has been decoded based on the encoded video information.

[0105] The intra encoder (722) is configured to receive samples of a current block (e.g., a processing block), optionally compare the block to blocks already encoded in the same picture, generate transformed and quantized coefficients, and optionally generate intra prediction information (e.g., intra prediction direction information according to one or more intra encoding techniques). In one example, the intra encoder (722) also calculates an intra prediction result (e.g., a predicted block) based on the intra prediction information and a reference block in the same picture.

[0106] The general controller (721) is configured to determine general control data and control other components of the video encoder (703) based on the general control data. In one example, 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, if the mode is an intra mode, the general controller (721) controls the switch (726) to select the result of the intra mode for use by the residual calculator (723) and controls the entropy encoder (725) to select intra prediction information and include the intra prediction information in the bitstream; if the mode is an inter mode, the general controller (721) controls the switch (726) to select the result of inter prediction for use by the residual calculator (723) and controls the entropy encoder (725) to select inter prediction information and include the inter prediction information in the bitstream.

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

[0108] The entropy encoder (725) is configured to format a bitstream to include the encoded block. The entropy encoder (725) is configured to include various information in accordance with a suitable standard, such as the HEVC standard. In one example, the entropy encoder (725) is configured to include general control data, selected prediction information (e.g., intra-prediction information or inter-prediction information), residual information, and other suitable information in the bitstream. It is noted that, in accordance with the disclosed subject matter, when encoding a block in a merged sub-mode of either the inter mode or the bi-prediction mode, the residual information is not present.

[0109] 8 shows a diagram of a video decoder (810) according to another embodiment of the present disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence and decode the coded pictures to generate reconstructed pictures. In one example, the video decoder (810) is used in place of the video decoder (410) in the example of FIG. 4.

[0110] In the example of FIG. 8, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residual decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG. 8.

[0111] The entropy decoder (871) may be configured to reconstruct from the coded picture certain symbols that represent the syntax elements of which the coded picture is composed. Such symbols may include, for example, prediction information (e.g., intra- or inter-prediction information, etc.) that may identify the mode in which the block is coded (e.g., intra- or inter-prediction mode, merged submode or the latter two in another submode), certain samples or metadata used for prediction by the intra-decoder (872) or the inter-decoder (880), respectively, residual information, e.g., in the form of quantized transform coefficients, etc. In one example, if the prediction mode is an inter- or bi-prediction mode, the inter-prediction information is provided to the inter-decoder (880); if the prediction type is an intra-prediction type, the intra-prediction information is provided to the intra-decoder (872). The residual information may undergo inverse quantization and is provided to the residual decoder (873).

[0112] The inter decoder (880) is configured to receive inter prediction information and generate inter prediction results based on the inter prediction information.

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

[0114] The residual decoder (873) is configured to perform inverse quantization to extract dequantized transform coefficients, and to process the dequantized transform coefficients to transform the residual from the frequency domain to the spatial domain. The residual decoder (873) may also require certain control information (including quantizer parameters (QP)), which may be provided by the entropy decoder (871) (data path not depicted since this is only low volume control information).

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

[0116] It should be noted that the video encoders (403), (603), (703) and the video decoders (410), (510), (810) may be implemented using any suitable techniques. In one embodiment, the video encoders (403), (603), (703) and the video decoders (410), (510), (810) may be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), (603) and the video decoders (410), (510), (810) may be implemented using one or more processors executing software instructions.

[0117] This disclosure includes embodiments relating to geometric partitioning mode (GPM) with intra block copy, such as signaling, processing, and storage of BV information for IBC, and handling of BV merge candidate lists for GPM in IBC.

[0118] ITU-T VCEG (Q6 / 16) and ISO / IEC MPEG (JTC 1 / SC29 / WG11) published the H.265 / HEVC (High Efficiency Video Coding) standard in 2013 (version 1), 2014 (version 2), 2015 (version 3), and 2016 (version 4). In 2015, the two standards organizations jointly formed the Joint Video Exploration Team (JVET) to explore the possibility of developing the next video coding standard beyond HEVC. In October 2017, the two standards organizations announced a Joint Call for Proposals on Video Compression with Capability beyond HEVC (CfP). By 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 had been submitted. In April 2018, all received CfP responses were evaluated at the 122 MPEG / 10th JVET meeting. As a result of this meeting, JVET formally launched the standardization process for next-generation video coding beyond HEVC, and this new standard was named Versatile Video Coding (VVC), and JVET was renamed the Joint Video Experts Team. In 2020, ITU-T VCEG (Q6 / 16) and ISO / IEC MPEG (JTC1 / SC29 / WG11) published the VVC video coding standard (version 1).

[0119] In inter prediction, for each inter predicted coding unit (CU), motion parameters are required, e.g., due to the coding features of VVC used for inter predicted sample generation. The motion parameters may include motion vectors, reference picture indices, reference picture list usage indices, and / or additional information. The motion parameters may be signaled explicitly or implicitly. If a CU is coded in skip mode, the CU may be associated with one PU, and significant residual coefficients, coded motion vector deltas, and / or reference picture indices may not be required. If a CU is coded in merge mode, the motion parameters for the CU may be obtained from neighboring CUs. The neighboring CUs may include spatial and temporal candidates, and additional schedules (or additional candidates) as introduced in VVC. The merge mode can be applied to any inter predicted CU, not just skip mode. An alternative to the merge mode is explicit transmission of motion parameters, where the motion vector, the corresponding reference picture index for each reference picture list, the reference picture list usage flag, and / or other required information may be explicitly signaled for each CU.

[0120] For VVC, the VVC Test model (VTM) reference software can include several new sophisticated inter-prediction coding tools, which can include one or more of the following: (1) Enhanced Merge Prediction (2) Merge motion vector difference (MMVD) (3) AMVP mode with symmetric MVD signaling (4) Affine motion compensation prediction (5) Subblock-based temporal motion vector prediction (SbTMVP) (6) Adaptive motion vector resolution (AMVR) (7) Motion Field Storage: 1 / 16 luma sample MV storage and 8x8 motion field compression (8) Bi-prediction with CU-level weights (BCW) (9) Bi-directional optical flow (BDOF) (10) Decoder side motion vector refinement (DMVR) (11) Combined inter and intra prediction (CIIP) (12) Geometric partitioning mode (GPM)

[0121] A merge candidate list can be constructed by including five types of candidates as in VTM4. A merge candidate list can be constructed in the following order: 1) Spatial MVP from spatially neighboring CUs, 2) Temporal MVP from co-located CUs; 3) History-based MVP from a FIFO table, 4) Pairwise average MVP, 5) Zero MV.

[0122] The size of the merge list can be signaled in the slice header. The maximum allowed size of the merge list can be 6, as in VTM4. For each CU coded 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 coded using the context, and for the other bins bypass coding can be used.

[0123] In spatial candidate derivation, 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. The maximum number of merge candidates (e.g., four merge candidates) may be selected from among candidates located at the positions shown in FIG. 9, for example. As shown in FIG. 9, a current block (901) may include neighboring blocks (902)-(906) located at positions A0, A1, B0, B1, and B2, respectively. The order of derivation of spatial merge candidates may be B1, A1, B0, A0, and B2. Position B2 may be considered only if any CU (or block) at positions A0, B0, B1, or A1 is not available (e.g., because the CU belongs to another slice or tile) or is intra-coded. After the candidate (or block) at position A1 is added, the addition of the remaining candidates (or blocks) may be subject to a redundancy check. The redundancy check can ensure that candidates with the same motion information are removed from the merge list so that the coding efficiency is improved. To reduce the computational complexity, the redundancy check may not consider all possible candidate pairs. Instead, only the candidate pairs connected by the arrows in FIG. 10 may be considered. For example, the redundancy check can be applied to five candidate pairs, such as the candidate pair A1 and B1 and the candidate pair A1 and A0. A candidate can be added to the merge list only if the corresponding candidate used for the redundancy check does not contain the same motion information. For example, the candidate B0 can be added to the merge list only if the corresponding candidate B1 does not contain the same motion information.

[0124] In the derivation of a temporal candidate, only one candidate may be added to the merge list. For example, as shown in FIG. 11, in the derivation of a temporal merge candidate for a current CU (1114), a scaled motion vector may be derived based on a co-located CU (1104) belonging to a co-located reference picture (1112). The reference picture list used for the derivation of the co-located CU (1104) may be explicitly signaled in the slice header. The scaled motion vector for the temporal merge candidate may be obtained as shown by the dotted line (1102) in FIG. 11, which is scaled from the motion vector of the co-located CU (1104) using picture order count (POC) distances tb and td. tb may 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 a co-located picture (e.g., Col_ref) (1110) and a co-located picture (e.g., Col_pic) (1112). The reference picture index of a temporal merge candidate can be set to zero.

[0125] The position for the temporal candidate can be selected between candidates C0 and C1, as shown in Figure 12. For example, if the CU at position C0 is unavailable, intra-coded, or outside the current CTU row, then position C1 can be used. Otherwise, position C0 can be used in deriving the temporal merge candidate.

[0126] GPM can be applied for inter prediction. GPM can be applied only to CUs of a certain size, e.g., CUs with size of 8×8 or larger than 8×8. GPM can be signaled, e.g., using a CU-level flag, and can act as a type of merge mode. Other merge modes can include normal merge mode, MMVD mode, CIIP mode, and / or sub-block merge mode.

[0127] When the GPM is used, the CU can be divided into two geometrically shaped partitions by using one of several partition aspects. The partition aspects can be distinguished by angle and / or edge. In an embodiment, 64 different partition aspects can be applied in the GPM. The 64 different partition aspects can be distinguished by 24 non-uniformly quantized angles between 0° and 360° and up to four edges relative to the center of the CU. FIG. 13 shows 24 exemplary angles applied in the GPM. FIG. 14 shows four exemplary possible partition edges associated with an angle with index 3 in the CU (1402), each partition edge can be associated with a respective distance index. The distance index can indicate a distance relative to the center of the CU (1402). In the GPM, each geometric partition in the CU can be inter-predicted using a respective motion vector. Furthermore, for each partition, only uni-prediction may be allowed. For example, each partition can have one motion vector and one reference index. The constraint that only uni-predictive motion is allowed for each partition can ensure that only two motion-compensated predictions are needed for each CU, which also applies to conventional bi-prediction.

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

[0129] The implementation cost of IBC can be high over the entire already reconstructed region of the current picture. For example, a drawback of the IBC concept in HEVC is the need for additional memory in the Decode Picture Butter (DPB). Therefore, in hardware implementations of IBC, external memory is usually used. The additional external memory accesses can entail an increase in memory bandwidth.

[0130] In some implementations, it may be necessary to reduce the implementation cost. For example, VVC can use fixed memory, which can realize IBC by using on-chip memory, significantly reducing memory bandwidth requirements and hardware complexity. In addition, block vector (BV) coding of IBC can use the concept of merge list for inter prediction. The IBC list construction process can consider two spatially neighboring BVs and five history-based BVs (HBVPs). Here, 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., BVs of two spatial candidates).

[0131] To further improve the compression efficiency, as in VVC, template matching (TM) can be used to refine the motion at the decoder side. In TM mode, the motion is refined by building a template from reconstructed samples of the left and top neighborhoods, and the closest match between the template and a reference frame in the current picture can be determined.

[0132] TM can be applied to GPM. When a CU is coded with GPM, it can be decided whether TM is applied to refine each motion for a geometric partition. When TM is selected, a template can be constructed using left and top neighboring samples, and the motion can be further refined by finding the best match between the current template and a reference region with the same template pattern in a reference frame. The refined motion can be used to perform motion compensation for the geometric partition and can be further stored in a motion field.

[0133] GPM can be applied to support inter and intra prediction to improve coding performance beyond VVC. For example, a predefined intra prediction mode for (or with respect to) a geometric partition line can be selected in addition to a motion vector from a merge candidate list for each geometric partition in a GPM-applied CU. For each geometric partition, an intra prediction mode or an inter prediction mode can be determined based on a flag. If inter prediction is selected, a uni-predictive signal can be generated by MV from the merge candidate list. If an intra prediction mode is selected instead, a uni-predictive signal can be generated from neighboring samples predicted from a specified index of the intra prediction mode. The variation of possible intra prediction modes can be constrained by the geometry. Finally, the two uni-predictive signals can be blended similarly to normal GPM.

[0134] To reduce complexity and signaling overhead, a variation of possible intra prediction modes can be explored (or defined). For example, the impact of the variation of possible intra prediction modes on a GPM with inter and intra prediction was explored for two exemplary configurations. The first configuration tried only modes parallel and perpendicular to the geometric partition line. In addition to the intra angle modes parallel and perpendicular to the geometric partition line, in the second configuration, a planar mode was also tried. Two or three possible intra prediction modes were tried for the geometric partition in a GPM with inter and intra prediction.

[0135] In VVC, for CUs in bi-predictive inter mode, GPM with inter and intra prediction can be applied to improve partition precision, which can also be extended to combine inter and intra prediction for next generation video standards beyond VVC. However, partition precision may only be used for inter and intra prediction modes. For IBC, geometric partition scheme may not be applied to improve partition precision.

[0136] In the present disclosure, the GPM can be combined with different prediction blocks. For example, the GPM can be combined with three different prediction blocks. The three different prediction blocks can be generated using IBC, inter prediction mode, and intra prediction mode, respectively. Thus, each geometric partition of the GPM can be predicted based on one of the three different prediction blocks.

[0137] In an embodiment, a GPM mode can be combined with different prediction blocks (or prediction types). For example, a GPM can be combined with three different prediction blocks for two geometric partitions of the GPM. Each of the two geometric partitions can be predicted by one of three prediction types: 1) an IBC block using the BV of the IBC block, 2) a motion compensation block by using inter prediction, and 3) a neighboring sample by using an intra prediction mode. Each geometric partition can have a respective flag (e.g., intra flag) to indicate whether intra prediction is used or not. If the flag (e.g., intra flag) is true for a geometric partition, an intra prediction mode can be further signaled to indicate which intra prediction mode should be used to predict the geometric partition. Otherwise (e.g., intra flag is false), an IBC flag can be signaled to indicate whether IBC is used or not. If IBC is used for that geometric partition, the BV information of IBC can be signaled, resulting in generating an intra copied block. The intra copied blocks can be applied to predict the geometric partition. Otherwise (e.g., both the intra flag and the IBC flag are false), the inter prediction operation of the GPM can be generated. Thus, the geometric partition can be predicted based on the motion compensation block by using inter prediction. Due to the flexibility of the GPM, three different configurations in intra-coded frames (e.g., intra-IBC, intra-intra, and IBC-IBC) and nine different configurations in inter-coded frames (e.g., inter-IBC, IBC-IBC, inter-inter, intra-intra, and intra-IBC) can be applied.

[0138] In an embodiment, the GPM mode can be combined with two prediction types. For example, the GPM mode can be combined with an intra prediction mode and a predictor of IBC. In one example, for a first geometric partition of the GMP, an intra prediction flag can be signaled to indicate whether an intra prediction mode is used. If the intra prediction flag for the first partition is true, the intra prediction flag for the second geometric partition can be inferred as false. In one example, the intra prediction flag for both geometric partitions can be set as false by default. For each geometric partition, if the intra prediction mode is false for each of the geometric partitions, the BV information of the IBC can be signaled, resulting in an intra copied block for each of the geometric partitions. Otherwise, if the intra prediction flag is true, an intra prediction mode can be signaled to indicate which intra prediction mode can be used for the intra prediction process, and each of the geometric partitions can be predicted by the signaled intra prediction mode.

[0139] In an embodiment, the GPM mode can be combined with an inter-prediction mode and a predictor of IBC. For each of the geometric partitions of the GPM, first, an IBC flag can be signaled to indicate whether IBC is used for each of the geometric partitions. If the IBC flag is true, the BV information of IBC can be signaled, and as a result, an intra-copied block is generated for each of the geometric partitions. Otherwise, if the IBC flag is false, an inter-prediction process can be applied for each of the geometric partitions.

[0140] In some embodiments, blending may not be used along the boundary between two partitions if both partitions are predicted with the same prediction type, such as IBC, e.g., samples along the boundary between the first and second partitions of a GPM may not be blended.

[0141] A GPM mode can be embedded with IBC merge (or IBC merge mode), which may be similar to the embodiment where a VVC GPM mode is embedded with an inter prediction merge mode. In one example, for an intra slice (or a slice predicted by intra prediction), a combination of IBC and intra can be allowed in a GPM with IBC merge. Thus, a first partition of the GPM can be IBC predicted and a second partition of the GPM can be intra predicted. In another example, for an inter slice (or a slice predicted by inter prediction), a combination of IBC and inter can be allowed if an intra partition is not allowed in any partition of a GPM with IBC merge.

[0142] In this disclosure, the prediction mode of a CU encoded by a GPM with IBC may be set (or determined) to a specified mode. The mode may include an IBC mode, an INTER mode, and an INTER_IBC mode. Each of the IBC mode, the INTER mode, and the INTER_IBC mode may include any one or a combination of IBC, intra prediction, and inter prediction.

[0143] In one embodiment, the prediction mode of a GPM with IBC and intra in an intra slice can be set as an IBC mode (e.g., MODE_IBC). The IBC mode (e.g., MODE_IBC) can include IBC-IBC and IBC-intra for a geometric partition of a GPM. If the intra flag (e.g., intra_flag) is true for a geometric partition, intra prediction can be applied to that geometric partition. Otherwise (e.g., intra flag is false), IBC can be applied to that geometric partition.

[0144] The prediction mode of GPM with IBC and inter in inter slices can be set as INTER mode (e.g., MODE_INTER). INTER mode can include IBC-IBC and IBC-INTER. If the inter flag (e.g., inter_flag) is true for a geometric partition, inter prediction can be applied to that geometric partition. Otherwise (e.g., inter flag is false), IBC can be applied to that geometric partition.

[0145] In one example, the BV information of a GPM having a reference index (or reference frame index) as -1 can be used to distinguish the neighbor information of neighboring blocks in an IBC merge list by checking (i) whether the neighboring block is predicted by INTER mode and (ii) whether the reference frame index is -1.

[0146] The prediction mode of IBC and GPM with inter in inter slices can be set as INTER_IBC mode (e.g., MODE_INTER_IBC), which can indicate that MV or BV information can be used as predictor for normal inter merge list or IBC merge list, respectively.

[0147] A block may have multiple prediction modes. Prediction bits associated with the multiple prediction modes may be combined as a prediction mode of the current CU. For example, three prediction bits associated with inter, intra, and IBC, respectively, may be combined as a prediction mode of the current CU. For an inter-predicted block (or a block predicted by inter prediction), only the prediction bit for inter may be true. Similarly, for an intra-prediction mode (or a block predicted by intra prediction), only the prediction bit for intra may be true, and for an IBC block (or a block predicted by IBC), only the prediction bit for IBC may be true. If the current CU is marked as a GPM with IBC and inter, the prediction bits for inter and IBC may both be set as true. If the current CU is marked as a GPM with IBC and intra, the prediction bits for intra and IBC may both be set as true. When obtaining a predictor or generating an MPM list, the associated prediction bits may be used to check whether the prediction mode and motion information may be used for other CUs.

[0148] In this disclosure, constraints may be applied to the use of motion modes (e.g., merge mode or AMVP mode) of the IBC for a GPM with an IBC, for example, only merge mode may be allowed for the IBC when the IBC is used for a GPM to minimize the transmission of BV-encoded side information.

[0149] If two geometric partitions are both predicted by IBC, the merge indexes for the two different IBCs may be different, so a first merge index can be assigned to the first of the two geometric partitions, and a second merge index can be assigned to the second of the two geometric partitions.

[0150] In the present disclosure, the BV information of a GPM with an IBC may be stored / recorded in units such as 4x4 units (or 4x4 pixel units).

[0151] BV information for a GPM with IBC may be stored in 4x4 units (or 4x4 pixel units). In one example, the MV of inter prediction or the BV of IBC may be stored in 4x4 units for each partition. In one example, bidirectional motion information may be stored in the corresponding 4x4 units along the geometric boundary of two partitions. When IBC is used for GPM, bidirectional motion information may be combined (or generated) from two unidirectional motions such as BV and MV. In one example, if the motion information (e.g., MV) of one geometric partition is from reference list 0 (or reference list L0), the BV information may not be stored in the 4x4 units. Bidirectional motion information may be set as motion information from reference list 0 only. In one example, if two unidirectional predictions are both IBC, only one of the BVs may be stored in the 4x4 units.

[0152] If intra prediction modes are also available for GPM, a respective flag for each reference list may be signaled to indicate whether the BV and / or MV information in each reference list is valid or not.

[0153] For bidirectional motion information within a 4×4 unit along (or spanning) the geometric boundary of two geometric partitions, the BV information can be set as the motion information in reference list (1-X) if the motion information (e.g., MV) is from reference list X, where X can be either 0 or 1. Thus, the MV can be determined from reference list X, and the BV can be determined from reference list (X-1).

[0154] The bidirectional motion information can be combined with two BVs from two geometric partitions. The two BV information can be set as the motion information for both reference lists (e.g., L0 and L1). For example, one BV of a first partition of the two geometric partitions is from reference list L0, and another BV of a second partition of the two geometric partitions is from reference list L1.

[0155] When two geometric partitions are applied to IBC, the motion information for reference list X can be derived from the BV information from partition X. The partition index X can be derived from the merge GPM index, which can be either 0 or 1.

[0156] In this disclosure, a merge list can be derived for an IBC and a GPM with the IBC.

[0157] The construction of a merge list for a GPM with an IBC can be the same as or similar to the construction of the merge mode of the IBC.

[0158] If intra prediction mode is available for a GPM, a flag indicating whether the BV information for each reference list (e.g., L1 and L0) is valid can be detected. If the flag is true, the BV information with reference index -1 can be used as an IBC spatial BV candidate for the merge list of a GPM with IBC.

[0159] The motion information for each reference list can be determined based on whether the reference index associated with the motion information is -1 or not. If the reference index is -1, the motion information associated with the reference index as -1 for each reference list can be used for IBC merge list construction. Thus, each IBC spatial BV candidate can have bidirectional BV information from list 0 (or reference list L0) and list 1 (or reference list L1), respectively, and both BVs can be added to the IBC merge candidate list.

[0160] In an embodiment, the motion information for each reference list may be determined based on whether a reference index associated with the motion information is −1 or not. If the reference index associated with the motion information for reference list 0 is true, then the motion information (also referred to as BV) with the reference index as −1 for reference list 0 may be used for IBC merge list construction. Otherwise, if the reference index associated with the motion information for reference list 1 is true, then the motion information (also referred to as BV) with the reference index as −1 for reference list 1 may be used for IBC merge list construction. Up to one BV information per spatial neighboring block may be applied for the IBC merge list.

[0161] In this disclosure, the two geometric partitions for the GPM can be predicted from the IBC blocks by using IBC or from neighboring samples by using intra prediction. Three examples of different combinations of prediction blocks for the two geometric partitions of the GPM in an intra-coded frame are shown in Figures 15A-15C. As shown in Figure 15A, a current block (1504) and two reconstructed blocks (1510) and (1512) can be included in an intra-coded frame (1502). The current block (1504) can be partitioned into two geometric partitions (1506) and (1508) by the GPM. The two geometric partitions (1506) and (1508) can be predicted from IBC blocks such as the reconstructed blocks (1510) and (1512), respectively. Thus, a block vector BV0 can be associated with a partition (1506), and a reconstructed block (1510) and a block vector BV1 can be associated with a partition (1508) and a reconstructed block (1512). Furthermore, the block vector BV0 and the block vector BV1 may not be the same.

[0162] In FIG. 15B, a current block (1516) may be included in an intra-coded frame (1514). The current block (1516) may be divided into two geometric partitions (1518) and (1520). The two geometric partitions (1518) and (1520) may be predicted from neighboring samples by using an intra-prediction mode, and the intra-prediction modes of the two geometric partitions (1518) and (1520) may be different. For example, the partition (1518) may be predicted based on neighboring samples from an intra-prediction block B, and the partition (1520) may be predicted based on neighboring samples from an intra-prediction block A.

[0163] In FIG. 15C, a current block (1524) may be included in an intra-coded frame (1522). The current block (1524) may be divided into two geometric partitions (1526) and (1528). The geometric partition (1526) is a block vector (BV IBC ) based IBC block (1530), and the geometric partition (1528) can be predicted from neighboring pixels of the intra prediction block according to the intra prediction mode.

[0164] The motion information (e.g., MV) of a CU can be stored. For example, in VVC, the motion information of a CU can be stored with a granularity of 4×4 samples. The stored motion information can be used for MV prediction and merge list construction. Similarly, the BV information of a CU can also be stored using a 4×4 unit (or 4×4 pixel unit). The stored BV information can be used for IBC and IBC merge list construction. In GPM, due to two geometric partitions in a CU, three types of motion information including MV and BV may be involved. The motion information storage and BV information storage of GPM can be adaptively designed based on the geometric partitioning.

[0165] The motion storage type derivation of GPM can also be applied to GPM with IBC. The motion storage type, e.g., sType(T) for a 4×4 unit, can be determined by the displacement from the center of the 4×4 unit to the partition boundary. T=0 or T=1 can indicate that the corresponding 4×4 unit stores unidirectional MV or BV from geometric partition P0 or P1. T=2 can indicate that the corresponding 4×4 unit stores bidirectional motion information combined from two unidirectional motion vectors or block vectors.

[0166] For T=2, if IBC is available for GPM, there may be three different bidirectional motion types. For example, the first type may include regular bidirectional motion information (e.g., MV) that is combined (or generated) from two inter-merge predicted blocks. The second type may be associated with a combination of IBC and inter-merge prediction. Thus, one of the two unidirectional motion information may be a BV from an IBC block, and the other of the two unidirectional motion information may be an MV from an inter block. The motion information of an inter block may be stored in a 4×4 unit according to a motion information storage scheme, and the BV information may also be stored in the 4×4 unit for the construction of a BV candidate list. In the third type, two BV information associated with two geometric partitions (e.g., P0 or P1) may be treated for a 4×4 unit along the geometric boundary of those two geometric partitions. Since there may be no reference list information for the IBC merge list, a motion storage rule may be adopted in which the motion information of P0 or P1 from the same reference list may be stored. Therefore, if the motion information of P0 or P1 is from the same reference list, the BV storage information can be set as the BV of P1, and the MV or BV information of GPM merge index 0 can be used for the geometric partition of P0, and the MV or BV information of GPM merge index 1 can be used for the geometric partition of P1.

[0167] The motion information of a GPM with IBC can be coded by merge mode. The motion vector for each partition can be either from the merge motion mode or from the merged BV of the IBC. Unlike the two reference lists in a normal motion mode list, only one BV can be available for each merge candidate in the IBC merge list. Thus, each partition can have a corresponding BV, and each BV can be a merge candidate in the IBC merge list. The IBC merge list can be directly reused for the IBC merge list of a GPM. For example, each IBC merge candidate can be used for the IBC in a GPM with IBC.

[0168] FIG. 16 shows a flow chart outlining an exemplary decoding process (1600) according to some embodiments of the present disclosure. FIG. 17 shows a flow chart outlining an exemplary encoding process (1700) according to some embodiments of the present disclosure. The proposed processes may be used separately or combined in any order. Furthermore, each of the processes (or embodiments), the encoder, and the decoder may 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 on a non-transitory computer-readable medium.

[0169] The operations of the processes (e.g., 1600 and 1700) may be combined or arranged in any quantity or order as desired. In embodiments, two or more of the operations of the processes (e.g., 1600 and 1700) may be performed in parallel.

[0170] The processes (e.g., (1600) and (1700)) can be used in the reconstruction and / or encoding of blocks to generate a prediction block for a block being reconstructed. In various embodiments, the processes (e.g., (1600) and (1700)) are performed by processing circuitry, such as processing circuitry in terminal devices (310), (320), (330), and (340), processing circuitry performing the functions of a video encoder (403), processing circuitry performing the functions of a video decoder (410), processing circuitry performing the functions of a video decoder (510), processing circuitry performing the functions of a video encoder (603), etc. In some embodiments, the processes (e.g., (1600) and (1700)) are implemented with software instructions, such that the processing circuitry performs the processes (e.g., (1600) and (1700)) when the processing circuitry executes the software instructions.

[0171] As shown in Figure 16, the process (1600) may begin at (S1601) and proceed to (S1610), where coded information for a current block in a current picture of a video may be received from a coded video bitstream.

[0172] At (S1620), the current block may be divided into a first partition and a second partition based on a geometric partition mode (GPM).

[0173] In response to determining that the current block is coded in GPM at (S1630), a first prediction type for a first partition of the current block and a second prediction type for a second partition of the current block may be determined based on at least one flag associated with a prediction type including one of intra prediction, inter prediction, and intra block copy (IBC). Each of the first and second prediction types may be one of intra prediction, inter prediction, and IBC.

[0174] At (S1640), a first prediction mode for the first partition of the current block may be determined based on the determined first prediction type.

[0175] At (S1650), a second prediction mode for a second partition of the current block may be determined based on the determined second prediction type.

[0176] At (S1660), a first partition of the current block may be reconstructed based on a first prediction mode, and a second partition of the current block may be reconstructed based on a second prediction mode.

[0177] To determine the first prediction type, in one example, a first prediction type for a first partition of a current block may be determined as intra prediction based on a first flag of the at least one flag being true. In one example, a first prediction type for a first partition of a current block may be determined as IBC based on a first flag of the at least one flag being false and a second flag of the at least one flag being true. In another example, a first prediction type for a first partition of a current block may be determined as inter prediction based on a first flag being false and a second flag being false.

[0178] To determine a first prediction mode, an intra prediction mode for a first partition of a current block may be determined based on a first syntax element included in the coded information in response to a first flag of the at least one flag being true. An IBC block vector for a first partition of a current block may be determined based on a second syntax element included in the coded information in response to a second flag of the at least one flag being true. An inter prediction mode for a first partition of a current block may be determined based on a third syntax element included in the coded information in response to the first flag of the at least one flag and the second flag of the at least one flag being false.

[0179] In one example, a first prediction mode for the first partition may be determined to be associated with one of a first intra prediction mode and a first block vector of the IBC, and a second prediction mode for the second partition may be determined to be associated with one of a second intra prediction mode and a second block vector of the IBC.

[0180] In one example, a first prediction mode for a first partition may be determined to be associated with one of a first inter prediction mode and a first block vector of an IBC, and a second prediction mode for a second partition may be determined to be associated with one of a second inter prediction mode and a second block vector of an IBC.

[0181] In response to the first prediction type being IBC and the second prediction type being IBC, samples along a boundary between the first partition and the second partition may not be blended.

[0182] In some embodiments, the encoded information may include an intra prediction bit indicating whether one of the first prediction type and the second prediction type is intra prediction. The encoded information may include an inter prediction bit indicating whether one of the first prediction type and the second prediction type is inter prediction. The encoded information may also include an IBC prediction bit indicating whether one of the first prediction type and the second prediction type is IBC prediction.

[0183] In the process (1600), in response to the first prediction type being IBC, the first partition of the current block may be predicted by a merge mode of IBC.

[0184] In one embodiment, in response to the motion store type being 0 or 1, one of the inter prediction motion vectors and the IBC block vectors may be stored in 4x4 pixel units. In another embodiment, in response to the motion store type being 2, in one example, a first motion vector associated with the first partition and a second motion vector associated with the second partition may be stored in 4x4 pixel units. In another example, the motion vector associated with the first partition and the block vector associated with the second partition may be stored in 4x4 pixel units. In yet another example, one of the first block vector associated with the first partition and the second block vector associated with the second partition may be stored in 4x4 pixels.

[0185] In response to the first prediction type being IBC, a first block vector associated with the first partition may be determined as a first merge candidate in an IBC merge list, and in response to the second prediction type being IBC, a second block vector associated with the second partition may be determined as a second merge candidate in the IBC merge list.

[0186] The process 1600 may be adapted as appropriate. Steps in the process 1600 may be modified and / or omitted. Additional steps may be added. Any suitable order of performance may be used.

[0187] As shown in Figure 17, the process (1700) may start at (S1701) and proceed to (S1710), where a current block of a current picture of a video may be partitioned into a first partition and a second partition based on a geometric partition mode (GPM).

[0188] At (S1720), a first prediction type for a first partition of the current block may be determined, and a second prediction type for a second partition of the current block may be determined. Each of the first and second prediction types may be one of intra prediction, inter prediction, and IBC.

[0189] At (S1730), based on the determined first prediction type, a first prediction mode may be determined for the first partition of the current block.

[0190] At (S1740), a second prediction mode for the second partition of the current block may be determined based on the determined second prediction type.

[0191] In (S1750), encoded information of the current block may be generated. The encoded information may include at least one flag associated with one of intra prediction, inter prediction, and IBC, and indicates a first prediction type of the first partition and a second prediction type of the second partition.

[0192] Thereafter, the process proceeds to (S1799) and ends.

[0193] The process 1700 may be adapted as appropriate. Steps in the process 1700 may be modified and / or omitted. Additional steps may be added. Any suitable order of performance may be used.

[0194] The techniques described above can be implemented as computer software using computer readable instructions and can be physically stored on one or more computer readable media. For example, Figure 18 illustrates a computer system (1800) suitable for implementing certain embodiments of the disclosed subject matter.

[0195] Computer software may be coded using any suitable machine code or computer language and may be subject to assembly, compilation, linking, or similar mechanisms to produce code containing instructions that are executable by one or more computer central processing units (CPUs), graphics processing units (GPUs), etc., either directly, or through interpretation, microcode execution, etc.

[0196] The instructions may be executed on various types of computers or components thereof including, for example, personal computers, tablet computers, servers, smart phones, gaming devices, Internet of Things devices, and the like.

[0197] 18 for computer system (1800) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing the embodiments of the present disclosure. Neither the arrangement of components should be interpreted as having any dependency or requirement regarding any one or combination of components illustrated in the exemplary embodiment of computer system (1800).

[0198] The computer system (1800) may include certain human interface input devices that may be responsive to input by one or more human users through, for example, tactile input (e.g., keystrokes, swipes, data glove movements), audio input (e.g., voice, clapping), visual input (e.g., gestures), or olfactory input (not shown). Human interface devices may also be used to capture certain media that are not necessarily directly related to conscious human input, such as audio (e.g., speech, music, ambient sounds), images (e.g., scanned images, photographic images obtained from still image cameras), and video (e.g., two-dimensional video, three-dimensional video including stereoscopic video).

[0199] The input human interface devices may include one or more (only one of each is shown) of a keyboard (1801), a mouse (1802), a trackpad (1803), a touch screen (1810), a data glove (not shown), a joystick (1805), a microphone (1806), a scanner (1807), and a camera (1808).

[0200] The computer system (1800) may also include some type of human interface output device. Such human interface output devices may stimulate one or more of the human user's senses, for example, through tactile output, sound, light, and smell / taste. Such human interface output devices may include haptic output devices (e.g., haptic feedback via a touch screen (1810), data gloves (not shown), or joystick (1805); although there may be haptic feedback devices that do not act as input devices), audio output devices (e.g., speakers (1809), headphones (not shown)), visual output devices (e.g., screens (1810) including CRT screens, LCD screens, plasma screens, OLED screens; each may or may not have touch screen input capability, each may or may not have haptic feedback capability, some of which may output two-dimensional visual output or higher than three-dimensional output through such means as stereoscopic output; virtual reality glasses (not shown), holographic displays, and smoke tanks (not shown)), and printers (not shown).

[0201] The computer system (1800) may also include human accessible storage and associated media, such as optical media including CD / DVD ROM / RW (1820) along with CD / DVD or similar media (1821), thumb drives (1822), removable hard drives or solid state drives (1823), legacy magnetic media such as tapes and floppy disks (not shown), specialized ROM / ASIC / PLD based devices (not shown) such as security dongles, etc.

[0202] Those skilled in the art should also understand that the term "computer-readable medium" as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

[0203] The computer system (1800) may also include an interface (1854) to one or more communication networks (1855). The networks may be, for example, wireless, wired, optical. The networks may further be local, wide area, metropolitan, in-vehicle and industrial, real-time, delay tolerant, etc. Examples of networks include Ethernet, WLAN, cellular networks including GSM, 3G, 4G, 5G, LTE, etc., TV wired or wireless wide area digital networks including cable television, satellite television, terrestrial broadcast television, in-vehicle and industrial including CANBus, etc. Some networks typically require an external network interface adapter that is attached to some kind of general-purpose data port or peripheral bus (1849) (e.g., a USB port of the computer system (1800)). Others are typically integrated into the core of the computer system (1800) by attachment to a system bus as described below (e.g., an Ethernet interface to a PC computer system or a cellular network interface to a smartphone computer system). Using any of these networks, the computer system (1800) can communicate with other entities. Such communications may be unidirectional, receive only (e.g., broadcast television), unidirectional transmit only (e.g., CANbus to certain CANbus devices), or bidirectional, for example, to other computer systems using local or wide area digital networks. With each of these networks and network interfaces as described above, certain protocols and protocol stacks may be used.

[0204] The aforementioned human interface devices, human accessible storage devices, and network interfaces may be attached to a core (1840) of the computer system (1800).

[0205] The core (1840) may include one or more central processing units (CPUs) (1841), graphics processing units (GPUs) (1842), specialized programmable processing units in the form of field programmable gate arrays (FPGAs) (1843), hardware accelerators for certain tasks (1844), graphics adapters (1850), and the like. These devices may be connected through a system bus (1848), along with read only memory (ROM) (1845), random access memory (1846), and internal mass storage devices (1847), such as internal non-user accessible hard drives, solid state drives (SSDs), and the like. In some computer systems, the system bus (1848) may be accessible in the form of one or more physical plugs to allow expansion with additional CPUs, GPUs, and the like. Peripheral devices may be attached directly to the core's system bus (1848) or through a peripheral bus (1849). In one example, a screen 1810 may be connected to a graphics adapter 1850. Architectures for peripheral buses include PCI, USB, and the like.

[0206] The CPU (1841), GPU (1842), FPGA (1843), and accelerator (1844) can execute certain instructions that may combine to constitute the computer code described above. The computer code may be stored in a ROM (1845) or a RAM (1846). Temporary data may also be stored in the RAM (1846), while persistent data may be stored, for example, in an internal mass storage device (1847). Rapid storage and retrieval from any of the memory devices may be enabled through the use of a cache memory that may be closely associated with one or more of the CPU (1841), GPU (1842), mass storage device (1847), ROM (1845), RAM (1846), and the like.

[0207] The computer-readable medium can have computer code thereon for performing various computer-implemented operations. The medium and computer code may be those specially designed and constructed for the purposes of the present disclosure, or they may be of the kind well known and available to those having skill in the computer software arts.

[0208] By way of example and not limitation, a computer system having the architecture (1800), and in particular the core (1840), can provide functionality as a result of a processor (including a CPU, GPU, FPGA, accelerator, etc.) executing software embodied in one or more tangible computer readable media. Such computer readable media can be user accessible mass storage as introduced above as well as media associated with some type of storage of the core (1840) of a non-transitory nature such as mass storage (1847) internal to the core or ROM (1845). Software implementing various embodiments of the present disclosure can be stored in such devices and executed by the core (1840). The computer readable media can include one or more memory devices or chips depending on the particular needs. The software can cause the core (1840) and in particular the processors therein (including a CPU, GPU, FPGA, etc.) to execute certain processes or certain specific portions thereof described herein, including defining data structures stored in RAM (1846) and modifying such data structures according to processes defined by the software. Additionally or alternatively, the computer system may provide functionality as a result of logic hardwired or otherwise embodied in circuitry (e.g., accelerator (1844)), which may operate in place of or together with software to perform particular processes or portions of particular processes described herein. Reference to software includes logic, and vice versa, as appropriate. Reference to a computer-readable medium may include circuitry (e.g., an integrated circuit (IC)) that stores software for execution, circuitry that embodies logic for execution, or both, as appropriate. The present disclosure encompasses any suitable combination of hardware and software.

[0209] Appendix A: Acronyms JEM: joint exploration model VVC: versatile video coding BMS: benchmark set MV: Motion Vector HEVC: High Efficiency Video Coding SEI: Supplementary Enhancement Information VUI: Video Usability Information GOP: Group of Pictures TU: Transform Unit PU: Prediction Unit CTU: Coding Tree Unit CTB: Coding Tree Block PB: Prediction Block HRD: Hypothetical Reference Decoder SNR: Signal Noise Ratio CPU: Central Processing Unit GPU: Graphics Processing Unit 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

[0210] While this disclosure has described several exemplary embodiments, there are alterations, substitutions, and various substitute equivalents, which fall within the scope of this disclosure. Thus, it will be appreciated that those skilled in the art will be able to devise many systems and methods that, although not explicitly shown or described herein, embody the principles of the present disclosure and are thus within the spirit and scope of the present disclosure.

Claims

1. 1. A method of video decoding performed in a video decoder, the method comprising: receiving coded information for a current block in a current picture of the video from a coded video bitstream; partitioning the current block into a first partition and a second partition based on a geometric partition mode (GPM); responsive to determining that the current block is GPM coded, determining a first prediction type for a first partition of the current block and a second prediction type for a second partition of the current block based on at least one flag associated with a prediction type including one of intra prediction, inter prediction, and intra block copy (IBC), wherein each of the first and second prediction types is one of intra prediction, inter prediction, and IBC; determining a first prediction mode for a first partition of the current block based on the determined first prediction type; determining a second prediction mode for a second partition of the current block based on the determined second prediction type; reconstructing a first partition of the current block based on a first prediction mode and a second partition of the current block based on a second prediction mode; and in response to the first prediction type being IBC and the second prediction type being IBC, samples along a boundary between the first partition and the second partition are not blended. method.

2. Determining the first prediction type includes: determining, based on a first flag of the at least one flag being true, that a first prediction type for a first partition of a current block is intra prediction; determining, based on a first flag of the at least one flag being false and a second flag of the at least one flag being true, that a first prediction type for a first partition of a current block is IBC; determining, based on the first flag being false and the second flag being false, that a first prediction type for the first partition of the current block is inter prediction; The method of claim 1.

3. Determining the first prediction mode includes: in response to a first flag of the at least one flag being true, determine an intra-prediction mode for a first partition of a current block based on a first syntax element included in the encoded information; in response to a second flag of the at least one flag being true, determine an IBC block vector for a first partition of a current block based on a second syntax element included in the encoded information; determining an inter prediction mode for a first partition of a current block based on a third syntax element included in the encoded information in response to a first flag of the at least one flag and a second flag of the at least one flag being false. The method of claim 2.

4. determining the first prediction mode includes determining that the first prediction mode for a first partition is associated with one of a first intra prediction mode and a first block vector of an IBC; determining the second prediction mode includes determining that the second prediction mode for the second partition is associated with one of a second intra prediction mode and a second block vector of an IBC. The method of claim 1.

5. determining the first prediction mode includes determining that the first prediction mode for a first partition is associated with one of a first inter prediction mode and a first block vector of an IBC; determining the second prediction mode includes determining that the second prediction mode for the second partition is associated with one of a second inter prediction mode and a second block vector of an IBC. The method of claim 1.

6. The encoded information further comprises: an intra prediction bit indicating whether one of the first prediction type and the second prediction type is intra prediction; an inter prediction bit indicating whether one of the first prediction type and the second prediction type is inter prediction; and including an IBC prediction bit indicating whether one of the first prediction type and the second prediction type is an IBC prediction; The method of claim 1.

7. 3. The method of claim 2, wherein in response to the first prediction type being IBC, the first partition of the current block is predicted by a merge mode of IBC.

8. responsive to the motion storage type being 0 or 1, storing one of the inter prediction motion vector and the IBC block vector in units of 4×4 pixels; In response to a movement memory type of 2: The first motion vector associated with the first partition and the second motion vector associated with the second partition are expressed in units of 4×4 pixels as follows: The motion vectors associated with the first partition and the block vectors associated with the second partition are expressed in units of 4×4 pixels as follows: The first block vector associated with the first partition and one of the second block vectors associated with the second partition are divided into 4×4 pixels. [0023] Further comprising storing. The method of claim 1.

9. responsive to the first prediction type being IBC, determining that a first block vector associated with the first partition is a first merge candidate in the IBC merge list; and determining, in response to the second prediction type being IBC, that a second block vector associated with the second partition is a second merge candidate in the IBC merge list. The method of claim 1.

10. Apparatus configured to carry out the method according to any one of claims 1 to 9.

11. A computer program product for causing a computer to carry out the method according to any one of claims 1 to 9.

12. 1. A method of video encoding performed in a video encoder, the method comprising: generating encoded information comprising a predictive encoding of input picture data utilizing reference picture data; the reference picture data is generated by a local decoder operation with a picture earlier than the input picture data as a current picture; The local decoder operations include: receiving encoded information of a current block in a current picture of the video; partitioning the current block into a first partition and a second partition based on a geometric partition mode (GPM); responsive to determining that the current block is GPM coded, determining a first prediction type for a first partition of the current block and a second prediction type for a second partition of the current block based on at least one flag associated with a prediction type including one of intra prediction, inter prediction, and intra block copy (IBC), wherein each of the first and second prediction types is one of intra prediction, inter prediction, and IBC; determining a first prediction mode for a first partition of the current block based on the determined first prediction type; determining a second prediction mode for a second partition of the current block based on the determined second prediction type; reconstructing a first partition of the current block based on a first prediction mode and a second partition of the current block based on a second prediction mode; and in response to the first prediction type being IBC and the second prediction type being IBC, samples along a boundary between the first partition and the second partition are not blended. method.

13. Apparatus configured to perform the method of claim 12.

14. A computer program product for causing a computer to carry out the method according to claim 12.

Images