Overlapped block motion compensation (OBMC) for intra mode

Abstract

A method for processing a video includes: receiving a bitstream; and decoding one or more images using the encoded information of the bitstream. The decoding includes performing overlapped block motion compensation (OBMC) on a block predicted in an intra mode.

Description

[0001] Cross-references to related applications This disclosure claims the benefit of U.S. Provisional Application 63 / 511,661, filed July 2, 2023, and U.S. Patent Application 18 / 748,757, filed June 20, 2024, entitled “Overlapped Block Motion Compensation (OBMC) for intra mode.” Both applications are incorporated herein by reference in their entirety. Technical Field

[0002] This disclosure relates generally to video processing, and more specifically to methods and apparatus for performing Overlapping Block Motion Compensation (OBMC) for intra-frame modes. Background Technology

[0003] Video consists of a set of still images (or "frames") that capture visual information. To reduce storage memory and transmission bandwidth, video can be compressed before storage or transmission and decompressed before display. The compression process is usually called encoding, while the decompression process is usually called decoding. There are many video coding formats that use standardized video coding techniques, the most common being based on prediction, transform, quantization, entropy coding, and loop filtering. Standardization organizations have developed video coding standards that specify particular video coding formats, such as the High Efficiency Video Coding (HEVC / H.265) standard, the Universal Video Coding (VVC / H.266) standard, and the AVS standard. As video standards adopt increasingly advanced video coding techniques, the coding efficiency of new video coding standards also increases. Summary of the Invention

[0004] In a first aspect of this disclosure, a method for processing video is provided, the method comprising: receiving a bitstream; and decoding one or more images using encoded information of the bitstream. Decoding the one or more images using the encoded information of the bitstream comprises: performing Overlapping Block Motion Compensation (OBMC) on blocks predicted using intra-frame modes.

[0005] In a second aspect of this disclosure, a method for encoding a video sequence into a bitstream is provided, the method comprising: receiving a video sequence; encoding one or more images of the video sequence; and generating a bitstream. The encoding of the one or more images of the video sequence comprises: performing Overlapping Block Motion Compensation (OBMC) on blocks predicted using intra-frame modes.

[0006] In a third aspect of this disclosure, an apparatus for processing video is provided, the apparatus comprising: a receiving module configured to receive a bitstream; and a decoding module configured to decode one or more images using encoded information of the bitstream, wherein the decoding module is configured to perform overlapping block motion compensation (OBMC) on blocks predicted using intra-frame modes.

[0007] In a fourth aspect of this disclosure, an apparatus for encoding a video sequence into a bitstream is provided, the apparatus comprising: a receiving module configured to receive a video sequence; an encoding module configured to encode one or more images in the video sequence; and a generating module configured to generate a bitstream, wherein the encoding module is configured to perform overlapping block motion compensation (OBMC) on blocks predicted using intra-frame modes.

[0008] In a fifth aspect of this disclosure, an electronic device is provided, the electronic device comprising: one or more processors; and a computer-readable storage medium communicatively coupled to the one or more processors, wherein the computer-readable storage medium stores computer-readable instructions executable by the one or more processors, the computer-readable instructions, when executed by the one or more processors, performing the method according to the first aspect or the second aspect.

[0009] In a sixth aspect of this disclosure, a non-transitory computer-readable storage medium is provided that stores a video bitstream thereon, wherein the bitstream, when decoded by a decoder, causes the decoder to perform the method according to the first aspect.

[0010] In a seventh aspect of this disclosure, a non-transitory computer-readable storage medium is provided that stores a video bitstream thereon, wherein the bitstream, when encoded by an encoder, causes the encoder to perform the method according to the second aspect.

[0011] In an eighth aspect of this disclosure, a computer program product is provided, the computer program product comprising: computer program instructions that enable a computer to perform the method according to the first aspect or the second aspect.

[0012] In a ninth aspect of this disclosure, a computer program is provided that enables a computer to perform the method described according to the first or second aspect. Attached Figure Description

[0013] Embodiments and various aspects of this disclosure are illustrated in the following detailed description and accompanying drawings. The various features shown in the figures are not drawn to scale.

[0014] Figure 1This is a schematic diagram illustrating the structure of an example video sequence according to some embodiments of the present disclosure.

[0015] Figure 2A This is a schematic diagram illustrating an exemplary encoding process of a hybrid video encoding system consistent with embodiments of this disclosure.

[0016] Figure 2B This is a schematic diagram illustrating another exemplary encoding process of a hybrid video encoding system consistent with embodiments of this disclosure.

[0017] Figure 3A This is a schematic diagram illustrating an exemplary decoding process of a hybrid video coding system consistent with embodiments of this disclosure.

[0018] Figure 3B This is a schematic diagram illustrating another exemplary decoding process of a hybrid video coding system consistent with embodiments of the present disclosure.

[0019] Figure 4 This is a block diagram of an exemplary apparatus for encoding or decoding video according to some embodiments of the present disclosure.

[0020] Figure 5 Exemplary Overlapping Block Motion Compensation (OBMC) performed for block boundaries according to some embodiments of this disclosure is shown.

[0021] Figure 6 An exemplary template of the OBMC according to some embodiments of this disclosure is shown.

[0022] Figures 7A to 7F Exemplary current coding tree unit (CTU) processing order according to some embodiments of this disclosure is shown, along with available reference samples in the current CTU and the left-hand CTU.

[0023] Figure 8A and Figure 8B Exemplary block vector (BV) adjustments for horizontal and vertical flipping are shown according to some embodiments of this disclosure.

[0024] Figure 9 Exemplary subpixel positions are shown in an intra-frame TMP employing a subpixel mode, according to some embodiments of the present disclosure.

[0025] Figure 10 Exemplary intra-frame prediction modes according to some embodiments of this disclosure are shown.

[0026] Figure 11 A flowchart illustrating an exemplary method for performing OBMC on a block according to some embodiments of the present disclosure is shown.

[0027] Figure 12This illustrates, according to some embodiments of the present disclosure, the sub-blocks at the upper boundary of the block during OBMC execution. , , and Examples.

[0028] Figure 13 An exemplary block illustrating the merge block is shown according to some embodiments of this disclosure.

[0029] Figure 14 An exemplary block is shown, illustrating a method for filling a block vector according to some embodiments of the present disclosure. Detailed Implementation

[0030] Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. The following description refers to the accompanying drawings, in which, unless otherwise stated, the same numerals in different figures represent the same or similar elements. The embodiments set forth in the following description of the exemplary embodiments do not represent all embodiments consistent with this disclosure. Rather, they are merely examples of apparatuses and methods consistent with aspects of this disclosure as described in the appended claims. Specific aspects of this disclosure are described in more detail below. In the event of any conflict with terms and / or definitions incorporated by reference, the terms and definitions provided herein shall prevail.

[0031] The Joint Video Experts Group (JVET) of the ITU-T Video Coding Experts Group (ITU-T VCEG) and the ISO / IEC Moving Picture Experts Group (ISO / IEC MPEG) is currently developing a universal video coding standard (VVC / H.266). The VVC standard aims to double the compression efficiency of its predecessor, the High Efficiency Video Coding (HEVC / H.265) standard. In other words, VVC aims to achieve the same subjective quality as HEVC / H.265 using half the bandwidth.

[0032] To achieve the same subjective quality as HEVC / H.265 using half the bandwidth, JVET has been developing techniques beyond HEVC using the Joint Exploration Model (JEM) reference software. With coding techniques incorporated into JEM, JEM achieves significantly higher coding performance than HEVC. The VVC standard has recently been finalized and continues to incorporate more coding technologies to provide better compression performance. VVC adopts the hybrid video coding system used in modern video compression standards such as HEVC, H.264 / AVC, MPEG2, and H.263.

[0033] Video is a collection of still images (or "frames") arranged in chronological order to store visual information. Video capture devices (e.g., cameras) can be used to capture and store those images in chronological order, and video playback devices (e.g., televisions, computers, smartphones, tablets, video players, or any end-user terminal with a display) can be used to display these images in chronological order. Furthermore, in some applications, video capture devices can transmit the captured video in real time to the video playback device (e.g., a computer with a display), for example, for video observation, conferencing, or live streaming.

[0034] To reduce the storage space and transmission bandwidth required for these applications, the video can be compressed before storage or transmission and decompressed before display. This compression and decompression can be implemented by software executed by a processor (e.g., a processor in a general-purpose computer) or by dedicated hardware. The module used for compression is typically called an "encoder," while the module used for decompression is typically called a "decoder." The encoder and decoder can be collectively referred to as a "codec." The encoder and decoder can be implemented as any of a variety of suitable hardware, software, or combinations thereof. For example, the hardware implementation of the encoder and decoder can include circuit systems such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, or any combination thereof. The software implementation of the encoder and decoder can include program code, computer-executable instructions, firmware, or any suitable computer-implemented algorithm or process embedded in a computer-readable medium. Video compression and decompression can be implemented using various algorithms or standards, such as MPEG-1, MPEG-2, MPEG-4, H.26x series, etc. In some applications, the codec can decompress the video according to a first encoding standard and recompress the decompressed video using a second encoding standard. In this case, the codec can be called a "transcoder".

[0035] Video coding processes identify and retain useful information for image reconstruction while ignoring information that is not crucial for the reconstruction. If the ignored, unimportant information cannot be fully reconstructed, then such a coding process can be called "lossy." Otherwise, it can be called "lossless." Most coding processes are lossy, a trade-off between reducing required storage space and transmission bandwidth.

[0036] Useful information about an image being encoded (referred to as the "current image") includes changes relative to a reference image (e.g., a previously encoded and reconstructed image). These changes can include variations in pixel position, brightness, or color, with positional changes being of primary interest. The positional changes of a set of pixels representing an object can reflect the movement of that object between the reference image and the current image.

[0037] An image encoded without referencing another image (i.e., whose reference image is itself) is called an "I-image" or "I-piece". If some or all of the blocks in an image (e.g., these blocks typically refer to various parts of a video image) are predicted using intra-frame prediction or inter-frame prediction with a reference image (e.g., one-way prediction), then the image is called a "P-image" or "P-piece". If at least one block in an image is predicted using two reference images (e.g., two-way prediction), then the image is called a "B-image" or "B-piece".

[0038] Figure 1 The structure of an example video sequence 100 according to some embodiments of the present disclosure is shown. Video sequence 100 may be live video or video that has already been captured and archived. Video 100 may be real-life video, computer-generated video (e.g., computer game video), or a combination thereof (e.g., real-life video with augmented reality effects). Video sequence 100 may originate from a video capture device (e.g., a camera), a video archive containing previously captured video (e.g., a video file stored in a storage device), or a video feed interface (e.g., a video broadcast transceiver) that receives video from a video content provider.

[0039] like Figure 1 As shown, video sequence 100 may include a series of images arranged temporally along a timeline, including images 102, 104, 106, and 108. Images 102-106 are consecutive, and there are more images between images 106 and 108. Figure 1 In this diagram, image 102 is an I-image, and its reference image is image 102 itself. Image 104 is a P-image, and its reference image is image 102, as indicated by the arrow. Image 106 is a B-image, and its reference images are images 104 and 108, as indicated by the arrow. In some embodiments, the reference image of an image (e.g., image 104) may not immediately precede or follow that image. For example, the reference image of image 104 may be an image preceding image 102. It should be noted that the reference images of images 102-106 are merely examples, and this disclosure does not limit the embodiments of the reference images to specific cases. Figure 1 The example shown.

[0040] Typically, due to the computational complexity of this task, video codecs do not encode or decode the entire image at once. Instead, they segment the image into multiple basic segments and encode or decode those segments sequentially. Such basic segments are referred to herein as basic processing units (“BPUs”). For example, Figure 1 Structure 110 illustrates an example structure of an image (e.g., any one of images 102-108) from video sequence 100. In structure 110, the image is divided into 4×4 basic processing units, the boundaries of which are shown as dashed lines. In some embodiments, the basic processing unit may be referred to as a “macroblock” in some video coding standards (e.g., MPEG family, H.261, H.263, or H.264 / AVC), or as a “coding tree unit” (“CTU”) in some other video coding standards (e.g., H.265 / HEVC or H.266 / VVC). The basic processing unit in the image may have a variable size, such as 128×128, 64×64, 32×32, 16×16, 4×8, 16×32, or any arbitrary shape and size of pixels. The size and shape of the basic processing units for the image can be selected based on a balance between coding efficiency and the level of detail to be maintained in the basic processing units.

[0041] The basic processing unit can be a logical unit that may include a set of different types of video data stored in computer memory (e.g., in a video frame buffer). For example, a basic processing unit for a color image may include a luminance component (Y) representing non-color information, one or more chrominance components (e.g., Cb and Cr) representing color information, and associated syntax elements, wherein the size of the luminance and chrominance components may be the same as that of the basic processing unit. In some video coding standards (e.g., H.265 / HEVC or H.266 / VVC), the luminance and chrominance components may be referred to as “code tree blocks” (“CTBs”). Any operation performed on the basic processing unit may be repeatedly performed on each of the luminance and chrominance components of the basic processing unit.

