VIDEO DECODING METHOD, VIDEO DECODING APPARATUS, NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM, COMPUTER PROGRAM, AND BITSTREAM SIGNAL PROCESSING METHOD

Abstract

To provide a method and a system for improving a composite inter-intra prediction.SOLUTION: A method includes the steps of: acquiring a first reference image and a second reference image related to a current prediction block; generating a first prediction L0 on the basis of a first motion vector MV0 from the current prediction block to a reference block in the first reference image; generating a second prediction L1 on the basis of a second motion vector MV1 from the current prediction block to a reference block in the second reference image; determining whether a bi-directional optical flow (BDOF) operation is to be applied; and calculating a double prediction of the current prediction block on the basis of the first prediction L0, the second prediction L1, a first inclination value, and a second inclination value.SELECTED DRAWING: Figure 3

Description

[Technical field]

[0001] This application is based on priority application Ser. No. 62 / 790,421, filed Jan. 9, 2019. All rights reserved.

[0002] This application relates to video coding and compression. More specifically, this application relates to video coding and compression. A method and apparatus for combined inter and intra prediction (CIIP) for video coding and the equipment. [Background technology]

[0003] A variety of video coding techniques can be used to compress video data. The video coding is performed according to one or more video coding standards. For example, video coding standards include Versatile Video Coding (VVC), JEM, High Efficiency Video Coding (H.265 / HEVC), Advanced video coding (H.264 / AVC), Motion Picture Experts Group (MPEG) Video coding generally involves the process of dividing a video image or sequence into Prediction methods that exploit redundancy present in the frame (e.g., inter-prediction, intra-prediction, etc.) An important goal of video coding technology is to avoid or minimize the degradation of video quality. Compressing video data into a format that uses a lower bit rate while keeping video quality to a minimum And so. Summary of the Invention

[0004] Examples of the present disclosure provide a method for improving the efficiency of syntax signaling in merge-related modes. Provide.

[0005] This disclosure attitude According to Mr. 1. A method of video coding comprising: obtaining a video bitstream; generating an inter prediction of a current coding block from the video bitstream based on at least one motion vector from a current image to at least one respective reference image; generating an intra prediction of the current coding block from the video bitstream based on an intra prediction mode; generating a final prediction of the current coding block by weighted averaging the inter prediction and the intra prediction; and identifying the current coding block to be treated as an inter mode when constructing a most probable mode (MPM) list of neighboring coding blocks and marking the intra mode of the current coding block as unavailable, wherein bidirectional optical flow (BDOF) operations are disabled for the current coding block.

[0009] Both the foregoing general description and the following detailed description are exemplary and explanatory and are not intended to limit the present disclosure. Please understand that this is not a guarantee. [Brief description of the drawings]

