CN111064968A - VVC inter-frame CU deep rapid dividing method - Google Patents

VVC inter-frame CU deep rapid dividing method Download PDF

Info

Publication number
CN111064968A
CN111064968A CN201911312416.6A CN201911312416A CN111064968A CN 111064968 A CN111064968 A CN 111064968A CN 201911312416 A CN201911312416 A CN 201911312416A CN 111064968 A CN111064968 A CN 111064968A
Authority
CN
China
Prior art keywords
target
preset condition
depth
frame
division
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911312416.6A
Other languages
Chinese (zh)
Other versions
CN111064968B (en
Inventor
李跃
陈灵娜
丁平尖
朱涛
聂明星
龚向坚
刘杰
罗凌云
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of South China
Original Assignee
University of South China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of South China filed Critical University of South China
Priority to CN201911312416.6A priority Critical patent/CN111064968B/en
Publication of CN111064968A publication Critical patent/CN111064968A/en
Application granted granted Critical
Publication of CN111064968B publication Critical patent/CN111064968B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The application discloses a VVC inter-frame CU depth rapid dividing method, which comprises the following steps: extracting a motion vector residual error of a target CU; if the target CU divides the QT, judging whether the target CU meets a first preset condition or a second preset condition; if so, stopping further QT division on the target CU; if the target CU carries out H _ BT or V _ BT division, judging whether the target CU meets a third preset condition or a fourth preset condition; if so, stopping further H _ BT or V _ BT division on the target CU; if the target CU divides the H _ TT or the V _ TT, judging whether the target CU meets a third preset condition, a fourth preset condition or a fifth preset condition; and if so, stopping further H _ TT or V _ TT division on the target CU. The method can reduce the complexity in the CU deep dividing process.

Description

VVC inter-frame CU deep rapid dividing method
Technical Field
The invention relates to the technical field of video coding, in particular to a VVC inter-frame CU depth rapid dividing method.
Background
Because the high-definition video can bring better visual experience effect to people, the video with the format is widely applied in actual life, however, the video data volume which is rapidly increased brings great challenges to video compression coding.
For more efficient compression of Video data, VCEG (Video Coding Experts Group) and MPEG (Moving Picture Experts Group) are jointly making up a new generation of Video compression standard vvc (scalable Video Coding). In the process of performing compression coding on video by the VVC, a coded frame is usually divided into a plurality of CTU sequences, and in order to obtain optimal division of a target CTU, the target CTU first performs QT (quad tree division) as a root node, and the obtained leaf nodes may further perform QT, H-BT (horizontal binary tree division), V-BT (vertical binary tree division), H-TT (horizontal ternary tree division) and V-TT (vertical ternary tree division) recursively until a CU (coding unit) cannot be divided any more, and then obtain the optimal CTU division through a bottom-up clipping process. In encoding the target CU, it is usually necessary to go through further partitioning of all QTs, H-BT, V-BT, H-TT and V-TT, and the target CU will eventually select only one partitioning mode. Obviously, by such a partitioning manner, the complexity in partitioning the CU depth is significantly increased. At present, no effective solution exists for the problem.
Therefore, how to reduce the complexity in the process of partitioning the CU depth is an urgent technical problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a method for fast dividing a depth of a CU between VVC frames, so as to reduce complexity in dividing the depth of the CU. The specific scheme is as follows:
a VVC inter-frame CU depth fast dividing method comprises the following steps:
sequentially extracting coding frames of a video to be coded;
when the coding frame is an inter-frame coding frame, sequentially extracting a target CU to be coded;
extracting a forward prediction motion vector residual and a backward prediction motion vector residual of the target CU according to the target CU;
if the target CU is to be subjected to QT division, judging whether the target CU meets a first preset condition or a second preset condition;
if so, stopping further QT partitioning on the target CU;
if the target CU carries out H _ BT or V _ BT division, judging whether the target CU meets a third preset condition or a fourth preset condition;
if so, stopping further H _ BT or V _ BT division on the target CU;
if the target CU divides the H _ TT or the V _ TT, judging whether the target CU meets the third preset condition, the fourth preset condition or the fifth preset condition;
if yes, stopping further H _ TT or V _ TT division on the target CU;
wherein the expression of the first preset condition is as follows: QTc≥QTp+1 and MVD f0; the expression of the second preset condition is as follows: QTc≥QTp+1 and MVD b0; the expression of the third preset condition is as follows: BT (BT)c≥BTp+1 and MVD f0; the expression of the fourth preset condition is as follows: BT (BT)c≥BTp+1 and MVD b0; the expression of the fifth preset condition is as follows: BT (BT)c＜BTp-1；
In the formula, QTcIs the QT depth, QT, of the target CUpFor the target CUQT prediction depth, MVDfFor the forward predicted motion vector residual, MVDbFor said backward predicted motion vector residual, BTcIs BT depth of the target CU, BTpPredicting a depth for the BT of the target CU.
Preferably, after the step of determining whether the target CU satisfies the first preset condition or the second preset condition, the method further includes:
and if not, performing further QT division on the target CU.
Preferably, after the step of determining whether the target CU satisfies a third preset condition or a fourth preset condition, the method further includes:
and if not, further H _ BT or V _ BT division is carried out on the target CU.
Preferably, after the step of determining whether the target CU satisfies the third preset condition, the fourth preset condition, or the fifth preset condition, the method further includes:
and if not, further H _ TT or V _ TT division is carried out on the target CU.
Preferably, the QT predicted depth QT of the target CUpThe obtaining process of (1), comprising:
calculating a QT predicted depth QT of the target CU using a first computational modelp；
Wherein the expression of the first computational model is: QTp＝(QT0+QT1+1)/2；
In the formula, QT0And QT1Temporally corresponding to a maximum QT depth of a co-located CU of the encoded frame, respectively, for the target CU, and QT0And QT1The nearest neighbor frame having the same coding QP as the current coded frame.
Preferably, the BT of the target CU predicts the depth BTpThe obtaining process of (1), comprising:
obtaining a BT predicted depth BT of the target CU by utilizing a second calculation modelp；
Wherein the expression of the second calculation model is: BT (BT)p＝(BT0+BT1+1)/2；
In the formula, BT0And BT1Respectively corresponding to the maximum BT depth of the CU at the same position of the coded frame in the time domain of the target CU, and BT0And BT1The nearest neighbor frame having the same coding QP as the current coded frame.
It can be seen that, in the method for quickly dividing the depth of a CU between VVC frames provided by the present invention, because the forward predicted motion vector residual and the backward predicted motion vector residual of the target CU can represent the motion intensity of the target CU, and the CU at the corresponding position of the encoded frame has a strong correlation with the target CU being encoded, three determination criteria are set to determine whether the target CU can end the further division of QT, H-BT, V-BT, H-TT and V-TT in advance. That is, when the target CU is to perform different partition modes, whether the target CU can terminate partitioning in advance is determined according to the first preset condition, the second preset condition, the third preset condition, the fourth preset condition, and the fifth preset condition. Obviously, by the rapid CU depth dividing method provided by the invention, the steps that the target CU needs to traverse all QT, H-BT, V-BT, H-TT and V-TT for further dividing can be terminated in advance, so that the complexity in the process of dividing the target CU depth can be obviously reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for fast depth partitioning of a inter-frame CU according to an embodiment of the present invention;
fig. 2 is an example of the optimal division of a CTU.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart of a method for fast depth partitioning of a inter-frame CU according to an embodiment of the present invention, where the method includes:
step S11: sequentially extracting coding frames of a video to be coded;
step S12: when the coding frame is an inter-frame coding frame, sequentially extracting a target CU to be coded;
step S13: extracting a forward prediction motion vector residual and a backward prediction motion vector residual of the target CU according to the target CU;
in this embodiment, a new VVC inter-frame CU depth fast-partitioning method is provided, by which the complexity in partitioning the target CU depth can be significantly reduced. Specifically, when the target CU needs to be deeply divided, a forward prediction motion vector residual and a backward prediction motion vector residual of the target CU are first extracted.
It can be understood that, because the forward predicted motion vector residual and the backward predicted motion vector residual of the target CU can characterize the motion intensity of the target CU to some extent, while the corresponding position CU of the already encoded frame has strong correlation with the target CU currently being encoded, in the actual encoding process, a larger CU may be selected for a still region or a motion identity region for encoding, and therefore, in this case, no further QT, H-BT, V-BT, H-TT and V-TT partitioning is required for the CU. Referring to fig. 2, fig. 2 shows an example of the optimal partition of a CTU, the size of the CTU is 128 × 128, in fig. 2, there is 64 × 64 CU as the optimal partition, in this case, if the CU is further subjected to QT, H-BT, V-BT, H-TT and V-TT partition, the encoding complexity of the CU is increased, and the encoding efficiency is not increased.
The rapid depth partitioning method for the CU provided by the embodiment is an optimal partitioning method for predicting the CU in the CTU in advance and accurately, so that the CU can omit and jump the tedious steps of traversing the QT, H-BT, V-BT, H-TT and V-TT partitioning methods one by one. Specifically, in the present embodiment, a corresponding determination method is provided, that is, the optimal partition method for predicting the target CU in advance and accurately through steps S14 to S19.
Step S14: if the target CU divides the QT, judging whether the target CU meets a first preset condition or a second preset condition; if yes, go to step S15;
step S15: stopping further QT partitioning of the target CU;
step S16: if the target CU carries out H _ BT or V _ BT division, judging whether the target CU meets a third preset condition or a fourth preset condition; if yes, go to step S17;
step S17: stopping further H _ BT or V _ BT division on the target CU;
step S18: if the target CU divides the H _ TT or the V _ TT, judging whether the target CU meets a third preset condition, a fourth preset condition or a fifth preset condition; if yes, go to step S19;
step S19: stopping further H _ TT or V _ TT division on the target CU;
wherein the expression of the first preset condition is as follows: QTc≥QTp+1 and MVD f0; the expression of the second preset condition is as follows: QTc≥QTp+1 and MVD b0; the expression of the third preset condition is as follows: BT (BT)c≥BTp+1 and MVD f0; the expression of the fourth preset condition is as follows: BT (BT)c≥BTp+1 and MVD b0; the expression of the fifth preset condition is: BT (BT)c＜BTp-1；
In the formula, QTcQT depth, QT, for the target CUpPredicting depth, MVD, for QT of target CUfFor forward prediction of motion vector residuals, MVDbFor backward prediction of motion vector residuals, BTcBT depth of target CUpThe depth is predicted for the BT of the target CU.
It can be understood that, in practical applications, when the target CU needs to be partitioned, the target CU is generally partitioned heuristically by using a preset template, and thus whether the partition mode is the optimal partition mode of the target CU is determined. Therefore, in the present embodiment, step S14, step S16, and step S18 are technical solutions in parallel at the same time.
Specifically, when the target CU is to perform QT partition, it is determined whether the target CU satisfies a first preset condition or a second preset condition, and if the target CU satisfies the first preset condition or the second preset condition, it indicates that QT may be the optimal partition mode of the target CU, in which case, further QT partition of the target CU may be stopped; when the target CU is to perform H _ BT or V _ BT division, judging whether the target CU meets a third preset condition or a fourth preset condition, if so, indicating that the H _ BT or V _ BT division mode is possibly the optimal division mode of the target CU, and under the condition, stopping further H _ BT or V _ BT division on the target CU; when the target CU is to perform H _ TT or V _ TT division, whether the target CU meets a third preset condition, a fourth preset condition or a fifth preset condition is judged, if the target CU meets the third preset condition, the fourth preset condition or the fifth preset condition, the H _ TT or V _ TT division mode is possibly an optimal division mode of the target CU, and in this case, the target CU can be stopped from further performing H _ TT or V _ TT division.
Obviously, the best partition mode of the target CU is predicted in advance by steps S14 to S19, so that the tedious steps of compressing and encoding the target CU by traversing all QT, H-BT, V-BT, H-TT and V-TT can be avoided by steps S14 to S19. Therefore, the technical scheme provided by the embodiment can significantly reduce the complexity in the process of compressing and encoding the target CU.
It can be seen that, in the method for quickly dividing the depth of a CU between VVC frames provided by the present invention, because the forward predicted motion vector residual and the backward predicted motion vector residual of the target CU can represent the motion intensity of the target CU, and the CU at the corresponding position of the encoded frame has a strong correlation with the target CU being encoded, three determination criteria are set to determine whether the target CU can end the further division of QT, H-BT, V-BT, H-TT and V-TT in advance. That is, when the target CU is to perform different partition modes, whether the target CU can terminate partitioning in advance is determined according to the first preset condition, the second preset condition, the third preset condition, the fourth preset condition, and the fifth preset condition. Obviously, by the rapid CU depth dividing method provided by the invention, the steps that the target CU needs to traverse all QT, H-BT, V-BT, H-TT and V-TT for further dividing can be terminated in advance, so that the complexity in the process of dividing the target CU depth can be obviously reduced.
Based on the above embodiments, this embodiment further describes and optimizes the technical solution, specifically, the steps are as follows: after the process of judging whether the target CU meets the first preset condition or the second preset condition, the method further includes:
and if not, performing further QT division on the target CU.
It is understood that, in the process of deeply partitioning the target CU, in addition to the foregoing situations, when the target CU is to be subjected to QT partitioning, the target CU may not satisfy the first preset condition or the second preset condition, and in this case, it indicates that the current target CU depth may not be the optimal partitioning, and in this case, the target CU needs to be subjected to further QT partitioning, and thus an optimal partitioning mode of the target CU is found.
Obviously, the technical scheme provided by the embodiment can relatively ensure the integrity of the target CU in the depth division process.
Based on the above embodiments, this embodiment further describes and optimizes the technical solution, specifically, the steps are as follows: after the process of judging whether the target CU meets the third preset condition or the fourth preset condition, the method further includes:
and if not, further H _ BT or V _ BT division is carried out on the target CU.
In this embodiment, when the target CU is to be subjected to H _ BT or V _ BT partition, if it is determined that the target CU does not satisfy the third preset condition or the fourth preset condition, it indicates that the current target CU depth may not be the optimal partition, in this case, the target CU needs to be further subjected to H _ BT or V _ BT partition, and thus, the target CU optimal partition mode is searched and determined for the subsequent flow steps to be continuously executed.
Based on the above embodiments, this embodiment further describes and optimizes the technical solution, specifically, the steps are as follows: after the process of judging whether the target CU meets the third preset condition, the fourth preset condition, or the fifth preset condition, the method further includes:
and if not, further H _ TT or V _ TT division is carried out on the target CU.
In practical applications, when the target CU is going to perform H _ TT or V _ TT division, the target CU may not satisfy the third preset condition, the fourth preset condition, or the fifth preset condition, and at this time, it indicates that the current target CU depth may not be the optimal division. In this case, the target CU needs to be further divided by H _ TT or V _ TT, and thus the optimal division mode of the target CU is continuously found.
Obviously, by the technical scheme provided by the embodiment, the target CU depth division method provided by the embodiment can be applied to more actual scenes.
Based on the above embodiments, this embodiment further describes and optimizes the technical solution, specifically, the QT predicted depth QT of the target CUpThe obtaining process of (1), comprising:
calculating a QT predicted depth QT of a target CU using a first computational modelp；
Wherein the expression of the first calculation model is: QTp＝(QT0+QT1+1)/2；
In the formula, QT0And QT1Respectively temporally corresponding encoded frame phases for target CUMaximum QT depth of co-located CU, and QT0And QT1The nearest neighbor frame having the same coding QP as the current coded frame.
In the embodiment, a method for calculating the QT predicted depth QT of the target CU is providedpThat is, in an actual process, the first calculation model may be utilized to obtain the QT prediction depth QT of the target CUp. Obviously, when the QT predicted depth QT of the target CU is calculated by the first calculation modelpIn time, the QT of the target CU can be made to predict the depth QTpThe calculation result is more accurate and reliable.
Based on the foregoing embodiments, this embodiment further describes and optimizes the technical solution, specifically, the BT of the target CU predicts the depth BTpThe obtaining process of (1), comprising:
obtaining the BT predicted depth BT of the target CU by utilizing a second calculation modelp；
Wherein the expression of the second calculation model is: BT (BT)p＝(BT0+BT1+1)/2；
In the formula, BT0And BT1The maximum BT depth of the CU at the same position of the coded frame is respectively corresponding to the target CU in time domain, and BT0And BT1The nearest neighbor frame having the same coding QP as the current coded frame.
In the embodiment, a method for calculating the BT predicted depth BT of the target CU is providedpI.e. during the actual operation, the parameter BT can be set0And BT1Inputting the data into a second computing module, and outputting the BT predicted depth BT of the target CU by using a second computing modelp. Obviously, the method provided by the embodiment can further ensure the BT predicted depth BT of the target CUpAccuracy in the calculation process.
Based on the technical content disclosed in the above embodiment, in the present embodiment, VTM5.0 is used as a test platform, and is independently executed on inter (r) core (tm) i5-7700 CPU, 24GB RAMde PC to perform experimental verification on the CU depth partitioning method disclosed above, so as to evaluate the feasibility and effectiveness of the partitioning method.
Assume that the test sequence includes 5 resolutions, namely, 416 × 240 (blowingburgles, BQSquare, RaceHores), 832 × 480 (racehorsc, part science, basetballdrill), 1280 × 720(FourPeople, KristenAndSara), 1920 × 1080(Cactus, Kimono, ParkScene), and 2560 × 1600 (peoplesstreet, steelocomotive, nebutafettival); then, setting a coding Quantization Parameter (QP) to (22, 27, 32, 37), wherein the coding configuration is ra (random access); finally, the performance of the algorithm is measured by using the code Rate change condition (BD-Rate) and the coding Time (TS).
Wherein TS is defined as
Figure BDA0002324903510000091
In the formula, T0For the encoding time of the original test pattern, TpFor the encoding time of the present invention after application to the original test model, i represents a different QP value.
Referring to table 1, table 1 shows the performance comparison results of the method provided by the present invention on the VTM5.0 test platform.
TABLE 1
Figure BDA0002324903510000092
As can be seen from the results shown in Table 1, the encoding time of the method of the present invention can be saved by 13.6% to 39%, and can be reduced by 24% on average. The increase of BD-Rate ranged from 0.05% to 2.03%, with an average increase of 0.96%. Especially for the NebutaFestival video sequence with the resolution of 2560 x 1600, 39% of the encoding time can be saved, while the BD-Rate is only increased by 0.05%. Obviously, compared with the original VTM5.0 algorithm platform, the rapid CU depth partitioning method provided by the invention effectively reduces the encoding time under the condition that the human eye can accept the encoding quality degradation range. In summary, the method of the present invention can significantly reduce the encoding complexity in the video compression encoding process, and can also maintain the better video compression quality.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above detailed description is given to the rapid depth partitioning method for inter-frame CU of VVC provided by the present invention, and a specific example is applied in the present document to explain the principle and the implementation of the present invention, and the description of the above embodiment is only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims (6)

1. A VVC inter-frame CU depth fast dividing method is characterized by comprising the following steps:
sequentially extracting coding frames of a video to be coded;
when the coding frame is an inter-frame coding frame, sequentially extracting a target CU to be coded;
extracting a forward prediction motion vector residual and a backward prediction motion vector residual of the target CU according to the target CU;
if the target CU is to be subjected to QT division, judging whether the target CU meets a first preset condition or a second preset condition;
if so, stopping further QT partitioning on the target CU;
if the target CU carries out H _ BT or V _ BT division, judging whether the target CU meets a third preset condition or a fourth preset condition;
if so, stopping further H _ BT or V _ BT division on the target CU;
if the target CU divides the H _ TT or the V _ TT, judging whether the target CU meets the third preset condition, the fourth preset condition or the fifth preset condition;
if yes, stopping further H _ TT or V _ TT division on the target CU;
wherein the expression of the first preset condition is as follows: QTc≥QTp+1 and MVDf0; the expression of the second preset condition is as follows: QTc≥QTp+1 and MVDb0; the expression of the third preset condition is as follows: BT (BT)c≥BTp+1 and MVDf0; the expression of the fourth preset condition is as follows: BT (BT)c≥BTp+1 and MVDb0; the expression of the fifth preset condition is as follows: BT (BT)c＜BTp-1；
In the formula, QTcIs the QT depth, QT, of the target CUpPredicting depth, MVD, for QT of the target CUfFor the forward predicted motion vector residual, MVDbFor said backward predicted motion vector residual, BTcIs BT depth of the target CU, BTpPredicting a depth for the BT of the target CU.
2. The VVC inter-frame CU depth fast partition method of claim 1, wherein after the process of determining whether the target CU satisfies a first preset condition or a second preset condition, the method further comprises:
and if not, performing further QT division on the target CU.
3. The VVC inter-frame CU depth fast partition method of claim 1, wherein after the process of determining whether the target CU satisfies a third preset condition or a fourth preset condition, the method further comprises:
and if not, further H _ BT or V _ BT division is carried out on the target CU.
4. The VVC inter-frame CU depth fast partition method of claim 1, wherein after the process of determining whether the target CU satisfies the third preset condition, the fourth preset condition, or the fifth preset condition, the method further comprises:
and if not, further H _ TT or V _ TT division is carried out on the target CU.
5. The VVC inter-frame CU depth fast partition method of claim 1, wherein the QT predicted depth QT of the target CUpThe obtaining process of (1), comprising:
calculating a QT predicted depth QT of the target CU using a first computational modelp；
Wherein the expression of the first computational model is: QTp＝(QT0+QT1+1)/2；
In the formula, QT0And QT1Temporally corresponding to a maximum QT depth of a co-located CU of the encoded frame, respectively, for the target CU, and QT0And QT1The nearest neighbor frame having the same coding QP as the current coded frame.
6. The VVC inter-frame CU depth fast partition method as claimed in claim 1, wherein the BT prediction depth BT of the target CU is equal to BTpThe obtaining process of (1), comprising:
obtaining a BT predicted depth BT of the target CU by utilizing a second calculation modelp；
Wherein the expression of the second calculation model is: BT (BT)p＝(BT0+BT1+1)/2；
In the formula, BT0And BT1Respectively corresponding to the maximum BT depth of the CU at the same position of the coded frame in the time domain of the target CU, and BT0And BT1The nearest neighbor frame having the same coding QP as the current coded frame.
CN201911312416.6A 2019-12-18 2019-12-18 VVC inter-frame CU deep rapid dividing method Active CN111064968B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911312416.6A CN111064968B (en) 2019-12-18 2019-12-18 VVC inter-frame CU deep rapid dividing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911312416.6A CN111064968B (en) 2019-12-18 2019-12-18 VVC inter-frame CU deep rapid dividing method

Publications (2)

Publication Number Publication Date
CN111064968A true CN111064968A (en) 2020-04-24
CN111064968B CN111064968B (en) 2021-02-12

Family

ID=70302391

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911312416.6A Active CN111064968B (en) 2019-12-18 2019-12-18 VVC inter-frame CU deep rapid dividing method

Country Status (1)

Country Link
CN (1) CN111064968B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013155664A1 (en) * 2012-04-16 2013-10-24 Mediatek Singapore Pte. Ltd. Methods and apparatuses of coding structure for scalable extension of high efficiency video coding (hevc)
CN107371022A (en) * 2017-08-26 2017-11-21 同济大学 The quick division methods of interframe encode unit applied to HEVC medical image lossless codings
CN107396121A (en) * 2017-08-22 2017-11-24 中南大学 A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure
CN108712647A (en) * 2018-05-17 2018-10-26 哈尔滨工业大学 A kind of CU division methods for HEVC
CN109688414A (en) * 2018-12-19 2019-04-26 同济大学 A kind of reduction of VVC intraframe coding unit candidate modes and block, which divide, shifts to an earlier date terminating method
CN110087087A (en) * 2019-04-09 2019-08-02 同济大学 VVC interframe encode unit prediction mode shifts to an earlier date decision and block divides and shifts to an earlier date terminating method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013155664A1 (en) * 2012-04-16 2013-10-24 Mediatek Singapore Pte. Ltd. Methods and apparatuses of coding structure for scalable extension of high efficiency video coding (hevc)
CN107396121A (en) * 2017-08-22 2017-11-24 中南大学 A kind of coding unit depth prediction approach and device based on hierarchical B-frame structure
CN107371022A (en) * 2017-08-26 2017-11-21 同济大学 The quick division methods of interframe encode unit applied to HEVC medical image lossless codings
CN108712647A (en) * 2018-05-17 2018-10-26 哈尔滨工业大学 A kind of CU division methods for HEVC
CN109688414A (en) * 2018-12-19 2019-04-26 同济大学 A kind of reduction of VVC intraframe coding unit candidate modes and block, which divide, shifts to an earlier date terminating method
CN110087087A (en) * 2019-04-09 2019-08-02 同济大学 VVC interframe encode unit prediction mode shifts to an earlier date decision and block divides and shifts to an earlier date terminating method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
NA TANG，ET AL.: "Fast CTU Partition Decision Algorithm for VVC", 《 2019 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS)》 *
张盛峰等: "HEVC帧间预测编码单元尝试快速选择算法", 《计算机工程》 *