[0042] Video encoding involves multiple operational stages, examples of which are as follows: Figure 2A-2B and Figures 3A-3BAs shown. For each stage, the size of the basic processing unit may still be too large to process, and therefore can be further subdivided into segments referred to herein as "basic processing subunits". In some embodiments, the basic processing subunit may be referred to as a "block" in some video coding standards (e.g., MPEG series, H.261, H.263, or H.264 / AVC), or as a "coding unit" ("CU") in some other video coding standards (e.g., H.265 / HEVC or H.266 / VVC). The basic processing subunit may have the same or smaller size as the basic processing unit. Similar to the basic processing unit, the basic processing subunit is also a logical unit that may include a set of different types of video data (e.g., Y, Cb, Cr, and associated syntax elements) stored in computer memory (e.g., stored in a video frame buffer). Any operation performed on the basic processing subunit may be repeatedly performed on each of the luminance and chrominance components of the basic processing subunit. It should be noted that this division may be performed at deeper levels as needed for processing. It should also be noted that different schemes can be used to divide the basic processing units at different stages.

[0043] For example, in the pattern decision-making stage (examples of which are in...) Figure 2B As shown in the diagram, the encoder can decide which prediction mode (e.g., intra-image prediction or inter-image prediction) to use for the basic processing unit, which may be too large to make such a decision. The encoder can divide the basic processing unit into multiple basic processing subunits (e.g., CUs in H.265 / HEVC or H.266 / VVC) and determine the prediction type for each individual basic processing subunit.

[0044] For another example, in the prediction phase (the example is in...) Figure 2A-2B As shown in the diagram, the encoder can perform prediction operations at the level of a basic processing subunit (e.g., a CU). However, in some cases, the basic processing subunit may still be too large to process. The encoder can further divide the basic processing subunit into smaller segments (e.g., referred to as "prediction blocks" or "PBs" in H.265 / HEVC or H.266 / VVC), at which the prediction operations can be performed.

[0045] For another example, in the transformation phase (the example of which is in...) Figure 2A-2BAs shown, the encoder can perform transform operations on residual basic processing subunits (e.g., CUs). However, in some cases, the basic processing subunits may still be too large to process. The encoder can further divide the basic processing subunits into smaller segments (e.g., referred to as "transform blocks" or "TBs" in H.265 / HEVC or H.266 / VVC), at which point the transform operation can be performed. It should be noted that the partitioning scheme of the same basic processing subunit can differ between the prediction and transform phases. For example, in H.265 / HEVC or H.266 / VVC, the prediction blocks and transform blocks of the same CU can have different sizes and numbers.

[0046] exist Figure 1 In structure 110, the basic processing unit 112 is further divided into 3×3 basic processing sub-units, the boundaries of which are shown as dashed lines. Different basic processing units of the same image can be divided into basic processing sub-units using different schemes.

[0047] In some implementations, to provide parallel processing and fault tolerance for video encoding and decoding, an image can be divided into multiple regions for processing, such that for a particular region of the image, the encoding or decoding process can be independent of information from any other region of the image. In other words, each region of the image can be processed independently. By doing so, the codec can process different regions of the image in parallel, thereby improving encoding efficiency. Furthermore, when data in one region is corrupted during processing or lost during network transmission, the codec can correctly encode or decode other regions of the same image without relying on the corrupted or lost data, thus providing fault tolerance. In some video coding standards, images can be divided into different types of regions. For example, H.265 / HEVC and H.266 / VVC provide two types of regions: "slices" and "tiles." It should also be noted that different images in the video sequence 100 can have different segmentation schemes for dividing an image into multiple regions.

[0048] For example, in Figure 1 In this structure, structure 110 is divided into three regions 114, 116, and 118, the boundaries of which are shown as solid lines within structure 110. Region 114 comprises four basic processing units. Each of regions 116 and 118 comprises six basic processing units. It should be noted that... Figure 1 The basic processing unit, basic processing subunit, and area of ​​structure 110 described herein are merely examples, and this disclosure does not limit its embodiments.

[0049] Figure 2AA schematic diagram of an example encoding process 200A consistent with embodiments of this disclosure is shown. For example, the encoding process 200A may be performed by an encoder. Figure 2A As shown, the encoder can encode the video sequence 202 into a video bitstream 228 according to process 200A. Similar to... Figure 1 Video sequence 100 and video sequence 202 may include a set of images (referred to as "original images") arranged in chronological order. Similar to... Figure 1 In structure 110, the encoder can divide each raw image of video sequence 202 into multiple basic processing units, multiple basic processing sub-units, or multiple regions for processing. In some embodiments, the encoder can perform process 200A at the level of basic processing units for each raw image of video sequence 202. For example, the encoder can perform process 200A iteratively, wherein the encoder can encode basic processing units in one iteration of process 200A. In some embodiments, the encoder can perform process 200A in parallel for multiple regions (e.g., regions 114-118) of each raw image of video sequence 202.

[0050] exist Figure 2A In this process, the encoder feeds the basic processing unit (referred to as the "raw BPU") of the original image of video sequence 202 to prediction stage 204 to generate prediction data 206 and prediction BPU 208. The encoder subtracts prediction BPU 208 from the raw BPU to generate residual BPU 210. The encoder feeds residual BPU 210 to transform stage 212 and quantization stage 214 to generate quantization transform coefficients 216. The encoder feeds prediction data 206 and quantization transform coefficients 216 to binary encoding stage 226 to generate video bitstream 228. Components 202, 204, 206, 208, 210, 212, 214, 216, 226, and 228 may be referred to as the "forward path". During process 200A, after quantization stage 214, the encoder feeds quantization transform coefficients 216 to inverse quantization stage 218 and inverse transform stage 220 to generate reconstructed residual BPU 222. The encoder can add the reconstructed residual BPU 222 to the prediction BPU 208 to generate a prediction reference 224, which is used in the next iteration of process 200A during prediction phase 204. Components 218, 220, 222, and 224 of process 200A can be referred to as a "reconstruction path." The reconstruction path can be used to ensure that both the encoder and the decoder use the same reference data for prediction.

[0051] The encoder can iteratively execute process 200A to encode each raw BPU of the raw image (in the forward path) and generate prediction reference 224 for encoding the next raw BPU of the raw image (in the reconstruction path). After encoding all raw BPUs of the raw image, the encoder can continue to encode the next image in the video sequence 202.

[0052] Referring to process 200A, the encoder can receive a video sequence 202 generated by a video acquisition device (e.g., a camera). As used herein, the term "receive" can refer to any action of receiving, inputting, acquiring, retrieving, obtaining, reading, accessing, or otherwise inputting data.

[0053] In prediction phase 204, during the current iteration, the encoder may receive the original BPU and prediction reference 224, and perform prediction operations to generate prediction data 206 and prediction BPU 208. Prediction reference 224 can be generated from the reconstruction path of a previous iteration of process 200A. The purpose of prediction phase 204 is to reduce information redundancy by extracting prediction data 206 from prediction data 206 and prediction reference 224 that can be used to reconstruct the original BPU into prediction BPU 208.

[0054] Ideally, the predicted BPU 208 should be identical to the original BPU. However, due to non-ideal prediction and reconstruction operations, the predicted BPU 208 is typically slightly different from the original BPU. To record this difference, after generating the predicted BPU 208, the encoder can subtract it from the original BPU to generate the residual BPU 210. For example, the encoder can subtract the pixel value (e.g., grayscale or RGB value) of the predicted BPU 208 from the value of the corresponding pixel in the original BPU. Each pixel of the residual BPU 210 can have a residual value generated by this subtraction between the corresponding pixel in the original BPU and the predicted BPU 208. Compared to the original BPU, the predicted data 206 and the residual BPU 210 can have fewer bits, but they can be used to reconstruct the original BPU without significant quality degradation. Therefore, the original BPU is compressed.

[0055] To further compress the residual BPU 210, in the transform phase 212, the encoder can reduce the spatial redundancy of the residual BPU 210 by decomposing it into a two-dimensional set of "basic patterns," each basic pattern being associated with "transform coefficients." The basic patterns can have the same size (e.g., the size of the residual BPU 210). Each basic pattern can represent a frequency-varying component of the residual BPU 210 (e.g., the frequency of brightness variation). No basic pattern can be reproduced by any combination of any other basic patterns (e.g., a linear combination). In other words, the decomposition decomposes the variation of the residual BPU 210 into the frequency domain. This decomposition is analogous to the discrete Fourier transform of a function, where the basic patterns are analogous to the basis functions of the discrete Fourier transform (e.g., trigonometric functions), and the transform coefficients are analogous to the coefficients associated with the basis functions.

[0056] Different transform algorithms can use different base modes. Various transform algorithms, such as discrete cosine transform and discrete sine transform, can be used in transform stage 212. The transform in transform stage 212 is reversible. That is, the encoder can recover the residual BPU 210 through the inverse operation of the transform (called the "inverse transform"). For example, to recover a pixel of the residual BPU 210, the inverse transform can be to multiply the value of the corresponding pixel in the base mode by the corresponding correlation coefficient and sum the products to produce a weighted sum. For video coding standards, both the encoder and decoder can use the same transform algorithm (and therefore the same base mode). Therefore, the encoder can record only the transform coefficients, and the decoder can reconstruct the residual BPU 210 based on the transform coefficients without receiving the base mode from the encoder. Compared to the residual BPU 210, the transform coefficients can have fewer bits, but they can be used to reconstruct the residual BPU 210 without significant quality degradation. Therefore, the residual BPU 210 is further compressed.

[0057] The encoder can further compress the transform coefficients in quantization phase 214. During the transform process, different fundamental modes can represent different frequencies of change (e.g., brightness change frequencies). Because the human eye is generally better at identifying low-frequency changes, the encoder can ignore information about high-frequency changes without causing significant quality degradation in decoding. For example, in quantization phase 214, the encoder can generate quantized transform coefficients 216 by dividing each transform coefficient by an integer value (called a "quantization scale factor") and performing rounding on the quotient. After this operation, some transform coefficients of the high-frequency fundamental modes can be converted to zero, while the transform coefficients of the low-frequency fundamental modes can be converted to smaller integers. The encoder can ignore the zero-valued quantized transform coefficients 216, thereby further compressing the transform coefficients. The quantization process is also reversible, wherein the quantized transform coefficients 216 can be reconstructed into the transform coefficients in the inverse operation of quantization (called "inverse quantization").

[0058] Because the encoder ignores the remainder of such division in the rounding operation, the quantization stage 214 may be lossy. Typically, the quantization stage 214 may constitute the primary source of information loss in process 200A. The greater the information loss, the fewer bits the quantization transform coefficients 216 may require. To obtain different levels of information loss, the encoder can use different values ​​of the quantization parameters or any other parameters of the quantization process.

[0059] In the binary encoding stage 226, the encoder may use binary encoding techniques to encode the prediction data 206 and the quantization transform coefficients 216. For example, the binary encoding techniques may include entropy coding, variable-length coding, arithmetic coding, Huffman coding, context-adaptive binary arithmetic coding, or any other lossless or lossy compression algorithm. In some embodiments, in addition to the prediction data 206 and the quantization transform coefficients 216, the encoder may also encode other information in the binary encoding stage 226, such as the prediction mode used in the prediction stage 204, the parameters of the prediction operation, the transform type of the transform stage 212, the parameters of the quantization process (e.g., quantization parameters), encoder control parameters (e.g., bitrate control parameters), etc. The encoder may use the output data of the binary encoding stage 226 to generate a video bitstream 228. In some embodiments, the video bitstream 228 may be further packaged for network transmission.

[0060] Referring to the reconstruction path of process 200A, in the inverse quantization stage 218, the encoder can perform inverse quantization on the quantized transform coefficients 216 to generate reconstructed transform coefficients. In the inverse transform stage 220, the encoder can generate a reconstruction residual BPU 222 based on the reconstructed transform coefficients. The encoder can add the reconstruction residual BPU 222 to the prediction BPU 208 to generate a prediction reference 224 to be used in the next iteration of process 200A.

[0061] It should be noted that other variations of process 200A can be used to encode video sequence 202. In some embodiments, the stages of process 200A can be performed by the encoder in different orders. In some embodiments, one or more stages of process 200A can be combined into a single stage. In some embodiments, a single stage of process 200A can be divided into multiple stages. For example, transform stage 212 and quantization stage 214 can be combined into a single stage. In some embodiments, process 200A may include additional stages. In some embodiments, process 200A may be omitted. Figure 2A One or more stages in the process.

[0062] Figure 2B A schematic diagram of another example encoding process 200B consistent with embodiments of the present disclosure is shown. Process 200B can be modified from process 200A. For example, process 200B can be used by an encoder conforming to a hybrid video coding standard (e.g., H.26x series). Compared to process 200A, the forward path of process 200B additionally includes a mode decision stage 230, and divides the prediction stage 204 into a spatial prediction stage 2042 and a temporal prediction stage 2044. The reconstruction path of process 200B additionally includes a loop filtering stage 232 and a buffer 234.