[0010] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate examples consistent with this disclosure. , together with the explanation, serve to explain the principles of the present disclosure. [Figure 1] FIG. 2 is a block diagram of an encoder according to an example of the present disclosure. [Diagram 2] FIG. 2 is a block diagram of a decoder according to an example of the present disclosure. [Diagram 3] 1 is a flowchart illustrating a method for generating a combined inter-and-intra prediction (CIIP) according to an example of the present disclosure. [Figure 4] 1 is a flowchart illustrating a method for generating a CIIP according to an example of the present disclosure. [Figure 5A] FIG. 2 illustrates a block partition in a multi-type tree structure according to an example of the present disclosure. [Figure 5B] FIG. 2 illustrates a block partition in a multi-type tree structure according to an example of the present disclosure. [Figure 5C] FIG. 2 illustrates a block partition in a multi-type tree structure according to an example of the present disclosure. [Figure 5D] FIG. 2 illustrates a block partition in a multi-type tree structure according to an example of the present disclosure. [Figure 5E] FIG. 2 illustrates a block partition in a multi-type tree structure according to an example of the present disclosure. [Figure 6A] FIG. 1 illustrates a diagram showing combined inter and intra prediction (CIIP) according to an example of the present disclosure. [Figure 6B]FIG. 1 illustrates a diagram showing combined inter and intra prediction (CIIP) according to an example of the present disclosure. [Figure 6C] FIG. 1 illustrates a diagram showing combined inter and intra prediction (CIIP) according to an example of the present disclosure. [Figure 7A] 1 is a flowchart of an MPM candidate list generation process according to an example of the present disclosure. [Figure 7B] 1 is a flowchart of an MPM candidate list generation process according to an example of the present disclosure. [Figure 8] FIG. 1 illustrates a workflow of an existing CIIP design in VVC according to an example of the present disclosure. [Figure 9] FIG. 1 illustrates a workflow of the proposed CIIP method by removing BDOF according to an example of the present disclosure. [Figure 10] FIG. 1 illustrates a workflow of a single-prediction-based CIIP that selects a prediction list based on POC distance according to an example of the present disclosure. [Figure 11A] 1 is a flowchart of a method when enabling a CIIP block for MPM candidate list generation according to an example of the present disclosure. [Figure 11B] 1 is a flowchart of a method for disabling a CIIP block for MPM candidate list generation according to an example of the present disclosure. [Figure 12] FIG. 1 illustrates a computing environment coupled with a user interface according to an example of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0011] Reference will now be made in detail to examples of the present disclosure, examples of which are illustrated in the accompanying drawings. Unless otherwise noted, the same numbers in different drawings represent the same or similar elements in the accompanying drawings. The embodiments described in the following description of examples of the present disclosure are consistent with the present disclosure. These do not represent all embodiments that may be implemented in accordance with the present invention. Instead, they are provided in accordance with the appended claims. are merely examples of apparatus and methods consistent with aspects related to the present disclosure described herein. do.

[0012] The terminology used in this disclosure is for the purpose of describing particular embodiments only. It is not intended to limit the disclosure. As used herein, the singular forms "a," "an," and "the" may be used interchangeably unless clearly indicated by context. The term "and / or" is intended to include the plural, if any. A term is any or all possible combinations of one or more of the associated listed items. It should also be understood that the term "combination" is intended to mean and include.

[0013] Herein, terms such as "first," "second," and "third" may be used to describe various pieces of information. However, it should be understood that the information should not be limited by these terms. These terms are used only to distinguish one category of information from another. For example, the first information may be referred to as the second information without departing from the scope of this disclosure. Similarly, the second information may be referred to as the first information. where applicable, the word "if" may be used interchangeably with "when" or "in the event of" or "when may be understood to mean "at discretion."

[0014] The first version of the HEVC standard was completed in October 2013 and is the latest version of the HEVC standard. Approximately 50% lower bit rate than the H.264 / MPEG AVC decoding standard The HEVC standard offers significant coding savings or equivalent perceptual quality over its predecessor. It offers improved coding, but adding coding tools to HEVC makes it even better. Based on this, there is evidence that VCEG and MPE can achieve similar coding efficiency. Both G and G are new coding technologies for future video coding standards. We have begun research into advanced technology that will enable significant improvements in coding efficiency. In order to start a major study on this, the ITU-TVECG and ISO / IE C MPEG formed a Joint Video Exploration Team (JVET) One reference software, called the Joint Exploration Model (JEM), is the HEVC test model. By integrating some additional coding tools on top of Dell (HM), JVE It was maintained by T.

[0015] In October 2017, a joint call for proposals was made for video compression with capabilities beyond HEVC. The CfP was published by ITU-T and ISO / IEC. At the 10th JVET meeting, 23 CfP responses were received and evaluated, outperforming HEVC by about 40%. Based on these evaluation results, JVET has decided to develop a compression efficiency gain of 100% for Versatile. To develop a new generation video coding standard called eVideo Coding (VVC). In the same month, the company launched a new project to demonstrate a reference implementation of the VVC standard. A single reference software code base called the VVC Test Model (VTM) has been established. It was done.