Also Published As

Publication number Publication date
CN111064968B (en) 2021-02-12

Similar Documents

Publication Publication Date Title
US9781443B2 (en) Motion vector encoding/decoding method and device and image encoding/decoding method and device using same
JP6073405B2 (en) Video decoding method and apparatus
KR101145698B1 (en) Inter-frame prediction coding method, device and system
US20130208801A1 (en) Motion vector encoding device and decoding device
KR102271765B1 (en) Intraframe prediction method and apparatus, video encoding apparatus and storage medium
JP2013523010A5 (en) Method and apparatus for implicit adaptive motion vector predictor selection for video encoding and video decoding
JP2007202150A (en) Method of and apparatus for deciding encoding mode for variable block size motion estimation
US20200053368A1 (en) Method and apparatus for encoding a video
Chen et al. Effective HEVC intra coding unit size decision based on online progressive Bayesian classification
CN108989799B (en) Method and device for selecting reference frame of coding unit and electronic equipment
US20200014915A1 (en) Method and apparatus for encoding a video
CN101888546A (en) Motion estimation method and device
WO1997015887A1 (en) Method and device for selectively compressing video codec
WO2020248715A1 (en) Coding management method and apparatus based on high efficiency video coding
CN116193126A (en) Video coding method and device
CN104796701B (en) Predictive mode based on HEVC determines method and device
KR102201604B1 (en) Method and apparatus for hiding data in prediction parameters
CN113422959A (en) Video encoding and decoding method and device, electronic equipment and storage medium
CN111064968B (en) VVC inter-frame CU deep rapid dividing method
JP2001251627A (en) Coder, coding method and recording medium recorded with program
CN110139098B (en) Decision tree-based intra-frame fast algorithm selection method for high-efficiency video encoder
JP4216769B2 (en) Moving picture coding method, moving picture coding apparatus, moving picture coding program, and computer-readable recording medium recording the program
CN111107359A (en) Intra-frame prediction coding unit dividing method suitable for HEVC standard
CN110062237B (en) Intra-frame coding mode selection method and device for video coding
JP4695115B2 (en) Moving picture coding method, moving picture coding apparatus, moving picture coding program, and computer-readable recording medium recording the program

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant