Patent Application
20210360275
This application relates to the field of video coding technologies, and more specifically, to an inter prediction method and apparatus.
A digital video capability can be incorporated into a wide variety of apparatuses, including a digital television, a digital live broadcast system, a wireless broadcast system, a personal digital assistant (personal digital assistant, PDA), a laptop or desktop computer, a tablet computer, an e-book reader, a digital camera, a digital recording apparatus, a digital media player, a video game apparatus, a video game console, a cellular or satellite radio phone (namely “smartphone”), a video conferencing apparatus, a video streaming apparatus, and the like. A digital video apparatus implements video compression technologies, such as video compression technologies described in standards defined in MPEG-2, MPEG-4, ITU-T H.263, and ITU-T H.264/MPEG-4 part 10 advanced video coding (AVC), a video coding standard H.265/high efficiency video coding (high efficiency video coding, HEVC) standard, and extensions of such standards. The video apparatus can more efficiently transmit, receive, encode, decode, and/or store digital video information by implementing such video compression technologies.
The video compression technologies are used to perform spatial (intra-picture) prediction and/or temporal (inter-picture) prediction to reduce or remove inherent redundancy in video sequences. In block-based video coding, a video slice (namely, a video frame or a part of a video frame) may be partitioned into picture blocks, and the picture block may also be referred to as a tree block, a coding unit (CU), and/or a coding node. A picture block in a to-be-intra-coded (I) slice of a picture is coded through spatial prediction based on a reference sample in a neighboring block in the same picture. For a picture block in a to-be-inter-coded (P or B) slice of a picture, spatial prediction based on a reference sample in a neighboring block in the same picture or temporal prediction based on a reference sample in another reference picture may be used. A picture may be referred to as a frame, and a reference picture may be referred to as a reference frame.
To improve accuracy of inter prediction performed on a non-translational moving object, an affine motion model may be used for the inter prediction.
When inter prediction is performed based on the affine motion model, a motion vector of a control point of a current block may be first determined, and then a motion vector value of each subblock in the current block is obtained. Finally, motion compensation is performed based on a motion vector of each subblock to obtain a predicted sample value of each subblock, so as to obtain a predicted sample value of the current block.
However, in some cases, because there is a luminance difference between the current block and a reference block corresponding to the current block, the accuracy of the inter prediction is not very high.
This application provides an inter prediction method and apparatus, to improve accuracy of inter prediction.
According to a first aspect, an inter prediction method is provided. The method includes: obtaining a predicted sample value of a current affine block; determining one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block; determining a linear model coefficient based on a first sample set and a second sample set; and updating the predicted sample value of the current affine block based on the linear model coefficient, to obtain an updated predicted sample value of the current affine block.
The first sample set includes at least one reconstructed sample neighboring to an edge of the current affine block, the second sample set includes at least one reconstructed sample neighboring to an edge of the one or more luminance compensation blocks, and the sample in the first sample set is in a one-to-one correspondence with the sample in the second sample set.
Optionally, the obtaining a predicted sample value of a current affine block includes: determining, based on a motion vector of each subblock in the current affine block, a reference subblock corresponding to each subblock; and determining a predicted sample value of each subblock based on a reconstructed sample value of the reference subblock corresponding to each subblock, to obtain the predicted sample value of the current affine block.
Optionally, reconstructed samples included in the first sample set and the second sample set may be specifically luminance values of the samples (Y component values of the samples).
It should be understood that, when the predicted sample value of each subblock is determined based on the reconstructed sample value of the reference subblock corresponding to each subblock, the reconstructed sample value of the reference subblock corresponding to each subblock may be directly determined as the predicted sample value of the subblock.
In this application, luminance compensation is performed on the predicted sample value of the current affine block, to improve accuracy of inter prediction, reduce a residual value, and when video quality is the same, reduce a bit rate, to further improve coding performance.
It should be understood that the luminance compensation in this application refers to local illumination compensation. For brevity of language, the luminance compensation is uniformly used in subsequent descriptions in this application.
With reference to the first aspect, in some implementations of the first aspect, the determining one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block includes: determining, based on the motion vector of each of the plurality of subblocks of the current affine block, a luminance compensation block corresponding to each subblock, to obtain the plurality of luminance compensation blocks.
Optionally, the plurality of subblocks are subblocks located at an edge of the current affine block.
Optionally, the plurality of subblocks are subblocks located at a left edge and/or a right edge of the current affine block.
It should be understood that, the luminance compensation block corresponding to each subblock is determined based on the motion vector of each subblock, and a quantity of finally obtained luminance compensation blocks is the same as a quantity of subblocks of the current affine block.
In this application, the luminance compensation block corresponding to each subblock is determined based on the motion vector of each subblock, so that a plurality of luminance compensation blocks that better match the subblocks can be obtained, and the accuracy of the inter prediction can be improved to some extent.
With reference to the first aspect, in some implementations of the first aspect, the first sample set includes a reconstructed sample neighboring to the left edge and/or a reconstructed sample neighboring to an upper edge of the current affine block.
With reference to the first aspect, in some implementations of the first aspect, the second sample set includes a reconstructed sample at a specific neighboring location of each of the plurality of luminance compensation blocks. The plurality of luminance compensation blocks include a first-type luminance compensation block and/or a second-type luminance compensation block. The first-type luminance compensation block is a luminance compensation block corresponding to a subblock on the upper edge of the current affine block. The second-type luminance compensation block is a luminance compensation block corresponding to a subblock on the left edge of the current affine block. A reconstructed sample at a specific neighboring location of the first-type luminance compensation block is a reconstructed sample neighboring to an upper edge of the first-type luminance compensation block. A reconstructed sample at a specific neighboring location of the second-type luminance compensation block is a reconstructed sample neighboring to a left edge of the second-type luminance compensation block.
For ease of understanding, the plurality of luminance compensation blocks may further be spliced into one virtual luminance compensation block. A shape of the virtual luminance compensation block may be or may not be a rectangle. For example, the virtual luminance compensation block may be an irregular graphics block obtained by splicing the luminance compensation blocks.
It should be understood that the virtual luminance compensation block is not a real picture block that needs to be constructed, but may be a reference object used to determine the reconstructed sample in the second sample set.
Optionally, when the first sample set includes only the reconstructed sample neighboring to the upper edge of the current affine block, the second sample set also includes only a reconstructed sample neighboring to an upper edge of the virtual luminance compensation block.
Optionally, when the first sample set includes only the reconstructed sample neighboring to the left edge of the current affine block, the second sample set also includes only a reconstructed sample neighboring to a left edge of the virtual luminance compensation block.
Optionally, when the first sample set includes the reconstructed sample neighboring to the upper edge and the reconstructed sample neighboring to the left edge of the current affine block, the second sample set also includes a reconstructed sample neighboring to an upper edge and a reconstructed sample neighboring to a left edge of the virtual luminance compensation block.
With reference to the first aspect, in some implementations of the first aspect, the determining one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block includes: determining, based on a motion vector of a subblock at a first preset location in the current affine block, a luminance compensation block corresponding to the affine block.
In this application, a motion vector of a subblock at a fixed location in the current affine block is used to determine the luminance compensation block corresponding to the entire affine motion block, so that a quantity of luminance compensation blocks that need to be determined can be reduced, and complexity of determining the luminance compensation block can be reduced.
With reference to the first aspect, in some implementations of the first aspect, the first preset location is the upper-left corner or the center of the current affine block.
The upper-left corner of the current affine block may be a location at which a leftmost and uppermost sample of the current affine block is located.
For example, for an affine block whose size is W×H, the upper-left corner of the affine block is used as a coordinate origin, coordinates of the upper-left corner of the affine block is (0, 0), and coordinates of the center of the affine block are (W/2, H/2).
Optionally, the subblock at the first preset location in the current affine block is a subblock, in the current affine block, whose upper-left corner is located at the first preset location.
It should be understood that the subblock at the first preset location in the current affine block may alternatively be a subblock, in the current affine block, whose lower-left corner, upper-right corner, or lower-right corner is located at the first preset location.
With reference to the first aspect, in some implementations of the first aspect, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the current affine block.
With reference to the first aspect, in some implementations of the first aspect, the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the affine block.
Optionally, when the first sample set includes only the reconstructed sample neighboring to the upper edge of the current affine block, the second sample set also includes only the reconstructed sample neighboring to the upper edge of the luminance compensation block corresponding to the affine block.
Optionally, when the first sample set includes only the reconstructed sample neighboring to the left edge of the current affine block, the second sample set also includes only the reconstructed sample neighboring to the left edge of the luminance compensation block corresponding to the affine block.
Optionally, when the first sample set includes the reconstructed sample neighboring to the upper edge and the reconstructed sample neighboring to the left edge of the current affine block, the second sample set also includes the reconstructed sample neighboring to the upper edge and the reconstructed sample neighboring to the left edge of the luminance compensation block corresponding to the affine block.
With reference to the first aspect, in some implementations of the first aspect, the determining one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block includes: determining, based on a motion vector of a subblock at a second preset location in the current affine block, a luminance compensation block corresponding to the subblock at the second preset location.
In this application, a motion vector of a subblock at a fixed location in the current affine block is used to determine a luminance compensation block corresponding to the subblock, so that a quantity of luminance compensation blocks that need to be determined can be reduced, and complexity of determining the luminance compensation block can be simplified.
Optionally, the second preset location is one or more of a left edge, an upper edge, or the upper-left corner of the current affine block.
For example, the second preset location may be the left edge, the upper edge, or the upper-left corner of the current affine block.
For another example, the second preset location may be the left edge and the upper edge of the current affine block. In this case, the second preset location includes two locations.
With reference to the first aspect, in some implementations of the first aspect, the second preset location is the left edge and/or the upper edge of the current affine block, and the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the subblock at the second preset location.
With reference to the first aspect, in some implementations of the first aspect, the second preset location is the left edge and/or the upper edge of the current affine block, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
Optionally, the second preset location is the left edge of the current affine block, the first sample set includes the reconstructed sample neighboring to the left edge of the subblock at the second preset location, and the second sample set includes the reconstructed sample neighboring to the left edge of the luminance compensation block corresponding to the subblock at the second preset location.
Optionally, the second preset location is the upper edge of the current affine block, the first sample set includes the reconstructed sample neighboring to the upper edge of the subblock at the second preset location, and the second sample set includes the reconstructed sample neighboring to the upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
Optionally, the second preset location is the left edge and the upper edge of the current affine block, the first sample set includes the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the subblock at the second preset location, and the second sample set includes the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
With reference to the first aspect, in some implementations of the first aspect, the second preset location is the upper-left corner of the current affine block, and the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the subblock at the second preset location.
With reference to the first aspect, in some implementations of the first aspect, the second preset location is the upper-left corner of the current affine block, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
Optionally, the second preset location is the upper-left corner of the current affine block, the first sample set includes the reconstructed sample neighboring to the left edge and/or the reconstructed sample neighboring to the upper edge of the subblock at the second preset location, and the second sample set includes the reconstructed sample neighboring to the left edge and/or the reconstructed sample neighboring to the upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
With reference to the first aspect, in some implementations of the first aspect, the foregoing method is a video decoding method. Before the determining one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block, the method further includes: decoding a bitstream to obtain first identification information, where the first identification information is used to indicate to perform luminance compensation on the current affine block.
Optionally, a local illumination compensation (local illumination compensation, LIC) flag (flag) may be used to represent the first identification information.
The LIC technology is an inter prediction method used to compensate for a luminance difference between a current block and a reference block. In the LIC technology, a predicted value of the current block is derived according to a linear model constructed based on neighboring reconstructed samples of the current block and neighboring reconstructed samples of the reference block.
Optionally, the LIC flag being 1 indicates the first identification information, and indicates that luminance compensation needs to be performed on the current affine block.
Optionally, the LIC flag being 0 indicates second identification information, and indicates that luminance compensation does not need to be performed on the current affine block.
When the foregoing method is a decoding method, if the second identification information is obtained by decoding the bitstream, it is determined that luminance compensation does not need to be performed on the current affine block, and an inter prediction process is completed after the predicted sample value of the current affine block is obtained.
With reference to the first aspect, in some implementations of the first aspect, the method is a video encoding method. The method further includes: generating first identification information, where the first identification information is used to indicate that luminance compensation needs to be performed on the current affine block; and encoding the first identification information to generate a bitstream.
In this application, the first identification information is encoded, so that a decoder side can obtain the first identification information through decoding in a decoding process, and then perform luminance compensation on the affine block in an inter prediction process.
With reference to the first aspect, in some implementations of the first aspect, the updated predicted sample value of the current affine block is obtained according to the following formula:
pred_c(i,j)=α×rec_c(i,j)+β.
pred_c(i, j) is an updated predicted sample value at a location (i, j) in the current affine block, rec_c(i, j) is a predicted sample value at the location (i, j) in the current affine block, and α and β are linear model coefficients.
According to a second aspect, an inter prediction apparatus is provided, including several functional units configured to implement any method in the first aspect.
According to a third aspect, an inter prediction apparatus is provided. The inter prediction apparatus includes: a prediction unit, configured to obtain a predicted sample value of a current affine block; a processing unit, where the processing unit is configured to: determine one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block, and determine a linear model coefficient based on a first sample set and a second sample set, where the first sample set includes at least one reconstructed sample neighboring to an edge of the current affine block, the second sample set includes at least one reconstructed sample neighboring to an edge of the one or more luminance compensation blocks, and the sample in the first sample set is in a one-to-one correspondence with the sample in the second sample set; and an update unit, configured to update the predicted sample value of the current affine block based on the linear model coefficient, to obtain an updated predicted sample value of the current affine block.
With reference to the third aspect, in some implementations of the third aspect, the processing unit is configured to determine, based on the motion vector of each of the plurality of subblocks of the current affine block, a luminance compensation block corresponding to each subblock, to obtain the plurality of luminance compensation blocks.
With reference to the third aspect, in some implementations of the third aspect, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the current affine block.
With reference to the third aspect, in some implementations of the third aspect, the second sample set includes a reconstructed sample at a specific neighboring location of each of the plurality of luminance compensation blocks. The plurality of luminance compensation blocks include a first-type luminance compensation block and/or a second-type luminance compensation block. The first-type luminance compensation block is a luminance compensation block corresponding to a subblock on the upper edge of the current affine block. The second-type luminance compensation block is a luminance compensation block corresponding to a subblock on the left edge of the current affine block. A reconstructed sample at a specific neighboring location of the first-type luminance compensation block is a reconstructed sample neighboring to an upper edge of the first-type luminance compensation block. A reconstructed sample at a specific neighboring location of the second-type luminance compensation block is a reconstructed sample neighboring to a left edge of the second-type luminance compensation block.
With reference to the third aspect, in some implementations of the third aspect, the processing unit is configured to determine, based on a motion vector of a subblock at a first preset location in the current affine block, a luminance compensation block corresponding to the current affine block.
With reference to the third aspect, in some implementations of the third aspect, the first preset location is the upper-left corner or the center of the current affine block.
With reference to the third aspect, in some implementations of the third aspect, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the current affine block, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the current affine block.
With reference to the third aspect, in some implementations of the third aspect, the processing unit is configured to determine, based on a motion vector of a subblock at a second preset location in the current affine block, a luminance compensation block corresponding to the subblock at the second preset location.
With reference to the third aspect, in some implementations of the third aspect, the second preset location is a left edge and/or an upper edge of the current affine block, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the subblock at the second preset location, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
With reference to the third aspect, in some implementations of the third aspect, the second preset location is the upper-left corner of the current affine block, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the subblock at the second preset location, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
With reference to the third aspect, in some implementations of the third aspect, the apparatus is a video decoding apparatus. The apparatus further includes: a decoding unit, configured to decode a bitstream to obtain first identification information, where the first identification information is used to indicate to perform luminance compensation on the current affine block.
Optionally, before the predicted sample value of the current affine block is updated based on the linear model coefficient, the decoding unit decodes the bitstream to obtain the first identification information.
With reference to the third aspect, in some implementations of the third aspect, the updated predicted sample value of the current affine block is obtained according to the following formula:
pred_c(i,j)=α×rec_c(i,j)+β.
pred_c(i, j) is an updated predicted sample value at a location (i, j) in the current affine block, rec_c(i, j) is a predicted sample value at the location (i, j) in the current affine block, and α and β are linear model coefficients.
According to a fourth aspect, a video data decoding device is provided, and the device includes:
a memory, configured to store video data in a form of a bitstream; and
a video decoder, configured to implement some or all steps of any method according to the first aspect.
According to a fifth aspect, a video data encoding device is provided, and the device includes:
a memory, configured to store video data in a form of a bitstream; and
a video encoder, configured to implement some or all steps of any method according to the first aspect.
According to a sixth aspect, an embodiment of this application provides a video data decoding device, including a memory and a processor. The processor invokes program code stored in the memory, to perform some or all steps of any method according to the first aspect.
Optionally, the memory is a non-volatile memory.
Optionally, the memory and the processor are coupled to each other.
According to a seventh aspect, an embodiment of this application provides a computer-readable storage medium. The computer-readable storage medium stores program code, and the program code includes instructions used to perform some or all steps of any method according to the first aspect.
According to an eighth aspect, an embodiment of this application provides a computer program product. When the computer program product runs on a computer, the computer is enabled to perform some or all steps of any method according to the first aspect.
It should be understood that, the technical solutions in the second aspect to the eighth aspect of this application are consistent with the technical solution in the first aspect. Beneficial effects achieved in the various aspects and corresponding feasible implementations are similar, and details are not described again.
The following describes the embodiments of this application with reference to the accompanying drawings.
In the following description, reference is made to the accompanying drawings that form a part of this application and show, by way of illustration, specific aspects of the embodiments of this application or specific aspects in which the embodiments of this application may be used. It should be understood that the embodiments of this application may further be used in another aspect, and may include structural or logical changes not depicted in the accompanying drawings. Therefore, the following detailed description shall not be taken in a limiting sense, and the scope of this application should be defined by the appended claims.
For example, it should be understood that a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa.
For another example, if one or more specific method steps are described, a corresponding device may include one or more units such as functional units, to perform the described one or more method steps (for example, one unit performing the one or more steps; or a plurality of units each performing one or more of the plurality of steps), even if such one or more units are not explicitly described or illustrated in the accompanying drawings.
In addition, if a specific apparatus is described based on one or more units such as functional units, a corresponding method may include one step used to perform a function of one or more units (for example, one step used to perform the function of the one or more units, or a plurality of steps each used to perform the function of one or more of the plurality of units), even if such one or more steps are not explicitly described or illustrated in the accompanying drawings. Further, it should be understood that features of the various example embodiments and/or aspects described in this specification may be combined with each other, unless specifically noted otherwise.
The technical solutions in the embodiments of this application may not only be applied to existing video coding standards (for example, standards such as H.264 and HEVC), but also be applied to future video coding standards (for example, the H.266 standard). Terms used in implementations of this application are merely intended to explain specific embodiments of this application, and are not intended to limit this application. The following first briefly describes some concepts that may be used in the embodiments of this application.
Video coding typically refers to processing of a sequence of pictures that constitute a video or a video sequence. In the video coding field, the terms “picture (picture)”, “frame (frame)”, and “image (image)” may be used as synonyms. Video coding in this specification refers to video encoding or video decoding. Video encoding is performed on a source side, and usually includes processing (for example, through compression) an original video picture to reduce an amount of data for representing the video picture, for more efficient storage and/or transmission. Video decoding is performed on a destination side, and usually includes inverse processing relative to an encoder to reconstruct the video picture. “Coding” of a video picture in the embodiments should be understood as “encoding” or “decoding” of a video sequence. A combination of an encoding part and a decoding part is also referred to as coding (encoding and decoding).
A video sequence includes a series of pictures (picture), the picture is further split into slices (slice), and the slice is further split into blocks (block). Video coding is performed by block. In some new video coding standards, the concept “block” is further extended. For example, a macroblock (macroblock, MB) is introduced to the H.264 standard. The macroblock may further be split into a plurality of prediction blocks (partition) that can be used for predictive coding. In the high efficiency video coding (high efficiency video coding, HEVC) standard, basic concepts such as a “coding unit” (coding unit, CU), a “prediction unit” (prediction unit, PU), and a “transform unit” (transform unit, TU) are used, a plurality of block units are obtained through functional division, and a brand-new tree-based structure is used for description. For example, a CU may be split into smaller CUs through quadtree split, and the smaller CU may further be split, to generate a quadtree structure. The CU is a basic unit for splitting and encoding a coding picture. A PU and a TU also have similar tree structures. The PU may correspond to a prediction block, and is a basic unit for predictive coding. The CU is further split into a plurality of PUs based on a splitting pattern. The TU may correspond to a transform block, and is a basic unit for transforming a prediction residual. However, in essence, all of the CU, the PU, and the TU are conceptually blocks (or referred to as picture blocks).
For example, in HEVC, a CTU is split into a plurality of CUs by using a quadtree structure represented as a coding tree. A decision on whether to encode a picture region through inter (temporal) or intra (spatial) prediction is made at a CU level. Each CU may further be split into one, two, or four PUs based on a PU splitting pattern. In one PU, a same prediction process is applied, and related information is transmitted to a decoder on a PU basis. After obtaining a residual block by applying the prediction process based on the PU splitting pattern, the CU may be partitioned into transform units (transform unit, TU) based on another quadtree structure similar to the coding tree used for the CU. In the recent development of video compression technologies, a quad-tree and binary tree (quad-tree and binary tree, QTBT) partition frame is used to partition a coding block. In a QTBT block structure, the CU may be square or rectangular.
In this specification, for ease of description and understanding, a to-be-coded picture block in a current coded picture may be referred to as a current block. For example, in encoding, the current block is a block that is being encoded, and in decoding, the current block is a block that is being decoded. A decoded picture block, in a reference picture, used to predict the current block is referred to as a reference block. To be specific, the reference block is a block that provides a reference signal for the current block, and the reference signal represents a sample value in the picture block. A block that is in the reference picture and that provides a prediction signal for the current block may be referred to as a prediction block. The prediction signal represents a sample value, a sampling value, or a sampling signal in the prediction block. For example, after a plurality of reference blocks are traversed, an optimal reference block is found. The optimal reference block provides prediction for the current block, and this block is referred to as a prediction block.
In a case of lossless video coding, an original video picture may be reconstructed. In other words, a reconstructed video picture has same quality as the original video picture (assuming that no transmission loss or other data loss occurs during storage or transmission). In a case of lossy video coding, further compression is performed through, for example, quantization, to reduce an amount of data for representing a video picture, but the video picture cannot be reconstructed on a decoder side. To be specific, quality of a reconstructed video picture is lower or poorer than that of the original video picture.
Several H.261 video coding standards are for “lossy hybrid video coding” (to be specific, spatial and temporal prediction in a sample domain is combined with 2D transform coding for applying quantization in a transform domain). Each picture of a video sequence is usually partitioned into a set of non-overlapping blocks, and coding is usually performed at a block level. To be specific, on an encoder side, a video is usually processed, that is, encoded, at a block (video block) level. For example, a prediction block is generated through spatial (intra) prediction and temporal (inter) prediction, the prediction block is subtracted from a current block (a block being processed or to be processed) to obtain a residual block, and the residual block is transformed in the transform domain and quantized to reduce an amount of data that is to be transmitted (compressed). On a decoder side, an inverse processing part relative to an encoder is applied to an encoded block or a compressed block to reconstruct the current block for representation. Furthermore, the encoder duplicates a processing loop of the decoder, so that the encoder and the decoder generate same prediction (for example, intra prediction and inter prediction) and/or reconstruction for processing, that is, coding, a subsequent block.
The following describes a system architecture used in the embodiments of this application.
Although
A communication connection between the source device 12 and the destination device 14 may be implemented over a link 13, and the destination device 14 may receive encoded video data from the source device 12 over the link 13. The link 13 may include one or more media or apparatuses capable of moving the encoded video data from the source device 12 to the destination device 14. In an example, the link 13 may include one or more communication media that enable the source device 12 to directly transmit the encoded video data to the destination device 14 in real time. In this example, the source device 12 may modulate the encoded video data according to a communications standard (for example, a wireless communications protocol), and may transmit modulated video data to the destination device 14. The one or more communications media may include a wireless communications medium and/or a wired communications medium, for example, a radio frequency (RF) spectrum or one or more physical transmission cables. The one or more communications media may be a part of a packet-based network, and the packet-based network is, for example, a local area network, a wide area network, or a global network (for example, the internet). The one or more communications media may include a router, a switch, a base station, or another device that facilitates communication from the source device 12 to the destination device 14.
The source device 12 includes an encoder 20. Optionally, the source device 12 may further include a picture source 16, a picture preprocessor 18, and a communications interface 22. In a specific implementation, the encoder 20, the picture source 16, the picture preprocessor 18, and the communications interface 22 may be hardware components in the source device 12, or may be software programs in the source device 12. Descriptions are separately provided as follows:
The picture source 16 may include or be any type of picture capturing device configured to, for example, capture a real-world picture; and/or any type of device for generating a picture or comment (for screen content encoding, some text on a screen is also considered as a part of a to-be-encoded picture or image), for example, a computer graphics processor configured to generate a computer animation picture; or any type of device configured to obtain and/or provide a real-world picture or a computer animation picture (for example, screen content or a virtual reality (virtual reality, VR) picture), and/or any combination thereof (for example, an augmented reality (augmented reality, AR) picture). The picture source 16 may be a camera configured to capture a picture or a memory configured to store a picture. The picture source 16 may further include any type of (internal or external) interface through which a previously captured or generated picture is stored and/or a picture is obtained or received. When the picture source 16 is a camera, the picture source 16 may be, for example, a local camera or an integrated camera integrated into the source device. When the picture source 16 is a memory, the picture source 16 may be a local memory or, for example, an integrated memory integrated into the source device. When the picture source 16 includes an interface, the interface may be, for example, an external interface for receiving a picture from an external video source. The external video source is, for example, an external picture capturing device such as a camera, an external memory, or an external picture generation device. The external picture generation device is, for example, an external computer graphics processor, a computer, or a server. The interface may be any type of interface, for example, a wired or wireless interface or an optical interface, according to any proprietary or standardized interface protocol.
A picture may be considered as a two-dimensional array or matrix of picture elements (picture element). The picture element in the array may also be referred to as a sample. Quantities of samples in horizontal and vertical directions (or axes) of the array or the picture define a size and/or resolution of the picture. For representation of a color, typically three color components are used. To be specific, the picture may be represented as or include three sample arrays. For example, in an RBG format or color space, the picture includes corresponding red, green, and blue sample arrays. However, in video coding, each sample is typically represented in a luminance/chrominance format or a color space. For example, a picture in a YUV format includes a luminance component indicated by Y (sometimes L is used instead) and two chrominance components indicated by U and V. The luminance (luma) component Y represents brightness or gray level intensity (for example, both are the same in a gray-scale picture), and the two chrominance (chroma) components U and V represent chrominance or color information components. Correspondingly, the picture in the YUV format includes a luminance sample array of luminance sample values (Y) and two chrominance sample arrays of chrominance values (U and V). A picture in an RGB format may be converted or transformed into a picture in the YUV format and vice versa, and such a process is also known as color transformation or conversion. If a picture is monochrome, the picture may include only a luminance sample array. In this embodiment of this application, a picture transmitted by the picture source 16 to a picture processor may also be referred to as original picture data 17.
The picture preprocessor 18 is configured to receive the original picture data 17 and perform preprocessing on the original picture data 17 to obtain a preprocessed picture 19 or preprocessed picture data 19. For example, the preprocessing performed by the picture preprocessor 18 may include trimming, color format conversion (for example, from an RGB format to a YUV format), color correction, or de-noising.
The encoder 20 (also referred to as a video encoder 20) is configured to receive the preprocessed picture data 19, and process the preprocessed picture data 19 in a related prediction mode (such as a prediction mode in the embodiments of this specification), to provide encoded picture data 21 (structural details of the encoder 20 are further described below based on
The communications interface 22 may be configured to receive the encoded picture data 21, and transmit the encoded picture data 21 to the destination device 14 or any other device (for example, a memory) over the link 13 for storage or direct reconstruction. The other device may be any device used for decoding or storage. The communications interface 22 may be, for example, configured to package the encoded picture data 21 in an appropriate format, for example, into a data packet for transmission over the link 13.
The destination device 14 includes a decoder 30. Optionally, the destination device 14 may further include a communications interface 28, a picture post-processor 32, and a display device 34. Descriptions are separately provided as follows:
The communications interface 28 may be configured to receive the encoded picture data 21 from the source device 12 or any other source. The any other source is, for example, a storage device. The storage device is, for example, an encoded picture data storage device. The communications interface 28 may be configured to transmit or receive the encoded picture data 21 over the link 13 between the source device 12 and the destination device 14 or over any type of network. The link 13 is, for example, a direct wired or wireless connection. The any type of network is, for example, a wired or wireless network or any combination thereof, or any type of private or public network or any combination thereof. The communications interface 28 may be, for example, configured to depackage the data packet transmitted through the communications interface 22, to obtain the encoded picture data 21.
Both the communications interface 28 and the communications interface 22 may be configured as unidirectional communications interfaces or bidirectional communications interfaces, and may be configured to, for example, send and receive messages to establish a connection, and acknowledge and exchange any other information related to a communication link and/or data transmission such as encoded picture data transmission.
The decoder 30 (also referred to as the decoder 30) is configured to receive the encoded picture data 21 and provide decoded picture data 31 or a decoded picture 31 (structural details of the decoder 30 are further described below based on
The picture post-processor 32 is configured to post-process the decoded picture data 31 (also referred to as reconstructed picture data) to obtain post-processed picture data 33. The post-processing performed by the picture post-processor 32 may include color format conversion (for example, from a YUV format to an RGB format), color correction, trimming, re-sampling, or any other processing. The picture post-processor 32 may further be configured to transmit the post-processed picture data 33 to the display device 34.
The display device 34 is configured to receive the post-processed picture data 33 to display a picture to, for example, a user or a viewer. The display device 34 may be or may include any type of display for presenting a reconstructed picture, for example, an integrated or external display or monitor. For example, the display may include a liquid crystal display (liquid crystal display, LCD), an organic light emitting diode (organic light emitting diode, OLED) display, a plasma display, a projector, a micro LED display, a liquid crystal on silicon (liquid crystal on silicon, LCoS), a digital light processor (digital light processor, DLP), or any types of other displays.
Although
Based on the descriptions, a person skilled in the art can definitely learn that existence and (exact) division of functionalities of different units or functionalities of the source device 12 and/or the destination device 14 shown in
The encoder 20 and the decoder 30 each may be implemented as any one of various appropriate circuits, for example, one or more microprocessors, digital signal processors (digital signal processor, DSP), application-specific integrated circuits (application-specific integrated circuit, ASIC), field-programmable gate arrays (field-programmable gate array, FPGA), discrete logic, hardware, or any combinations thereof. If the technologies are implemented partially by using software, a device may store software instructions in a suitable non-transitory computer-readable storage medium and may execute the instructions by using hardware such as one or more processors, to perform the technologies of this specification. Any of the foregoing content (including hardware, software, a combination of hardware and software, and the like) may be considered as one or more processors.
In some cases, the video encoding and decoding system 10 shown in
For example, the residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the prediction processing unit 260, and the entropy encoding unit 270 form a forward signal path of the encoder 20, whereas, for example, the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (decoded picture buffer, DPB) 230, and the prediction processing unit 260 form a backward signal path of the encoder. The backward signal path of the encoder corresponds to a signal path of a decoder (refer to a decoder 30 in
The encoder 20 receives, for example, via an input 202, a picture 201 or a picture block 203 of the picture 201, for example, a picture in a sequence of pictures forming a video or a video sequence. The picture block 203 may also be referred to as a current picture block or a to-be-encoded picture block, and the picture 201 may be referred to as a current picture or a to-be-encoded picture (particularly in video coding, for distinguishing the current picture from other pictures, for example, previously encoded and/or decoded pictures in a same video sequence, namely, the video sequence that also includes the current picture).
An embodiment of the encoder 20 may include a partitioning unit (not shown in
In an example, the prediction processing unit 260 of the encoder 20 may be configured to perform any combination of the partitioning technologies described above.
Like the picture 201, the picture block 203 is also or may be considered as a two-dimensional array or matrix of samples with sample values, although a size of the picture block 203 is smaller than a size of the picture 201. In other words, the picture block 203 may include, for example, one sample array (for example, a luma array in a case of a monochrome picture 201), three sample arrays (for example, one luma array and two chroma arrays in a case of a color picture), or any other quantity and/or type of arrays depending on an applied color format. Quantities of samples in horizontal and vertical directions (or axes) of the picture block 203 define a size of the picture block 203.
The encoder 20 shown in
The residual calculation unit 204 is configured to calculate a residual block 205 based on the picture block 203 and a prediction block 265 (other details about the prediction block 265 are provided below), for example, by subtracting sample values of the prediction block 265 from sample values of the picture block 203 sample by sample (pixel by pixel), to obtain the residual block 205 in a sample domain.
The transform processing unit 206 is configured to apply a transform, for example, a discrete cosine transform (discrete cosine transform, DCT) or a discrete sine transform (discrete sine transform, DST), to sample values of the residual block 205 to obtain transform coefficients 207 in a transform domain. The transform coefficient 207 may also be referred to as a transform residual coefficient and represents the residual block 205 in the transform domain.
The transform processing unit 206 may be configured to apply integer approximations of DCT/DST, such as transforms specified in HEVC/H.265. In comparison with an orthogonal DCT transform, such an integer approximation is typically scaled by a factor. To preserve a norm of a residual block which is processed by using forward and inverse transforms, applying an additional scale factor is a part of a transform process. The scaling factor is usually selected based on some constraints. For example, the scaling factor is a power of two for a shift operation, a bit depth of the transform coefficient, and a tradeoff between accuracy and implementation costs. For example, a specific scaling factor is specified for the inverse transform by, for example, the inverse transform processing unit 212 on the decoder side 30 (and a corresponding inverse transform by, for example, the inverse transform processing unit 212 on the encoder 20 side), and correspondingly, a corresponding scaling factor may be specified for the forward transform by the transform processing unit 206 on the encoder 20 side.
The quantization unit 208 is configured to quantize the transform coefficients 207 to obtain quantized transform coefficients 209, for example, by applying scalar quantization or vector quantization. The quantized transform coefficient 209 may also be referred to as a quantized residual coefficient 209. A quantization process may reduce a bit depth related to some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be rounded down to an m-bit transform coefficient during quantization, where n is greater than m. A quantization degree may be modified by adjusting a quantization parameter (quantization parameter, QP). For example, for scalar quantization, different scales may be applied to achieve finer or coarser quantization. A smaller quantization step corresponds to finer quantization, and a larger quantization step corresponds to coarser quantization. An appropriate quantization step may be indicated by a quantization parameter (quantization parameter, QP). For example, the quantization parameter may be an index to a predefined set of appropriate quantization steps. For example, a smaller quantization parameter may correspond to finer quantization (a smaller quantization step), and a larger quantization parameter may correspond to coarser quantization (a larger quantization step), or vice versa. The quantization may include division by a quantization step and corresponding quantization or inverse quantization, for example, performed by the inverse quantization unit 210, or may include multiplication by a quantization step. In embodiments according to some standards such as HEVC, a quantization parameter may be used to determine the quantization step. Generally, the quantization step may be calculated based on a quantization parameter by using a fixed point approximation of an equation including division. An additional scaling factor may be introduced for quantization and dequantization to restore the norm of the residual block, where the norm of the residual block may be modified because of a scale used in the fixed point approximation of the equation for the quantization step and the quantization parameter. In an example implementation, scales of the inverse transform and the dequantization may be combined. Alternatively, a customized quantization table may be used and signaled from the encoder to the decoder, for example, in a bitstream. The quantization is a lossy operation, where a loss increases with an increasing quantization step.
The inverse quantization unit 210 is configured to apply the inverse quantization of the quantization unit 208 to a quantized coefficient to obtain a dequantized coefficient 211, for example, apply, based on or by using a same quantization step as the quantization unit 208, the inverse of a quantization scheme applied by the quantization unit 208. The dequantized coefficient 211 may also be referred to as a dequantized residual coefficient 211, and correspond to the transform coefficient 207, although usually different from the transform coefficient due to a loss caused by quantization.
The inverse transform processing unit 212 is configured to apply an inverse transform of the transform applied by the transform processing unit 206, for example, an inverse discrete cosine transform (discrete cosine transform, DCT) or an inverse discrete sine transform (discrete sine transform, DST), to obtain an inverse transform block 213 in the sample domain. The inverse transform block 213 may also be referred to as an inverse transform dequantized block 213 or an inverse transform residual block 213.
The reconstruction unit 214 (for example, a summer 214) is configured to add the inverse transform block 213 (namely, a reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in a sample domain, for example, by adding a sample value of the reconstructed residual block 213 and the sample value of the prediction block 265.
Optionally, a buffer unit 216 (or briefly referred to as a “buffer” 216) of, for example, the line buffer 216, is configured to buffer or store the reconstructed block 215 and a corresponding sample value, for example, for intra prediction. In another embodiment, the encoder may be configured to use unfiltered reconstructed blocks and/or corresponding sample values stored in the buffer unit 216 for any type of estimation and/or prediction, for example, intra prediction.
For example, in an embodiment, the encoder 20 may be configured so that the buffer unit 216 is configured to store not only the reconstructed block 215 used for the intra prediction unit 254 but also a reconstructed block (not shown in
The loop filter unit 220 (or briefly referred to as a “loop filter” 220) is configured to filter the reconstructed block 215 to obtain the filtered block 221, to smooth sample transition or improve video quality. The loop filter unit 220 is intended to represent one or more loop filters including, for example, a deblocking filter, a sample-adaptive offset (sample-adaptive offset, SAO) filter, or another filter, for example, a bilateral filter, an adaptive loop filter (adaptive loop filter, ALF), a sharpening or smoothing filter, or a collaborative filter. Although the loop filter unit 220 is shown as an in-loop filter in
In an embodiment, the encoder 20 (correspondingly, the loop filter unit 220) may be configured to output a loop filter parameter (for example, sample adaptive offset information), for example, directly or after entropy encoding performed by the entropy encoding unit 270 or any other entropy encoding unit, so that, for example, the decoder 30 can receive and apply the same loop filter parameter for decoding.
The decoded picture buffer (decoded picture buffer, DPB) 230 may be a reference picture memory that stores reference picture data for use in encoding video data by the encoder 20. The DPB 230 may be formed by any one of a variety of memory devices such as a dynamic random access memory (dynamic random access memory, DRAM) (including a synchronous DRAM (synchronous DRAM, SDRAM), a magnetoresistive RAM (magnetoresistive RAM, MRAM), and a resistive RAM (resistive RAM, RRAM)), or another type of memory device. The DPB 230 and the buffer 216 may be provided by a same memory device or separate memory devices. In an example, the decoded picture buffer (decoded picture buffer, DPB) 230 is configured to store the filtered block 221. The decoded picture buffer 230 may further be configured to store another previously filtered block, for example, a previously reconstructed and filtered block 221, of the same current picture or of a different picture, for example, a previously reconstructed picture, and may provide a complete previously reconstructed, that is, decoded picture (and a corresponding reference block and sample) and/or a partially reconstructed current picture (and a corresponding reference block and sample), for example, for inter prediction. In an example, if the reconstructed block 215 is reconstructed without in-loop filtering, the decoded picture buffer (decoded picture buffer, DPB) 230 is configured to store the reconstructed block 215.
The prediction processing unit 260, also referred to as a block prediction processing unit 260, is configured to receive or obtain the picture block 203 (a current picture block 203 of the current picture 201) and reconstructed picture data, for example, reference samples of the same (current) picture from the buffer 216 and/or reference picture data 231 of one or more previously decoded pictures from the decoded picture buffer 230, and to process such data for prediction, that is, to provide the prediction block 265 that may be an inter prediction block 245 or an intra prediction block 255.
The mode selection unit 262 may be configured to select a prediction mode (for example, an intra or inter prediction mode) and/or a corresponding prediction block 245 or 255 to be used as the prediction block 265, for calculation of the residual block 205 and for reconstruction of the reconstructed block 215.
In an embodiment, the mode selection unit 262 may be configured to select the prediction mode (for example, from prediction modes supported by the prediction processing unit 260), where the prediction mode provides a best match or a minimum residual (the minimum residual means better compression for transmission or storage), or provides minimum signaling overheads (the minimum signaling overheads mean better compression for transmission or storage), or considers or balances both. The mode selection unit 262 may be configured to determine the prediction mode based on rate distortion optimization (rate distortion optimization, RDO), that is, select a prediction mode that provides minimum rate-distortion optimization or select a prediction mode for which related rate distortion at least satisfies a prediction mode selection criterion.
The following describes in detail prediction processing performed (for example, by the prediction processing unit 260) and mode selection performed (for example, by the mode selection unit 262) by an example of the encoder 20.
As described above, the encoder 20 is configured to determine or select an optimal or optimum prediction mode from a set of (predetermined) prediction modes. The set of prediction modes may include, for example, an intra prediction mode and/or an inter prediction mode.
A set of intra prediction modes may include 35 different intra prediction modes, for example, non-directional modes such as a DC (or average) mode and a planar mode, or directional modes such as those defined in H.265, or may include 67 different intra prediction modes, for example, non-directional modes such as a DC (or average) mode and a planar mode, or directional modes such as those defined in H.266 under development.
In a possible implementation, a set of inter prediction modes depends on available reference pictures (namely, for example, at least some decoded pictures stored in the DBP 230, as described above) and other inter prediction parameters, for example, depends on whether an entire reference picture or only a part of the reference picture, for example, a search window area around an area of the current block, is used to search for a best matching reference block, and/or for example, depends on whether sample interpolation such as half-pel and/or quarter-pel interpolation is applied. The set of inter prediction modes may include, for example, an advanced motion vector prediction (advanced motion vector prediction, AMVP) mode and a merge (merge) mode. In a specific implementation, the set of inter prediction modes may include an improved control point-based AMVP mode and an improved control point-based merge mode in the embodiments of this application. In an example, the intra prediction unit 254 may be configured to perform any combination of inter prediction technologies described below.
In addition to the foregoing prediction modes, a skip mode and/or a direct mode may also be used in the embodiments of this application.
The prediction processing unit 260 may further be configured to partition the picture block 203 into smaller block partitions or subblocks, for example, by iteratively using quadtree (quad-tree, QT) partitioning, binary tree (binary-tree, BT) partitioning, triple tree (triple-tree, TT) partitioning, or any combination thereof, and perform, for example, prediction on each of the block partitions or subblocks. Mode selection includes selection of a tree structure of the partitioned picture block 203 and selection of a prediction mode applied to each of the block partitions or subblocks.
The inter prediction unit 244 may include a motion estimation (motion estimation, ME) unit (not shown in
For example, the encoder 20 may be configured to select a reference block from a plurality of reference blocks of a same picture or different pictures in a plurality of other pictures and provide, for the motion estimation unit (not shown in
The motion compensation unit is configured to obtain the inter prediction parameter, and perform inter prediction based on or by using the inter prediction parameter, to obtain the inter prediction block 245. Motion compensation performed by the motion compensation unit (not shown in
Specifically, the inter prediction unit 244 may transmit the syntax elements to the entropy encoding unit 270. The syntax elements include the inter prediction parameter (such as indication information of selection of an inter prediction mode used for prediction of the current block after traversal of a plurality of inter prediction modes). In a possible application scenario, if there is only one inter prediction mode, the inter prediction parameter may alternatively not be carried in the syntax element. In this case, the decoder side 30 may directly perform decoding by using a default prediction mode. It may be understood that the inter prediction unit 244 may be configured to perform any combination of inter prediction technologies.
The intra prediction unit 254 is configured to obtain, for example, receive, the picture block 203 (the current picture block) and one or more previously reconstructed blocks, for example, reconstructed neighboring blocks, of a same picture for intra estimation. For example, the encoder 20 may be configured to select an intra prediction mode from a plurality of (predetermined) intra prediction modes.
In an embodiment, the encoder 20 may be configured to select the intra prediction mode according to an optimization criterion, for example, based on a minimum residual (for example, an intra prediction mode providing the prediction block 255 that is most similar to the current picture block 203) or minimum rate distortion.
The intra prediction unit 254 is further configured to determine the intra prediction block 255 based on, for example, an intra prediction parameter in the selected intra prediction mode. In any case, after selecting an intra-prediction mode for a block, the intra prediction unit 254 is further configured to provide an intra prediction parameter, namely, information indicating the selected intra-prediction mode for the block, to the entropy encoding unit 270. In an example, the intra prediction unit 254 may be configured to perform any combination of intra prediction technologies.
Specifically, the intra prediction unit 254 may transmit syntax elements to the entropy encoding unit 270. The syntax elements include the intra prediction parameter (such as indication information of selection of an intra prediction mode used for prediction of the current block after traversal of a plurality of intra prediction modes). In a possible application scenario, if there is only one intra prediction mode, the intra prediction parameter may alternatively not be carried in the syntax element. In this case, the decoder side 30 may directly perform decoding in a default prediction mode.
The entropy encoding unit 270 is configured to apply (or not apply) an entropy encoding algorithm or scheme (for example, a variable-length coding (variable length coding, VLC) scheme, a context adaptive VLC (context adaptive VLC, CAVLC) scheme, an arithmetic coding scheme, a context adaptive binary arithmetic coding (context adaptive binary arithmetic coding, CABAC) scheme, a syntax-based context-adaptive binary arithmetic coding (syntax-based context-adaptive binary arithmetic coding, SBAC) scheme, a probability interval partitioning entropy (probability interval partitioning entropy, PIPE) coding scheme, or another entropy encoding methodology or technology) to one or all of the quantized residual coefficient 209, the inter prediction parameter, the intra prediction parameter, and/or the loop filter parameter, to obtain encoded picture data 21 that may be output via an output 272, for example, in a form of an encoded bitstream 21. The encoded bitstream may be transmitted to the video decoder 30, or archived for later transmission or retrieval by the video decoder 30. The entropy encoding unit 270 may further be configured to entropy encode another syntax element for a current video slice being encoded.
Another structural variant of the video encoder 20 can be used to encode a video stream. For example, a non-transform based encoder 20 may directly quantize a residual signal without the transform processing unit 206 for some blocks or frames. In another implementation, the encoder 20 may have the quantization unit 208 and the inverse quantization unit 210 that are combined into a single unit.
Specifically, in this embodiment of this application, the encoder 20 may be configured to implement a video encoding method described in the following embodiments.
It should be understood that the video encoder in this application may include only some modules in the video encoder 20. For example, the video encoder in this application may include a picture decoding unit and a partitioning unit. The picture decoding unit may include one or more of an entropy decoding unit, a prediction unit, an inverse transform unit, and an inverse quantization unit.
In addition, another structural variant of the video encoder 20 can be used to encode a video stream. For example, for some picture blocks or picture frames, the video encoder 20 may directly quantize a residual signal, processing by the transform processing unit 206 is not required, and correspondingly, processing by the inverse transform processing unit 212 is not required either. Alternatively, for some picture blocks or picture frames, the video encoder 20 does not generate residual data, and correspondingly, processing by the transform processing unit 206, the quantization unit 208, the inverse quantization unit 210, and the inverse transform processing unit 212 is not required. Alternatively, the video encoder 20 may directly store a reconstructed picture block as a reference block, and processing by the filter 220 is not required. Alternatively, the quantization unit 208 and the inverse quantization unit 210 in the video encoder 20 may be combined. The loop filter 220 is optional. In addition, in a case of lossless compression coding, the transform processing unit 206, the quantization unit 208, the inverse quantization unit 210, and the inverse transform processing unit 212 are optional. It should be understood that in different application scenarios, the inter prediction unit 244 and the intra prediction unit 254 may be selectively enabled.
In the example of
The entropy decoding unit 304 is configured to perform entropy decoding on the encoded picture data 21 to obtain, for example, a quantized coefficient 309 and/or a decoded encoding parameter (not shown in
The inverse quantization unit 310 may have a same function as the inverse quantization unit 110. The inverse transform processing unit 312 may have a same function as the inverse transform processing unit 212. The reconstruction unit 314 may have a same function as the reconstruction unit 214. The buffer 316 may have a same function as the buffer 216. The loop filter 320 may have a same function as the loop filter 220. The decoded picture buffer 330 may have a same function as the decoded picture buffer 230.
The prediction processing unit 360 may include the inter prediction unit 344 and the intra prediction unit 354. The inter prediction unit 344 may resemble the inter prediction unit 244 in function, and the intra prediction unit 354 may resemble the intra prediction unit 254 in function. The prediction processing unit 360 is usually configured to perform block prediction and/or obtain a prediction block 365 from the encoded data 21, and receive or obtain (explicitly or implicitly) a prediction-related parameter and/or information about a selected prediction mode, for example, from the entropy decoding unit 304.
When the video slice is encoded into an intra-encoded (I) slice, the intra prediction unit 354 of the prediction processing unit 360 is configured to generate the prediction block 365 for a picture block in the current video slice based on a signaled intra prediction mode and data that is from a previously decoded block of a current frame or picture. When the video frame is encoded into an inter encoded (namely, B or P) slice, the inter prediction unit 344 (for example, a motion compensation unit) in the prediction processing unit 360 is configured to generate a prediction block 365 of a video block in the current video slice based on a motion vector and the another syntax element that is received from the entropy decoding unit 304. For inter prediction, the prediction block may be generated from one of reference pictures in one reference picture list. The video decoder 30 may construct reference frame lists: a list 0 and a list 1, by using a default construction technology based on reference pictures stored in the DPB 330.
The prediction processing unit 360 is configured to determine prediction information for the video block in the current video slice by parsing the motion vector and the another syntax element, and use the prediction information to generate the prediction block for the current video block that is being decoded. In an example of this application, the prediction processing unit 360 determines, by using some received syntax elements, a prediction mode (for example, intra or inter prediction) for encoding the video block in the video slice, an inter prediction slice type (for example, a B slice, a P slice, or a GPB slice), construction information of one or more of reference picture lists for the slice, a motion vector of each inter encoded video block for the slice, an inter prediction status of each inter encoded video block in the slice, and other information, to decode the video block in the current video slice. In another example of this application, the syntax element received by the video decoder 30 from the bitstream includes a syntax element in one or more of an adaptive parameter set (adaptive parameter set, APS), a sequence parameter set (sequence parameter set, SPS), a picture parameter set (picture parameter set, PPS), or a slice header.
The inverse quantization unit 310 may be configured to perform inverse quantization (namely, dequantization) on a quantized transform coefficient provided in the bitstream and decoded by the entropy decoding unit 304. An inverse quantization process may include: using a quantization parameter calculated by the video encoder 20 for each video block in the video slice, to determine a quantization degree that should be applied and, likewise, an inverse quantization degree that should be applied.
The inverse transform processing unit 312 is configured to apply an inverse transform (for example, an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process) to a transform coefficient, to generate a residual block in a sample domain.
The reconstruction unit 314 (for example, the summator 314) is configured to add an inverse transform block 313 (namely, a reconstructed residual block 313) to the prediction block 365, to obtain a reconstructed block 315 in a sample domain, for example, by adding sample values of the reconstructed residual block 313 and sample values of the prediction block 365.
The loop filter unit 320 (in a coding loop or after a coding loop) is configured to filter the reconstructed block 315 to obtain a filtered block 321, to smooth sample transition or improve video quality. In an example, the loop filter unit 320 may be configured to perform any combination of filtering technologies described below. The loop filter unit 320 is intended to represent one or more loop filters such as a deblocking filter, a sample-adaptive offset (sample-adaptive offset, SAO) filter, or another filter, for example, a bilateral filter, an adaptive loop filter (adaptive loop filter, ALF), a sharpening or smoothing filter, or a collaborative filter. Although the loop filter unit 320 is shown as an in-loop filter in
Then, a decoded video block 321 in a given frame or picture is stored in the decoded picture buffer 330 that stores a reference picture used for subsequent motion compensation.
The decoder 30 is configured to, for example, output the decoded picture 31 via an output 332, for presentation or viewing to a user.
Another variant of the video decoder 30 may be used to decode a compressed bitstream. For example, the decoder 30 may generate an output video stream without the loop filter unit 320. For example, a non-transform based decoder 30 may directly inverse-quantize a residual signal without the inverse transform processing unit 312 for some blocks or frames. In another implementation, the video decoder 30 may have the inverse quantization unit 310 and the inverse transform processing unit 312 that are combined into a single unit.
Specifically, in this embodiment of this application, the decoder 30 is configured to implement a video decoding method described in the following embodiments.
It should be understood that the video decoder in this application may include only some modules in the video decoder 30. For example, the video decoder in this application may include a partitioning unit and a picture coding unit. The picture coding unit may include one or more of a prediction unit, a transform unit, a quantization unit, and an entropy encoding unit.
In addition, another structural variant of the video decoder 30 can be used to decode an encoded video bitstream. For example, the video decoder 30 may generate an output video stream without processing by the filter 320. Alternatively, for some picture blocks or picture frames, the entropy decoding unit 304 of the video decoder 30 does not obtain quantized coefficients through decoding, and correspondingly, there is no need for the inverse quantization unit 310 and the inverse transform processing unit 312 to perform processing. The loop filter 320 is optional. In addition, in a case of lossless compression, the inverse quantization unit 310 and the inverse transform processing unit 312 are also optional. It should be understood that in different application scenarios, the inter prediction unit and the intra prediction unit may be selectively enabled.
It should be understood that, in the encoder 20 and the decoder 30 in this application, a processing result for a procedure may be output to a next procedure after being further processed. For example, after a procedure such as interpolation filtering, motion vector derivation, or loop filtering, an operation such as (clip) clip or shift (shift) is further performed on a processing result of the corresponding procedure.
For example, a motion vector that is of a control point of a current picture block and that is derived based on a motion vector of a neighboring affine coding block (a coding block that is predicted by using an affine motion model may be referred to as an affine coding block) or a motion vector that is of a subblock of the current picture block and that is derived based on the motion vector of the neighboring affine coding block may further be processed. This is not limited in this application. For example, a value of the motion vector is constrained to be within a specific bit depth range. Assuming that an allowed bit depth of the motion vector is bitDepth, the value of the motion vector ranges from −2{circumflex over ( )}(bitDepth−1) to 2{circumflex over ( )}(bitDepth−1)−1, where the symbol “{circumflex over ( )}” represents exponentiation. If bitDepth is 16, the value ranges from −32768 to 32767. If bitDepth is 18, the value ranges from −131072 to 131071.
For another example, the value of the motion vector (for example, motion vectors MVs of four 4×4 subblocks within one 8×8 picture block) may further be constrained, so that a maximum difference between integer parts of the MVs of the four 4×4 subblocks does not exceed N (for example, N may be set to 1) samples.
As shown in
In some examples, the antenna 42 may be configured to transmit or receive an encoded bitstream of video data. In addition, in some examples, the display device 45 may be configured to present the video data. In some examples, the logic circuit 47 may be implemented by the processing unit 46. The processing unit 46 may include application-specific integrated circuit (application-specific integrated circuit, ASIC) logic, a graphics processor, a general-purpose processor, or the like. The video coding system 40 may also include the optional processor 43. The optional processor 43 may similarly include application-specific integrated circuit (application-specific integrated circuit, ASIC) logic, a graphics processor, a general-purpose processor, or the like. In some examples, the logic circuit 47 may be implemented by hardware, for example, video coding dedicated hardware, and the processor 43 may be implemented by general-purpose software, an operating system, or the like. In addition, the memory 44 may be a memory of any type, for example, a volatile memory (for example, a static random access memory (static random access memory, SRAM) or a dynamic random access memory (dynamic random access memory, DRAM)) or a nonvolatile memory (for example, a flash memory). In a non-limitative example, the memory 44 may be implemented as a cache memory. In some examples, the logic circuit 47 may access the memory 44 (for example, for implementation of a picture buffer). In another example, the logic circuit 47 and/or the processing unit 46 may include a memory (for example, a cache) for implementation of a picture buffer or the like.
In some examples, the encoder 20 implemented by using the logic circuit may include a picture buffer (which is implemented by, for example, the processing unit 46 or the memory 44) and a graphics processing unit (which is implemented by, for example, the processing unit 46). The graphics processing unit may be communicatively coupled to the picture buffer. The graphics processing unit may include the encoder 20 implemented by using the logic circuit 47, to implement various modules that are described with reference to
In some examples, the decoder 30 may be implemented by using the logic circuit 47 in a similar manner, to implement various modules that are described with reference to the decoder 30 in
In some examples, the antenna 42 may be configured to receive an encoded bitstream of video data. As described, the encoded bitstream may include data, an indicator, an index value, mode selection data, and the like related to video frame encoding described in this specification, for example, data related to coding partitioning (for example, a transform coefficient or a quantized transform coefficient, an optional indicator (as described), and/or data that defines the coding partitioning). The video coding system 40 may further include the decoder 30 coupled to the antenna 42 and configured to decode the encoded bitstream. The display device 45 is configured to present a video frame.
It should be understood that, in this embodiment of this application, relative to the example described with reference to the encoder 20, the decoder 30 may be configured to perform an inverse process. With regard to signaling a syntax element, the decoder 30 may be configured to receive and parse such a syntax element and correspondingly decode related video data. In some examples, the encoder 20 may entropy encode the syntax element into an encoded video bitstream. In such examples, the decoder 30 may parse the syntax element and correspondingly decode the related video data.
The video coding device 400 includes: ingress ports 410 and a receiving unit (Rx) 420 that are configured to receive data; a processor, a logic unit, or a central processing unit (CPU) 430 that is configured to process the data; a transmitter unit (Tx) 440 and egress ports 450 that are configured to transmit the data; and a memory 460 configured to store the data. The video coding device 400 may further include an optical-to-electrical conversion component and an electrical-to-optical (EO) component coupled to the ingress port 410, the receiver unit 420, the transmitter unit 440, and the egress port 450 for egress or ingress of optical or electrical signals.
The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (for example, a multi-core processor), FPGAs, ASICs, and DSPs. The processor 430 communicates with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460. The processor 430 includes a coding module 470 (for example, an encoding module 470 or a decoding module 470). The encoding/decoding module 470 implements the embodiments disclosed in this specification, to implement the inter prediction method provided in the embodiments of this application. For example, the encoding/decoding module 470 performs, processes, or provides various coding operations. Therefore, the encoding/decoding module 470 substantially improves functions of the video coding device 400 and affects transform of the video coding device 400 to a different state. Alternatively, the encoding/decoding module 470 is implemented as an instruction stored in the memory 460 and executed by the processor 430.
The memory 460 includes one or more disks, tape drives, and solid-state drives, and may be used as an overflow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution. The memory 460 may be volatile and/or nonvolatile, and may be a read-only memory (ROM), a random access memory (RAM), a ternary content-addressable memory (ternary content-addressable memory, TCAM), and/or a static random access memory (SRAM).
In this embodiment of this application, the processor 510 may be a central processing unit (central processing unit, CPU). Alternatively, the processor 510 may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or another programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.
The memory 530 may include a read-only memory (ROM) device or a random access memory (RAM) device. Any other storage device of an appropriate type may alternatively be used as the memory 530. The memory 530 may include code and data 531 accessed by the processor 510 through the bus 550. The memory 530 may further include an operating system 533 and an application program 535. The application program 535 includes at least one program that allows the processor 510 to perform the video encoding or decoding method described in this application. For example, the application program 535 may include applications 1 to N, and further include a video encoding or decoding application (referred to as a video coding application for short) that performs the video encoding or decoding method described in this application.
In addition to a data bus, the bus system 550 may further include a power bus, a control bus, a status signal bus, and the like. However, for clear description, various types of buses in the figure are marked as the bus system 550.
Optionally, the coding device 500 may further include one or more output devices, for example, a display 570. In an example, the display 570 may be a touch-sensitive display that combines a display and a touch-sensitive unit that is operable to sense a touch input. The display 570 may be connected to the processor 510 through the bus 550.
To better understand the inter prediction method in the embodiments of this application, the following first describes some related concepts or content of inter prediction.
Inter prediction means searching a reconstructed picture for a matched reference block for a current block in a current picture, and using a sample value of a sample in the reference block as a predicted value of a sample value of a sample in the current block. (This process is referred to as motion estimation (Motion estimation, ME)).
Motion estimation is to try a plurality of reference blocks in a reference picture for a current block, and then finally determine one or two reference blocks (two reference blocks are required for bidirectional prediction) from the plurality of reference blocks by using rate-distortion optimization (rate-distortion optimization, RDO) or another method. The reference block is used to perform inter prediction on the current block.
Motion information of the current block includes indication information of a prediction direction (which is usually forward prediction, backward prediction, or bidirectional prediction), one or two motion vectors (motion vector, MV) pointing to the reference block, indication information of the picture in which the reference block is located (which is usually represented by using a reference index (reference index)).
Forward prediction means selecting a reference picture from a forward reference picture set, to obtain a reference block for a current block. Backward prediction means selecting a reference picture from a backward reference picture set, to obtain a reference block for a current block. Bidirectional prediction means selecting a reference picture from a forward reference picture set and a reference picture from a backward reference picture set, to obtain a reference block. When a bidirectional prediction method is used, a current coding block has two reference blocks. Each reference block needs to be indicated by using a motion vector and a reference index. Then, a predicted value of a sample value of a sample in the current block is determined based on sample values of samples in the two reference blocks.
In HEVC, there are two inter prediction modes: an AMVP mode and a merge mode.
In the AMVP mode, spatially or temporally neighboring encoded blocks (denoted as neighboring blocks) of a current coding block are first traversed. A candidate motion vector list is constructed based on motion information of the neighboring blocks. Then, an optimal motion vector is determined from the candidate motion information list based on a rate-distortion cost, and candidate motion information with a minimum rate-distortion cost is used as a motion vector predictor (motion vector predictor, MVP) of the current coding block.
Locations and a traversal order of the neighboring blocks are predefined. The rate-distortion cost may be obtained through calculation by using a formula (1), where J is the rate-distortion cost (rate-distortion cost), SAD is a sum of absolute differences (sum of absolute differences, SAD) between an original sample value and a predicted sample value that is obtained through motion estimation performed by using a candidate motion vector predictor, R is a bit rate, and λ is a Lagrange multiplier. An encoder side transfers, to a decoder side, an index value and a reference frame index value of a selected motion vector predictor in the candidate motion vector list. Further, the encoder side may perform motion search in a neighborhood centered on the MVP to obtain an actual motion vector of the current coding block, and then transfer a difference (motion vector difference) between the MVP and the actual motion vector to the decoder side.
J=SAD+λR (1)
In addition, in terms of different motion models, the AMVP mode may be classified into a translational model-based AMVP mode and a non-translational model-based AMVP mode.
In the merge mode, a candidate motion information list is first constructed based on motion information of a spatially or temporally encoded unit of a current coding unit. Then, optimal motion information is determined from the candidate motion information list as motion information of the current coding unit based on a rate-distortion cost. Finally, an index value (denoted as a merge index hereinafter) of a location of the optimal motion information in the candidate motion information list is transferred to the decoder side.
In the merge mode, spatial and temporal candidate motion information of the current coding unit may be shown in
The temporal candidate motion information of the current coding unit may be obtained by scaling an MV of a block at a corresponding location in a reference frame based on picture order counts (picture order count, POC) of the reference frame and a current frame. When the block at the corresponding location in the reference frame is obtained, it may be first determined whether a block at a location T in the reference frame is available. If the block at the location T is unavailable, a block at a location C is selected.
When a translational model is used for prediction, same motion information is used for all samples in a coding unit, and then motion compensation is performed based on the motion information, to obtain a predicted sample value of the coding unit. However, in the real world, there are a variety of motions. Many objects, for example, a rotating object, a roller coaster rotating in different directions, fireworks, and some stunts in movies, are not in translational motion. If these moving objects, especially those in a UGC scenario, are encoded by using a block motion compensation technology based on the translational motion model in a current coding standard, coding efficiency is greatly affected. Therefore, to improve a coding effect, non-translational motion model-based prediction is provided.
In non-translational motion model-based prediction, a same motion model is used on an encoder side and a decoder side to derive motion information of each motion compensation subunit in a current coding block, and then motion compensation is performed based on the motion information of the motion compensation subunit to obtain a prediction subblock of each subblock, to improve prediction efficiency. Common non-translational motion models include a 4-parameter affine motion model and a 6-parameter affine motion model.
The motion compensation subunit in the embodiments of this application may be a sample or a sample block that is obtained through partitioning according to a specific method and whose size is N1×N2, where both N1 and N2 are positive integers, N1 may be equal to or may not be equal to N2.
The following briefly describes the 4-parameter affine motion model and the 6-parameter affine motion model.
The 4-parameter affine motion model:
The 4-parameter affine motion model may be expressed as a formula (2).
a1, a2, a3, and a4 in the formula (2) are constants in the 4-parameter affine motion model, and are equivalent to coefficients in a formula (3).
As shown in
In the formula (3), (x, y) are coordinates of the motion compensation subunit relative to the top-left sample of the current coding block, W is the width of the current coding block, the motion vector of the top-left control point of the current coding block is (vx0, vy0), and the motion vector (vx1, vy1) of the top-right control point of the current coding block.
The 6-parameter affine motion model:
The 6-parameter affine motion model may be expressed as a formula (4).
a1, a2, a3, a4, a5, and a6 in the formula (4) are constants in the 6-parameter affine motion model, and are equivalent to coefficients in a formula (5).
As shown in
In the 6-parameter affine motion model, if the sample in the top-left corner (0, 0), the sample in the top-right corner (W, 0), and the sample in the bottom-left corner (0, H) are used as control points, motion vectors mv0 (vx0, vy0), mv1 (vx1, vy1), and mv2 (vx2, vy2) of the top-left control point, the top-right control point, and the bottom-left control point of the current coding block are first determined. Then, motion information of each motion compensation subunit in the current coding block is derived according to the formula (5).
In the formula (5), (x, y) are coordinates of the motion compensation subunit relative to the top-left sample of the current coding block, W is the width of the current coding block, H is the height of the current coding block, the motion vector of the top-left control point of the current coding block is (vx0, vy0), the motion vector of the top-right control point of the current coding block is (vx1, vy1), and the motion vector of the bottom-left control point of the current coding block is (vx2, vy2).
A coding block that is predicted by using an affine motion model is referred to as an affine coding block.
Generally, motion information of a control point of the affine coding block may be obtained by using an affine motion model-based AMVP mode or an affine merge mode. The motion information of the control point may be obtained by using an inherited control point motion vector prediction method or a constructed control point motion vector prediction method.
It should be understood that the inter prediction method shown in
1001: Obtain a predicted sample value of a current affine block.
The current affine block may be a picture block on which inter prediction processing is being performed. When the method shown in
In this application, a predicted sample value may also be referred to as a predicted sample value. To avoid confusion, the predicted sample value is uniformly used in this application.
Optionally, obtaining the predicted sample value of the current affine block in step 1001 specifically includes: obtaining a predicted sample value of each subblock in the current affine block by performing motion compensation on each subblock based on a motion vector of each subblock, to finally obtain the predicted sample value of the current affine block.
1002: Determine one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block.
It should be understood that in step 1002, based on the motion vectors of the one or more subblocks of the current affine block, the one or more luminance compensation blocks are determined in a reference frame corresponding to the current affine block.
In step 1002, a final purpose of determining the one or more luminance compensation blocks is to perform luminance compensation (which may also be referred to as local illumination compensation) on the predicted sample value of the current affine block.
Specifically, a second sample set may be determined by obtaining the one or more luminance compensation blocks, so that a linear model coefficient is subsequently determined with reference to a first sample set determined based on the current affine block. Further, the predicted sample value of the current affine block is updated based on the linear model coefficient.
1003: Determine the linear model coefficient based on the first sample set and the second sample set, where the first sample set includes at least one reconstructed sample neighboring to an edge of the current affine block, the second sample set includes at least one reconstructed sample neighboring to an edge of the one or more luminance compensation blocks, and the sample in the first sample set is in a one-to-one correspondence with the sample in the second sample set.
In step 1002, there is a plurality of manners of determining the one or more luminance compensation blocks. The following describes some common determining manners and composition of the first sample set and the second sample set in different determining manners.
First manner: Determine, based on the motion vector of each of the plurality of subblocks of the current affine block, a luminance compensation block corresponding to each subblock, to obtain the plurality of luminance compensation blocks.
It should be understood that the plurality of subblocks are subblocks located on the edge of the current affine block. (For example, the plurality of subblocks may be subblocks on a left edge and an upper edge of the current affine block).
In the first manner, the luminance compensation block corresponding to each of the plurality of subblocks is determined based on the motion vector of each subblock, and a quantity of finally obtained luminance compensation blocks is the same as a quantity of subblocks in the current affine block.
Specifically, in the first manner, the plurality of subblocks include a luminance compensation block corresponding to the subblock on the left edge of the current affine block and/or a luminance compensation block corresponding to the subblock on the upper edge of the current affine block.
Optionally, in the first manner, the first sample set includes a reconstructed sample neighboring to the left edge and/or a reconstructed sample neighboring to the upper edge of the current affine block.
Optionally, in the first manner, the second sample set includes a reconstructed sample at a specific neighboring location of each of the plurality of luminance compensation blocks.
The plurality of luminance compensation blocks include a first-type luminance compensation block and/or a second-type luminance compensation block. The first-type luminance compensation block is the luminance compensation block corresponding to the subblock on the upper edge of the current affine block. The second-type luminance compensation block is the luminance compensation block corresponding to the subblock on the left edge of the current affine block. A reconstructed sample at a specific neighboring location of the first-type luminance compensation block is a reconstructed sample neighboring to an upper edge of the first-type luminance compensation block. A reconstructed sample at a specific neighboring location of the second-type luminance compensation block is a reconstructed sample neighboring to a left edge of the second-type luminance compensation block.
For ease of understanding, the plurality of luminance compensation blocks may further be spliced into one virtual luminance compensation block. A shape of the virtual luminance compensation block may be or may not be a rectangle. For example, the virtual luminance compensation block may be an irregular graphics block obtained by splicing the luminance compensation blocks.
For example, as shown in
Next, the seven luminance compensation blocks respectively corresponding to the seven subblocks may be spliced into one virtual luminance compensation block based on a location relationship of the seven subblocks in the current affine block, and the virtual luminance compensation block obtained through splicing is shown in
When the virtual luminance compensation block is obtained through splicing based on the seven luminance compensation blocks, reconstructed samples neighboring to left edges and/or upper edges of these subblocks may be carried. Subblocks on a left edge of the virtual luminance compensation block include B0, B4, B8, and B12, and subblocks on an upper edge of the virtual luminance compensation block include B0 to B3 (where B0 may be a subblock on the left edge or a subblock on the upper edge).
In
It should be understood that the subblock A0 in the upper-left corner is described as a subblock on the upper edge in the foregoing implementation, and because A0 is also located on the left edge of the current affine block, the subblock A0 may alternatively be described as a subblock on the left edge in another implementation.
It should be understood that, in the first manner, a sample included in the first sample set may be in a one-to-one correspondence with a sample included in the second sample set.
For example, as shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the virtual luminance compensation block. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the current affine block. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly above the current affine block is equal to a smaller value between the predetermined quantity and the width of the current affine block. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, affine block width value). Min( ) is a function for obtaining a minimum value. It should be understood that composition of the second sample set corresponds to composition of the first sample set.
As shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the virtual luminance compensation block. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the current affine block. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly left to the current affine block is equal to a smaller value between the predetermined quantity and the height of the current affine block. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, affine block height value). It should be understood that composition of the second sample set corresponds to composition of the first sample set.
As shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the current affine block and a predetermined quantity of neighboring reconstructed samples exactly above the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the virtual luminance compensation block and a predetermined quantity of neighboring reconstructed samples exactly above the virtual luminance compensation block. For example, the first sample set may include 16 neighboring reconstructed samples exactly left to the current affine block and 16 neighboring reconstructed samples exactly above the current affine block. In another example, the first sample set may include 8 neighboring reconstructed samples exactly left to the current affine block and 16 neighboring reconstructed samples exactly above the current affine block. In another example, the predetermined quantity is limited by a size of the current affine block. The quantity of neighboring samples that are in the first sample set and exactly left to the current affine block is equal to Min(vertically predetermined quantity value, affine block height value), and the quantity of neighboring samples that are in the first sample set and exactly above the current affine block is equal to Min(horizontally predetermined quantity value, affine block width value). Alternatively, in the first sample set, both the quantity of neighboring samples exactly left to the current affine block and the quantity of neighboring samples exactly above the current affine block are equal to Min(predetermined quantity value, affine block height value, affine block width value). It should be understood that the second sample set corresponds to the first sample set.
Second manner: Determine, based on a motion vector of a subblock at a first preset location in the current affine block, a luminance compensation block corresponding to the current affine block.
In the second manner, the motion vector of the subblock at the first preset location is used as a motion vector of the entire current affine block, and then the luminance compensation block corresponding to the entire current affine block is determined based on the motion vector. (In the second manner, only one luminance compensation block needs to be determined.)
In the second manner, a motion vector of a subblock at a fixed location in the current affine block is used to determine the luminance compensation block corresponding to the entire affine motion block, so that complexity of determining the luminance compensation block can be simplified.
The first preset location may be a fixed location in the current affine block. The subblock located at the first preset location may be a subblock whose upper-left corner (which may alternatively be another location such as the lower-left corner, the upper-right corner, or the lower-right corner) is located at the first preset location.
Specifically, when the width of the current affine block is W and the height of the current affine block is H, and coordinates of a sample in the upper-left corner of the current affine block is (x0, y0), coordinates of a subblock in the center of the current block are (x0+W/2, y0+H/2), and coordinates of a subblock in the upper-left corner of the current affine block are (x0, y0).
For example, as shown in
Optionally, the first preset location is the center of the current affine block.
For example, when the first preset location is the center of the current affine block, the subblock at the first preset location in the current affine block may be A10 (where the upper-left corner of the subblock A10 is located in the center of the current affine block).
It should be understood that the upper-left corner and the center are only two possible implementations of the first preset location. In this application, any location in the current affine block may alternatively be set as the first preset location based on a requirement.
In the second manner, a process of obtaining, based on the motion vector of the subblock at the first preset location, the luminance compensation block corresponding to the current affine block may be shown in
Optionally, in the second manner, the first sample set includes a reconstructed sample neighboring to the left edge and/or a reconstructed sample neighboring to the upper edge of the current affine block.
Optionally, in the second manner, the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the affine block.
It should be understood that, in the second manner, a sample included in the first sample set may be in a one-to-one correspondence with a sample included in the second sample set.
For example, as shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the luminance compensation block corresponding to the affine block. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the current affine block. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly above the current affine block is equal to a smaller value between the predetermined quantity and the width of the current affine block. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, affine block width value). It should be understood that composition of the second sample set corresponds to composition of the first sample set.
As shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the luminance compensation block corresponding to the affine block. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the current affine block. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly left to the current affine block is equal to a smaller value between the predetermined quantity and the height of the current affine block. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, affine block height value). It should be understood that composition of the second sample set corresponds to composition of the first sample set.
As shown in
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the current affine block and a predetermined quantity of neighboring reconstructed samples exactly above the current affine block. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the luminance compensation block corresponding to the affine block and a predetermined quantity of neighboring reconstructed samples exactly above the luminance compensation block corresponding to the affine block. For example, the first sample set may include 16 neighboring reconstructed samples exactly left to the current affine block and 16 neighboring reconstructed samples exactly above the current affine block. In another example, the first sample set may include 8 neighboring reconstructed samples exactly left to the current affine block and 16 neighboring reconstructed samples exactly above the current affine block. In another example, the predetermined quantity is limited by a size of the current affine block. The quantity of neighboring samples that are in the first sample set and exactly left to the current affine block is equal to Min(vertically predetermined quantity value, affine block height value), and the quantity of neighboring samples that are in the first sample set and exactly above the current affine block is equal to Min(horizontally predetermined quantity value, affine block width value). Alternatively, in the first sample set, both the quantity of neighboring samples exactly left to the current affine block and the quantity of neighboring samples exactly above the current affine block are equal to Min(predetermined quantity value, affine block height value, affine block width value). It should be understood that the second sample set corresponds to the first sample set.
Third manner: Determine, based on a motion vector of a subblock at a second preset location in the current affine block, a luminance compensation block corresponding to the subblock at the second preset location.
Optionally, the second preset location is one or more of a left edge, an upper edge, or the upper-left corner of the current affine block.
For example, the second preset location may be the left edge of the current affine block, or the second preset location may be the upper edge of the current affine block.
For another example, the second preset location may be the left edge and the upper edge of the current affine block. In this case, the second preset location includes two locations.
In the third manner, based on different second preset locations, reconstructed samples included in the first sample set and the second sample set are also different. The following describes the reconstructed samples in different cases.
Case 1: The second preset location is the left edge of the current affine block.
In Case 1, the first sample set may include a reconstructed sample neighboring to a left edge of the subblock at the second preset location, and the second sample set may include a reconstructed sample neighboring to a left edge of the luminance compensation block corresponding to the subblock at the second preset location.
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the subblock at the second preset location. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the luminance compensation block corresponding to the subblock at the second preset location. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the subblock at the second preset location. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly left to the subblock at the second preset location is equal to a smaller value between the predetermined quantity and the width of the subblock at the second preset location. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, width value of the subblock at the second preset location). It should be understood that composition of the second sample set corresponds to composition of the first sample set.
For example, as shown in
Case 2: The second preset location is the upper edge of the current affine block.
In Case 2, the first sample set may include a reconstructed sample neighboring to an upper edge of the subblock at the second preset location, and the second sample set may include a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the subblock at the second preset location. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly above the luminance compensation block corresponding to the subblock at the second preset location. For example, the predetermined quantity may be 16. In another example, the predetermined quantity is limited by a size of the subblock at the second preset location. For example, the quantity of neighboring reconstructed samples that are included in the first sample set and that are exactly above the subblock at the second preset location is equal to a smaller value between the predetermined quantity and the height of the subblock at the second preset location. In other words, the quantity of samples in the first sample set=Min(predetermined quantity value, height value of the subblock at the second preset location). It should be understood that composition of the second sample set corresponds to composition of the first sample set.
For example, as shown in
Case 3: The second preset location is the left edge and the upper edge of the current affine block.
In Case 3, the first sample set may include a reconstructed sample neighboring to a left edge and a reconstructed sample neighboring to an upper edge of the subblock at the second preset location, and the second sample set may include a reconstructed sample neighboring to a left edge and a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
In a feasible implementation, the first sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the subblock at the second preset location and a predetermined quantity of neighboring reconstructed samples exactly above the subblock at the second preset location. Correspondingly, the second sample set includes a predetermined quantity of neighboring reconstructed samples exactly left to the luminance compensation block corresponding to the subblock at the second preset location and a predetermined quantity of neighboring reconstructed samples exactly above the luminance compensation block corresponding to the subblock at the second preset location. For example, the first sample set may include 16 neighboring reconstructed samples exactly left to the subblock at the second preset location and 16 neighboring reconstructed samples exactly above the subblock at the second preset location. In another example, the first sample set may include 8 neighboring reconstructed samples exactly left to the subblock at the second preset location and 16 neighboring reconstructed samples exactly above the subblock at the second preset location. In another example, the predetermined quantity is limited by a size of the subblock at the second preset location. The quantity of neighboring samples that are in the first sample set and exactly left to the subblock at the second preset location is equal to Min(vertically predetermined quantity value, height value of the subblock at the second preset location), and the quantity of neighboring samples that are in the first sample set and exactly above the subblock at the second preset location is equal to Min(horizontally predetermined quantity value, width value of the subblock at the second preset location). Alternatively, in the first sample set, both the quantity of neighboring samples exactly left to the subblock at the second preset location and the quantity of neighboring samples exactly above the subblock at the second preset location are equal to Min(predetermined quantity value, height value of the subblock at the second preset location, width value of the subblock at the second preset location). It should be understood that the second sample set corresponds to the first sample set.
For example, as shown in
Case 4: The second preset location is the upper-left corner of the current affine block.
In Case 4, the first sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the subblock at the second preset location, and the second sample set includes a reconstructed sample neighboring to a left edge and/or a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock at the second preset location.
For example, as shown in
It should be understood that
In this application, the linear model coefficient obtained in step 1003 does not need to be transmitted between an encoder side and a decoder side, and both the encoder side and the decoder side may derive the linear model coefficient based on the first sample set and the second sample set.
In
It is assumed that the first sample set and the second sample set each include N samples, C(n) is a sample value of an nth sample in the reconstructed samples neighboring to the left edge and the reconstructed samples neighboring to the upper edge of the current affine block, and R(n) is a sample value of an nth sample in the reconstructed samples neighboring to the left edge and the reconstructed samples neighboring to the upper edge of the luminance compensation block of the current affine block. In this case, linear model coefficients α and β may be determined according to a formula (7) and a formula (8).
It should be understood that, before the model coefficients are derived, the luminance compensation block corresponding to each subblock in the current affine block may be obtained in another manner. (Refer to the foregoing first manner and third manner.) After the first sample set and the second sample set are obtained, the foregoing formula (7) and formula (8) may be used to determine the linear model coefficients α and β.
1004: Update the predicted sample value of the current affine block based on the linear model coefficient, to obtain an updated predicted sample value of the current affine block.
In step 1004, updating the predicted sample value of the current affine block based on the linear model coefficient may also be understood as performing luminance compensation (local illumination compensation) (where the local illumination compensation technology is used to perform local illumination compensation on the predicted sample value of the current affine block) on the predicted sample value of the current affine block based on the linear model coefficient, to obtain a predicted sample value obtained after luminance compensation (local illumination compensation) is performed on the current affine block. To avoid confusion, descriptions in step 1004 are used for the following related content.
In step 1004, the updated predicted sample value of the current affine block may be specifically determined according to a formula (9).
pred_C(i,j)=α×rec_C(i,j)+β (9)
In the formula (9), pred_c(i, j) is an updated predicted sample value at a location (i, j) in the current affine block, rec_c(i, j) is a predicted sample value at the location (i, j) in the current affine block, and α and β are linear model coefficients.
rec_c(i, j) may alternatively be understood as a reconstructed sample value at a location (i, j) in a reference block corresponding to the current affine block (where a reference subblock corresponding to each subblock in the current affine block may be obtained based on the motion vector of each subblock, to obtain the reference block corresponding to the current affine block). The reconstructed sample value at the location (i, j) in the reference block corresponding to the current affine block may be used as the predicted sample value at the location (i, j) in the current affine block.
In this application, luminance compensation is performed on the predicted sample value of the current affine block, to improve accuracy of inter prediction, reduce a residual value, and when video quality is the same, reduce a bit rate, to further improve coding performance.
Specifically, because there may be a luminance difference between the current affine block and the reference block of the current affine block, a predicted sample value that is of the current affine block and that is obtained based on the reference block may have some differences from an actual sample value of the current affine block. Therefore, the linear model coefficient is derived, and a sample value of the current affine block is updated based on the linear model coefficient, so that the updated predicted sample value is closer to the actual sample value of the current affine block. In this way, a residual value between the actual sample value of the current affine block and the updated predicted sample value of the current affine block can be reduced, so that the bit rate can be reduced when the video quality is the same, and coding performance can further be improved.
The method shown in
When the method shown in
Optionally, an LIC flag being 1 indicates the first identification information, and indicates that luminance compensation needs to be performed on the current affine block.
Optionally, an LIC flag being 0 indicates second identification information, and indicates that luminance compensation does not need to be performed on the current affine block.
When the foregoing method is a decoding method, if the second identification information is obtained by decoding the bitstream, it is determined that luminance compensation does not need to be performed on the current affine block, and an inter prediction process is completed after the predicted sample value of the current affine block is obtained.
When the method shown in
In this application, the first identification information is encoded, so that the decoder side can obtain the first identification information through decoding in a decoding process, and then perform luminance compensation on the affine block in an inter prediction process.
In addition, when the method shown in
The foregoing describes in detail the inter prediction method in the embodiments of this application with reference to the accompanying drawings. To better understand a related procedure of the inter prediction method in the embodiments of this application, the following describes in detail processes of the inter prediction method in the embodiments of this application with reference to specific embodiments.
Embodiment 1: Determine, based on the motion vector of each subblock in the current affine block, the luminance compensation block corresponding to each subblock; and determine the linear model coefficient based on the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the current affine block, and the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the virtual luminance compensation block formed by the plurality of luminance compensation blocks.
In Embodiment 1, a process of obtaining the updated predicted sample value of the current affine block includes steps 2001 to 2004. These steps are described in detail below.
2001: Determine a motion vector of a control point of the current affine block.
In step 2001, the motion vector of the control point of the current block may be inherited or analytically derived from the bitstream. A manner in which the control point motion vector can be obtained falls within the protection scope of this application. This is not specifically limited in this application.
2002: Determine the motion vector of each subblock in the current affine block.
Specifically, in step 2002, the motion vector of each subblock in the current affine block may be determined based on motion information of the control point of the current affine block and an affine motion model used by the current affine block.
2003: Perform motion compensation based on the motion vector of each subblock in the current affine block, to obtain the predicted sample value of each subblock.
After step 2003, the encoder side may determine, based on an actual requirement, whether local illumination compensation needs to be performed on the current affine block.
After step 2003, the decoder side may decode the bitstream to obtain the LIC flag. The LIC flag being 1 indicates that LIC compensation needs to be performed on the current affine block, and step 2004 further needs to be performed. The updated predicted sample value, obtained in step 2004, of the current affine block is a final predicted sample value of the current affine block. The LIC flag being 0 indicates that LIC compensation does not need to be performed on the current affine block, and the predicted sample value, obtained in step 2003, of the current affine block is a final predicted sample value of the current affine block.
2004: Perform LIC compensation on the current affine block.
Specifically, in step 2004, a linear model needs to be first obtained, and then LIC compensation is performed on the current affine block according to the linear model. A specific process may include step 1 to step 3.
Step 1: Obtain a template of the linear model.
The template refers to a set of sample values used to derive linear model coefficients for LIC compensation. The template herein includes a template (which is equivalent to the reconstructed sample neighboring to the edge of the current affine block in the foregoing description) of the current affine block and a template (which is equivalent to the reconstructed sample neighboring to the edge of the virtual luminance compensation block in the foregoing description) of the virtual luminance compensation block.
Specifically, as shown in
When the virtual luminance compensation block is obtained based on the current affine block, motion compensation may first be performed based on a motion vector of each subblock in the subblocks on the left edge and the upper edge of the current affine block, to obtain the luminance compensation blocks A1 to G1. Then, the luminance compensation blocks A1 to G1 are spliced into the virtual luminance compensation block. For details, refer to the manner shown in
As shown in
It should be understood that, in
Step 2: Determine the linear model coefficients α and β used for LIC compensation.
The linear model coefficients α and β used for LIC compensation may be derived based on the template of the current affine block and the template of the virtual compensation block that are obtained in step 1.
Specifically, the linear model coefficients α and β may be derived based on the template of the current affine block and the template of the virtual compensation block that are obtained in step 1 by using the foregoing formula (7) and formula (8).
Step 3: Perform compensation on the predicted sample value of the current affine block based on the linear model coefficients α and β, to obtain a predicted sample value obtained after luminance compensation.
Specifically, in step 3, compensation may be performed on the predicted sample value of the current affine block according to the foregoing formula (9), to obtain the predicted sample value (which is equivalent to the updated predicted sample value of the current affine block in the foregoing description) that is obtained after luminance compensation and that is of the current affine block.
Embodiment 2: Determine, based on a motion vector of the subblock in the upper-left corner of the current affine block, the luminance compensation block corresponding to the current affine block; and determine the linear model coefficient based on the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the current affine block, and the reconstructed sample neighboring to the left edge and the reconstructed sample neighboring to the upper edge of the luminance compensation block corresponding to the current affine block.
In Embodiment 2, a process of obtaining the updated predicted sample value of the current affine block includes steps 3001 to 3005. These steps are described in detail below.
3001: Determine the predicted sample value of each subblock in the current affine block.
Specifically, in step 3001, motion information of each subblock may be determined based on motion information of a control point of the current affine block, and then motion compensation is performed on each subblock based on the motion information of each subblock, to obtain the predicted sample value of each subblock.
3002: Use motion information of a subblock in the upper-left corner of the current affine block as motion information of the current affine block, and perform motion compensation on the current affine block based on the motion information, to obtain the luminance compensation block corresponding to the current affine block.
As shown in
Optionally, in step 3002, motion compensation may be performed by alternatively using motion information of a subblock in the center of the current affine block as the motion information of the current affine block, to obtain the luminance compensation block corresponding to the current affine block.
3003: Obtain a template of a linear model.
As shown in
3004: Determine the linear model coefficients α and β used for LIC compensation.
Specifically, derivation may be performed based on the template of the current affine block and the template of the luminance compensation block corresponding to the current affine block that are determined in step 3003.
3005: Perform compensation on the predicted sample value of the current affine block based on the linear model coefficients α and β, to obtain a predicted sample value obtained after luminance compensation.
Embodiment 3: Determine, based on a motion vector of the subblock in the upper-left corner of the current affine block, a luminance compensation block corresponding to the subblock in the upper-left corner of the current affine block; and determine the linear model coefficient based on a reconstructed sample neighboring to a left edge and a reconstructed sample neighboring to an upper edge of the subblock in the upper-left corner of the current affine block, and a reconstructed sample neighboring to a left edge and a reconstructed sample neighboring to an upper edge of the luminance compensation block corresponding to the subblock in the upper-left corner of the current affine block.
In Embodiment 3, a process of obtaining the updated predicted sample value of the current affine block includes steps 4001 to 4005. These steps are described in detail below.
4001: Determine the predicted sample value of each subblock in the current affine block.
Specifically, for a specific process of step 4001, refer to step 3001.
4002: Perform, based on motion information of the subblock in the upper-left corner of the current affine block, motion compensation on the subblock in the upper-left corner of the current affine block, to obtain the luminance compensation block corresponding to the subblock in the upper-left corner.
As shown in
4003: Obtain a template of a linear model.
As shown in
4004: Determine the linear model coefficients α and β used for LIC compensation.
Specifically, derivation may be performed based on the template of the subblock A0 and the template of the luminance compensation block A1 that are determined in step 3003.
4005: Perform compensation on the predicted sample value of the current affine block based on the linear model coefficients α and β, to obtain a predicted sample value obtained after luminance compensation.
The foregoing describes in detail the video decoding method and the video encoding method in the embodiments of this application with reference to the accompanying drawings. The following separately describes an inter prediction apparatus in the embodiments of this application with reference to
a prediction unit 5001, configured to obtain a predicted sample value of a current affine block;
a processing unit 5002, where the processing unit 5002 is configured to:
determine one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block, and
determine a linear model coefficient based on a first sample set and a second sample set, where the first sample set includes at least one reconstructed sample neighboring to an edge of the current affine block, the second sample set includes at least one reconstructed sample neighboring to an edge of the one or more luminance compensation blocks, and the sample in the first sample set is in a one-to-one correspondence with the sample in the second sample set; and
an update unit 5003, configured to update the predicted sample value of the current affine block based on the linear model coefficient, to obtain an updated predicted sample value of the current affine block.
In this application, luminance compensation is performed on the predicted sample value of the current affine block, to improve accuracy of inter prediction, reduce a residual value, and when video quality is the same, reduce a bit rate, to further improve coding performance.
The inter prediction apparatus 5000 may be either an encoding device or a decoding device.
When the inter prediction apparatus 5000 is an encoding device, the prediction unit 5001, the processing unit 5002, and the update unit 5003 in the inter prediction apparatus 5000 may correspond to the inter prediction unit 244 in the encoder 20 shown in
When the inter prediction apparatus 5000 is a decoding device, the prediction unit 5001, the processing unit 5002, and the update unit 5003 in the inter prediction apparatus 5000 may correspond to the inter prediction unit 344 in the decoder 30 shown in
In addition, the inter prediction apparatus 5000 may alternatively be referred to as a coding device or a codec, and the inter prediction apparatus 5000 can implement encoding or decoding of a video picture.
a memory 6001, configured to store a program; and
a processor 6002, configured to execute program stored in the memory 6001, where when the program stored in the memory 6001 is executed, the processor 6002 is configured to:
obtain a predicted sample value of a current affine block,
determine one or more luminance compensation blocks based on motion vectors of one or more subblocks of the current affine block, and
determine a linear model coefficient based on a first sample set and a second sample set, where the first sample set includes at least one reconstructed sample neighboring to an edge of the current affine block, the second sample set includes at least one reconstructed sample neighboring to an edge of the one or more luminance compensation blocks, and the sample in the first sample set is in a one-to-one correspondence with the sample in the second sample set, and
update the predicted sample value of the current affine block based on the linear model coefficient, to obtain an updated predicted sample value of the current affine block.
The prediction unit 5001, the processing unit 5002, and the update unit 5003 in the inter prediction apparatus 5000 may correspond to the processor 6002 in the inter prediction apparatus 6000. The processor 6002 can implement functions of the prediction unit 5001, the processing unit 5002, and the update unit 5003 in the inter prediction apparatus 5000.
In addition, similar to the inter prediction apparatus 5000, the inter prediction apparatus 6000 may be either an encoding device or a decoding device.
When the inter prediction apparatus 6000 is an encoding device, the processor 6002 in the inter prediction apparatus 6000 may correspond to the inter prediction unit 244 in the encoder 20 shown in
When the inter prediction apparatus 6000 is a decoding device, the processor 6002 in the inter prediction apparatus 6000 may correspond to the inter prediction unit 344 in the decoder 30 shown in
Similarly, the inter prediction apparatus 6000 may alternatively be referred to as a coding device or a codec, and the inter prediction apparatus 6000 can implement encoding or decoding of a video picture.
A person of ordinary skill in the art may be aware that units, algorithms, and steps in the examples described with reference to the embodiments disclosed in this application can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed by hardware or software depends on a particular application and a design constraint condition of the technical solutions. A person skilled in the art may use different methods to implement the described functions for each particular application, but it should not be considered that the implementation goes beyond a scope of this application.
It may be clearly understood by a person skilled in the art that, for convenient and brief description, for a detailed working process of the foregoing system, apparatus, and units, refer to a corresponding process in the foregoing method embodiments, and details are not described herein again.
In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus, and method may be implemented in another manner. For example, the described apparatus embodiments are merely examples. For example, division into the units is merely logical function division and may be other division in an actual implementation. For example, a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces. The indirect couplings or communication connections between the apparatuses or units may be implemented in an electronic form, a mechanical form, or another form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, and may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected based on an actual requirement to achieve the objectives of the solutions of the embodiments.
In addition, functional units in the embodiments of this application may be integrated into one processing unit, or each of the units may exist alone physically, or two or more units are integrated into one unit.
When the functions are implemented in the form of a software functional unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of this application essentially, or the part contributing to the conventional technology, or some of the technical solutions may be implemented in a form of a software product. The computer software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform all or some of the steps of the methods described in the embodiments of this application. The foregoing storage medium includes any medium that can store program code, for example, a USB flash drive, a removable hard disk, a read-only memory (read-only memory, ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disc.
The foregoing description is merely specific implementations of this application, but are not intended to limit the protection scope of this application. Any variation or replacement readily figured out by a person skilled in the art within the technical scope disclosed in this application shall fall within the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 201910104883.3 | Feb 2019 | CN | national |
| 201910194096.2 | Mar 2019 | CN | national |
This application is a continuation of International Application No. PCT/CN2019/119406, filed on Nov. 19, 2019, which claims priority to Chinese Patent Application No. 201910104883.3, filed on Feb. 1, 2019, and to Chinese Patent Application No. 201910194096.2, filed on Mar. 14, 2019. All of the aforementioned patent applications are hereby incorporated herein by reference in their entireties.
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2019/119406 | Nov 2019 | US |
| Child | 17389873 | US |