[0063] Generally, prediction techniques can be categorized into two types: spatial prediction and temporal prediction. Spatial prediction (e.g., intra-image prediction or "intra-frame prediction") uses pixels from one or more encoded neighboring BPUs within the same image to predict the current BPU. That is, prediction reference 224 in spatial prediction can include the neighboring BPUs. Spatial prediction can reduce the inherent spatial redundancy of the image. Temporal prediction (e.g., inter-image prediction or "inter-frame prediction") uses regions from one or more encoded images to predict the current BPU. That is, prediction reference 224 in temporal prediction can include the encoded image. Temporal prediction can reduce the inherent temporal redundancy of the image.

[0064] In reference process 200B, during the forward path, the encoder performs prediction operations in spatial prediction phase 2042 and temporal prediction phase 2044. For example, in spatial prediction phase 2042, the encoder may perform intra-frame prediction. For a given original BPU of an image being encoded, prediction reference 224 may include one or more adjacent BPUs that have already been encoded (in the forward path) and reconstructed (in the reconstructed path) in the same image. The encoder can generate a predicted BPU 208 by extrapolating adjacent BPUs. The extrapolation technique may include, for example, linear extrapolation or interpolation, polynomial extrapolation or interpolation, etc. In some embodiments, the encoder may perform the extrapolation at the pixel level, for example by extrapolating the corresponding pixel value for each pixel of the predicted BPU 208. The adjacent BPU used for extrapolation can be located from various directions relative to the original BPU, such as in the vertical direction (e.g., above the original BPU), the horizontal direction (e.g., to the left of the original BPU), the diagonal direction (e.g., lower left, lower right, upper left, or upper right of the original BPU), or any direction defined in the video coding standard used. For intra-frame prediction, prediction data 206 may include, for example, the location (e.g., coordinates) of the adjacent BPU used, the size of the adjacent BPU used, the extrapolation parameters, the orientation of the adjacent BPU used relative to the original BPU, etc.