[0016] Like HEVC, VVC is a block-based hybrid video coding framework. Figure 1 (explained below) shows a typical block-based A block diagram of a hybrid video coding system is given. The input video signal is divided into blocks (codes). In VTM-1.0, the C U can be up to 128x128 pixels, but only based on the quadtree. Unlike HEVC, which divides blocks based on quad / binary / ternary, VVC To accommodate various local characteristics based on the tree, a single coding tree unit is used. A CTU is divided into CUs. In addition, multiple partitions in HEVC The concept of unit types has been removed, i.e. CU, prediction unit (PU) and transform unit The separation of the CU (TU) no longer exists in the VVC; instead, each CU always has an additional partition. It is used as the basic unit for both prediction and transformation without any partitioning. Multi-type tree structure In this example, a CTU is first partitioned using a quadtree structure. Then, each quad The tree leaf nodes can be further partitioned into binary and ternary tree structures. As shown in Figures 5A, 5B, 5C, 5D, 5E (described below), , respectively, four-way partitioning, horizontal binary partitioning, and vertical binary partitioning. partitioning, horizontal ternary partitioning, and vertical ternary partitioning. There is a split type.

[0017] In FIG. 1 (described below), spatial and / or temporal prediction can be performed. Spatial prediction (or "intra prediction") is the process of predicting the time course of an already existing video image / slice. Pixels from the samples of the neighboring blocks (called reference samples) that are The current video block is predicted using spatial prediction, which is inherent to the video signal. Reduce redundancy. Temporal prediction (also called "inter-prediction" or "motion compensated prediction"). ) uses reconstructed pixels from a previously coded video image to Temporal prediction is a method to reduce the temporal redundancy inherent in video signals. The temporal prediction signal for a particular CU is usually determined by the motion between the current CU and its temporal reference. The motion vectors are signaled by one or more motion vectors (MVs) that indicate the amount and direction of motion. Also, if multiple reference images are supported, one reference image index is This means that the temporal prediction signal comes from which reference picture in the reference picture store. After spatial and / or temporal prediction, the encoder The mode decision block in the The prediction block is then subtracted from the current video block to obtain the prediction residual. The difference is decorrelated using a transform and quantization.

[0018] The quantized residual coefficients are inverse quantized and inverse transformed to form a reconstructed residual, which is then The deblocking filter is added to the predicted block to form the reconstructed signal of the CU. , Sample Adaptive Offset (SAO), Adaptive In-Loop Filter Further in-loop filtering, such as ALF, can be implemented by storing the reference image in a future image store. It can be applied to the reconstructed CU before it is used to code the next video block. To form the input video bitstream, the coding mode (inter or inter) tra), prediction mode information, motion information, and quantized residual coefficients are all entropy-dependent. - The encoded data is sent to the coding unit, where it is further compressed and packed to produce a bitstream. Form.

[0019] FIG. 2 (described below) shows a general block diagram of a block-based video decoder. The video bitstream is first entropy decoded by the entropy decoding unit. The coding mode and prediction information are stored in the spatial prediction unit (intra-coded the temporal prediction unit (if inter-coded) ) to form a prediction block. The residual transform coefficients are then sent to the inverse quantization unit. The prediction block and the residual block are then sent to the inverse transform unit to reconstruct the residual block. The difference blocks are added together. The reconstructed blocks are stored in the reference image store. Before the reference image stream is processed, it can go through an additional in-loop filtering. The reconstructed video in the image is then sent to drive a display device. It is also used to predict future video blocks.

[0020] FIG 1 shows a typical encoder 100. The encoder 100 receives a video input 110, Motion compensation 112, motion estimation 114, intra / inter mode decision 116, block prediction 140, adder 128, transform 130, quantization 132, prediction related information 142, intra prediction measurement 118, image buffer 120, inverse quantization 134, inverse transform 136, adder 126, memory 124, the in-loop filter 122, the entropy coding 138, and the bitstream The optical fiber 140 has a stream 144.

[0021] FIG. 2 shows a block diagram of an exemplary decoder 200. The decoder 200 Ream 210, entropy decoding 212, inverse quantization 214, inverse transform 216, adder 2 18, intra / inter mode selection 220, intra prediction 222, memory 230, A loop filter 228, a motion compensation 224, an image buffer 226, prediction related information 234, and and a video output 232.

