WO2022016535A1

WO2022016535A1 - Video coding and decoding method and device

Info

Publication number: WO2022016535A1
Application number: PCT/CN2020/104529
Authority: WO
Inventors: 缪泽翔; 郑萧桢
Original assignee: 深圳市大疆创新科技有限公司
Priority date: 2020-07-24
Filing date: 2020-07-24
Publication date: 2022-01-27
Also published as: CN112970252A

Abstract

A video coding and decoding method and device. The video coding method comprises: if a prediction block pointed by a motion vector of the current image block is located on a tile boundary of a reference frame, adjusting the position of the prediction block so that the prediction block is located inside a tile of the reference frame, thus when tile boundary filtering is not performed at a coding end and tile boundary filtering is performed at a decoding end, a pixel value of a prediction block referenced by a coding end during coding and a pixel value of a prediction block referenced by a decoding end during decoding can be kept consistent, and the current image block is located at the current frame; and coding the current image block on the basis of the adjusted prediction block. According to the solution in the present application, the prediction block pointed by the motion vector of the current image block is adjusted to the interior of the tile, so that the complexity of an encoder can be further reduced, and the image quality deterioration caused by a block boundary effect generated by the image at the tile boundary can be avoided.

Description

Method and device for video coding and decoding

technical field

The present application relates to the field of image processing, and more particularly, to a video coding and decoding method and apparatus.

Background technique

At present, in practical applications, due to the rising demand for video resolution and frame rate, the single-core hardware encoder can no longer meet the demand, and the multi-core hardware encoder can provide higher encoding performance, which can meet higher Resolution and frame rate requirements. A multi-core hardware encoder usually divides an image or video into multiple tiles, and each core is responsible for encoding and decoding one or more of the tiles.

Since the image is divided into multiple cores for encoding, more obvious boundary block effects are likely to occur at the divided boundaries of the image, resulting in poor image display quality and reduced video viewing experience for users. In the High Efficiency Video Coding (HEVC) standard, the information and function switches related to image sub-tiles are stored in the Picture Parameter Set (PPS). Switch loop_filter_across_tiles_enabled_flag for filtering at boundaries. In response to the above problems, in an implementation manner, loop_filter_across_tiles_enabled_flag can be set to 1, that is, filtering is performed on the Coding Tree Unit (CTU) of the tile boundary, but this method will be performed at the tile boundary because of the need. More data exchange leads to an additional increase in the implementation complexity of the encoder; in another implementation, you can choose to set loop_filter_across_tiles_enabled_flag to 0, that is, no filtering is performed on the tile boundary, but the decoded image is at the tile boundary. There may be obvious block boundary effects where the subjective quality is degraded. Because the code stream is completely consistent with the encoder and the decoder, when loop_filter_across_tiles_enabled_flag is 1, both the encoder and decoder will perform tile boundary filtering operations; when loop_filter_across_tiles_enabled_flag is 0, neither the encoder nor the decoder will perform tile boundary filtering. filter operation.

Therefore, how to eliminate the boundary block effect caused by different kernels encoding different images in the same video and reduce the complexity of the encoder has become an urgent problem to be solved.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a video encoding and decoding method and apparatus, which can realize that not only the loop_filter_across_tiles_enabled_flag is set to 1, but tile boundary filtering is not performed at the encoding end to reduce the complexity of the encoder, and tile boundary filtering is performed at the decoding end so that the The subjective quality is relatively not reduced, which solves the defects and deficiencies existing in the simultaneous filtering of the encoding end and the decoding end in the prior art, and at the same time can ensure that the functions and effects of the reconstructed image at the encoding end and the decoded image at the decoding end are completely the same as the reference frame, and further Because the filtering operation is performed at the decoding end, the potential block effect of the boundary of the decoded image tile can be reduced, and the viewing experience of the user can be improved.

In a first aspect, a video coding method is provided, comprising: if a prediction block pointed to by a motion vector of a current image block is located on a tile boundary of a reference frame, adjusting the position of the prediction block so that the prediction block is The block is located inside the tile of the reference frame, so that when tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the pixel value of the prediction block referenced by the encoding end when encoding and The pixel values of the prediction block referenced by the decoding end during decoding can be kept consistent, and the current image block is located in the current frame; the current image block is encoded based on the adjusted prediction block.

In the video coding method provided by the embodiment of the present application, if the prediction block pointed to by the motion vector of the current image block is located at the tile boundary of the reference frame, the position of the prediction block can be adjusted to the inside of the tile, so that the prediction based on the adjusted prediction block encodes the current image block. Since the prediction block pointed to by the motion vector of the current image block is adjusted to the interior of the tile, all the pixels of the foregoing prediction block are not in the tile boundary filtering area that needs to be filtered, and the coding end can realize that the tile boundary filtering is not performed without the tile boundary filtering. The decoding end performs tile boundary filtering, and does not introduce decoding errors caused by "the encoding end does not perform tile boundary filtering, but the decoding end performs tile boundary filtering", which makes the prediction block of the encoding end inconsistent with the prediction block of the decoding end. Reduce the complexity of the encoder.

In a second aspect, a video encoding apparatus is provided, including a processor and a memory. The memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory to execute the method in the above-mentioned first aspect or each implementation manner thereof.

For the beneficial effects, reference may be made to the description of the above-mentioned first aspect, which is not repeated here for the sake of brevity.

In a third aspect, a chip is provided, including a processing circuit, for implementing the method of the above-mentioned first aspect.

Description of drawings

Fig. 1 is the architecture diagram of applying the technical solution of the embodiment of the present application;

FIG. 2 is a schematic diagram of a video coding framework 2 provided by an embodiment of the present application;

3 is a schematic diagram of deblocking filtering provided by an embodiment of the present application;

4 is a schematic flowchart of an encoding method provided by an embodiment of the present application;

Fig. 5a is a schematic diagram of video division to be encoded provided by an embodiment of the present application;

Fig. 5b is a schematic diagram of video division to be encoded provided by another embodiment of the present application;

Fig. 5c is a schematic diagram of video division to be encoded provided by another embodiment of the present application;

6 is a schematic flowchart of a decoding method provided by an embodiment of the present application;

7 is a schematic diagram of a video coding framework 2 provided by another embodiment of the present application;

8 is a schematic diagram of the information included after the video to be encoded is divided according to an embodiment of the present application;

9a is a schematic diagram of an inter-frame prediction provided by an embodiment of the present application;

FIG. 9b is a schematic diagram of an inter-frame prediction provided by another embodiment of the present application;

9c is a schematic diagram of an inter-frame prediction provided by another embodiment of the present application;

10a is a schematic diagram of a partitioned area of a tile boundary affected by filtering according to an embodiment of the present application;

FIG. 10b is a schematic diagram of a partitioned area of a tile boundary affected by filtering according to another embodiment of the present application;

FIG. 10c is a schematic diagram of a partitioned area of a tile boundary affected by filtering according to another embodiment of the present application;

11a is a schematic diagram of the location of a prediction block provided by an embodiment of the present application;

11b is a schematic diagram of the location of a prediction block provided by another embodiment of the present application;

11c is a schematic diagram of the location of a prediction block provided by another embodiment of the present application;

12a is a schematic diagram of adjusting the position of an original prediction block according to an embodiment of the present application;

12b is a schematic diagram of adjusting the position of an original prediction block according to another embodiment of the present application;

12c is a schematic diagram of adjusting the position of an original prediction block according to another embodiment of the present application;

FIG. 12d is a schematic diagram of adjusting the position of an original prediction block according to still another embodiment of the present application;

Fig. 12e is a kind of schematic diagram of adjusting the position of the original prediction block provided by another embodiment of the present application;

13 is a schematic diagram of a video encoding apparatus provided by an embodiment of the present application;

14 is a schematic diagram of a video decoding apparatus provided by an embodiment of the present application;

15 is a schematic structural diagram of a video encoding and decoding apparatus provided by an embodiment of the present application;

FIG. 16 is a schematic structural diagram of a chip provided by an embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present application are described below.

Unless otherwise specified, all technical and scientific terms used in the embodiments of the present application have the same meaning as commonly understood by those skilled in the technical field of the present application. The terminology used in this application is for the purpose of describing specific embodiments only and is not intended to limit the scope of the application.

FIG. 1 is an architectural diagram of applying the technical solution of the embodiment of the present application.

As shown in FIG. 1 , the system 100 may receive data 102 to be processed, process the data 102 to be processed, and generate processed data 108 . For example, system 100 may receive data to be encoded and encode the data to be encoded to generate encoded data, or system 100 may receive data to be decoded and decode the data to be decoded to generate decoded data. In some embodiments, components in system 100 may be implemented by one or more processors, which may be processors in computing devices or processors in mobile devices (eg, drones). The processor may be any type of processor, which is not limited in this embodiment of the present invention. In some possible designs, the processor may include an encoder, a decoder, or a codec, among others. One or more memories may also be included in system 100 . The memory may be used to store instructions and data, for example, computer-executable instructions, data to be processed 102 , processed data 108 , etc. that implement the technical solutions of the embodiments of the present invention. The memory may be any type of memory, which is also not limited in this embodiment of the present invention.

The data to be encoded may include text, images, graphic objects, animation sequences, audio, video, or any other data that needs to be encoded. In some cases, the data to be encoded may include sensory data from sensors, which may be visual sensors (eg, cameras, infrared sensors), microphones, near-field sensors (eg, ultrasonic sensors, radar), position sensors, temperature sensor, touch sensor, etc. In some cases, the data to be encoded may include information from the user, eg, biometric information, which may include facial features, fingerprint scans, retinal scans, voice recordings, DNA sampling, and the like.

FIG. 2 is a schematic diagram of a video coding framework 2 according to an embodiment of the present application. As shown in Figure 2, after receiving the video to be encoded, starting from the first frame of the video to be encoded, each frame of the video to be encoded is encoded in sequence. Among them, the current coded frame mainly undergoes: prediction (Prediction), transformation (Transform), quantization (Quantization) and entropy coding (Entropy Coding), etc., and finally outputs the code stream of the current coded frame. Correspondingly, the decoding process usually decodes the received code stream according to the inverse process of the above process, so as to recover the video frame information before decoding.

Specifically, as shown in FIG. 2 , the video coding framework 2 includes a coding control module 201 for performing decision control actions and parameter selection in the coding process. For example, as shown in FIG. 2, the encoding control module 201 controls parameters used in transformation, quantization, inverse quantization, and inverse transformation, controls selection of intra-frame mode or inter-frame mode, and parameter control of motion estimation and filtering, And the control parameters of the encoding control module 201 will also be input into the entropy encoding module to be encoded to form a part of the encoded code stream.

When the coding of the current coded frame is started, the coded frame is divided 202, and specifically, the coded frame is divided into slices first, and then divided into blocks. Optionally, in an example, the coded frame is divided into a plurality of non-overlapping largest CTUs, and each CTU can also be iteratively divided into a series of smaller codes in a quad-tree, binary-tree, or ternary-tree manner. A unit (Coding Unit, CU), in some examples, a CU may also include a prediction unit (Prediction Unit, PU) and a transform unit (Transform Unit, TU) associated with it, where PU is the basic unit of prediction, and TU is the transform and basic units of quantification. In some examples, PUs and TUs are obtained by dividing into one or more blocks on the basis of CUs, wherein one PU includes multiple prediction blocks (Prediction Blocks, PBs) and related syntax elements. In some examples, the PU and the TU may be the same, or may be obtained by the CU through different partitioning methods. In some examples, at least two of the CUs, PUs, and TUs are the same, eg, CUs, PUs, and TUs are not distinguished, and all are predicted, quantized, and transformed in units of CUs. For the convenience of description, hereinafter, the CTU, CU or other formed data units are referred to as coding blocks.

It should be understood that, in this embodiment of the present application, a data unit targeted for video coding may be a frame, a slice, a coding tree unit, a coding unit, a coding block, or a group of any of the above. In different embodiments, the size of the data unit may vary.

Specifically, as shown in FIG. 2 , after the coded frame is divided into multiple coding blocks, a prediction process is performed to remove redundant information in the spatial and temporal domains of the current coded frame. Currently, the commonly used predictive coding methods include intra-frame prediction and inter-frame prediction. Intra-frame prediction only uses the reconstructed information in this frame to predict the current coding block, while inter-frame prediction uses the information in other frames (also called reference frames) that have been reconstructed before to predict the current coding block. Make predictions. Specifically, in this embodiment of the present application, the encoding control module 201 is configured to decide whether to select intra-frame prediction or inter-frame prediction.

When the intra-frame prediction mode is selected, the process of intra-frame prediction 203 includes obtaining the reconstructed block of the coded adjacent blocks around the current coding block as a reference block, and using the prediction mode method to calculate the prediction value based on the pixel value of the reference block to generate the prediction block. , the corresponding pixel values of the current coding block and the prediction block are subtracted to obtain the residual of the current coding block. The residual of the current coding block is transformed 204 , quantized 205 and entropy encoded 210 to form the code stream of the current coding block. Further, after all the coded blocks of the current coded frame are subjected to the above coding process, a part of the coded code stream of the coded frame is formed. In addition, the control and reference data generated in the intra prediction 203 are also encoded by entropy encoding 210 to form part of the encoded code stream.

Specifically, the transform 204 is used to de-correlate the residuals of image blocks in order to improve coding efficiency. For the transformation of the residual data of the current coding block, two-dimensional discrete cosine transform (Discrete Cosine Transform, DCT) transform and two-dimensional discrete sine transform (Discrete Sine Transform, DST) transform are usually used. Multiply with an N×M transformation matrix and its transposed matrix respectively, and obtain the transformation coefficient of the current coding block after multiplication.

After the transform coefficients are generated, quantization 205 is used to further improve the compression efficiency. The transform coefficients can be quantized to obtain quantized coefficients, and then the quantized coefficients are entropy encoded 210 to obtain the residual code stream of the current encoding block. The entropy encoding method includes: But not limited to content adaptive binary arithmetic coding (Context Adaptive Binary Arithmetic Coding, CABAC) entropy coding. Finally, the bit stream obtained by entropy encoding and the encoded encoding mode information are stored or sent to the decoding end. At the encoding end, inverse quantization 206 is also performed on the quantized result, and inverse transformation 207 is performed on the inverse quantization result. After the inverse transformation 207, the reconstructed pixels are obtained using the inverse transformation result and the motion compensation result. Afterwards, the reconstructed pixels are filtered (ie loop filtered) 211. After 211, the filtered reconstructed image (belonging to the reconstructed video frame) is output. Subsequently, the reconstructed image can be used as a reference frame image of other frame images for inter-frame prediction. In this embodiment of the present application, the reconstructed image may also be referred to as a reconstructed image or a reconstructed image.

Specifically, the coded adjacent blocks in the process of intra-frame prediction 203 are: adjacent blocks that have been coded before the current coded block is coded, and the residuals generated in the coding process of the adjacent blocks are transformed 204, quantized 205, After inverse quantization 206 and inverse transform 207, the reconstructed block is obtained by adding the prediction block of the adjacent block. Correspondingly, inverse quantization 206 and inverse transform 207 are inverse processes of quantization 206 and transform 204, and are used to restore residual data before quantization and transform.

As shown in FIG. 2 , when the inter prediction mode is selected, the inter prediction process includes motion estimation (Motion Estimation, ME) 208 and motion compensation (Motion Compensation, MC) 209. Specifically, the encoder can perform motion estimation 208 according to the reference frame image in the reconstructed video frame, and search for the image block most similar to the current encoding block in one or more reference frame images as the prediction block according to certain matching criteria, The relative displacement between the prediction block and the current coding block is the motion vector (Motion Vector, MV) of the current coding block. The original value of the pixel of the coding block is subtracted from the pixel value of the corresponding prediction block to obtain the residual of the coding block. The residual of the current coded block is transformed 204, quantized 205 and entropy coded 210 to form a part of the coded code stream of the coded frame. For the decoding end, motion compensation 209 may be performed based on the motion vector and prediction block determined above to obtain the current coding block.

Wherein, as shown in FIG. 2 , the reconstructed video frame is a video frame obtained after filtering 211 . The reconstructed video frame includes one or more reconstructed images. Filtering 211 is used to reduce compression distortions such as blocking and ringing effects during the encoding process. The reconstructed video frame is used to provide reference frames for inter-frame prediction during the encoding process. During the decoding process, the reconstructed video frame is post-processed and output. for the final decoded video.

Specifically, the inter prediction mode may include an advanced motion vector prediction (Advanced Motion Vector Prediction, AMVP) mode, a merge (Merge) mode, or a skip (skip) mode.

For the AMVP mode, the motion vector prediction (MVP) can be determined first. After the MVP is obtained, the starting point of the motion estimation can be determined according to the MVP, and a motion search can be performed near the starting point. After the search is completed, the optimal MV, the position of the reference block in the reference image is determined by the MV, the reference block is subtracted from the current block to obtain the residual block, the MV is subtracted from the MVP to obtain the Motion Vector Difference (MVD), and the difference between the MVD and the MVP is obtained. The index is transmitted to the decoder through the code stream.

For the Merge mode, the MVP can be determined first, and the MVP can be directly determined as the MV of the current block. Among them, in order to obtain the MVP, a MVP candidate list (merge candidate list) can be constructed first. In the MVP candidate list, at least one candidate MVP can be included, and each candidate MVP can have an index corresponding to the MVP candidate list. After the MVP is selected, the MVP index can be written into the code stream, and the decoder can find the MVP corresponding to the index from the MVP candidate list according to the index, so as to decode the image block.

It should be understood that the above process is only a specific implementation manner of the Merge mode. The Merge pattern can also have other implementations.

For example, Skip mode is a special case of Merge mode. After the MV is obtained according to the Merge mode, if the encoder determines that the current block is basically the same as the reference block, it does not need to transmit the residual data, only the index of the MVP needs to be passed, and further a flag can be passed, which can indicate that the current block can be directly Obtained from the reference block.

That is to say, the Merge mode is characterized by: MV=MVP (MVD=0); and the Skip mode has one more feature, namely: the reconstruction value rec=prediction value pred (residual value resi=0).

Merge mode can be applied to geometric prediction techniques. In the geometric prediction technology, the image block to be encoded can be divided into a plurality of sub-image blocks in the shape of a polygon, and a motion vector can be determined for each sub-image block from the motion information candidate list, and based on the The motion vector determines the prediction sub-block corresponding to each sub-image block, and constructs the prediction block of the current image block based on the prediction sub-block corresponding to each sub-image block, so as to realize the encoding of the current image block.

Due to block prediction and transform quantization, the difference in coding parameters between adjacent blocks may lead to Blocking Artifacts in the encoded reconstructed image. , HEVC) standard uses the Deblocking Filter (DBF) technology in the coding loop to improve the subjective quality of the video and the reference efficiency of the reconstructed frame. The function of the DBF technology is to eliminate the block effect caused by the encoding and decoding algorithm by correcting the pixel values of the reconstructed coding block, especially the pixel values near the boundary of the coding block. There are two main steps in DBF, namely, the determination of the filter strength of the block boundary and the filtering of the block boundary pixels.

The filtering sequence of the DBF in HEVC is based on the CTU as the basic unit. As shown in Figure 3, the solid dots in the figure represent pixel points, the solid black line in the figure represents the boundary of the image block to be filtered, and the thicker black dotted box part represents the 8x8 processing block for filtering operation. Each processing block Both span 4 8x8 blocks to be filtered and contain a "+" shaped edge. In this way, the goal of each processing block is to filter the boundary of the "+" shape, and contains all the filtering data required by itself, which allows the filtering operation to perform separate operations on each 8x8 processing block, which is beneficial to HEVC implements parallel filtering operations. Among them, through the DBF technology processing, the pixel values of at most 3 pixels on the left and right sides of the image block boundary can be modified to realize the smooth image block boundary.

For the decoding end, perform operations corresponding to the encoding end. Firstly, the residual information is obtained by entropy decoding, inverse quantization and inverse transformation, and according to the decoded code stream, it is determined whether the current image block uses intra-frame prediction or inter-frame prediction. If it is intra-frame prediction, use the reconstructed image blocks in the current frame to construct prediction information according to the intra-frame prediction method; if it is inter-frame prediction, you need to parse out the motion information, and use the parsed motion information in the reconstructed image. Then, the prediction information and the residual information are superimposed, and the reconstruction information can be obtained through the filtering operation.

In practical applications, due to the rising demand for video resolution and frame rate, the single-core hardware encoder can no longer meet the demand, and the multi-core hardware encoder can provide higher encoding performance, which can meet higher resolution and frame rate requirements. A multi-core hardware encoder usually divides an image or video into multiple tiles, and each core is responsible for encoding one or more of the tiles.

It should be understood that, in this embodiment of the present application, multiple tiles obtained by dividing an image or video may also be referred to as image blocks, which are not specifically limited in the present application.