[0065] In another example, during the temporal prediction phase 2044, the encoder may perform the inter-frame prediction. For a given original BPU of the current image, the prediction reference 224 may include one or more images (referred to as "reference images") that have been encoded (in the forward path) and reconstructed (in the reconstructed path). In some embodiments, the reference images may be encoded and reconstructed on a BPU-by-BPU basis. For example, the encoder may add the reconstructed residual BPU 222 to the prediction BPU 208 to generate a reconstructed BPU. When all reconstructed BPUs of the same image are generated, the encoder may generate a reconstructed image as a reference image. The encoder may perform a "motion estimation" operation to search for a matching region within a range (referred to as a "search window") of the reference image. The location of the search window in the reference image may be determined based on the location of the original BPU in the current image. For example, the search window may be centered at a location in the reference image that has the same coordinates as the original BPU in the current image and may extend outward by a predetermined distance. When the encoder identifies a region similar to the original BPU in the search window (e.g., using a pixel recursive algorithm, block matching algorithm, etc.), the encoder can determine such a region as a matching region. The matching region may have different specifications than the original BPU (e.g., less than, equal to, greater than, or with a different shape). Because the reference image and the current image are temporally separated in the timeline (e.g., as...), Figure 1 As shown), the matching region can be considered to have "moved" to the original BPU location over time. The encoder can record the direction and distance of this movement as a "motion vector." When using multiple reference images (e.g., Figure 1 When using image 106 in the reference image, the encoder can search for a matching region for each reference image and determine the associated motion vector of the matching region. In some embodiments, the encoder can assign weights to the pixel values ​​of the matching region for each matching reference image.

[0066] The motion estimation can be used to identify various types of motion, such as translation, rotation, scaling, etc. For inter-frame prediction, the prediction data 206 may include, for example, the location (e.g., coordinates) of the matching region, the motion vector associated with the matching region, the number of reference images, the weights associated with the reference images, etc.

[0067] To generate the predicted BPU 208, the encoder can perform a "motion compensation" operation. This motion compensation can be used to reconstruct the predicted BPU 208 based on the predicted data 206 (e.g., motion vectors) and the predicted reference 224. For example, the encoder can move the matching region of the reference image according to the motion vectors, where the encoder can predict the original BPU of the current image. When using multiple reference images (e.g., ... Figure 1 When the encoder moves the matching region of the reference image (image 106) according to the respective motion vector and average pixel value of the matching region, the encoder can move the matching region of the reference image. In some embodiments, if the encoder has already assigned weights to the pixel values ​​of the matching regions of each matching reference image, the encoder can perform a weighted summation of the pixel values ​​of the moved matching regions.

[0068] In some embodiments, the inter-frame prediction can be unidirectional or bidirectional. Unidirectional inter-frame prediction can use one or more reference images in the same temporal direction relative to the current image. For example, Figure 1 Image 104 in the image is a unidirectional inter-frame prediction image, where the reference image (e.g., image 102) precedes image 104. Bidirectional inter-frame prediction can use one or more reference images in two temporal directions relative to the current image. For example, Figure 1 Image 106 is a bidirectional inter-frame predicted image, wherein the reference images (e.g., images 104 and 108) are relative to image 104 in two time directions.

[0069] Referring again to the forward path of process 200B, after spatial prediction stage 2042 and temporal prediction stage 2044, in mode decision stage 230, the encoder can select a prediction mode (e.g., one of intra-frame prediction or inter-frame prediction) for the current iteration of process 200B. For example, the encoder can perform rate-distortion optimization techniques, wherein the encoder selects a prediction mode based on the bit rate of a candidate prediction mode and the distortion of the reference image reconstructed under the candidate prediction mode to minimize the value of the cost function. Based on the selected prediction mode, the encoder can generate a corresponding prediction BPU 208 and prediction data 206.

[0070] In the reconstruction path of process 200B, if an intra-prediction mode has already been selected in the forward path, the encoder can directly feed the prediction reference 224 (e.g., the current BPU that has been encoded and reconstructed in the current image) to the spatial prediction stage 2042 for subsequent use (e.g., for extrapolation of the next BPU of the current image) after generating the prediction reference 224. The encoder can also feed the prediction reference 224 to the loop filtering stage 232, where it can apply loop filtering to the prediction reference 224 to reduce or eliminate distortions (e.g., block artifacts) introduced during the encoding of the prediction reference 224. The encoder can apply various loop filtering techniques in the loop filtering stage 232, such as deblocking, sample adaptive shifting, adaptive loop filtering, etc. The loop-filtered reference image can be stored in buffer 234 (or “decoded image buffer”) for subsequent use (e.g., as an inter-frame prediction reference image for future images of video sequence 202). The encoder can store one or more reference images in buffer 234 for use in the temporal prediction stage 2044. In some embodiments, the encoder may encode the parameters of the loop filter (e.g., the loop filter strength), as well as the quantization transform coefficients 216, the prediction data 206, and other information in the binary encoding stage 226.

[0071] Figure 3A A schematic diagram of an example decoding process 300A consistent with embodiments of this disclosure is shown. Process 300A may be corresponding to... Figure 2A The compression process 200A described above is a decompression process. In some embodiments, process 300A can be similar to the reconstruction path of process 200A. The decoder can decode the video bitstream 228 into video stream 304 according to process 300A. Video stream 304 can be very similar to video sequence 202. However, due to information loss during compression and decompression (e.g., Figure 2A-2B In the quantization stage 214, video stream 304 typically differs from video sequence 202. Similar to... Figure 2A-2B In processes 200A and 200B, the decoder can perform process 300A at the level of a basic processing unit (BPU) for each image encoded in the video bitstream 228. For example, the decoder can perform process 300A iteratively, wherein the decoder can decode one basic processing unit in one iteration of process 300A. In some embodiments, the decoder can perform process 300A in parallel for multiple regions (e.g., regions 114-118) of each image encoded in the video bitstream 228.

[0072] exist Figure 3AIn this process, the decoder may feed a portion of the video bitstream 228 associated with a basic processing unit (referred to as a "coded BPU") of the encoded image to the binary decoding stage 302. In the binary decoding stage 302, the decoder may decode the portion into prediction data 206 and quantization transform coefficients 216. The decoder may feed the quantization transform coefficients 216 to the inverse quantization stage 218 and the inverse transform stage 220 to generate a reconstructed residual BPU 222. The decoder may feed the prediction data 206 to the prediction stage 204 to generate a prediction BPU 208. The decoder may add the reconstructed residual BPU 222 to the prediction BPU 208 to generate a prediction reference 224. In some embodiments, the prediction reference 224 may be stored in a buffer (e.g., a decoded image buffer in computer memory). The decoder may feed the prediction reference 224 to the prediction stage 204 for performing a prediction operation in the next iteration of process 300A.

[0073] The decoder can iteratively execute process 300A to decode each encoded BPU of the encoded image and generate a prediction reference 224 for encoding the next encoded BPU of the encoded image. After decoding all encoded BPUs of the encoded image, the decoder can output the image to video stream 304 for display and continue decoding the next encoded image in video bitstream 228.

[0074] In binary decoding stage 302, the decoder may perform the inverse operation of the binary encoding technique used by the encoder (e.g., entropy coding, variable-length coding, arithmetic coding, Huffman coding, context-adaptive binary arithmetic coding, or any other lossless compression algorithm). In some embodiments, in addition to the prediction data 206 and quantization transform coefficients 216, the decoder may also decode other information in binary decoding stage 302, such as prediction mode, parameters of the prediction operation, transform type, parameters of the quantization process (e.g., quantization parameters), encoder control parameters (e.g., bitrate control parameters), etc. In some embodiments, if the video bitstream 228 is transmitted over the network in the form of data packets, the decoder may unpack the video bitstream 228 before feeding it to binary decoding stage 302.

[0075] Figure 3BA schematic diagram of another example decoding process 300B consistent with embodiments of the present disclosure is shown. Process 300B can be modified from process 300A. For example, process 300B can be used by a decoder conforming to a hybrid video coding standard (e.g., H.26x series). Compared to process 300A, process 300B further divides the prediction stage 204 into a spatial prediction stage 2042 and a temporal prediction stage 2044, and further includes a loop filtering stage 232 and a buffer 234.

[0076] In process 300B, for the encoded basic processing unit (referred to as the "current BPU") of the encoded image being decoded (referred to as the "current image"), the prediction data 206 decoded by the decoder from binary decoding stage 302 can include various types of data depending on the prediction mode used by the encoder to encode the current BPU. For example, if the encoder uses intra-frame prediction to encode the current BPU, then the prediction data 206 can include a prediction mode indicator (e.g., a flag value) indicating intra-frame prediction, parameters of the intra-frame prediction operation, etc. The parameters of the intra-frame prediction operation can include, for example, the positions (e.g., coordinates) of one or more neighboring BPUs used as references, the size of the neighboring BPUs, extrapolation parameters, the orientation of the neighboring BPUs relative to the original BPU, etc. For another example, if the encoder uses inter-frame prediction to encode the current BPU, then the prediction data 206 can include a prediction mode indicator (e.g., a flag value) indicating inter-frame prediction, parameters of the inter-frame prediction operation, etc. The parameters of the inter-frame prediction operation may include, for example, the number of reference images associated with the current BPU, the weights associated with the reference images respectively, the positions (e.g., coordinates) of one or more matching regions in each reference image, and one or more motion vectors associated with the matching regions respectively.

[0077] Based on the prediction mode indicator, the decoder can determine whether to perform spatial prediction (e.g., intra-frame prediction) in the spatial prediction phase 2042 or temporal prediction (e.g., inter-frame prediction) in the temporal prediction phase 2044. Figure 2B The details of performing such spatial or temporal predictions are described herein and will not be repeated below. After performing such spatial or temporal predictions, the decoder can generate a prediction BPU 208. The decoder can then add the prediction BPU 208 and the reconstructed residual BPU 222 to generate a prediction reference 224, as shown below. Figure 3A As described.

[0078] In process 300B, the decoder can feed prediction reference 224 to spatial prediction stage 2042 or temporal prediction stage 2044 for performing prediction operations in the next iteration of process 300B. For example, if the current BPU is decoded using the intra-frame prediction in spatial prediction stage 2042, then after generating prediction reference 224 (e.g., the decoded current BPU), the decoder can feed prediction reference 224 directly to spatial prediction stage 2042 for subsequent use (e.g., for extrapolation of the next BPU of the current image). If the current BPU is decoded using inter-frame prediction in temporal prediction stage 2044, then after generating prediction reference 224 (e.g., a reference image where all BPUs have been decoded), the decoder can feed prediction reference 224 to loop filtering stage 232 to reduce or eliminate distortion (e.g., block artifacts). The decoder can, as shown in... Figure 2B The method described herein applies loop filtering to prediction reference 224. The loop-filtered reference image may be stored in buffer 234 (e.g., a decoded image buffer in computer memory) for subsequent use (e.g., as an inter-frame prediction reference image for a future encoded image of video bitstream 228). The decoder may store one or more reference images in buffer 234 for use in the temporal prediction stage 2044. In some embodiments, the prediction data may further include parameters of the loop filtering (e.g., loop filtering strength). In some embodiments, the prediction data includes parameters of the loop filtering when the prediction mode indicator of prediction data 206 indicates that inter-frame prediction was used to encode the current BPU.

[0079] Figure 4 This is a block diagram of an example apparatus 400 for encoding or decoding video, consistent with embodiments of this disclosure. Figure 4As shown, device 400 may include processor 402. When processor 402 executes the instructions described herein, device 400 may become a dedicated machine for video encoding or decoding. Processor 402 may be any type of circuit system capable of manipulating or processing information. For example, processor 402 may include any number of central processing units (or “CPU”), graphics processing units (or “GPU”), neural processing units (“NPU”), microcontroller units (“MCU”), optical processors, programmable logic controllers, microcontrollers, microprocessors, digital signal processors, intellectual property (IP) cores, programmable logic arrays (PLAs), programmable array logic (PALs), general-purpose array logic (GALs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), system-on-a-chip (SoCs), application-specific integrated circuits (ASICs), and any combination thereof. In some embodiments, processor 402 may also be a set of processors grouped into individual logic components. For example, such as Figure 4 As shown, processor 402 may include multiple processors, including processor 402a, processor 402b and processor 402n.

[0080] The device 400 may also include a memory 404 configured to store data (e.g., instruction sets, computer code, intermediate data, etc.). For example, such as Figure 4 As shown, the stored data may include program instructions (e.g., program instructions for implementing the stages in processes 200A, 200B, 300A, or 300B) and data for processing (e.g., video sequence 202, video bitstream 228, or video stream 304). Processor 402 can access the program instructions and data for processing (e.g., via bus 410) and execute the program instructions to perform operations or manipulations on the data for processing. Memory 404 may include a high-speed random access memory device or a non-volatile memory device. In some embodiments, memory 404 may include any combination of any number of random access memories (RAM), read-only memories (ROM), optical discs, magnetic disks, hard disks, solid-state drives, flash drives, secure digital cards (SD cards), memory sticks, compact flash (CF) cards, etc. Memory 404 may also be a group of memories grouped into a single logical component. Figure 4 (Not shown in the image).

[0081] Bus 410 may be a communication device for transmitting data between components within device 400, such as an internal bus (e.g., CPU-memory bus), an external bus (e.g., a Universal Serial Bus port, a Peripheral Component Interconnect Fast Port), etc.

[0082] For ease of explanation and to avoid ambiguity, processor 402 and other data processing circuitry are collectively referred to as "data processing circuitry" in this disclosure. The data processing circuitry may be implemented entirely as hardware, or as a combination of software, hardware, or firmware. Furthermore, the data processing circuitry may be a single, independent module, or may be wholly or partially integrated into any other component of device 400.

[0083] Device 400 may also include a network interface 406 to provide wired or wireless communication with a network (e.g., the Internet, intranet, local area network, mobile communication network, etc.). In some embodiments, network interface 406 may include any combination of any number of network interface controllers (NICs), radio frequency (RF) modules, transceivers, transceivers, modems, routers, gateways, wired network adapters, wireless network adapters, Bluetooth adapters, infrared adapters, near field communication (“NFC”) adapters, cellular network chips, etc.

[0084] In some embodiments, optionally, the device 400 may further include a peripheral interface 408 to provide connectivity to one or more peripheral devices. Figure 4 As shown, peripheral devices may include, but are not limited to, cursor control devices (e.g., mouse, touchpad, or touchscreen), keyboards, displays (e.g., cathode ray tube displays, liquid crystal displays, or light-emitting diode displays), video input devices (e.g., cameras or input interfaces coupled to video files), etc.

[0085] It should be noted that the video codec (e.g., the codec for executing processes 200A, 200B, 300A, or 300B) can be implemented as any combination of any software or hardware modules in device 400. For example, some or all stages of processes 200A, 200B, 300A, or 300B can be implemented as one or more software modules of device 400, such as program instructions that can be loaded into memory 404. As another example, some or all stages of processes 200A, 200B, 300A, or 300B can be implemented as one or more hardware modules of device 400, such as dedicated data processing circuitry (e.g., FPGA, ASIC, NPU, etc.).

[0086] Overlapping Block Motion Compensation (OBMC) is an inter-frame coding tool used in Enhanced Compression Model (ECM). When OBMC is applied to a Coding Unit (CU), it is performed against the top and left boundaries of the CU. Furthermore, when a CU is encoded using a sub-CU mode (e.g., affine mode or Decoder End Motion Vector Refinement (DMVR) mode), OBMC is further performed against the boundaries of each sub-CU of that CU, excluding the boundaries of the CU itself. To handle boundaries uniformly, OBMC is performed at the 4×4 sub-block level for all enabled boundaries. OBMC is applied to both the luma and chroma components.

[0087] Figure 5 This illustrates OBMC performed against block boundaries according to some embodiments of this disclosure. For example... Figure 5 As shown, block 500 is divided into 4×4 sub-blocks. For the upper and left block boundaries, OBMC is performed at the 4×4 sub-block level. When OBMC is applied to the current sub-block 511, in addition to the current motion vector... In addition, motion vectors from adjacent sub-blocks It is also used to derive the prediction block of the current sub-block. For example, when the current sub-block 511 is at the upper boundary 510 position, the motion vector from the adjacent upper sub-block 501. (If available and consistent with the current motion vector) (Different) is used to derive the prediction block of the current sub-block 511. When the current sub-block 521 is at the left boundary 520 position, the motion vector from the left adjacent sub-block 502. (If available and consistent with the current motion vector) (Different) is used to derive the prediction block of the current sub-block 521. Based on the current motion vector The predicted signal is represented as Based on the adjacent motion vectors The predicted signal is represented as The two prediction signals are fused to generate the final prediction signal for the current sub-block. .if equal Therefore, OBMC will not be performed on the current sub-block.

[0088] In early ECM, a fixed set of weights was used for the fusion operation. For sub-blocks at the upper boundary, samples in the same row shared the same weight; for sub-blocks at the left boundary, samples in the same column shared the same weight. The weights are shown in Equation 1, where the coordinates... This represents the horizontal distance between the current chroma sample and the chroma sample at the top left corner of the current 4×4 sub-block. and vertical distance .

[0089] (Formula 1) Then, an OBMC scheme based on template matching is adopted. Figure 6 A template of the OBMC according to some embodiments of this disclosure is shown. Figure 6 As shown, for each upper block (e.g., A, B, C, D) with a size of 4×4 at the upper CU boundary, the size of the template 601 is equal to 4×1. If N adjacent blocks have the same motion information, then the template size is merged into 4N×1 because motion compensation can be performed at once. For each left block (e.g., A, E, F, G) with a size of 4×4 at the left CU boundary, the size of the left template 602 is equal to 1×4 or 1×4N.

[0090] For each 4×4 upper sub-block (or N groups of 4×4 blocks), follow these steps to derive the predicted values ​​for the boundary samples. For example, take block A as the current block and its upper neighboring block as AboveNeighbor_A, and perform the same operation for the left block.

[0091] First, the three template matching costs (Cost1, Cost2, Cost3) are calculated using the sum of absolute differences (SAD) between the reconstructed samples of the template and the corresponding reference samples derived through motion compensation based on the following three types of motion information: Cost1 is calculated based on the motion information of A.

[0092] Cost2 is calculated based on the motion information of AboveNeighbor_A.

[0093] Cost3 is calculated based on a weighted prediction of the motion information of A and AboveNeighbor_A, with weighting factors of 3 / 4 and 1 / 4, respectively.

[0094] Secondly, by comparing Cost1, Cost2, and Cost3, a method is selected to calculate the final prediction result for the boundary samples.

[0095] If Cost1 is the minimum, then This means that OBMC is not executed.

[0096] If (Cost2 + (Cost2>>2) + (Cost2>>3))<= Cost1, then use fusion mode 1, as shown in Formula 1.

[0097] If Cost1 <= Cost2, then use fusion mode 2, as shown in formula 3.

[0098] Otherwise, use fusion mode 3, as shown in formula 2.

[0099] For chroma samples, fusion can only be performed on the first row or the first column.

[0100] (Formula 2) (Formula 3) For sub-CU boundaries, OBMC is performed at the 4×4 sub-block level, with CU boundary expectations. For each sub-block, in addition to the current motion vector, the motion vectors of the four connected adjacent sub-blocks—if available and different from the current motion vector—are also used to derive the prediction block for the current sub-block. These multiple prediction blocks based on multiple motion vectors are combined to generate the final prediction signal for the current sub-block.

[0101] For Advanced Motion Vector Prediction (AMVP) mode, a flag is sent to indicate whether OBMC is performed for the CU. For Skip and Merge modes, no signaling instruction is required, and OBMC is always performed.

[0102] The OBMC is controlled by the Sequence Parameter Set (SPS) flag, which can be set based on the hash block hit rate at the encoding end. If the hash block hit rate is greater than a threshold, the video sequence is determined to be screen content, and the OBMC is not applied.

[0103] If there are adjacent blocks encoded using Intra-Block Copy (IBC), Palette, or Block-Based Differential Pulse Code Modulation (BDPCM) modes, then OBMC should not be applied to the block.

[0104] When OBMC is applied to a sub-block, the sub-block boundary is further checked based on the reference sample of the current sub-block to determine whether OBMC should be applied to the boundary. If any absolute difference between the predicted sample and the non-interpolated (integer pixel) reference sample is greater than a threshold, then OBMC is not applied to the boundary.

[0105] Intra-Block Copy (IBC) is a tool used in VVC. It is well known to significantly improve the coding efficiency of screen content material. Since IBC mode is implemented in a block-level coding mode, block matching (BM) is performed at the coding end to find the optimal block vector (or motion vector) for each CU. Here, the block vector indicates the displacement from the current block to a reference block that has already been reconstructed within the current image. The luma block vector of the IBC-coded CU is integer precision. The chroma block vector is also rounded to integer precision. When combined with AMVR, the IBC mode can switch between 1-pixel motion vector precision and 4-pixel motion vector precision. IBC-coded CUs are considered a third prediction mode in addition to intra-frame or inter-frame prediction modes. The IBC mode is suitable for CUs with a width and height of 64 luma samples or less.

[0106] At the encoding end, hash-based motion estimation is performed for IBC. The encoder performs rate-distortion (RD) checks on blocks with a width or height no greater than 16 luminance samples. For non-merging modes, a block vector search is first performed using a hash-based search. If the hash search does not return any valid candidates, a local search based on block matching can be performed.

[0107] In the hash-based search, hash key matching (32-bit Cyclic Redundancy Check (CRC)) between the current block and reference blocks is extended to all allowed block sizes. The hash key calculation for each location in the current image is based on 4×4 sub-blocks. For a larger current block, a hash key matching the hash key of the reference block is determined when all hash keys of all 4×4 sub-blocks match the hash key in the corresponding reference location. If multiple reference blocks are found to match the hash key of the current block, the block vector cost of each matching reference is calculated, and the matching reference with the lowest cost is selected.

[0108] In block matching search, the search scope is set to cover both the previous and current coding tree units (CTUs).

[0109] At the CU level, an IBC mode is identified by a flag and can be identified as IBC AMVP mode or IBC skip / merge mode, as shown below.

[0110] In the IBC skip / merge mode, a merge candidate index is used to indicate which block vector in the merge candidate list is used to predict the current block. This list is drawn from neighboring candidate IBC encoded blocks. The merge candidate list consists of a space, HMVP, and paired candidates.

[0111] In IBC AMVP mode, the block vector difference is encoded in the same way as the motion vector difference. The block vector prediction method uses two candidates as predictors, one from the left neighboring block and the other from the upper neighboring block (if encoded in IBC mode). When a candidate from the left neighboring block or the upper neighboring block is unavailable, a default block vector is used as the predictor. A flag is sent to identify the block vector predictor index. To reduce memory consumption and decoder complexity, the IBC in VVC only allows the reconstruction of predefined regions, including the current CTU region and some regions of the left CTU. Figures 7A to 7F The diagram illustrates the current CTU processing order for IBC mode according to some embodiments of this disclosure, along with available reference samples in the current CTU and the left-hand CTU. Figures 7A to 7F As shown, each block represents a 64×64 luminance sample unit.

[0112] Based on the current CU's position within the current CTU, the following method is used.

[0113] refer to Figure 7A If the current block 701 is located within the upper left 64×64 block of the current CTU 710, then in the current image reference (CPR) mode, in addition to the samples already reconstructed in the current CTU, it can also reference the reference samples in the lower right 64×64 block 723 of the left CTU 720. In CPR mode, the current block 701 can also reference the reference samples in the lower left 64×64 block 722 of the left CTU, and the reference samples in the upper right 64×64 block 721 of the left CTU.

[0114] refer to Figure 7B If the current block 702 is located within the upper right 64×64 block of the current CTU and its brightness position (0, 64) relative to the current CTU 710 has not yet been reconstructed, then in CPR mode, in addition to the samples already reconstructed in the current CTU 710, the current block 702 can also refer to the reference samples in the lower left 64×64 block 722 and the lower right 64×64 block 723 of the left CTU 720.

[0115] refer to Figure 7C If the current block 702 is located in the upper right corner of the current CTU 64×64 block and has been reconstructed relative to the brightness position (0, 64) of the current CTU 710, then in CPR mode, in addition to the samples already reconstructed in the current CTU 710, the current block 702 can also refer to the reference samples in the lower right corner of the left CTU 720 64×64 block 723.

[0116] refer to Figure 7D If the current block 703 is located in the lower left 64×64 block of the current CTU 710, and its brightness position (64, 0) relative to the current CTU 710 has not yet been reconstructed, then in CPR mode, in addition to the samples already reconstructed in the current CTU 710, the current block 703 can also refer to the reference samples in the upper right 64×64 block 721 and the lower right 64×64 block 723 of the left CTU 720.

[0117] refer to Figure 7E If the current block 703 is located in the lower left 64×64 block of the current CTU 710 and has been reconstructed relative to the brightness position (64, 0) of the current CTU 710, then in CPR mode, in addition to the samples already reconstructed in the current CTU 710, the current block 703 can also refer to the reference samples in the lower right 64×64 block 723 of the left CTU 720.

[0118] refer to Figure 7F If the current block 70 is located in the lower right 64×64 block of the current CTU 710, then in CPR mode, only the samples that have been reconstructed in the current CTU 710 can be referenced.

[0119] This limitation allows the use of on-chip local memory in the hardware implementation to implement the IBC mode.

[0120] For IBC encoded blocks, a Reconstruction Reordered IBC (RR-IBC) mode is permitted. When RR-IBC is applied, the samples in the reconstructed block are flipped according to the flip type of the current block. At the encoding end, the original block is flipped before motion search and residual calculation, while the prediction block is derived without flipping. At the decoding end, the reconstructed block is flipped back to recover the original block.

[0121] For RR-IBC coded blocks, two flipping methods are supported: horizontal flipping and vertical flipping. First, a syntax flag is sent for the IBCAMVP coded block indicating whether the reconstruction has been flipped. If it has been flipped, another flag is sent indicating the flipping type. For IBC merging, the flipping type is inherited from adjacent blocks, and no syntax signaling is required. Considering horizontal or vertical symmetry, the current block and the reference block are typically horizontally or vertically aligned. Therefore, when applying a horizontal flip, the vertical component of the block vector (BV) is not sent and is inferred to be equal to 0. Similarly, when applying a vertical flip, the horizontal component of the BV is not sent and is inferred to be equal to 0.

[0122] To better utilize the symmetry properties, a flip-aware BV adjustment method is applied to refine the block vector candidates. Figure 8A and Figure 8B The diagram illustrates BV adjustments for horizontal and vertical flipping, respectively, according to some embodiments of the present disclosure. For example, such as... Figure 8A and Figure 8B As shown, ( x nbr , y nbr )and( x cur , y cur () represents the coordinates of the center sample of the adjacent block and the current block, respectively. BV nbr and BV cur These represent the BV of the adjacent block and the current block, respectively. For example... Figure 8A As shown, when the adjacent blocks are encoded using horizontal flipping, BV cur The horizontal component is not inherited directly from the adjacent block BV, but rather by adding a motion offset to the BV. BV nbr The horizontal component is used to calculate the BV cur The horizontal component (represented as) BV nbr h ),Right now BV cur h =2( x nbr - x cur ) + BV nbr h Similarly, such as Figure 8B As shown, when encoding the adjacent blocks using vertical flipping, a motion offset is added to the... BV nbr The vertical component is used to calculate the... BV cur The vertical component (represented as) BV nbr v ),Right now BV cur v =2( y nbr - y cur ) + BV nbrv .

[0123] Combined Intra-Block Copy and Intra-Prediction (IBC-CIIP) is a coding tool for CU that uses IBC and intra-prediction to obtain two prediction signals, which are then weighted and summed to generate the final prediction, as shown below: in and This refers to the IBC prediction signal and the intra-frame prediction signal. For IBC combining mode and IBCAMVP mode, It was set to equal (13, 4) and (1, 1).

[0124] The intra-prediction signal is generated using an intra-prediction mode (IPM) candidate list, with the IPM candidate list size predefined to 2. An IPM index is sent to indicate which IPM to use.

[0125] Intra-Block Copying with Geometric Partitioning (IBC-GPM) is a coding tool that geometrically divides the CU into two sub-partitions. The predicted signals for these two sub-partitions are generated using IBC and intra-prediction. IBC-GPM can be applied to either regular IBC merging or IBC TM merging modes. An IPM candidate list is constructed, with its size predefined to 3. There are a total of 48 geometric partitioning modes, divided into two sets, as shown below: Table 1: Geometric partitioning patterns in the first set of geometric partitioning patterns Table 2: Geometric Partition Patterns in the Second Geometric Partition Pattern Set When using IBC-GPM, an IBC-GPM geometry partitioning mode set flag is sent to indicate whether the first or second geometry partitioning mode set is selected, followed by a geometry partitioning mode index. An IBC-GPM intra-frame flag is sent to indicate whether intra-frame prediction is used for the first sub-partition. When intra-frame prediction is used for a sub-partition, an intra-frame prediction mode index is sent. When IBC is used for a sub-partition, a merge index is sent.

[0126] Intra-Block Copy with Local Illumination Compensation (IBC-LIC) is an encoding tool that compensates for local illumination variations within the image between the IBC-coded CU and its prediction block using a linear equation. The parameters of the linear equation are derived from a reference template. IBC-LIC can be applied to both IBC AMVP and IBC merge modes. For IBC AMVP mode, an IBC-LIC flag is sent to identify the use of IBC-LIC. For IBC merge mode, the IBC-LIC flag is inferred from the merge candidates.

[0127] Intra-frame template matching prediction (intra-frame TMP) is a special intra-frame prediction mode that copies the best prediction block from the reconstructed portion of the current frame. This prediction block has an L-shaped template that matches the current template. In other worlds, the block vector of the current block is jointly derived from the template in the encoder and decoder without signaling transmission. For a predefined search range, the encoder searches for the template most similar to the current template in the reconstructed portion of the current frame and uses the corresponding block as the prediction block; the vector representing the location of the matching block is stored as the block vector of the current block. The encoder then sends a signaling to enable this mode, and the same prediction operation is performed at the decoder.

[0128] A prediction signal is generated by matching the L-shaped causal neighborhood of the current block with another block in a predefined search region.

[0129] The sum of absolute differences (SAD) can be used as the cost function. Within each region, the decoder searches for the template with the minimum SAD relative to the current template and uses its corresponding block as the prediction block. A block vector is stored for the current block.

[0130] Consistent with the disclosed embodiments, multiple candidate intra-frame TMPs can be used. An intra-frame TMP selects only one matching block with the minimum template matching cost (SAD value). However, there are often several blocks similar to the current block, and their template matching costs are comparable. A multi-candidate intra-frame TMP method using multiple candidates for an intra-frame TMP is proposed. A candidate list is constructed, and the candidate matching blocks are sorted in ascending order of their template matching costs. An index is sent in the bitstream to indicate the candidate actually used by the current block.

[0131] In intra-frame TMP fusion mode, N candidate matching blocks corresponding to the N minimum template matching costs are fused to obtain the final predicted block for intra-frame TMP. According to some embodiments, an index is sent to indicate the candidate set used for intra-frame TMP fusion. The optimal 15 block vectors obtained through template matching are designated as BV0 to BV14. The index is used to indicate which of the three candidate sets {BV0 to BV4}, {BV5 to BV9}, and {BV10 to BV14} is used for the fusion operation. Weight derivation in fusion supports two methods: a SAD-based weight derivation method and a Wiener filtering-based weight derivation method. A flag is sent to indicate which method is used.

[0132] In intra-frame TMP filtering mode, a linear filtering model is applied to the intra-frame TMP prediction. The 6-tap linear filter consists of 5 spatial luminance samples from the matching block and a bias term. Filter coefficients are derived for each block using minimum MSE regression analysis based on samples between the matching template and the current template.

[0133] In intra-frame TMP using subpixel mode, three subpixel precisions are supported—including half-pixel, quarter-pixel, and three-quarter-pixel—and eight directions are provided around integer pixel locations. Figure 9 The diagram illustrates the subpixel positions used in an intra-frame TMP employing a subpixel pattern according to some embodiments of this disclosure. A precision index is transmitted to indicate which of the three subpixel precisions is used, and a direction index is transmitted to indicate which of the four directions is used. A four-tap discrete cosine transform-based interpolation filter (DCT-IF) is used for subpixel interpolation in the intra-frame TMP.

[0134] For the luminance component in VVC, the enabled intra-prediction modes are planar, DC, angular intra-prediction modes, multiple reference line (MRL) prediction mode, intra-segmentation (ISP) mode, and matrix-based intra-prediction (MIP) mode.

[0135] Angular intra-prediction is a directional intra-prediction method that is supported in HEVC and is also part of VVC. To capture arbitrary edge directions presented in natural video, the number of angular intra-prediction modes in VVC is expanded from 33 used in HEVC to 65. Figure 10 Intra-frame prediction modes according to some embodiments of this disclosure are shown. For example... Figure 10 As shown in the figure, the dashed arrows represent new angle intra-frame prediction modes that do not exist in HEVC.

[0136] Similar to HEVC, VVC also supports two non-angular intra-prediction modes: DC and planar modes. The DC intra-prediction mode uses the average sample value of the reference samples for the block to generate predictions. In VVC, only the reference samples along the longer side of the rectangular block are used to calculate the average, while for square blocks, reference samples from the left and top are used. In planar mode, the predicted sample value is obtained by a weighted average of four reference sample values. Here, the reference sample in the same row or column as the current sample, as well as the reference samples positioned relative to the lower left and upper right of the block, are used.

[0137] In VVC, the intra-prediction results for DC, planar, and several angle modes are further modified using the Position-Related Intra-Prediction Combination (PDPC) method. PDPC is applied to the following intra-modes that do not require signaling indication: planar, DC, intra-angles less than or equal to the horizontal direction, and intra-angles greater than or equal to the vertical direction and less than or equal to index 80.

[0138] The above OBMC method may have the following problems.

[0139] The current OBMC is performed only for inter-frame prediction mode coded blocks to improve coding efficiency. It resolves block artifacts by fusing different motion vectors at their boundaries. However, the current OBMC cannot be performed on blocks predicted using intra-frame modes (e.g., intra-frame prediction mode (IPM), intra-frame TMP, IBC, IBC-CIIP, etc.). Specifically, the current OBMC cannot be performed on intra-frame TMP and IBC coded blocks that use block vectors. The difference between motion vectors and block vectors is that motion vectors correspond to a position in another frame, while block vectors correspond to a position in the current frame. It can be assumed that block artifacts may also exist if the block vector of the current block differs from the block vector of the adjacent block.

[0140] This disclosure proposes an OBMC method for blocks that employ intra-frame mode prediction. The intra-frame mode includes one of the following: intra-frame prediction mode, intra-frame TMP mode, IBC mode, IBC-CIIP mode, RR-IBC mode, IBC-AMVP mode, intra-frame TMP fusion mode, IBC-LIC mode, and intra-frame TMP filtering mode.

[0141] In some embodiments, an OBMC method using block vectors is proposed. For example, the proposed OBMC method is applied to blocks predicted using an intra-frame TMP mode or an IBC mode. A block is predicted using the intra-frame TMP mode or the IBC mode, which means that there is a block vector in the current frame, and this block vector corresponds to a reconstructed block in the current frame.

[0142] In some embodiments, OBMC is performed at the sub-block level on one or more boundaries of the block (e.g., the top or left boundary of the block). For example, a block may include 4×4 sub-blocks, and a sub-block may be a 4×4 sub-block, meaning that the width and height of the sub-block are both 4 samples of the luminance component. In some other examples, the block may be of other sizes, and the sub-blocks may be of other sizes, without being limited thereto. In some embodiments, the OBMC may be applied at the sub-block level or the sample level.

[0143] In some embodiments, when OBMC is applied to the current sub-block, in addition to the current block vector In addition, block vectors from the adjacent sub-blocks above can also be used. (When the current sub-block is at the top boundary) or the block vector from the left adjacent sub-block. (When the current sub-block is at the left boundary), derive the prediction signal for the current sub-block.

[0144] Figure 11 A flowchart illustrating an exemplary method for performing OBMC on a block according to some embodiments of this disclosure is shown. Method 1100 may be performed by an encoder (e.g., via...) Figure 2A Process 200A or Figure 2B Process 200B), decoder (e.g., via Figure 3A Process 300A or Figure 3B The process 300B is performed, or by a device ( Figure 4 The device 400) is executed by one or more software or hardware components. For example, a processor (e.g., Figure 4 The processor 402 can execute method 1100. In some embodiments, method 1100 can be implemented by a computer program product contained in a computer-readable medium, the computer program product comprising components manufactured by a computer ( Figure 4 The device 400 executes computer-executable instructions, such as program code. (See reference) Figure 11 Method 1100 may include the following steps 1102 to 1106.

[0145] At step 1102, a first prediction signal is obtained based on the first block vector of the block. For example, based on the current block vector. The predicted signal is represented as And is considered as the first prediction signal. In some embodiments, the block vector This is obtained by performing intra-frame TMP or IBC on the current block. In this way, after obtaining the prediction signal using the intra-frame TMP or IBC mode, OBMC is performed. The upper and left boundaries of the current block are corrected by using the block vectors of the adjacent blocks at the sub-block level.

[0146] At step 1104, a second prediction signal is obtained based on the second block vector of neighboring blocks. For example, based on the neighboring block vectors... The predicted signal is represented as And it is regarded as the second prediction signal. Figure 12 This illustrates, according to some embodiments of the present disclosure, the sub-block 1201 located at the upper boundary of block 1210 during OBMC execution. , , and Examples.

[0147] At step 1106, a third prediction signal is generated based on the first prediction signal and the second prediction signal. For example, this can be achieved by fusing the first prediction signal. and the second prediction signal The generation is represented as The third prediction signal.

[0148] In some embodiments, the method further includes: determining that it is the first prediction signal. or the third prediction signal This serves as the final prediction signal for further processing. If the first prediction signal is determined... If the final prediction signal is true, then the OBMC cannot be executed.

[0149] In some embodiments, the OBMC is performed at the sub-block level.

[0150] In some embodiments, it is determined whether a neighboring sub-block is available. For example, the first prediction signal is determined when the neighboring sub-block is outside the frame or slice boundary, or when the neighboring sub-block is not predicted in intra-frame TMP mode or IBC mode, or when the neighboring sub-block has no valid block vector. This is the final predicted signal.

[0151] In some embodiments, the neighboring block vectors of the current sub-block are determined. Is it available? When adjacent block vectors When the current sub-block is unavailable, this means that by using the The sub-block at the corresponding location is unavailable, for example, outside the frame or slice boundary, or has not yet been reconstructed, thus determining the first predicted signal. This is the final predicted signal. In some embodiments, the first predicted signal is determined based on the sample predicted values ​​of the sub-block. or the third prediction signal This is the final prediction signal for the sub-block.

[0152] In some embodiments, the first prediction signal is calculated. With the second prediction signal The maximum absolute difference between them is used to determine whether to adopt the first prediction signal. The OBMC is performed on the sub-block. If the value is greater than (or equal to) a threshold, then the first prediction signal is determined. This is the final predicted signal.

[0153] In some embodiments, the first prediction signal is calculated. The average value of the second prediction signal The absolute difference between the average values ​​is used to determine whether it is the first prediction signal. or the third prediction signal This is the final predicted signal for the sub-block. If the absolute difference is greater than (or equal to) a threshold, then the first predicted signal is determined. This is the final predicted signal.

[0154] In some embodiments, the first prediction signal is calculated. With the second prediction signal The sum of absolute differences (SAD) between them is used to determine whether it is the first predicted signal. or the third prediction signal The final predicted signal for the sub-block. If the sum of the absolute differences is greater than (or equal to) a threshold, then the first predicted signal is determined. This is the final predicted signal.

[0155] In some embodiments, the prediction signal is determined to be the first prediction signal based on the prediction pattern of the adjacent sub-blocks. or the third prediction signal This is the final predicted signal. For example, when the sub-block is at the upper boundary, based on the prediction pattern of the adjacent sub-block above, it is determined to be the first predicted signal. or the third prediction signal The final prediction signal for the sub-block; and when the sub-block is at the left boundary, based on the prediction pattern of the adjacent sub-block on the left, it is determined to be the first prediction signal. or the third prediction signal The first prediction signal is the final prediction signal for the sub-block. In some embodiments, the first prediction signal is determined when the left-adjacent sub-block or the upper-adjacent sub-block is one of IBC GPM mode, IBC CIIP mode, RR-IBC mode, or intra-frame TMP fusion mode. This is the final prediction signal for the sub-block.

[0156] In some embodiments, at step 1106, the fusion operation is performed using the following formula, wherein the coordinates This represents the horizontal distance between the current sample and the sample at the top left corner of the current sub-block. and vertical distance For sub-blocks located at the upper boundary, samples in the same row share the same weight; for sub-blocks located at the left boundary, samples in the same column share the same weight. In Formula 4, to In each row or column The weight, to In each row or column The weights can be any integer values.

[0157] (Formula 4) In some embodiments, based on the first prediction signal and the first prediction signal This determines the weights used for fusion of sub-blocks in the OBMC. For example, based on... and The maximum absolute difference between them, or The average value and The absolute difference between the averages, or and The SAD values ​​between them determine the weights used for fusion.

[0158] In some embodiments, and Maximum absolute difference between The weights used to determine the fusion of sub-blocks in the OBMC. Greater than the threshold When, determine the first prediction signal For the final predicted signal; when the Greater than the threshold And less than (or equal to) the threshold When, the weights corresponding to Formula 3 are used; when the Greater than the threshold And less than (or equal to) the threshold When, the weights corresponding to Formula 2 are used; when the Less than (or equal to) the threshold When using the weights corresponding to Formula 1, the threshold is applied. , and It can be any positive integer; in one example, , and .

[0159] In some embodiments, when the Greater than the threshold When, determine the first prediction signal The final prediction signal for the current sub-block; when the Greater than the threshold And less than (or equal to) the threshold When, the weights corresponding to Formula 5 are used; when the Greater than the threshold And less than (or equal to) the threshold When, the weights corresponding to Formula 3 are used; when the Greater than the threshold And less than (or equal to) the threshold When, the weights corresponding to Formula 2 are used; when the Less than (or equal to) the threshold When using the weights corresponding to Formula 1, the threshold is applied. , , and It can be any positive integer.

[0160] (Formula 5) In some embodiments, for sub-blocks, it is proposed that the first prediction signal can be further fused. and the third prediction signal To generate the fourth prediction signal for the current block. As shown in Formula 6, where Based on and The SAD value between the two values ​​is used for calculation, as shown in Formula 7, where... The threshold value is used.

[0161] (Formula 6) (Formula 7) The fourth prediction signal is determined to be the final prediction signal for further processing.

[0162] In some embodiments, for a number of consecutive sub-blocks, these consecutive sub-blocks can be merged to perform the OBMC.

[0163] In some embodiments, whether to merge sub-blocks is determined based on whether the adjacent sub-blocks corresponding to the consecutive sub-blocks are in the same block. For example, Figure 13 An exemplary block of the merge block according to some embodiments of this disclosure is shown. For example... Figure 13 As shown, if the upper adjacent sub-block 1321 of sub-block 1311 and the upper adjacent sub-block 1322 of sub-block 1312 are in the same block 1320, then the sub-blocks 1311 and 1312 of block 1310 can be merged into a larger sub-block (if the original sub-block is 4×4, then the merged sub-block is 8×4), and the OBMC is performed on the merged sub-block.

[0164] In some embodiments, based on each neighboring sub-block corresponding to each neighboring sub-block... Whether to merge sub-blocks is determined by whether the predicted mode parameters are the same. For example, refer to Figure 13 If the adjacent sub-block 1321 of sub-block 1311 and the prediction mode parameters of the neighboring sub-block 1322 of sub-block 1312 With the same prediction mode parameters, sub-blocks 1311 and 1312 of block 1310 can be merged into a larger sub-block (if the original sub-block is 4×4, then the merged sub-block is 8×4), and the OBMC is performed on the merged sub-block.

[0165] In some embodiments, the prediction parameters of adjacent sub-blocks can be used to generate the second prediction signal. This means that the prediction parameters of adjacent sub-blocks can be inherited and applied to the current sub-block.

[0166] In some embodiments, when the OBMC is executed on a sub-block, It is through the adjacent sub-blocks The prediction parameters are generated in conjunction with the predicted parameters. In other worlds, the predicted parameters of the neighboring sub-blocks are inherited by the current sub-block to obtain... .

[0167] In some embodiments, when predicting neighboring sub-blocks using intra-frame TMP filtering mode, the filter coefficients are inherited. In this example, the current sub-block is also predicted using intra-frame TMP filtering mode, and the current sub-block is further predicted using the filter coefficients from the neighboring sub-blocks. And the filter coefficients, generate the OBMC. In some embodiments, when predicting the neighboring sub-blocks using intra-frame TMP filtering mode, only the... Used to generate .

[0168] In some embodiments, when predicting the neighboring sub-blocks using an intra-frame TMP fusion mode, the block vectors and fusion weights used are inherited. In this example, the current sub-block is also predicted using an intra-frame TMP fusion mode, and the block vectors and fusion weights used in the neighboring sub-blocks are inherited. And fusion weights, to generate the OBMC In some embodiments, when at least one block vector used in the fusion is not available for the current sub-block, only the [specific block vector] is used. (which is the block vector stored in the adjacent sub-blocks) to generate In some embodiments, the first prediction signal is determined when at least one block vector used in the fusion is not available for the current sub-block. This is the final predicted signal for the current sub-block. In some embodiments, when predicting the neighboring sub-blocks in intra-frame TMP fusion mode, only the [predicted signal] is used. (which is the block vector stored in the adjacent sub-blocks) to generate .

[0169] In some embodiments, when predicting the neighboring sub-blocks using the intra-frame TMP sub-pixel mode, the sub-pixel precision and orientation used are inherited. In this example, the current sub-block is also predicted using the intra-frame TMP sub-pixel mode, and the sub-pixel precision and orientation used in the neighboring sub-blocks are also inherited. In addition to the sub-pixel precision and orientation, a formula for generating the OBMC is generated. In some embodiments, when predicting the neighboring sub-blocks in intra-frame TMP sub-pixel mode, only the [presumably referring to a specific method or technique] is used. (which is the block vector stored in the adjacent sub-blocks) to generate .

[0170] In some embodiments, when predicting neighboring sub-blocks in IBC LIC mode, the LIC parameters are inherited. In this example, the current sub-block also uses... Prediction is performed in IBC LIC mode, and through data from neighboring sub-blocks. And the LIC parameters, generate the OBMC. In some embodiments, when predicting the neighboring sub-blocks in the IBC LIC mode, only the [specific method / method] is used. (which is the block vector stored in the adjacent sub-blocks) to generate .

[0171] In some embodiments, when predicting the neighboring sub-blocks in IBC CIIP mode, the intra-prediction mode and weights are inherited. In this example, the current sub-block is also predicted in the IBC CIIP mode, and the weights of the neighboring sub-blocks are adjusted accordingly. The predicted signal obtained from the intra-frame prediction mode is weighted to generate the signal used for OBMC. In some embodiments, when predicting the neighboring sub-blocks using the IBC-CIIP mode, only the [specific method / method] is used. (which is the block vector stored in the adjacent sub-blocks) to generate .

[0172] In some embodiments, when predicting the neighboring sub-blocks in IBC GPM mode, the intra-prediction mode and the geometric partitioning mode are inherited. In this example, the current sub-block is also predicted in the IBC-GPM mode, and through the... The predicted signals from the adjacent sub-blocks and the partitioning pattern are used to generate the OBMC. In some embodiments, when predicting the neighboring sub-blocks using the IBC-GPM mode, only the [specific method / method] is used. (which is the block vector stored in the adjacent sub-blocks) to generate .

[0173] In some embodiments, when predicting the neighboring sub-blocks in RR-IBC mode, the first prediction signal is determined. The final prediction signal for the current sub-block.

[0174] In the above embodiments, when the adjacent sub-block is predicted in intra-frame prediction mode, this means that the adjacent sub-block is predicted in non-intra-frame TMP mode or non-IBC mode, or the adjacent sub-block has no stored block vector, and the first prediction signal is determined. The final prediction signal for the current sub-block.

[0175] In some embodiments, when predicting the neighboring sub-blocks using an intra-prediction mode, the OBMC can be generated using one of the stored intra-prediction modes (angle mode, plane mode, and DC mode) for the neighboring sub-blocks. .

[0176] In some embodiments, when predicting the neighboring sub-blocks in an intra-frame prediction mode, block vectors can be derived to generate the current sub-block. For example, a padding method is used to derive the block vectors of adjacent blocks encoded in intra-prediction mode. In some embodiments, for an adjacent sub-block at the top boundary of a block, if the adjacent sub-block has no stored block vector, then the block vectors from the left and right adjacent sub-blocks of the adjacent sub-block can be padded to the adjacent sub-block; for an adjacent sub-block at the left boundary of a block, if the adjacent sub-block has no stored block vector, then the block vectors from the upper and lower adjacent sub-blocks of the adjacent sub-block can be padded to the adjacent sub-block. For example, Figure 14 Exemplary blocks illustrating methods for filling block vectors according to some embodiments of this disclosure are shown. For example... Figure 14 As shown, the neighboring sub-block 1403 of sub-block 1413 is predicted in intra-frame prediction mode, such that the neighboring sub-block 1403 has no stored block vector. Then, the block vector BV1 of the neighboring sub-block 1402 can be filled into the neighboring sub-block 1403. When the OBMC is performed on the sub-block 1413, the block vector BV1 is used to generate In another example, when the OBMC is performed on sub-block 1413, the block vector BV1 of adjacent sub-block 1402 and the block vector BV3 of adjacent sub-block 1404 are simultaneously used to generate the... .

[0177] In some embodiments, not only the block vector is filled, but also the prediction parameters, such as the prediction mode, the filter coefficients of the intra-frame TMP filtering mode, the block vector and the fusion weight of the intra-frame TMP fusion mode, the sub-pixel precision and orientation of the intra-frame TMP sub-pixel mode, the LIC parameters of the IBC-LIC mode, the intra-frame prediction mode and weights in the IBC-CIIP mode, and the intra-frame prediction mode and the geometric partitioning mode of the IBC-GPM mode.

[0178] In some embodiments, the OBMC is performed at the sample level.

[0179] In some embodiments, the predicted value of the sample is used to determine whether it is the first predicted signal. or the third prediction signal The final predicted signal is used as a sample in the sub-block. In this example, for coordinates... The sample, the first prediction signal is The second prediction signal is And the third prediction signal is In some embodiments, calculation and The difference between them is used to determine whether it is the first prediction signal. or the third prediction signal Coordinates are The final predicted signal of the sample. If the difference is greater than (or equal to) a threshold, then the first predicted signal is determined. The final predicted signal is determined; if the difference is less than the threshold, then the third predicted signal is determined. The final prediction signal for the sample is obtained by fusing the... and stated Obtained.

[0180] In some embodiments, it is determined at the block level whether the first prediction signal or the third prediction signal is the final prediction signal.

[0181] In some embodiments, a block-level flag is sent to identify whether the first prediction signal or the third prediction signal is the final prediction signal for the block. In some embodiments, whether to send the flag is determined by the prediction mode of the current block. For example, if the current block is predicted in IBC-AMVP mode, then the flag is sent to identify whether the first prediction signal or the third prediction signal is the final prediction signal; otherwise, the third prediction signal is determined to be the final prediction signal without any signaling indication.

[0182] In some embodiments, without any signaling indication, the third prediction signal is determined to be the final prediction signal for all blocks predicted in intra-frame TMP mode or IBC mode.

[0183] In some embodiments, the final prediction signal for a block is determined based on the number of samples in the block, specifically whether it is the first prediction signal or the third prediction signal. For example, if the number of samples in the block is greater than or equal to 256, the first prediction signal is determined to be the final prediction signal; conversely, if the number of samples in the block is less than 256, the third prediction signal is determined to be the final prediction signal.

[0184] In some embodiments, based on the prediction mode of the current block, it is determined whether the first prediction signal or the third prediction signal is the final prediction signal of the block. For example, when predicting the current block using IBC-GPM mode, IBC-CIIP mode, RR-IBC mode, IBC-AMVP mode, or intra-frame TMP fusion mode, the first prediction signal is determined to be the final prediction signal.

[0185] In some embodiments, based on the type of the current slice, it is determined whether the first prediction signal or the third prediction signal is the final prediction signal for the block. For example, the slice type is determined for the current block (e.g., B slice or I slice), and when the block is an I slice, the first prediction signal is determined to be the final prediction signal for the block.

[0186] In some embodiments, a determination is made based on an SPS level flag to determine whether the first prediction signal or the third prediction signal is the final prediction signal for the block. In one example, the SPS flag is set to false for the screen content sequence, which means that OBMC is not performed on the screen content sequence, i.e., the first prediction signal is determined to be the final prediction signal for the block.

[0187] In some embodiments, based on the type of the block, it is determined whether the first prediction signal or the third prediction signal is the final prediction signal for the block. For example, the type of the block (luminance block or chroma block) is determined, and when the block is a chroma block, the first prediction signal is determined to be the final prediction signal for the block.

[0188] In some embodiments, the OBMC can also be performed when the current block is predicted in intra-frame prediction mode, i.e., when there is no block vector for the current block, and the This is the prediction signal of the intra-frame prediction mode. The prediction signal can be obtained according to the aforementioned OBMC process. , And whether the first prediction signal is used or the third prediction signal Perform the determination of the OBMC.

[0189] In some embodiments, the above embodiments can be freely combined.

[0190] In some embodiments, a non-transitory computer-readable storage medium for storing a bitstream is also provided. The bitstream can be encoded and decoded according to the disclosed OBMC for intra-frame mode. In some embodiments, the bitstream includes a block flag indicating whether the first prediction signal or the third prediction signal is the final prediction signal for a block. In some embodiments, the bitstream includes an SPS level flag indicating whether the first prediction signal or the third prediction signal is the final prediction signal.

[0191] The embodiments may be further described using the following terms: 1. A method for processing video, the method comprising: Receive bitstream; and Decode one or more images using the encoded information of the bitstream. The decoding of the one or more images using the encoded information of the bitstream includes: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

[0192] 2. The method according to Clause 1, wherein performing the OBMC on the block predicted using the intra-frame mode further comprises: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of the adjacent blocks; A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0193] 3. The method according to Clause 2, wherein the OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is a block vector corresponding to an adjacent sub-block.

[0194] 4. The method according to Clause 3, wherein the one or more boundaries include at least one of the upper boundary or left boundary of the block.

[0195] 5. The method according to Clause 3, wherein obtaining the first prediction signal based on the block further comprises: Perform intra-frame template matching prediction (intra-frame TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

[0196] 6. The method according to Clause 3, wherein generating the third prediction signal for the OBMC based on the first prediction signal and the second prediction signal comprises: The first prediction signal and the second prediction signal are fused to obtain the third prediction signal.

[0197] 7. The method according to Clause 6, wherein fusing the first prediction signal and the second prediction signal to obtain the third prediction signal further comprises: The weights are determined based on one of the following: the maximum absolute difference between the first and second predicted signals, the absolute difference between the average of the first and second predicted signals and the average of the second predicted signals, or the sum of the absolute differences between the first and second predicted signals (SAD).

[0198] 8. The method according to Clause 3, wherein performing the OBMC on the block predicted using the intra-frame mode further comprises: Merging contiguous sub-blocks; and The OBMC is executed on the merged sub-blocks.

[0199] 9. The method according to Clause 8, wherein merging the contiguous sub-blocks further comprises: Determine whether adjacent sub-blocks corresponding to the consecutive sub-blocks are in the same block; and If the adjacent sub-blocks are in the same block, then the consecutive sub-blocks are merged.

[0200] 10. The method according to Clause 8, wherein merging the contiguous sub-blocks further comprises: Determine whether the block vector and prediction mode parameters of each adjacent sub-block corresponding to each consecutive sub-block are the same; If the block vector and the prediction mode parameters are the same, then the consecutive sub-blocks are merged.

[0201] 11. The method according to Clause 3, wherein the second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

[0202] 12. The method according to Clause 3, wherein when the adjacent sub-blocks are predicted in intra-frame prediction mode, the method further comprises: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

[0203] 13. The method according to Clause 12, wherein when the adjacent sub-blocks are predicted using the intra-prediction mode, the method further comprises: The second block vector is exported using a fill method; and The second block vector is used to generate the second predicted signal.

[0204] 14. The method according to Clause 13, wherein deriving the second block vector by the filling method further comprises: When the adjacent sub-block is located at the upper boundary of the block, and the adjacent sub-block has no stored block vector, the block vectors from the left and right neighboring sub-blocks are used to fill the adjacent sub-block; or When the adjacent sub-block is located at the left boundary of the block and the adjacent sub-block has no stored block vector, the block vectors from the upper and lower neighboring sub-blocks of the adjacent sub-block are used to fill the adjacent sub-block.

[0205] 15. The method according to Clause 14, wherein deriving the second block vector by the filling method further comprises: When the adjacent sub-block is located at the upper boundary of the block, the prediction parameters from the left and right neighboring sub-blocks of the adjacent sub-block are filled into the adjacent sub-block; or When the adjacent sub-block is located at the left boundary of the block, the prediction parameters from the upper and lower neighboring sub-blocks of the adjacent sub-block are filled into the adjacent sub-block.

[0206] 16. The method according to Clause 3, wherein the method further comprises: Determine whether the first prediction signal or the third prediction signal is the final prediction signal for the sub-block.

[0207] 17. The method according to Clause 16, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block further comprises: Determine whether the adjacent sub-blocks of the sub-block are available; and When the adjacent sub-block is unavailable, the first prediction signal is determined to be the final prediction signal.

[0208] 18. The method according to Clause 16, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block further comprises: Determine whether the second block vector is available; and When the second block vector is unavailable, the first prediction signal is determined to be the final prediction signal.

[0209] 19. The method according to Clause 16, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block is based on the predicted values ​​of the samples of the sub-block.

[0210] 20. The method according to Clause 19, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block based on the predicted value of the sample of the sub-block comprises: Calculate the maximum value of the absolute difference between the first predicted signal and the second predicted signal; and When the maximum value of the absolute difference between the first predicted signal and the second predicted signal is greater than or equal to a threshold, the first predicted signal is determined to be the final predicted signal.

[0211] 21. The method according to Clause 19, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block based on the predicted value of the sample of the sub-block comprises: Calculate the absolute difference between the average value of the first predicted signal and the average value of the second predicted signal; and When the absolute difference between the average values ​​of the first predicted signal and the second predicted signal is greater than or equal to a threshold, the first predicted signal is determined to be the final predicted signal.

[0212] 22. The method according to Clause 19, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block based on the predicted value of the sample of the sub-block comprises: Calculate the sum of absolute differences (SAD) between the first predicted signal and the second predicted signal; When the SAD is greater than or equal to the threshold, the first predicted signal is determined to be the final predicted signal.

[0213] 23. The method according to Clause 16, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block is based on the prediction patterns of samples from the adjacent sub-blocks.

[0214] 24. The method according to Clause 23, wherein: When the sub-block is located at the upper boundary, determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block is based on the prediction pattern of the adjacent sub-block above; or When the sub-block is located at the left boundary, determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block is based on the prediction mode of the adjacent sub-block on the left.

[0215] 25. The method according to Clause 24, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal of the sub-block further comprises: When the left adjacent sub-block or the upper adjacent sub-block adopts the geometrically partitioned intra-block copy (IBC-GPM) mode, the combined intra-block copy and intra-prediction (IBC-CIIP) mode, the reconstruction and reordering intra-block copy (RR-IBC) mode, or the intra-template matching prediction (intra-TMP) fusion mode, the first prediction signal is determined to be the final prediction signal of the sub-block.

[0216] 26. The method according to Clause 2, wherein the OBMC is performed on samples of sub-blocks at one or more boundaries of the block.

[0217] 27. The method according to Clause 26, the method further comprising: Determine whether the first prediction signal or the third prediction signal is the final prediction signal for the sample.

[0218] 28. The method according to Clause 27, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal is based on the predicted values ​​of the samples of the sub-block.

[0219] 29. The method according to Clause 28, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal based on the predicted value of the sample of the sub-block further comprises: Calculate the difference between the first predicted signal of the sample and the second predicted signal of the sample; and When the difference between the first predicted signal and the second predicted signal of the sample is greater than or equal to a threshold, the first predicted signal is determined to be the final predicted signal of the sample; or When the difference between the first predicted signal and the second predicted signal of the sample is less than the threshold, the third predicted signal is determined to be the final predicted signal of the sample.

[0220] 30. The method according to Clause 2, the method further comprising: determining whether the first prediction signal or the third prediction signal is a block-level final prediction signal.

[0221] 31. The method according to clause 30, wherein performing the OBMC on the block predicted using the intra-frame mode further comprises: Based on one of the number of samples in the block, the prediction mode of the block, the slice type of the block, or the type of the block, determine whether the first prediction signal or the third prediction signal is the final prediction signal.

[0222] 32. The method according to Clause 31, wherein when determining whether the first prediction signal or the third prediction signal is the final prediction signal based on the prediction mode of the block, the method further comprises: When the block is predicted using one of the following modes: Intra-Block Copying with Geometric Partitioning (IBC-GPM), Intra-Block Copying and Intra-Prediction Combined (IBC-CIIP), Intra-Block Copying with Reconstruction and Reordering (RR-IBC), Intra-Block Copying with Advanced Motion Vector Prediction (IBC-AMVP), or Intra-Template Matching Prediction (Intra-TMP) Fusion Mode, the first predicted signal is determined to be the final predicted signal.

[0223] 33. The method according to Clause 31, wherein when determining whether the first prediction signal or the third prediction signal is the final prediction signal is based on the slice type of the block, the method further comprises: Determine the slice type of the block; and When the block is a piece I, the first prediction signal is determined to be the final prediction signal.

[0224] 34. The method according to Clause 31, wherein when determining whether the first prediction signal or the third prediction signal is the final prediction signal is based on the type of the block, the method further comprises: Determine the type of the block; and When the block is a chroma block, the first prediction signal is determined to be the final prediction signal.

[0225] 35. The method according to Clause 2, wherein the method further comprises: Decode a flag, which indicates whether the first prediction signal or the third prediction signal is the final prediction signal.

[0226] 36. The method according to Clause 35, wherein the flag is a sequence parameter set SPS flag.

[0227] 37. The method according to clause 35, wherein the flag is determined based on the prediction pattern of the block.

[0228] 38. The method according to Clause 37, wherein determining whether the first prediction signal or the third prediction signal is the final prediction signal further comprises: Determine whether the block is predicted in an intra-block copy with advanced motion vector prediction (IBC-AMVP) mode; When the block is predicted using the IBC-AMVP model Decode the flag; and The final predicted signal is determined based on the stated flag; and When the block is not predicted using the IBCAMVP pattern The third prediction signal is determined to be the final prediction signal.

[0229] 39. The method according to Clause 2, wherein the method further comprises: The first prediction signal and the third prediction signal are fused to obtain a fourth prediction signal; and The fourth prediction signal is determined to be the final prediction signal.

[0230] 40. The method according to Clause 39, wherein fusing the first prediction signal and the third prediction signal to obtain the fourth prediction signal further comprises: Based on the absolute difference and SAD between the first predicted signal and the second predicted signal, the weight of the first predicted signal is determined; and When the SAD is greater than or equal to the threshold, the weight of the first predicted signal is set to 1; or When the SAD is less than the threshold, the weight is determined as the ratio of the SAD to the threshold.

[0231] 41. The method according to Clause 1, wherein when the block is predicted in intra-frame prediction mode, the method further comprises: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0232] 42. A method for encoding a video sequence into a bitstream, the method comprising: Receive video sequences; Encode one or more images of the video sequence; and Generate bitstream, Encoding the one or more images in the video sequence includes: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

[0233] 43. The method according to clause 42, wherein performing the OBMC on the block predicted using the intra-frame mode further comprises: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0234] 44. The method according to Clause 43, wherein the OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is a block vector corresponding to an adjacent sub-block.

[0235] 45. The method according to clause 44, wherein obtaining the first prediction signal based on the block further comprises: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

[0236] 46. ​​The method according to Clause 44, wherein the second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

[0237] 47. The method according to clause 44, wherein when the adjacent sub-blocks are predicted in intra-frame prediction mode, the method further comprises: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

[0238] 48. The method according to clause 42, wherein when the block is predicted in intra-frame prediction mode, the method further comprises: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0239] 49. An apparatus for processing video, the apparatus comprising: The receiving module is configured to receive bit streams; and A decoding module configured to decode one or more images using the encoded information of the bitstream. The decoding module is configured as follows: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

[0240] 50. The apparatus according to clause 49, wherein the decoding module is configured to: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0241] 51. The apparatus according to clause 50, wherein the OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is a block vector corresponding to an adjacent sub-block.