[0022] FIG. 3 illustrates an example for generating a combined inter-and-intra prediction (CIIP) according to the present disclosure. An exemplary method 300 is shown.

[0023] In step 310, a first reference image and a second reference image associated with the current prediction block are Get two reference images, where the first is before the current image in display order and the second is before the current image in display order. The reference image is after the current image in display order.

[0024] In step 312, the current prediction block is converted to a reference block in the first reference image. A first prediction L0 is obtained based on the first motion vector MV0.

[0025] In step 314, the current prediction block is converted to a reference block in the second reference image. A second prediction L1 is obtained based on the second motion vector MV1.

[0026] JPEG0007676485000001.jpg55161

[0027] JPEG0007676485000002.jpg32161

[0028] FIG. 4 illustrates an exemplary method for generating a CIIP according to the present disclosure. The method uses uni-prediction based inter prediction and MPM based inter prediction to generate a CIIP. Intra prediction is included.

[0029] In step 410, the reference image list associated with the current prediction block is A reference image is obtained.

[0030] In step 412, a first motion vector is calculated based on the first motion vector from the current image to the first reference image. Based on this, an inter prediction is generated.

[0031] In step 414, the intra-prediction mode associated with the current prediction block is Get it.

[0032] In step 416, an intra prediction of the current prediction block is performed based on the intra prediction. Generate measurements.

[0033] In step 418, the current Generate a final prediction for the predicted block.

[0034] In step 420, the current prediction block is selected based on the most probable mode (MPM). For the base intra-mode prediction, we consider whether it is inter-mode or intra-mode. Identify how the information will be treated.

[0035] FIG. 5A illustrates a block quaternary partition in a multi-type tree structure according to an example of the present disclosure. A diagram showing this division is shown.

[0036] FIG. 5B illustrates a block vertical binary partition in a multi-type tree structure according to an example of the present disclosure. A diagram showing the partition is shown.

[0037] FIG. 5C illustrates a block horizontal binary partition in a multi-type tree structure according to an example of the present disclosure. A diagram showing the partition is shown.

[0038] FIG. 5D illustrates a block vertical ternary partition in a multi-type tree structure according to an example of the present disclosure. A diagram showing the partition is shown.

[0039] FIG. 5E illustrates a block horizontal ternary partition in a multi-type tree structure according to an example of the present disclosure. A diagram showing the partition is shown.