Since the image is divided into multiple cores for encoding, a more obvious boundary will appear at the divided boundary of the image, thereby reducing the viewing experience of the user.

In view of the above problems, in the first implementation mode, it is possible to choose not to filter the tile boundary at the encoding end and the decoding end, but the decoded image may have obvious block boundary effects at the tile boundary, resulting in poor subjective quality; The second implementation is that you can choose to perform tile boundary filtering on both the encoding end and the decoding end, which can solve the block boundary effect at the tile boundary, but it does not need to be displayed at the encoding end, and performing tile boundary filtering will bring additional The amount of data exchange and calculation increases the complexity of the encoding process.

The present application provides a method for video encoding and video decoding, which can reduce the complexity of the encoder without performing tile boundary filtering at the encoding end, and perform tile boundary filtering at the decoding end so that the subjective quality is relatively not reduced, solving the problem of existing At the same time, it can ensure that the reconstructed image at the encoding end and the decoded image at the decoding end have the same function and effect as the reference frame. Further, because the filtering is performed at the decoding end. The operation can reduce the potential block effect of decoded image tile boundary and improve the user's viewing experience.

The video coding method 400 provided by this embodiment of the present application will be described in detail below with reference to FIG. 4 .

FIG. 4 shows a video coding method 400 provided by an embodiment of the present application. The method may be executed by an encoder, and the method 400 may include steps 410-420.

410. If the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjust the position of the prediction block, so that the prediction block is located inside the tile of the reference frame, thereby so that when tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the pixel value of the prediction block referenced by the encoding end in encoding and the prediction block referenced by the decoding end in decoding The pixel values of , can be kept consistent, and the current image block is located in the current frame.

If step 410 is not performed, when tile boundary filtering is not performed at the encoding end, and tile boundary filtering is performed at the decoding end, when the prediction block is located on the tile boundary, the prediction block and When the decoding end performs decoding, the referenced prediction blocks will be inconsistent, which will lead to decoding errors.

However, in the embodiment of the present invention, since the position-adjusted prediction block is located inside the tile of the reference frame, when tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the encoding end performs the tile boundary filtering. The referenced (position-adjusted) prediction block during encoding is located inside each tile of the reference frame, and because the position information of the prediction block during decoding is exactly the same as the position information of the prediction block at the encoding end, the decoding end uses the same information when decoding. The reference prediction block is also located inside each tile of the reference frame and has nothing to do with the boundary, so as to ensure the consistency of the two, and avoid decoding errors caused by tile boundary filtering at the decoding end without performing tile boundary filtering at the encoding end. In addition, in this embodiment of the present invention, it is not necessary to perform tile boundary filtering at the encoding end, thereby reducing the amount of data exchange and filtering at the encoding end. At the same time, tile boundary filtering is performed at the decoding end, which also prevents the image from generating blocks at the tile boundary. Deterioration of image quality due to boundary effects.

It should be noted that the fact that the prediction block is located inside the tile of the reference frame includes that the prediction block does not overlap with the region that needs to be filtered at the tile boundary of the reference frame. In addition, the adjustment of the prediction block position can be achieved by adjusting the motion vector.

The prediction block in this embodiment of the present application may be one or more reference blocks among multiple reference blocks, and the reference block is located in a reference frame, where the reference frame may be the previous frame and/or the next frame of the current frame , or may be the first few frames and/or the next few frames of the current frame, or may be a fixed frame, which is not specifically limited in this application.

In the embodiment of the present application, the size of the multiple tiles included in the divided reference frame may be the same, that is, when the reference frame is divided, vertical or horizontal division may be performed from the center of the reference frame; the divided reference frame includes The sizes of the plurality of tiles may also be different, that is, when the reference frame is divided, it may not be divided vertically or horizontally from the center of the reference frame.

For example, as shown in FIG. 5a, an embodiment of the present application provides a schematic diagram of image division of a certain frame (which may be a reference frame in the present application) in the video to be encoded. Two tiles can be obtained by horizontally dividing the reference frame, namely tile 1 and tile 2, and each tile is rectangular.

Wherein, each tile may include an integer number of CTUs, and during encoding, different processors may be used to encode tile 1 and tile 2 respectively.

As shown in FIG. 5b , it is a schematic diagram of image division of a certain frame (which may be a reference frame in this application) in a video to be encoded according to another embodiment of the present application. Two tiles can be obtained by dividing the reference frame vertically, namely tile 3 and tile 4, and each tile is rectangular.

Similarly, each tile may include an integer number of CTUs, and during encoding, tile 3 and tile 4 may be encoded separately by different processors.

As shown in FIG. 5c , it is a schematic diagram of image division of a certain frame (which may be a reference frame in this application) in a video to be encoded according to another embodiment of the present application. Four tiles can be obtained by dividing the reference frame vertically and horizontally, namely tile 5, tile 6, tile 7 and tile 8, and each tile is rectangular.

Similarly, each tile may include an integer number of CTUs, and when encoding, tile 5, tile 6, tile 7, and tile 8 may be encoded by different processors, respectively.

It should be understood that the horizontal division in this embodiment of the present application may refer to the division of the image from the horizontal direction, and the vertical division may refer to the division of the image from the vertical direction.

In the embodiment of the present application, if the predicted block pointed to by the determined motion vector of the current image block is located on the tile boundary of the reference frame, the position of the predicted block can be adjusted, that is, the predicted block can be moved in a certain direction Offset so that the moved prediction block is inside the tile of the reference frame.

420. Based on the adjusted prediction block, encode the current image block.

Optionally, in some embodiments, the method further includes enabling the tile boundary filtering during encoding of the current image block.

Optionally, in some embodiments, the enabling the tile boundary filtering includes: setting the tile boundary filtering enable flag in the bitstream data to 1; wherein the tile boundary filtering is enabled The flag bit is located in the picture data set, sequence parameter set, slice header, image header or sequence header of the code stream data.

In this embodiment, the tile boundary filtering is enabled, that is, the tile boundary filtering enable flag bit loop_filter_across_tiles_enabled_flag in the code stream data is set to 1. Wherein, the tile boundary filtering enable flag bit loop_filter_across_tiles_enabled_flag is located in the picture parameter set (Picture Parameter Set, PPS), sequence parameter set (Sequence Parameter Set, SPS), slice header, image header or sequence header in the code stream data or other header data. The embodiment of the present invention can realize that not only the loop_filter_across_tiles_enabled_flag is set to 1, but tile boundary filtering is not performed at the encoding end to reduce the complexity of the encoder, and tile boundary filtering is performed at the decoding end so that the subjective quality is relatively not degraded. The defects and deficiencies of simultaneous filtering at the encoding end and the decoding end can ensure that the reconstructed image at the encoding end and the decoded image at the decoding end have the same function and effect as the reference frame. Reduces potential decoded image tile boundary blocking to improve user viewing experience.

Correspondingly, for the decoding end, the decoding end may perform decoding based on the foregoing encoding process.

FIG. 6 shows a video coding method 600 provided by an embodiment of the present application, and the method 600 may include steps 610-620.

610. Determine that the prediction block pointed to by the motion vector of the current image block is located inside the tile of the reference frame, and the current image block is located in the current frame.

It can be understood that, in the process of encoding, the encoding end adjusts the position of the prediction block pointed to by the motion vector of the current image block to the interior of the tile, and performs encoding based on the adjusted prediction block. Correspondingly, during the decoding process at the decoding end, the prediction block pointed to by the motion vector of the current image block is the adjusted prediction block, that is, the prediction block is located inside the tile.

It should be noted that the fact that the prediction block is located inside the tile of the reference frame may mean that the prediction block is not located on the boundary of the tile, that is, not located in the first area mentioned below. In other words, if the prediction block is not located in the first area mentioned below, it can be understood that the prediction block is located inside the tile of the reference frame.

620. Based on the prediction block, decode the current image block.

It should be understood that the above step 610 is an optional step, in other words, the decoding end may not determine that the prediction block pointed to by the motion vector of the current image block is located inside the tile of the reference frame, and may directly perform the current image block based on the prediction block. decoding.

In the video decoding method provided by the embodiment of the present application, the decoding end may determine that the prediction block pointed to by the motion vector of the current image block is located inside the tile of the reference frame, so as to decode the current image block based on the prediction block. Therefore, the encoder does not perform boundary filtering during encoding, and the decoder can perform tile boundary filtering during the decoding process, so that the subjective quality is relatively not degraded, and at the same time, it can ensure that the decoded image at the decoding end and the reconstructed image at the encoding end are completely consistent. , and further, the viewing experience of the user can be improved.

In order to facilitate the understanding of the solution of the present application, the video coding method provided by the embodiment of the present application will be described below with reference to FIG. 7 .

As shown in FIG. 7 , a schematic diagram of a video coding framework 2 provided by another embodiment of the present application is shown. Wherein, a tile boundary information division 212 is added to the schematic diagram of the video coding framework. Specifically, the encoder can perform motion estimation 208 according to the reference frame image in the reconstructed video frame, and search for the image block most similar to the current encoding block in one or more reference frame images as the prediction block according to certain matching criteria, The relative displacement between the prediction block and the current coding block is the motion vector of the current coding block. If the predicted block obtained by dividing and judging according to the tile boundary information is located on the tile boundary, the position of the predicted block can be adjusted to the inside of the tile, and the original value of the pixel of the encoding block can be subtracted from the corresponding pixel value of the predicted block to obtain Residuals of encoded blocks. The residual of the current coded block is transformed 204, quantized 205 and entropy coded 210 to form a part of the coded code stream of the coded frame. For the decoding end, motion compensation 209 may be performed based on the above determined motion vector and the prediction block, so as to obtain the current block.

The dividing 202 processing on the encoded frame may refer to performing tile division processing on the encoded frame, and sending the divided tile boundary information to the inter-frame prediction module, so that the inter-frame prediction module can perform motion estimation 208 and When the motion compensation 209 is performed, a judgment is made and corresponding operations are performed.

The divided tile boundary information may include: tile i_x_start, tile i_x_end, tile i_y_start, and tile i_y_end. Among them, tile i_x_start represents the start coordinate of the ith tile in the horizontal direction, tile i_x_end represents the end coordinate of the ith tile in the horizontal direction, and tile i_y_start represents the ith tile The starting coordinate of the tile in the vertical direction, and the end of tile i_y_ indicates the ending coordinate of the ith tile in the vertical direction.