[0242] 52. The apparatus according to clause 51, wherein the decoding module is configured to: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

[0243] 53. The apparatus according to Clause 51, wherein the second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

[0244] 54. The apparatus according to clause 51, wherein when the adjacent sub-blocks are predicted in intra-frame prediction mode, the decoding module is configured to: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

[0245] 55. The apparatus according to clause 49, wherein when the block is predicted in intra-frame prediction mode, the decoding module is configured to: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0246] 56. An apparatus for encoding a video sequence into a bitstream, the apparatus comprising: A receiving module configured to receive video sequences; An encoding module configured to encode one or more images in the video sequence; and The generation module is configured to generate a bitstream. The encoding module is configured as follows: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

[0247] 57. The apparatus according to clause 56, wherein the encoding module is configured to: A first prediction signal is obtained based on the first block vector of the block; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0248] 58. The apparatus according to clause 57, wherein the OBMC is performed on a sub-block at one or more boundaries of the block, and the second block vector is a block vector corresponding to an adjacent sub-block.

[0249] 59. The apparatus according to clause 58, wherein the encoding module is configured to: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

[0250] 60. The apparatus according to Clause 58, wherein the second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

[0251] 61. The apparatus according to clause 58, wherein when the adjacent sub-blocks are predicted in intra-frame prediction mode, the coding module is configured to: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