[0040] Combined inter and intra prediction As shown in FIG. 1 and FIG. 2, the inter and intra prediction methods are used in the hybrid video coding. Here, each PU is used in a multi-threading scheme, either in the time domain or the spatial domain. Only the 3D model allows the user to choose between inter prediction or intra prediction to exploit the correlation. However, as pointed out in previous literature, the inter-prediction block The residual signals generated by the inter- and intra-prediction blocks have very different characteristics from each other. Therefore, if the two types of predictions could be efficiently combined, In order to reduce the energy of the prediction residual and improve the coding efficiency, another positive Moreover, in natural video content, the motion of moving objects is predicted For example, old content (e.g. previously coded objects contained in the image) and new content (e.g. previously There may be areas that contain both the In such a scenario, both inter and intra predictions are performed using one of the current blocks. cannot provide an accurate forecast of

[0041] To further improve prediction efficiency, the VVC standard includes a merge mode for coding. Hybrid inter-and-inter prediction combines intra and inter prediction for a single grouped CU. In particular, for each merge CU, one additional flag is added. The signaling flag is used to indicate whether CIIP is enabled for the current CU. For the luminance component, CIIP supports three modes: planar mode, DC mode, horizontal Supports four frequently used intra modes, including color mode, vertical mode, and saturation mode. For each component, DM (i.e., chroma is the same intramodulation of the luminance component) The CI (reuse of existing CIs) is always applied without additional signaling. In the IP design, weighted average is applied to the inter prediction samples of one CIIP CU. and intra prediction samples are combined. Specifically, planar mode or DC mode is selected. If both are present, then equal weights (i.e. 0.5) are applied. (That is, either horizontal mode or vertical mode is applied.) The current CU is first Four equally sized regions horizontally (for horizontal mode) or vertically (for vertical mode) is divided into

[0042] JPEG0007676485000003.jpg60161

[0043] In addition, in the current VVC operation specification, the intra mode of one CIIP CU is the most Through the MPM mechanism, the neighboring CIIP CUs In particular, each CI can be used as a predictor to predict the trajectory. For an IP CU, if its neighboring block is also a CIIP CU, The intra-modes of the adjacent blocks are first divided into planar mode, DC mode, horizontal mode, and rounded to the closest mode in the vertical mode, then the MPM candidate list of the current CU However, when configuring the MPM list for each intra-CU, its neighbors are added to the One of the blocks is considered unavailable if it is coded in CIIP mode. That is, the intra mode of one CIIP CU is the same as the intra mode of its neighboring intra CUs. Figures 7A and 7B (described below) are not allowed to predict the intra-mode. ,Compare the MPM list generation process of intra-CU and CIIP CU.

[0044] JPEG0007676485000004.jpg72162

[0045] JPEG0007676485000005.jpg84163

[0046] JPEG0007676485000006.jpg137163

[0047] JPEG0007676485000007.jpg61163

[0048] Here, shift and o offset are 15-BD and 1≪(14-BD)+2·(1≪13 ), which is the right shift value applied to combine the L0 and L1 prediction signals in bi-prediction. and the offset value.

[0049] FIG. 6A is a diagram illustrating a combined inter and intra prediction in horizontal mode according to an example of the present disclosure. show.

[0050] FIG. 6B is a diagram illustrating a combined inter and intra prediction in vertical mode according to an example of the present disclosure. show.

[0051] FIG. 6C illustrates a combined inter and intra prediction for planar and DC modes according to an example of the present disclosure. A diagram showing the measurement is shown.

[0052] FIG. 7A illustrates a flowchart of an MPM candidate list generation process for intra-CUS according to an example of the present disclosure. A flow chart is shown.

[0053] FIG. 7B illustrates a flowchart of an MPM candidate list generation process of a CIIP CU according to an example of the present disclosure. A flow chart is shown.

[0054] Improvements to CIIP CIIP can improve the efficiency of conventional motion compensation prediction, but its design needs to be further refined. Specifically, the existing CIIP design in VVC can be improved to The following problems have been identified in this disclosure:

[0055] First, as explained in the "Combined Inter and Intra Prediction" section, CIIP is To combine inter and intra prediction samples, each CIIP CU The prediction signal needs to be generated using the neighboring samples generated by one CII. This means that the decoding of a P CU depends on the perfect reconstruction of its neighboring blocks. Due to this interdependence, in actual hardware implementation, CIIP is It must be performed during the reconstruction stage, when the reconstructed samples become available for intra prediction. The decoding of the CUs during the reconstruction phase must be performed sequentially (i.e., one after the other). Therefore, the calculation operations involved in the CIIP process (e.g., multiplication, addition, bit shift ) should not be too high to ensure sufficient throughput for real-time decoding. It is not possible to do so.

[0056] As mentioned in the "Bidirectional Optical Flow" section, BDOF is the forward and One inter-coded block is generated from two reference blocks from both backward time directions. This is enabled so that the prediction quality is improved when a CU that has been selected is predicted. As shown in the explanation, in the current VVC, BDOF is also Considering the additional complexity of BDOF, Such a design allows hardware codec encoding / decoding when CIIP is enabled. Decoding throughput may be significantly reduced.

[0057] Second, in the current CIIP design, one CIIP CU is a double-predicted When referring to a merge candidate, generate motion compensation prediction signals for both lists L0 and L1. If one or more MVs are not integer precision, partial sampling is required. To interpolate the samples at the pixel positions, an additional interpolation process must be invoked. Such a process not only increases computational complexity, but also requires more access from external memory. It also increases memory bandwidth when reference samples need to be accessed.

[0058] Then, as discussed in the "Combined Inter- and Intra-Prediction" section, the current CI In IP design, the intra mode of CIIP CU and the intra mode of intra CU are , are treated differently when constructing the MPM lists of their neighbors. If one current CU is coded in CIIP mode, its neighbors A CIIP CU is considered intra, i.e., it is not considered to be intra-modeled by neighboring CIIP CUs. A node can be added to the MPM candidate list, provided that the current CU is in intra-mode. If the CIIP CU is coded in the CIIP CU, the adjacent CIIP CU is considered as an inter- That is, the intra mode of the neighboring CIIP CU is excluded from the MPM candidate list. Such non-uniform designs are not optimal for the final version of the VVC standard. It's possible that it isn't.

[0059] FIG. 8 illustrates a workflow of an existing CIIP design in a VVC according to an example of the present disclosure. A diagram showing the above is shown.

[0060] Simplifying CIIP This disclosure uses existing CIIP designs to facilitate hardware codec implementation. In general, the main aspects of the technology proposed in this disclosure are The report is summarized as follows:

[0061] First, to improve the CIIP coding / decoding throughput, It is proposed to exclude the BDOF from the generation of inter prediction samples in the frame.

[0062] Second, to reduce computational complexity and memory bandwidth consumption, we use a single CIIP When a CU is bi-predicted (i.e., has both L0 and L1 MVs), For this, we convert the block from bi-predictive to uni-predictive to generate inter-predicted samples. A method is proposed.

[0063] Then, the two methods use intra-block MPM candidates when forming MPM candidates for neighboring blocks. It is proposed to harmonize the intra-modes of CU and CIIP.

[0064] CIIP without BDOF As pointed out in the "Problem Statement" section, BDOF is a When U is bi-predicted, we use Due to the additional complexity of BDOF, the existing CIIP design The encoding / decoding throughput can be significantly reduced, especially in Time decoding may be difficult for VVC decoders. On the other hand, CIIP For a CU, its final predicted sample is a combination of inter-predicted and intra-predicted samples. In other words, the improved prediction sample by BDOF is generated by averaging the The pull is not directly used as a prediction signal for the CIIP CU. Therefore, the conventional dual prediction Compare with the measured CU (where the BDOF is directly applied to generate the predicted samples) As a result, the corresponding improvement obtained from BDOF is less efficient in the CIIP CU. Therefore, based on the above circumstances, when generating inter prediction samples in CIIP mode, It is proposed to disable BDOF in the future. Figure 9 (described below) shows the result without BDOF. The corresponding workflow of the proposed CIIP process is shown below.

[0065] FIG. 9 illustrates a proposed CIIP method by removing BDOF according to an example of the present disclosure. A diagram showing the workflow is shown.

[0066] CIIP based on single forecast As mentioned above, a merge candidate referenced by one CIIP CU is double predicted. Sometimes, we generate both L0 and L1 prediction signals to predict samples in a CU. In order to reduce the bandwidth and complexity of the interpolation, in one embodiment of the present disclosure, of inter-predicted samples generated using single prediction (even if The CIIP mode is used to combine with the intra prediction samples. Specifically, when the current CIIP CU is single prediction, the inter prediction samples are It is directly combined with the intra predicted samples. Otherwise (i.e. the current CU is In the case where the prediction is performed, the inter-prediction samples used by CIIP are It is generated based on a single prediction from a list (L0 or L1). Select the prediction list. There are various methods that can be applied to the first method. For any CIIP block, we always select the first prediction (i.e., list L0). It has been proposed that:

[0067] In the second method, for any CIIP block predicted by two reference images, , it is proposed to always select the second prediction (i.e., list L1). One adaptive method is to find the image with a small picture order count (POC) distance from the current image. This is applied when the prediction list associated with the reference image of is selected. (described in) is a single-prediction based CIIP that selects a list of predictions based on POC distance. The workflow is shown.

[0068] Finally, the last method uses CIIP mode only if the current CU is uni-predicted. It is proposed to enable CII to reduce overhead. The signaling of the enable / disable flag of P depends on the prediction direction of the current CIIP CU. If the current CU is uni-predicted, the CIIP flag is set in the bitstream. Signaled to indicate whether CIIP is enabled or disabled. In this case, the signaling of the CIIP flag is skipped and the is always inferred to be false, that is, CIIP is always disabled.

[0069] FIG. 10 illustrates a single-predictor system for selecting a prediction list based on POC distance according to an example of the present disclosure. A diagram showing the workflow of measurement-based CIIP is shown.

[0070] Harmonizing Intra-CU and Intra-Mode of CIIP for Constructing MPM Candidate List As mentioned above, the current CIIP design is based on the intra-CU and intra-CIIP CU. Regarding how to form MPM candidate lists of those neighboring blocks using the mode, Specifically, in both intra-CU and intra-CIIP CU modes, can predict the intra mode of adjacent blocks coded in CIIP mode. However, only the intra mode of the intra CU can predict the intra mode of the intra CU. Another unified design is to use two methods: Harmonize the usage of Intra-CU and Intra-CIIP modes for configuration and modify this section. This is proposed in the

[0071] The first method treats the CIIP mode as an inter mode for the purposes of MPM list configuration. Specifically, it is proposed that one CIIP CU or one intra-CU When generating any of the MPM lists, the adjacent blocks are coded in CIIP mode. If the block is in the in-frame mode, the intra mode of the neighboring block is marked as disabled. In this way, the MPM list is configured using the intra mode of the CIIP block. Conversely, in the second method, the CIIP mode cannot be used for MPM list configuration. It is proposed to treat CII as an intra mode. In the PCU intra mode, both adjacent CIIP blocks and intra blocks Intra-mode prediction is possible. Figures 11A and 11B (described below) show the two methods above. 1 shows the MPM candidate list generation process when

[0072] Other embodiments of the present disclosure may be contemplated in light of the specification and practice of the present disclosure disclosed herein. This application is based on its general principles and is not intended to be limiting unless otherwise specified. Any modification, use, or adaptation of this disclosure, including any departure from the present disclosure that is within the scope of the present disclosure or customary practice, is hereby expressly incorporated by reference in its entirety. The true scope and spirit of the present disclosure is intended to cover any applicable international patent application, including, but not limited to, the following US Pat. It is intended that the specification and examples be considered as exemplary only, as indicated by the claims. It has been done.

[0073] The present disclosure is not limited to the specific examples described above and illustrated in the accompanying drawings, It is understood that various modifications and changes can be made without departing from the scope of the present invention. The scope of the present disclosure is intended to be limited only by the claims appended hereto. do.

[0074] FIG. 11A illustrates a block diagram of a CIIP block for MPM candidate list generation according to an example of the present disclosure. 1 shows a flowchart of an enabling method.

[0075] FIG. 11B illustrates a block diagram of a CIIP block for MPM candidate list generation according to an example of the present disclosure. 1 shows a flowchart of a method for disabling.

[0076] FIG. 12 illustrates a computing environment 1260 coupled with a user interface 1260. 10. The computing environment 1210 may be part of a data processing server. The computing environment 1210 includes a processor 1220, memory 1240, and I / O. O interface 1250.

[0077] The processor 1220 typically handles functions related to display, data acquisition, data communication, and image processing. The processor controls the overall operation of the computing environment 1210, such as the operation of 1220 executes instructions for performing all or some of the steps of the above method. The processor 1220 may include one or more processors. It may include one or more circuits that facilitate interaction between 220 and other components. A processor is a central processing unit (CPU), a microprocessor, or a single chip machine. It could be a GPU, a processor, etc.

[0078] The memory 1240 includes various components for supporting the operation of the computing environment 1210. The device is configured to store various types of data. Examples of such data include computer Any application or method operating in the computing environment 1210 may include instructions, video, and / or other information. The memory 1240 may include any type of volatile or non-volatile memory. a static memory device, or a combination thereof, such as a static random access memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM) , Erasable Programmable Read Only Memory (EPROM), Programmable Read Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), Magnetic Memory, Flash Memory This can be accomplished using a memory, a magnetic disk, or an optical disk.

[0079] The I / O interface 1250 is connected to the processor 1220 and to a keyboard, click hole, and other Provides an interface between the peripheral interface modules such as wheels and buttons. The buttons include a home button, a start scan button, and a stop scan button. The I / O interface 1250 includes, but is not limited to, an encoder. and a decoder.

[0080] In one embodiment, in order to perform the methods described above, a computing environment 1210 A plurality of programs, such as those included in the memory 1240, that are executable by the processor 1220 of the A non-transitory computer readable storage medium containing the program is also provided. The computer readable storage medium may include ROM, RAM, CD-ROM, magnetic tape, floppy disk, etc. The optical disk may be a hard disk, an optical data storage device, etc.

[0081] The non-transitory computer-readable storage medium may be implemented as a computer having one or more processors. It stores therein a number of programs for execution by a computing device. The programs, when executed by one or more processors, The operating device executes the method for motion prediction described above.

[0082] In one embodiment, the computing environment 1210 is configured to perform the above-described methods. , one or more application specific integrated circuits (ASICs), digital signal processors (DS P), Digital Signal Processing Devices (DSPD), Programmable Logic Devices (PL D), Field Programmable Gate Array (FPGA), Graphical Processing Graphics Processing Unit (GPU), Controller, Microcontroller, Microprocessor The device may be implemented using a 32-bit or 64-bit digital processor or other electronic components.

Claims

1. Obtaining a video bitstream; generating an inter prediction of a current coding block from the video bitstream based on at least one motion vector from a current picture to at least one respective reference picture in a reference picture list; generating an intra prediction of the current coding block from the video bitstream based on an intra prediction mode; generating a final prediction of the current coding block by weighted averaging the inter prediction and the intra prediction; identifying the current coding block to be treated as an inter mode when constructing a most probable mode (MPM) list of neighboring coding blocks and marking the intra mode of the current coding block as unavailable; A method of video decoding comprising: A method of video decoding, wherein bidirectional optical flow (BDOF) operations are disabled for the current coding block.

2. The method of claim 1 , wherein when the current coding block is predicted from one reference picture in the reference picture list L0, the reference picture list is L0.

3. The method of claim 1 , wherein when the current coding block is predicted from one reference picture in the reference picture list L1, the reference picture list is L1.

4. 2. The method of claim 1, wherein the reference picture list is L0 when the current coding block is predicted from one first reference picture in the reference picture list L0 and one second reference picture in the reference picture list L1.

5. 2. The method of claim 1, wherein the reference image list is L1 when the current coding block is predicted from one first reference image in the reference image list L0 and one second reference image in the reference image list L1.

6. The method of claim 1, wherein the reference image list is associated with one reference image that has a smaller picture order count (POC) distance to the current image when the current coding block is predicted from a first reference image in the reference image list L0 and a second reference image in the reference image list L1.

7. The method of claim 1 , wherein the intra-prediction mode is a PLANAR mode.

8. A video decoding device comprising one or more processors and one or more storages coupled to said one or more processors, the video decoding device being configured to perform the method of any one of claims 1 to 7.

9. A non-transitory computer-readable storage medium storing a number of programs for execution by a computing device having one or more processors, comprising: A non-transitory computer readable storage medium, wherein the plurality of programs, when executed by the one or more processors, cause the computing device to perform a method according to any one of claims 1 to 7 to process a video bitstream and store the processed video bitstream in the non-transitory computer readable storage medium.

10. A computer program product enabling a computer to carry out the steps of the method of any one of claims 1 to 7.

11. A method for signal processing of a bitstream by a video decoding device, comprising the steps of: The video decoding device Obtaining a video bitstream; generating an inter prediction of a current coding block from the video bitstream based on at least one motion vector from a current picture to at least one respective reference picture in a reference picture list; generating an intra prediction of the current coding block from the video bitstream based on an intra prediction mode; generating a final prediction of the current coding block by weighted averaging the inter prediction and the intra prediction; identifying the current coding block to be treated as an inter mode when constructing a most probable mode (MPM) list of neighboring coding blocks, and marking the intra mode of the current coding block as unavailable; Bidirectional optical flow (BDOF) operations are disabled for the current coding block; A method for processing a bitstream signal comprising:

Images