As shown in FIG. 8 , it is a schematic diagram of information included after the video to be encoded is divided according to an embodiment of the present application. As shown in FIG. 8, the reference frame is divided vertically to obtain two tiles, namely tile 0 and tile 1. Take tile 1 as an example, tile 1_x_start represents the start coordinate of tile 1 in the horizontal direction, tile 1_x_end represents the end coordinate of tile 1 in the horizontal direction, tile 1_y_start represents the tile 1 is the start coordinate in the vertical direction, and tile 1_y_end indicates the end coordinate of tile 1 in the vertical direction.

It is pointed out above that when it is determined that the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, the position of the prediction block can be adjusted. Wherein, the adjustment manner may include various manners, and details are detailed below.

Optionally, in some embodiments, the adjusting the position of the prediction block so that the prediction block is located inside the tile of the reference frame includes: adjusting the position of the prediction block based on a preset rule. The position is adjusted so that the prediction block is inside the tile of the reference frame.

Optionally, in some embodiments, the preset rule includes: adjusting the prediction block in at least one of the following manners:

moving the prediction block to the upper left;

moving the prediction block to the left;

moving the prediction block downward;

moving the prediction block to the lower right;

moving the prediction block to the right;

moving the prediction block to the upper right; and

The predicted block is moved towards the calculated closest area.

In the embodiment of the present application, as shown in FIG. 9a , it is a schematic diagram of an inter-frame prediction provided by the embodiment of the present application. Two tiles can be obtained by horizontally dividing the reference frame, namely tile 1 and tile 2. As can be seen from Figure 9a, the prediction block of the current image block is located on the tile boundary of the reference frame, and the position of the prediction block can be moved upward to adjust the prediction block to the interior of tile 1, as shown in Figure 9a Shown in dashed line.

As shown in FIG. 9b , it is a schematic diagram of an inter-frame prediction according to another embodiment of the present application. Two tiles can be obtained by vertically dividing the reference frame, namely tile 3 and tile 4. As can be seen from Figure 9b, the prediction block of the current image block is located on the tile boundary of the reference frame, and the position of the prediction block can be moved to the left to adjust the prediction block to the interior of tile 3, as shown in the figure Shown in dashed line in 9b.

As shown in FIG. 9c , it is a schematic diagram of an inter-frame prediction according to another embodiment of the present application. Four tiles can be obtained by dividing the reference frame vertically and horizontally, namely tile 5, tile 6, tile 7 and tile 8. As can be seen from Figure 9c, the prediction block of the current image block is located on the tile boundary of the reference frame, and the position of the prediction block can be moved to the upper left to adjust the prediction block to the interior of tile 5, as shown in the figure Shown in dashed line in 9c.

Similarly, other possible manners are similar to those described above, and are not repeated here for brevity.

It should be noted that, in the implementation of this application, moving the prediction block to the closest area calculated can be understood as moving the prediction block to the area where most of the prediction blocks are located. Referring to Fig. 9c, the prediction block of the current image block is located on the tile boundary of the reference frame, and most of the blocks of the prediction block are located in tile 5. Therefore, the prediction block can be moved to the area of tile 5, so that the prediction block is The prediction block is adjusted into tile 5.

The above describes various ways of adjusting the position of the prediction block if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame. The implementation manner of determining that the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame will be described below. For details, please refer to the following.

In this embodiment of the present application, the position of the prediction block pointed to by the determined motion vector may be adjusted. More preferably, if the motion vector is a motion vector in the candidate list, the motion vector may be marked, and the marking is intended to identify that the motion vector is unavailable in the subsequent encoding process.

The candidate list may be a Skip candidate list or a Merge candidate list, and the candidate list may be generated according to adjacent information such as the left image block and the upper image block of each image block. Wherein, the candidate list can be expressed as: list={(mv_x1, mv_y1), (mv_x2, mv_y2)...(mv_x5, mv_y5)}.

It should be understood that the candidate list may also be shown in the form of a table or other forms without limitation.

Optionally, in some embodiments, the method further includes: based on the boundary value of the prediction block and the boundary value of the first region, judging whether the prediction block is located on the tile boundary of the reference frame, the The first area is an area of the tile boundary affected by filtering.

As shown in FIG. 10a, it is a schematic diagram of a partitioned area of a tile boundary affected by filtering according to an embodiment of the present application. Referring to Figure 10a, two tiles can be obtained by horizontally dividing the reference frame, namely tile 1 and tile 2, wherein the thicker black solid line in the middle of the reference frame is the tile dividing boundary line, and the upper and lower two tiles are The area formed by the dotted line and the left and right boundaries of the reference frame may be the first area in this embodiment of the present application.

In the solution provided by the embodiment of the present application, it is judged whether the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame according to the boundary value of the prediction block and the boundary value of the first region, which is helpful for the encoder to determine whether the motion vector The position of the pointed prediction block is adjusted.

Optionally, in some embodiments, if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjusting the position of the prediction block includes: if the prediction block An arbitrary boundary of is located in the first area, and the position of the prediction block is adjusted.

As described above, the first region in this embodiment of the present application may be a region where the tile boundary is affected by filtering. Referring to FIG. 10a, two tiles can be obtained by horizontally dividing the reference frame, namely tile 1 and tile 2, and the area formed by the upper and lower dashed lines and the left and right borders of the reference frame is the present application in the first area. Assuming that any boundary of the prediction block of the current image block is located in the first area, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be adjusted.

As shown in Figure 10a, it can be seen from the figure that the lower boundary of the prediction block 1-1 is located in the first area, the upper boundary of the prediction block 1-2 is located in the first area, and all the boundaries of the prediction block 2 are located in the first area. within an area. If the prediction block pointed to by the motion vector is located at the position of one of the above three prediction blocks, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be determined. adjust.

Referring to FIG. 10b, two tiles can be obtained by vertically dividing the reference frame, namely tile 3 and tile 4, and the area formed by the left and right dashed lines and the upper and lower boundaries of the reference frame is the present application in the first area. Assuming that any boundary of the prediction block of the current image block is located in the first area, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be adjusted.

As shown in Figure 10b, it can be seen from the figure that the right boundary of the prediction block 3-1 is located in the first area, the left boundary of the prediction block 3-2 is located in the first area, and all the boundaries of the prediction block 4 are located in the first area. within an area. If the prediction block pointed to by the motion vector is located at the position of one of the above three prediction blocks, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be determined. adjust.

Referring to Figure 10c, four tiles are obtained by dividing the reference frame horizontally and vertically, namely tile 5, tile 6, tile 7 and tile 8, which are formed by all the dotted lines in the figure and the boundary of the reference frame. The area is the first area in this application. Assuming that any boundary of the prediction block of the current image block is located in the first area, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be adjusted.

As shown in Figure 10c, it can be seen from the figure that the right and lower boundaries of the prediction block 5-1 are located in the first area, the left and lower boundaries of the prediction block 5-2 are located in the first area, and the prediction block 5-2 is located in the first area. The left boundary of 5-3 is located in the first area, and all boundaries of prediction block 6 are located in the first area. If the prediction block pointed to by the motion vector is located at the position of one of the above four prediction blocks, it can be determined that the prediction block pointed to by the motion vector is located on the tile boundary of the reference frame, so that the position of the prediction block can be determined. adjust.

It should be noted that the positions of the above prediction blocks are only examples, and the present application can be applied as long as any boundary of the prediction blocks is located in the first area, and this application should not be particularly limited.

In addition, the boundary value of the prediction block in the embodiment of the present application may refer to the numerical value of the prediction block in the coordinate system, for example, the left boundary value and the right boundary value of the prediction block may refer to the x of the prediction block in the coordinate system value, the upper boundary value and the lower boundary value of the prediction block may refer to the y value of the prediction block in the coordinate system.

In the solution provided by the embodiment of the present application, if any boundary of the prediction block pointed to by the motion vector is located in the first area, the position of the prediction block pointed to by the motion vector can be adjusted to the inside of the tile, so that the encoding end does not perform tile operation. Slice boundary filtering, which can further reduce the complexity of the encoder.

Optionally, in some embodiments, the adjusting the position of the prediction block if any boundary of the prediction block is located in the first area includes: if the prediction block is on the right side of the horizontal direction The boundary value is greater than or equal to the left boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the prediction and/or, if the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction The position of the prediction block is adjusted if it is greater than or equal to the left boundary value of the first region in the horizontal direction.

The coordinate system referenced by the right boundary and the left boundary in this embodiment of the present application may be a two-dimensional coordinate system. For example, as shown in FIG. 8 above, the upper left corner of the prediction block may be located at the origin o of the coordinate system. o is the starting point and the horizontal direction to the right may be the X direction in the application, and the vertical downward direction with the origin o as the starting point may be the Y direction in the application.

In this embodiment of the present application, if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is less than or equal to the horizontal boundary value of the first region If the right boundary value is set, there are multiple possibilities for the location of the prediction block. One possibility is that the right boundary of the prediction block is located in the first area and the left boundary of the prediction block is not located in the first area, such as the prediction block 3-1 in Figure 10b; another possibility is that the right boundary and the left boundary of the prediction block are not located in the first area. The boundaries are all located in the first region, such as prediction block 4 in Fig. 10b.

Based on the content described above, it can be understood that if the right boundary of the prediction block in the horizontal direction is located in the first area, the position of the prediction block can be adjusted.

Similarly, if the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction , there are multiple possibilities for the location of the prediction block. One possibility is that the left boundary of the prediction block is located in the first area and the right boundary of the prediction block is not located in the first area, such as the prediction block 3-2 in Figure 10b; another possibility is that the left boundary and right boundary of the prediction block are not located in the first area. The boundaries are all located in the first region, such as prediction block 4 in Fig. 10b.

Based on the content described above, it can be understood that, if the left boundary of the prediction block in the horizontal direction is located in the first area, the position of the prediction block can be adjusted.

In the solution provided by this embodiment of the present application, by judging the boundary value of the prediction block and the boundary value of the first region, it can be determined to adjust the position of the prediction block, so that the encoding end does not perform tile boundary filtering, so that the encoder can be further reduced. complexity.

Optionally, in some embodiments, the adjusting the position of the prediction block if any boundary of the prediction block is located in the first area includes: if the prediction block is in the lower part of the vertical direction The boundary value is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is smaller than or equal to the lower boundary value of the first region in the vertical direction, for the The position of the prediction block is adjusted; and/or, if the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction If the value is greater than or equal to the upper boundary value of the first region in the vertical direction, the position of the prediction block is adjusted.

In this embodiment of the present application, if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is smaller than or equal to the vertical boundary value of the first region in the vertical direction The lower boundary value of , there are multiple possibilities for the location of the prediction block. One possibility is that the lower boundary of the prediction block is located in the first area and the upper boundary of the prediction block is not located in the first area, such as prediction block 1-1 in Figure 10a; another possibility is that the lower boundary and upper boundary of the prediction block The boundaries are all located in the first region, such as prediction block 2 in Fig. 10a.