[0252] 62. The apparatus according to clause 56, wherein when the block is predicted in intra-frame prediction mode, the coding module is configured to: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

[0253] 63. An electronic device, the electronic device comprising: One or more processors, and A computer-readable storage medium communicatively coupled to the one or more processors. The computer-readable storage medium stores computer-readable instructions that can be executed by the one or more processors, and when executed by the one or more processors, the computer-readable instructions perform the method according to any one of clauses 1 to 48.

[0254] 64. A non-transitory computer-readable storage medium having a video bitstream stored thereon, wherein the bitstream, when decoded by a decoder, causes the decoder to perform the method according to any one of clauses 1 to 41.

[0255] 65. A non-transitory computer-readable storage medium having a video bitstream stored thereon, wherein the bitstream, when encoded by an encoder, causes the encoder to perform the method according to any one of clauses 42 to 48.

[0256] 66. A computer program product comprising: computer program instructions, wherein the computer program instructions enable a computer to perform the method according to any one of clauses 1 to 48.

[0257] 67. A computer program, wherein the computer program enables a computer to perform the method according to any one of clauses 1 to 48.

[0258] In some embodiments, a non-transitory computer-readable storage medium including instructions is also provided, and the instructions can be executed by a device (e.g., the disclosed encoder and decoder) to perform the methods described above. Common forms of non-transitory media include, for example, floppy disks, flexible disks, hard disks, solid-state drives, magnetic tape or any other magnetic data storage media, CD-ROMs, any other optical data storage media, any physical media with a perforated pattern, RAM, PROMs and EPROMs, FLASH-EPROMs or any other flash memory, NVRAMs, caches, registers, any other memory chips or cassette tapes, and their networking versions. The device may include one or more processors (CPUs), input / output interfaces, network interfaces, and / or memory.