Based on the above description, it can be understood that if the lower boundary of the prediction block in the vertical direction is located in the first area, the position of the prediction block can be adjusted.

Similarly, if the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction , there are multiple possibilities for the location of the prediction block. One possibility is that the upper boundary of the prediction block is located in the first area and the lower boundary of the prediction block is not located in the first area, such as prediction blocks 1-2 in Figure 10a; another possibility is that the upper boundary and lower boundary of the prediction block are not located in the first area. The boundaries are all located in the first region, such as prediction block 2 in Fig. 10a.

Based on the above description, it can be understood that if the upper boundary of the prediction block in the vertical direction is located in the first area, the position of the prediction block can be adjusted.

In addition, as shown in Fig. 10c, if the reference frame is divided horizontally and vertically to obtain four tiles, namely tile 5, tile 6, tile 7 and tile 8, all the dotted lines in the figure and the reference The area formed by the border of the frame is the first area in this application, and there are multiple possibilities for the position of the prediction block. One possibility is that all the boundaries of the prediction block are located in the first area, such as prediction block 6 in Figure 10c; another possibility is that part of the boundaries of the prediction block are located in the first area, such as the prediction block in Figure 10c 5-1, prediction block 5-2 and prediction block 5-3.

It can be understood that, if part of the boundary of the prediction block is located in the first area, the position of the prediction block is not limited to that shown in FIG. 10c, and may also be located at other positions without limitation.

Optionally, in some embodiments, if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjusting the position of the prediction block includes: if the prediction block The boundary value of the first region and the boundary value of the first region do not meet the preset conditions, and the position of the prediction block is adjusted.

The preset condition is at least one of the following conditions: the right boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first region in the horizontal direction; the left boundary value of the prediction block is in the horizontal direction. The boundary value is greater than or equal to the right boundary value of the first region in the horizontal direction; the lower boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction; and, the prediction The upper boundary value of the block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction.

In the embodiment of the present application, if the reference frame is divided horizontally to obtain two tiles, namely tile 1 and tile 2, the area formed by the upper and lower dashed lines and the left and right borders of the reference frame is this The first area in the application. The position of the prediction block 1 in Fig. 11a can be expressed as: the lower boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction; the position of the prediction block 2 in Fig. 11a can be expressed as : The upper boundary value of the prediction block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction.

In this embodiment of the present application, if the prediction block pointed to by the motion vector of the current image block is not the position of prediction block 1 or prediction block 2, that is, the prediction block pointed to by the motion vector of the current image block overlaps with the first area, then Adjust the position of the prediction block.

In the embodiment of the present application, if the reference frame is vertically divided to obtain two tiles, namely tile 3 and tile 4, the area formed by the left and right dashed lines and the upper and lower boundaries of the reference frame is the original The first area in the application. The position of the prediction block 3 in Fig. 11b can be expressed as: the right boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first region in the horizontal direction; the position of the prediction block 4 in Fig. 11b can be expressed as : The left boundary value of the prediction block in the horizontal direction is greater than or equal to the right boundary value of the first region in the horizontal direction.

In the embodiment of the present application, if the prediction block pointed to by the motion vector of the current image block is not the position of prediction block 3 or prediction block 4, that is, the prediction block pointed to by the motion vector of the current image block overlaps with the first area, then Adjust the position of the prediction block.

In addition, as shown in Figure 11c, if the reference frame is divided horizontally and vertically to obtain four tiles, namely tile 5, tile 6, tile 7 and tile 8, all the dotted lines in the figure and the reference The area formed by the border of the frame is the first area in this application. The positions of prediction block 5, prediction block 6, prediction block 7 and prediction block 8 as in Fig. 11c can be expressed as all the boundaries of the prediction blocks are located outside the first area.

In this embodiment of the present application, if the prediction block pointed to by the motion vector of the current image block is not the position of prediction block 5, prediction block 6, prediction block 7 and prediction block 8, that is, the prediction block pointed to by the motion vector of the current image block is the same as If the first area overlaps, the position of the prediction block can be adjusted.

In the solution provided by the embodiments of the present application, by judging that the prediction block overlaps with the first region, it can be determined to adjust the position of the prediction block, so that the encoding end does not perform tile boundary filtering, thereby further reducing the complexity of the encoder.

As noted above, the encoder can determine whether the prediction block is located on the tile boundary of the reference frame based on the boundary value of the prediction block and the boundary value of the first region, where the first region is the region affected by the filtering of the tile boundary. The determination of the first region can be determined in the following manner, and details are detailed below.

If the reference frame is vertically divided to obtain two tiles, the left boundary and the right boundary of the first region can be determined by formula (1) and formula (2), respectively.

fbd_zone_left=(Tile_i_x_start-offset_left1-offset_left2)*4 (1)

fbd_zone_right=(Tile_i_x_start+offset_right1+offset_right2)*4 (2)

Among them, fbd_zone_left represents the left boundary of the first area, fbd_zone_right represents the right boundary of the first area, Tile_i_x_start represents the starting coordinates of the ith tile in the horizontal direction, offset_left1, offset_left2, offset_right1, offset_right2 represent offset values, offset_left1 can be greater than or an integer equal to 3, offset_left2 can take an integer greater than or equal to 4; offset_right1 can take an integer greater than or equal to 4, and offset_right2 can take an integer greater than or equal to 4.

The left boundary and the right boundary of the prediction block pointed to by the motion vector of the current image block can be determined by formula (3) and formula (4), respectively.

pred_block_left=block_x*4+mv_x (3)

pred_block_right=(block_x+block_width-1)*4+mv_x (4)

Among them, pred_block_left represents the left boundary of the prediction block, pred_block_right represents the right boundary of the prediction block, block_x represents the horizontal axis coordinate of the upper left corner of the current image block, mv_x represents the horizontal component of mv (identified with 1/4 pixel precision), and block_width represents the current The width of the image block.

If formula (5) is established, it can be determined that the prediction block pointed to by the motion vector of the current image block overlaps with the first region.

It should be noted that the meaning expressed by the above formula (5) may be that if the right boundary of the predicted block and the left boundary of the first area do not satisfy pred_block_right<fbd_zone_left, or the left boundary of the predicted block and the right boundary of the first area do not satisfy If pred_block_left>fbd_zone_right is satisfied, it can be determined that the prediction block pointed to by the motion vector of the current image block overlaps with the first zone.

Exemplarily, as shown in FIG. 12a, if the reference frame is vertically divided to obtain two tiles, namely tile 3 and tile 4, if the coordinate value of the starting point of tile 4 in the horizontal direction is 20, Then according to the above formula (1) and formula (2), it can be obtained that the coordinate values of the left border and the right border of the first region in the horizontal direction are 52 and 112 respectively, that is, the region shown by the dotted line in FIG. 12a is the first region in the application. One area; Assuming that the width of the current image block is 8, the coordinate value of the horizontal axis of the upper left corner of the current image block is 150, and the component of the motion vector in the horizontal direction is -560, the above formula (3) and formula (4) can be The coordinates of the left boundary and the right boundary of the prediction block pointed to by the motion vector of the current image block in the horizontal direction are 40 and 64, respectively, that is, the position of the original prediction block shown in FIG. 12a.

Since the value of the right boundary of the prediction block in the horizontal direction is 64, and the value of the left boundary of the first region in the horizontal direction is 52, the above formula (5) is satisfied, so it can be determined that the prediction block pointed to by the motion vector of the current image block is located in on tile borders.

If the reference frame is horizontally divided to obtain two tiles, the upper and lower boundaries of the first region can be determined by formula (6) and formula (7), respectively.

fbd_zone_top=(Tile_i_y_start-offset_top1-offset_top2)*4 (6)

fbd_zone_bottom=(Tile_i_y_start+offset_bottom1+offset_bottom2)*4 (7)

Wherein, offset_top1 can take an integer greater than or equal to 3, offset_top2 can take an integer greater than or equal to 4; offset_bottom1 can take an integer greater than or equal to 4, and offset_bottom2 can take an integer greater than or equal to 4.

The upper and lower boundaries of the prediction block pointed to by the motion vector of the current image block can be determined by formula (8) and formula (9), respectively.

pred_block_top=block_y*4+mv_y (8)

pred_block_bottom=(block_y+block_height-1)*4+mv_y (9)

Among them, block_y represents the vertical axis coordinate of the upper left corner of the current image block, mv_y represents the vertical component of mv, and block_height represents the height of the current image block.

If formula (10) is established, it can be determined that the prediction block pointed to by the motion vector of the current image block overlaps with the first region.

Similarly, it should be noted that the meaning expressed by the above formula (10) may be that if the lower boundary of the prediction block and the upper boundary of the first zone do not satisfy pred_block_bottom<fbd_zone_top, or the upper boundary of the prediction block and the lower boundary of the first zone If the boundary does not satisfy pred_block_top>fbd_zone_bottom, it can be determined that the prediction block pointed to by the motion vector of the current image block overlaps with the first area.

Exemplarily, as shown in Figure 12b, if the reference frame is divided horizontally to obtain two tiles, namely tile 1 and tile 2, if the coordinate value of the starting point of tile 2 in the vertical direction is 20, then According to the above formula (5) and formula (6), it can be obtained that the coordinate values of the upper boundary and the lower boundary of the first region in the vertical direction are 52 and 112 respectively, that is, the region shown by the dotted line in FIG. 12b is the first region in this application. area; assuming that the height of the current image block is 8, the vertical axis coordinate value of the upper left corner of the current image block is 150, and the vertical component of the motion vector is -560, then the above formula (7) and formula (8) can be obtained The coordinate values in the vertical direction of the upper boundary and the lower boundary of the prediction block pointed to by the motion vector of the current image block are 40 and 64, respectively, that is, the position of the prediction block shown in FIG. 12b.

Since the lower boundary value of the prediction block in the vertical direction is 64, and the left boundary value of the first region in the vertical direction is 52, which satisfies the above formula (10), it can be determined that the prediction block pointed to by the motion vector of the current image block is located in the tile on the border.

Optionally, in some embodiments, the adjusting the position of the prediction block so that the prediction block is located inside the tile of the reference frame includes: based on the boundary value of the prediction block and the According to the boundary value of the first region, the position of the prediction block is adjusted so that the prediction block is located inside the tile of the reference frame.

In this embodiment of the present application, the position of the prediction block may be adjusted by the boundary value of the prediction block and the boundary value of the first region, so that the prediction block is located inside the tile of the reference frame.

In the solution provided by the embodiment of the present application, the position of the prediction block is adjusted based on the boundary value of the prediction block and the boundary value of the first area, so that the prediction block is located inside the tile of the reference frame, which can ensure that the prediction block is located in the reference frame The accuracy of the tile interior.

It is pointed out above that the encoder can adjust the position of the prediction block based on the boundary value of the prediction block and the boundary value of the first region, and the specific adjustment method can be referred to below.

Optionally, in some embodiments, the adjusting the position of the prediction block based on the boundary value of the prediction block and the boundary value of the first region includes: adjusting the position of the prediction block in a horizontal direction and/or, adding a second threshold value to the boundary value of the prediction block in the vertical direction, the second threshold value is based on the boundary value of the prediction block in the vertical direction and the boundary value of the first region in the vertical direction and a second preset value obtained.

In this embodiment of the present application, the first threshold (represented by Δmv_x below) and the second threshold (represented by Δmv_y below) can be obtained by formula (11) and formula (12), or formula (13) and formula (14), respectively.

Δmv_x=-(pred_block_right-fbd_zone_left+offsetX) (11)

Δmv_y=-(pred_block_bottom-fbd_zone_top+offsetY) (12)

Δmv_x=(fbd_zone_right-pred_block_left+offsetX) (13)

Δmv_y=(fbd_zone_bottom-pred_block_top+offsetY) (14)

The values of offsetX and offsetY may be 1.

Then the horizontal and vertical components of the moved motion vector can be determined by formula (15) and formula (16).

mv_x_new=mv_x+Δmv_x (15)

mv_y_new=mv_y+Δmv_y (16)

The first preset value and/or the second preset value in the embodiment of the present application may be fixed or continuously adjusted, which is not specifically limited in the present application.

Optionally, in some embodiments, if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first area in the horizontal direction, and the first threshold value is a negative value; or, if the left boundary value of the prediction block in the horizontal direction is less than or equal to the first area in the horizontal direction and the right boundary value of the prediction block in the horizontal direction is greater than or equal to the right boundary value of the first region in the horizontal direction, and the first threshold value is a positive value.

In the embodiment of the present application, if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is less than or equal to the horizontal direction value of the first region Left boundary value, ie the position of the original prediction block shown in Figure 12a. A first threshold is added on the basis of the original prediction block, and the first threshold value is a negative value, that is, the original prediction block is moved to the left by the first threshold value, that is, the position of the moved prediction block shown in FIG. 12a.

Exemplarily, as described above, the coordinate values of the left and right boundaries of the original prediction block in the horizontal direction are 40 and 64, respectively, and the coordinate values of the left and right boundaries of the first region in the horizontal direction are 52 and 112, respectively, Through the above formula (11), it can be obtained that the first threshold Δmv_x is -13, that is, the coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 27 and 51, respectively. At this time, the position of the moved prediction block is If it is not located in the first area, the encoding end may encode the current image block based on the moved prediction block.

Similarly, as shown in Figure 12c, the coordinates of the left and right boundaries of the first region in the horizontal direction are 52 and 112, respectively, and the coordinates of the left and right boundaries of the original prediction block in the horizontal direction are 90 and 114, respectively , through the above formula (13), it can be obtained that the first threshold Δmv_x is 23, that is, the coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 113 and 137 respectively. At this time, the position of the moved prediction block is If it is not located in the first area, the encoding end may encode the current image block based on the moved prediction block.

In the solution provided by the embodiments of the present application, different first thresholds are obtained according to the different positions of the prediction blocks in the first area, so that the positions of the prediction blocks can be adjusted purposefully, and further, the number of prediction blocks can be reduced. offset for ease of implementation.

Optionally, in some embodiments, if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction, and the second threshold value is a negative value; or, if the upper boundary value of the prediction block in the vertical direction is less than or equal to the vertical upper boundary value of the first region and the lower boundary value of the prediction block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction, and the second threshold value is a positive value.

In this embodiment of the present application, if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the left boundary value of the prediction block in the vertical direction is less than or equal to the vertical boundary value of the first region The left boundary value, ie the position of the original prediction block shown in Figure 12b. A second threshold is added on the basis of the original prediction block, and the second threshold value is a negative value, that is, the original prediction block is moved up by a second threshold value, that is, the position of the moved prediction block shown in FIG. 12b.

Exemplarily, as described above, the coordinates of the upper and lower boundaries of the original prediction block in the vertical direction are 40 and 64, respectively, and the coordinates of the upper and lower boundaries of the first region in the vertical direction are 52 and 112, respectively, Through the above formula (12), it can be obtained that the second threshold Δmy_x is -13, that is, the coordinate values of the upper and lower boundaries of the moved prediction block in the vertical direction are 27 and 51 respectively. At this time, the position of the moved prediction block is If it is not located in the first area, the encoding end may encode the current image block based on the moved prediction block.

Similarly, as shown in Figure 12d, the coordinates of the upper and lower boundaries of the first region in the vertical direction are 52 and 112, respectively, and the coordinates of the upper and lower boundaries of the original prediction block in the vertical direction are 90 and 114, respectively , through the above formula (14), the second threshold Δmv_y can be obtained as 23, that is, the coordinate values of the upper and lower boundaries of the moved prediction block in the vertical direction are 113 and 137 respectively. At this time, the position of the moved prediction block is If it is not located in the first area, the encoding end may encode the current image block based on the moved prediction block.

It should be understood that the above numerical values are only examples, and other numerical values may also be used, which should not limit the present application.

According to the solution provided by the embodiments of the present application, different second thresholds are obtained according to the different positions of the predicted blocks in the first area, so that the positions of the predicted blocks can be adjusted purposefully, and further, the amount of the predicted blocks can be reduced. offset for ease of implementation.

Optionally, in some embodiments, if the left border of the prediction block in the horizontal direction is greater than or equal to the left border value of the first region in the horizontal direction, the right border of the prediction block in the horizontal direction is less than or equal to The right boundary value of the first region in the horizontal direction, the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction The value is less than or equal to the lower boundary value of the first region in the vertical direction, and the first threshold value and/or the second threshold value is a positive value or a negative value.

In this embodiment of the present application, if the left boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, the right boundary value of the prediction block in the horizontal direction is smaller than or equal to the right boundary value of the first region in the horizontal direction , the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, that is, the prediction block is located in the first area, that is, the position of the original prediction block shown in Fig. 12e. A first threshold and/or a second threshold is added on the basis of the original prediction block, and the first threshold and/or the second threshold are positive or negative, that is, the original prediction block is moved in any possible direction by the first threshold and/or The second threshold, the position of the moved prediction block shown in Figure 12e.

Exemplarily, as described above, the coordinate values of the left and right boundaries of the original prediction block in the horizontal direction are 60 and 84, respectively, and the coordinate values of the upper and lower boundaries in the vertical direction are 60 and 84, respectively; The coordinates of the left and right borders in the horizontal direction are 52 and 112, respectively, and the coordinates of the upper and lower borders in the vertical direction are 52 and 112, respectively.

The position of the original prediction block can be adjusted in the following ways, without limitation, please refer to the following for details.

1), through the above-mentioned formula (11) and formula (12), it can be obtained that the values of the first threshold Δmv_x and the second threshold Δmv_y are both -33, that is, on the basis of the original prediction block, increase -33 in the horizontal direction and the vertical direction, respectively, Then the coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 27 and 51, respectively, and the coordinates of the upper and lower boundaries of the moved prediction block in the vertical direction are 27 and 51, respectively. , the position of the moved prediction block is shown as the position of the moved prediction block 1 in FIG. 12e , the encoding end may encode the current image block based on the moved prediction block 1 .

2), through the above formula (13) and formula (12), the values of the first threshold Δmv_x and the second threshold Δmv_y can be obtained to be 53 and -33 respectively, that is, on the basis of the original prediction block, increase 53 in the horizontal direction, and in the vertical direction Add -33, that is, the coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 113 and 137, respectively, and the coordinates of the upper and lower boundaries of the moved prediction block in the vertical direction are 27 and 27, respectively. 51. At this time, the position of the moved prediction block is shown as the position of the moved prediction block 2 in FIG. 12e, and the encoding end may encode the current image block based on the moved prediction block 2.

3), through the above formula (11) and formula (14), the values of the first threshold Δmv_x and the second threshold Δmv_y can be obtained to be -33 and 53 respectively, that is, on the basis of the original prediction block, increase -33 in the horizontal direction, and in the vertical direction. The direction increases by 53, that is, the coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 27 and 51, respectively, and the coordinates of the upper and lower boundaries of the moved prediction block in the vertical direction are 113 and 113 respectively. 137. At this time, the position of the moved prediction block is shown as the position of the moved prediction block 3 in FIG. 12e, and the encoding end may encode the current image block based on the moved prediction block 3.

4), through the above formula (13) and formula (14), it can be obtained that the values of the first threshold Δmv_x and the second threshold Δmv_y are both 53, that is, on the basis of the original prediction block, increase 53 in the horizontal direction and the vertical direction, then The coordinate values of the left and right boundaries of the moved prediction block in the horizontal direction are 113 and 137, respectively, and the coordinates of the upper and lower boundaries of the moved prediction block in the vertical direction are 113 and 137, respectively. The position of the subsequent prediction block is shown as the position of the moved prediction block 4 in FIG. 12e , and the encoding end may encode the current image block based on the moved prediction block 4 .

In the solution provided by the embodiment of the present application, the position of the prediction block is adjusted based on the boundary value of the prediction block and the boundary value of the first region, so that the prediction block is located inside the tile of the reference frame, which can ensure that the prediction block is located in the reference frame. The accuracy of the tile interior.

The method embodiments of the present application are described in detail above with reference to FIGS. 1 to 12 , and the apparatus embodiments of the present application are described below with reference to FIGS. 13 to 16 . The apparatus embodiments and the method embodiments correspond to each other, and therefore are not described in detail. In part, please refer to the method embodiments of the previous parts.

FIG. 13 is an encoding apparatus 1300 provided by an embodiment of the present application. The encoding apparatus 1300 may include a processor 1310 .

The processor 1310, the processor 1310 is configured to: if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjust the position of the prediction block so that the prediction block is located at the tile boundary of the reference frame. Inside the tile of the reference frame, so that when tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the pixel value of the prediction block referenced by the encoding end during encoding and the The pixel values of the prediction block referenced by the decoding end during decoding can be kept consistent, and the current image block is located in the current frame; the current image block is encoded based on the adjusted prediction block.