[0259] It should be noted that the relational terms such as "first," "second," etc., used in this document are only used to distinguish one entity or operation from another, and do not require or imply any actual relationship or order between these entities or operations. Furthermore, the words "comprising," "having," "containing," and "including," as well as other similar forms, are intended to be identical in meaning and open-ended, because one or more items following any of these words do not imply an exhaustive list of such items, nor do they imply limitation to only the listed items.

[0260] As used herein, unless otherwise specified, the term "or" covers all possible combinations unless impractical. For example, if it is specified that a database may include A or B, then unless otherwise specified or impractical, the database may include A, or B, or A and B. As a second example, if it is specified that a database may include A, B, or C, then unless otherwise specified or impractical, the database may include A, or B, or C, or A and B, or A and C, or B and C, or A and B and C.

[0261] It should be understood that the above embodiments can be implemented in hardware, software (program code), or a combination of hardware and software. If implemented in software, it can be stored in the aforementioned computer-readable medium. When executed by a processor, the software can perform the disclosed methods. The computing units and other functional units described in this disclosure can be implemented in hardware, software, or a combination of hardware and software. Those skilled in the art should also understand that multiple modules / units described above can be combined into one module / unit, and each module / unit described above can be further divided into multiple sub-modules / sub-units.

[0262] In the foregoing specification, numerous specific details have been described with reference to embodiments, which may vary depending on the implementation. Certain adjustments and modifications may be made to the described embodiments. Other embodiments will be apparent to those skilled in the art upon consideration of the specification and practice of this disclosure herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims. The sequence of steps shown in the figures is also to be considered for illustrative purposes only and is not intended to be limited to any particular order of steps. Therefore, those skilled in the art will understand that these steps may be performed in a different order while implementing the same method.