Optionally, in some embodiments, the processor 1310 is further configured to: enable the tile boundary filtering in the process of encoding the current image block.

Optionally, in some embodiments, the processor 1310 is further configured to: set the tile boundary filtering enable flag in the code stream data to 1; wherein the tile boundary filtering enable flag is located in the In the picture data set, sequence parameter set, slice header, picture header or sequence header of the code stream data.

Optionally, in some embodiments, the processor 1310 is further configured to: adjust the position of the prediction block based on a preset rule, so that the prediction block is located inside the tile of the reference frame.

moving the prediction block to the upper left;

moving the prediction block to the left;

moving the prediction block downward;

moving the prediction block to the lower right;

moving the prediction block to the right;

moving the prediction block to the upper right; and

The predicted block is moved towards the calculated closest area.

Optionally, in some embodiments, the processor 1310 is further configured to: based on the boundary value of the prediction block and the boundary value of the first region, determine whether the prediction block is located at the tile boundary of the reference frame Above, the first region is the region where the tile boundary is affected by filtering.

Optionally, in some embodiments, the processor 1310 is further configured to: if any boundary of the prediction block is located in the first area, adjust the position of the prediction block.

Optionally, in some embodiments, the processor 1310 is further configured to: if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the The right boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the position of the prediction block is adjusted; and/or, if the prediction block is at the left boundary in the horizontal direction The value is less than or equal to the right boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction. position to adjust.

Optionally, in some embodiments, the processor 1310 is further configured to: if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the The lower boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the position of the prediction block is adjusted; and/or, if the prediction block is above the vertical direction The boundary value is less than or equal to the lower boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the prediction Adjust the position of the block.

Optionally, in some embodiments, the processor 1310 is further configured to: if the boundary value of the prediction block and the boundary value of the first region do not meet a preset condition, perform a calculation on the position of the prediction block. adjust;

The preset condition is at least one of the following conditions:

The right boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first region in the horizontal direction;

The left boundary value of the prediction block in the horizontal direction is greater than or equal to the right boundary value of the first region in the horizontal direction;

the lower boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction; and

The upper boundary value of the prediction block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction.

Optionally, in some embodiments, the processor 1310 is further configured to: adjust the position of the prediction block based on the boundary value of the prediction block and the boundary value of the first region, so that all The prediction block is located inside a tile of the reference frame.

Optionally, in some embodiments, the processor 1310 is further configured to: add a first threshold to the boundary value of the prediction block in the horizontal direction, where the first threshold is based on the prediction block in the horizontal direction The boundary value and the boundary value of the first region in the horizontal direction and the first preset value are obtained; and/or, a second threshold is added to the boundary value of the prediction block in the vertical direction, and the second threshold is based on The boundary value of the prediction block in the vertical direction, the boundary value of the first region in the vertical direction, and the second preset value are obtained.

FIG. 14 is a decoding apparatus 1400 provided by an embodiment of the present application. The decoding apparatus 1400 may include a processor 1410 .

The processor 1410 is configured to: determine that the prediction block pointed to by the motion vector of the current image block is located inside the tile of the reference frame, and the current image block is located in the current frame; The current image block is decoded.

An embodiment of the present invention also provides an encoding and decoding system, including:

an encoder, configured to adjust the position of the prediction block if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the first reference frame, so that the prediction block is located in the first reference frame Inside the tile of the frame; encode the current image block to be encoded based on the adjusted prediction block; during the encoding process, do not perform tile boundary filtering on the first reference frame; wherein the current The image block is located in the current frame;

The decoder is configured to decode the current image block based on the prediction block of the second reference frame obtained by decoding; in the decoding process, perform tile boundary filtering on the second reference frame.

In the embodiment of the present invention, disabling the tile boundary filtering function on the encoding side and enabling the tile boundary filtering function on the decoding side can not only achieve the picture quality when displayed on the encoding side, but also reduce the amount of data exchange and computation on the decoding side.

It should be noted that, for the specific implementation manner of the encoder in this embodiment of the present invention, reference may be made to the description of the video encoding method in any of the foregoing embodiments, and details are not described herein again.

FIG. 15 is a schematic structural diagram of a video encoding and decoding apparatus provided by still another embodiment of the present application. The video coding and decoding apparatus 1500 shown in FIG. 15 includes a processor 1510, and the processor 1510 can call and run a computer program from a memory, so as to implement the methods described in FIG. 4-FIG. 12 above.

Optionally, as shown in FIG. 15 , the video coding and decoding apparatus 1500 may further include a memory 1520 . The processor 1510 may call and run a computer program from the memory 1520 to implement the methods in the embodiments of the present application.

The memory 1520 may be a separate device independent of the processor 1510, or may be integrated in the processor 1510.

Optionally, as shown in FIG. 15 , the video codec apparatus 1500 may further include a transceiver 1530, and the processor 1510 may control the transceiver 1530 to communicate with other apparatuses, specifically, may send information or data to other apparatuses, or Receive information or data sent by other devices.

Optionally, the video encoding and decoding apparatus may be, for example, an encoder, a decoder, and a terminal (including but not limited to a mobile phone, a camera, a drone, etc.), and the encoding and decoding apparatus may implement the methods in the embodiments of the present application. For the sake of brevity, the corresponding process is not repeated here.

FIG. 16 is a schematic structural diagram of a chip according to an embodiment of the present application. The chip 1600 shown in FIG. 16 includes a processor 1610, and the processor 1610 can call and run a computer program from a memory to implement the method in the embodiment of the present application.

Optionally, as shown in FIG. 16 , the chip 1600 may further include a memory 1620 . The processor 1610 may call and run a computer program from the memory 1620 to implement the methods in the embodiments of the present application.

The memory 1620 may be a separate device independent of the processor 1610, or may be integrated in the processor 1610.

Optionally, the chip 1600 may further include an input interface 1630 . The processor 1610 can control the input interface 1630 to communicate with other devices or chips, and specifically, can obtain information or data sent by other devices or chips.

Optionally, the chip 1600 may further include an output interface 1640 . The processor 1610 can control the output interface 1640 to communicate with other devices or chips, and specifically, can output information or data to other devices or chips.

It should be understood that the chip mentioned in the embodiments of the present application may also be referred to as a system-on-chip, a system-on-chip, a system-on-chip, or a system-on-a-chip, or the like.

An embodiment of the present invention further provides a chip, including a processing circuit, for implementing the above-mentioned encoding method and decoding method.

It should be understood that the processor in this embodiment of the present application may be an integrated circuit image processing system, which has signal processing capability. In the implementation process, each step of the above method embodiments may be completed by a hardware integrated logic circuit in a processor or an instruction in the form of software. The above-mentioned processor can be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an off-the-shelf programmable gate array (Field Programmable Gate Array, FPGA) or other available Programming logic devices, discrete gate or transistor logic devices, discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.

It can be understood that the memory in this embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Wherein, the non-volatile memory may be a read-only memory (Read-Only Memory, ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electrically programmable read-only memory (Erasable PROM, EPROM). Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory. Volatile memory may be Random Access Memory (RAM), which acts as an external cache. By way of illustration and not limitation, many forms of RAM are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (Synchlink DRAM, SLDRAM) ) and direct memory bus random access memory (Direct Rambus RAM, DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

The memory in the embodiments of the present application may provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor may be configured to execute the instruction stored in the memory, and when the processor executes the instruction, the processor may execute each step corresponding to the terminal device in the foregoing method embodiments.

In the implementation process, each step of the above-mentioned method can be completed by a hardware integrated logic circuit in a processor or an instruction in the form of software. The steps of the methods disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware processor, or executed by a combination of hardware and software modules in the processor. The software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art. The storage medium is located in the memory, and the processor executes the instructions in the memory, and completes the steps of the above method in combination with its hardware. To avoid repetition, detailed description is omitted here.

It should also be understood that, in this embodiment of the present application, the pixels in the image may be located in different rows and/or columns, wherein the length of A may correspond to the number of pixels located in the same row included in A, and the height of A may be Corresponds to the number of pixels in the same column included in A. In addition, the length and height of A may also be referred to as the width and depth of A, respectively, which are not limited in this embodiment of the present application.

It should also be understood that, in this embodiment of the present application, "distributed at the boundary of A" may refer to at least one pixel point away from the boundary of A, and may also be referred to as "not adjacent to the boundary of A" or "not located at the boundary of A". "Boundary", which is not limited in this embodiment of the present application, where A may be an image, a rectangular area, or a sub-image, and so on.

It should also be understood that the above description of the embodiments of the present application focuses on emphasizing the differences between the various embodiments, and the unmentioned same or similar points can be referred to each other, and are not repeated here for brevity.

Embodiments of the present application further provide a computer-readable storage medium for storing a computer program.

Optionally, the computer-readable storage medium can be applied to the encoding device in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the encoding device in each method of the embodiments of the present application. For brevity, here No longer.

Optionally, the computer-readable storage medium can be applied to the decoding apparatus in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the decoding apparatus in each method of the embodiments of the present application. For brevity, here No longer.

Embodiments of the present application also provide a computer program product, including computer program instructions.

Optionally, the computer program product can be applied to the encoding device in the embodiments of the present application, and the computer program instructions cause the computer to execute the corresponding processes implemented by the encoding device in the various methods of the embodiments of the present application. Repeat.

Optionally, the computer program product can be applied to the decoding apparatus in the embodiments of the present application, and the computer program instructions cause the computer to execute the corresponding processes implemented by the decoding apparatus in each method of the embodiments of the present application. Repeat.

The embodiments of the present application also provide a computer program.

Optionally, the computer program can be applied to the encoding device in the embodiments of the present application. When the computer program is run on the computer, the computer executes the corresponding processes implemented by the encoding device in each method of the embodiments of the present application. For the sake of brevity. , and will not be repeated here.

Optionally, the computer program can be applied to the decoding device in the embodiments of the present application. When the computer program is run on the computer, the computer is made to execute the corresponding processes implemented by the decoding device in the various methods of the embodiments of the present application. For the sake of brevity. , and will not be repeated here.

It should be understood that, in this embodiment of the present application, the term "and/or" is only an association relationship for describing associated objects, indicating that there may be three kinds of relationships. For example, A and/or B can mean that A exists alone, A and B exist at the same time, and B exists alone. In addition, the character "/" in this document generally indicates that the related objects are an "or" relationship.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. Interchangeability, the above description has generally described the components and steps of each example in terms of function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the system, device and unit described above may refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may also be electrical, mechanical or other forms of connection.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solutions of the embodiments of the present application.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The integrated unit, if implemented in the form of a software functional unit and sold or used as an independent product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present application are essentially or part of contributions to the prior art, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium , including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk and other mediums that can store program codes.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of various equivalents within the technical scope disclosed in the present application. Modifications or substitutions shall be covered by the protection scope of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

A method for video coding, comprising:

If the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, the position of the prediction block is adjusted so that the prediction block is located inside the tile of the reference frame, so that when When tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the pixel value of the prediction block referred to by the encoding end for encoding and the pixel value of the prediction block referred to by the decoding end for decoding The value can be kept consistent, and the current image block is located in the current frame;

The current image block is encoded based on the adjusted prediction block.
The method according to claim 1, wherein the method further comprises:

During encoding of the current image block, the tile boundary filtering is enabled.
The method according to claim 2, wherein the enabling the tile boundary filtering comprises:

The tile boundary filtering enable flag in the code stream data is set to 1; wherein, the tile boundary filtering enable flag is located in the picture data set, sequence parameter set, slice header, image header or in the sequence header.
The method according to claim 1, wherein the adjusting the position of the prediction block so that the prediction block is located inside the tile of the reference frame comprises:

The position of the prediction block is adjusted based on a preset rule, so that the prediction block is located inside the tile of the reference frame.
The method according to claim 4, wherein the preset rule comprises:

The prediction block is adjusted in at least one of the following ways:

moving the prediction block to the upper left;

moving the prediction block to the left;

moving the prediction block downward;

moving the prediction block to the lower right;

moving the prediction block to the right;

moving the prediction block to the upper right; and

The predicted block is moved towards the calculated closest area.
The method according to claim 1, wherein the method further comprises:

Based on the boundary value of the prediction block and the boundary value of the first region, it is determined whether the prediction block is located on the tile boundary of the reference frame, and the first region is the region affected by the filtering of the tile boundary.
The method according to claim 6, wherein if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjusting the position of the prediction block comprises:

If any boundary of the prediction block is located in the first area, the position of the prediction block is adjusted.
The method according to claim 7, wherein, if any boundary of the prediction block is located in the first area, adjusting the position of the prediction block comprises:

If the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is less than or equal to the horizontal boundary value of the first region the right boundary value of the direction to adjust the position of the prediction block; and/or,

If the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is greater than or equal to the first region in the horizontal direction The left boundary value of the direction to adjust the position of the prediction block.
The method according to claim 7, wherein, if any boundary of the prediction block is located in the first area, adjusting the position of the prediction block comprises:

If the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is less than or equal to the vertical boundary value of the first region the lower boundary value in the direction to adjust the position of the prediction block; and/or,

If the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction is greater than or equal to the vertical boundary value of the first region The upper boundary value of the direction to adjust the position of the prediction block.
The method according to claim 6, wherein if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjusting the position of the prediction block comprises:

If the boundary value of the prediction block and the boundary value of the first region do not meet a preset condition, adjusting the position of the prediction block;

The preset condition is at least one of the following conditions:

The right boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first region in the horizontal direction;

The left boundary value of the prediction block in the horizontal direction is greater than or equal to the right boundary value of the first region in the horizontal direction;

the lower boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction; and

The upper boundary value of the prediction block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction.
The method according to any one of claims 6 to 10, wherein the adjusting the position of the prediction block so that the prediction block is located inside the tile of the reference frame comprises:

Based on the boundary value of the prediction block and the boundary value of the first region, the position of the prediction block is adjusted so that the prediction block is located inside the tile of the reference frame.
The method according to claim 11, wherein the adjusting the position of the prediction block based on the boundary value of the prediction block and the boundary value of the first region comprises:

A first threshold is added to the boundary value of the prediction block in the horizontal direction, the first threshold is based on the boundary value of the prediction block in the horizontal direction and the boundary value of the first region in the horizontal direction and a first preset value obtained; and/or,

adding a second threshold value to the boundary value of the prediction block in the vertical direction, the second threshold value is based on the boundary value of the prediction block in the vertical direction and the boundary value of the first region in the vertical direction and a second preset value obtained.
The method according to claim 12, wherein if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the prediction block is horizontal in the horizontal direction The left boundary value is less than or equal to the left boundary value of the first region in the horizontal direction, and the first threshold value is a negative value; or,

If the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is greater than or equal to the first region in the horizontal direction The right boundary value of the direction, the first threshold value is a positive value.
The method according to claim 11 or 12, wherein if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the prediction block is in the vertical direction The upper boundary value of the direction is less than or equal to the upper boundary value of the first region in the vertical direction, and the second threshold value is a negative value; or,

If the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is greater than or equal to the vertical boundary value of the first region The lower boundary value of the direction, the second threshold value is a positive value.
The method according to claim 12, wherein if the left boundary of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, the right boundary of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the prediction block is in the vertical direction The lower boundary value of is less than or equal to the lower boundary value of the first region in the vertical direction, and the first threshold and/or the second threshold are positive or negative.
A device for video encoding, comprising:

a processor, the processor is configured to: if the prediction block pointed to by the motion vector of the current image block is located on the tile boundary of the reference frame, adjust the position of the prediction block so that the prediction block is located in the reference frame Inside the tile of the frame, so that when tile boundary filtering is not performed at the encoding end and tile boundary filtering is performed at the decoding end, the pixel value of the prediction block referenced by the encoding end when encoding is performed with the decoding end. The pixel values of the prediction block referenced during decoding can be kept consistent, and the current image block is located in the current frame;

The current image block is encoded based on the adjusted prediction block.
The apparatus of claim 16, wherein the processor is further configured to:

During encoding of the current image block, the tile boundary filtering is enabled.
The apparatus of claim 17, wherein the processor is further configured to:

The tile boundary filtering enable flag in the code stream data is set to 1; wherein, the tile boundary filtering enable flag is located in the picture data set, sequence parameter set, slice header, image header or in the sequence header.
The apparatus of claim 16, wherein the processor is further configured to:

The position of the prediction block is adjusted based on a preset rule, so that the prediction block is located inside the tile of the reference frame.
The device according to claim 19, wherein the preset rule comprises:

The prediction block is adjusted in at least one of the following ways:

moving the prediction block to the upper left;

moving the prediction block to the left;

moving the prediction block downward;

moving the prediction block to the lower right;

moving the prediction block to the right;

moving the prediction block to the upper right; and

The predicted block is moved towards the calculated closest area.
The apparatus of claim 16, wherein the processor is further configured to:

Based on the boundary value of the prediction block and the boundary value of the first region, it is determined whether the prediction block is located on the tile boundary of the reference frame, and the first region is the region affected by the filtering of the tile boundary.
The apparatus of claim 21, wherein the processor is further configured to:

If any boundary of the prediction block is located in the first area, the position of the prediction block is adjusted.
The apparatus of claim 21, wherein the processor is further configured to:

If the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is less than or equal to the horizontal boundary value of the first region the right boundary value of the direction to adjust the position of the prediction block; and/or,

If the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the left boundary value of the prediction block in the horizontal direction is greater than or equal to the first region in the horizontal direction The left boundary value of the direction to adjust the position of the prediction block.
The apparatus of claim 21, wherein the processor is further configured to:

If the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is less than or equal to the vertical boundary value of the first region the lower boundary value in the direction to adjust the position of the prediction block; and/or,

If the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the upper boundary value of the prediction block in the vertical direction is greater than or equal to the vertical boundary value of the first region The upper boundary value of the direction to adjust the position of the prediction block.
The apparatus of claim 20, wherein the processor is further configured to:

If the boundary value of the prediction block and the boundary value of the first region do not meet a preset condition, adjusting the position of the prediction block;

The preset condition is at least one of the following conditions:

The right boundary value of the prediction block in the horizontal direction is less than or equal to the left boundary value of the first region in the horizontal direction;

The left boundary value of the prediction block in the horizontal direction is greater than or equal to the right boundary value of the first region in the horizontal direction;

the lower boundary value of the prediction block in the vertical direction is less than or equal to the upper boundary value of the first region in the vertical direction; and

The upper boundary value of the prediction block in the vertical direction is greater than or equal to the lower boundary value of the first region in the vertical direction.
The apparatus according to any one of claims 21 to 25, wherein the processor is further configured to:

Based on the boundary value of the prediction block and the boundary value of the first region, the position of the prediction block is adjusted so that the prediction block is located inside the tile of the reference frame.
The apparatus of claim 26, wherein the processor is further configured to:

A first threshold is added to the boundary value of the prediction block in the horizontal direction, the first threshold is based on the boundary value of the prediction block in the horizontal direction and the boundary value of the first region in the horizontal direction and a first preset value obtained; and/or,

adding a second threshold value to the boundary value of the prediction block in the vertical direction, the second threshold value is based on the boundary value of the prediction block in the vertical direction and the boundary value of the first region in the vertical direction and a second preset value obtained.
28. The device according to claim 27, wherein if the right boundary value of the prediction block in the horizontal direction is greater than or equal to the left boundary value of the first region in the horizontal direction, and the prediction block is in the horizontal direction The left boundary value is less than or equal to the left boundary value of the first region in the horizontal direction, and the first threshold value is a negative value; or,

If the left boundary value of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, and the right boundary value of the prediction block in the horizontal direction is greater than or equal to the first region in the horizontal direction The right boundary value of the direction, the first threshold value is a positive value.
The apparatus according to claim 27 or 28, wherein if the lower boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the prediction block is in the vertical direction The upper boundary value of the direction is less than or equal to the upper boundary value of the first region in the vertical direction, and the second threshold value is a negative value; or,

If the upper boundary value of the prediction block in the vertical direction is less than or equal to the lower boundary value of the first region in the vertical direction, and the lower boundary value of the prediction block in the vertical direction is greater than or equal to the vertical boundary value of the first region The lower boundary value of the direction, the second threshold value is a positive value.
The apparatus according to claim 28, wherein if the left border of the prediction block in the horizontal direction is greater than or equal to the left border value of the first region in the horizontal direction, the right border of the prediction block in the horizontal direction is less than or equal to the right boundary value of the first region in the horizontal direction, the upper boundary value of the prediction block in the vertical direction is greater than or equal to the upper boundary value of the first region in the vertical direction, and the prediction block is in the vertical direction The lower boundary value of is less than or equal to the lower boundary value of the first region in the vertical direction, and the first threshold value and/or the second threshold value is a positive value or a negative value.
A computer-readable storage medium comprising instructions for performing the method of any one of claims 1 to 15.
A chip comprising processing circuitry for executing instructions of the method of any one of claims 1 to 15.