[0263] Exemplary embodiments have been disclosed in the accompanying drawings and description. However, many variations and modifications can be made to these embodiments. Therefore, although specific terminology has been used, it is used only in a general and descriptive sense and not for limiting purposes.

Claims

1. A method for processing video, the method comprising: Receive bit stream; as well as Decode one or more images using the encoded information of the bitstream. The decoding of the one or more images using the encoded information of the bitstream includes: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

2. The method according to claim 1, wherein, Performing the OBMC on the block predicted using the intra-frame mode further includes: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

3. The method according to claim 2, wherein, The OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is the block vector corresponding to the adjacent sub-block.

4. The method according to claim 3, wherein, Based on the block, obtaining the first prediction signal further includes: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

5. The method according to claim 3, wherein, The second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

6. The method according to claim 3, wherein, When the adjacent sub-blocks are predicted in intra-frame prediction mode, the method further includes: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

7. The method according to claim 1, wherein, When the block is predicted in intra-frame prediction mode, the method further includes: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

8. A method for encoding a video sequence into a bitstream, the method comprising: Receive video sequences; Encode one or more images from the video sequence; as well as Generate bitstream, Encoding the one or more images in the video sequence includes: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

9. The method according to claim 8, wherein, Performing the OBMC on the block predicted using the intra-frame mode further includes: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

10. The method according to claim 9, wherein, The OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is the block vector corresponding to the adjacent sub-block.

11. The method according to claim 10, wherein, Based on the block, obtaining the first prediction signal further includes: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

12. The method according to claim 10, wherein, The second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

13. The method according to claim 10, wherein, When the adjacent sub-blocks are predicted in intra-frame prediction mode, the method further includes: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

14. The method according to claim 8, wherein, When the block is predicted in intra-frame prediction mode, the method further includes: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

15. An apparatus for processing video, the apparatus comprising: A receiving module configured to receive bit streams; as well as A decoding module configured to decode one or more images using the encoded information of the bitstream. The decoding module is configured as follows: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

16. The apparatus according to claim 15, wherein, The decoding module is configured to: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

17. The apparatus according to claim 16, wherein, The OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is the block vector corresponding to the adjacent sub-block.

18. The apparatus according to claim 17, wherein, The decoding module is configured to: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

19. The apparatus according to claim 17, wherein, The second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

20. The apparatus according to claim 17, wherein, When the adjacent sub-blocks are predicted in intra-frame prediction mode, the decoding module is configured to: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

21. The apparatus according to claim 15, wherein, When the block is predicted in intra-frame prediction mode, the decoding module is configured to: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

22. An apparatus for encoding a video sequence into a bitstream, the apparatus comprising: A receiving module configured to receive video sequences; An encoding module configured to encode one or more images in the video sequence; as well as The generation module is configured to generate a bitstream. The encoding module is configured as follows: Overlapping block motion compensation (OBMC) is performed on blocks predicted using intra-frame mode.

23. The apparatus according to claim 22, wherein, The encoding module is configured to: Based on the first block vector of the block, a first prediction signal is obtained; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

24. The apparatus according to claim 23, wherein, The OBMC is performed on sub-blocks at one or more boundaries of the block, and the second block vector is the block vector corresponding to the adjacent sub-block.

25. The apparatus according to claim 24, wherein, The encoding module is configured to: Perform intra-frame template matching prediction (TMP) or intra-frame block copying (IBC) on the block to obtain the first block vector.

26. The apparatus according to claim 24, wherein, The second prediction signal is obtained by the second block vector of the adjacent sub-block and the prediction parameters of the adjacent sub-block.

27. The apparatus according to claim 24, wherein, When the adjacent sub-blocks are predicted in intra-frame prediction mode, the coding module is configured to: The second prediction signal is generated using the intra-frame prediction modes already stored in the adjacent sub-blocks.

28. The apparatus according to claim 22, wherein, When the block is predicted in intra-frame prediction mode, the coding module is configured to: The first prediction signal is obtained as the prediction signal for the intra-frame prediction mode; The second prediction signal is obtained based on the second block vector of adjacent blocks; and A third prediction signal is generated based on the first prediction signal and the second prediction signal.

29. An electronic device, the electronic device comprising: One or more processors, and A computer-readable storage medium communicatively coupled to the one or more processors. The computer-readable storage medium stores computer-readable instructions that can be executed by the one or more processors, and when executed by the one or more processors, the computer-readable instructions perform the method according to any one of claims 1 to 14.

30. A non-transitory computer-readable storage medium having a video bitstream stored thereon, wherein, The bitstream causes the decoder to perform the method according to any one of claims 1 to 7 when it is decoded by the decoder.

31. A non-transitory computer-readable storage medium having a video bitstream stored thereon, wherein, The bitstream, when encoded by the encoder, causes the encoder to perform the method according to any one of claims 8 to 14.

32. A computer program product, the computer program product comprising: Computer program instructions, wherein the computer program instructions enable a computer to perform the method according to any one of claims 1 to 14.

33. A computer program, wherein, The computer program enables the computer to perform the method according to any one of claims 1 to 14.

Images