CN111818332A - Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard - Google Patents
Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard Download PDFInfo
- Publication number
- CN111818332A CN111818332A CN202010515283.9A CN202010515283A CN111818332A CN 111818332 A CN111818332 A CN 111818332A CN 202010515283 A CN202010515283 A CN 202010515283A CN 111818332 A CN111818332 A CN 111818332A
- Authority
- CN
- China
- Prior art keywords
- partition
- variance
- gradient
- calculated
- value
- 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.)
- Pending
Links
- 238000005192 partition Methods 0.000 title claims abstract description 61
- 238000000034 method Methods 0.000 claims abstract description 19
- 238000000638 solvent extraction Methods 0.000 claims description 20
- 238000004364 calculation method Methods 0.000 claims description 17
- 239000011159 matrix material Substances 0.000 claims description 3
- 238000012360 testing method Methods 0.000 claims description 2
- 238000012549 training Methods 0.000 claims description 2
- 230000006835 compression Effects 0.000 abstract description 2
- 238000007906 compression Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/11—Selection of coding mode or of prediction mode among a plurality of spatial predictive coding modes
-
- 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
- H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
-
- 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Discrete Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention belongs to the technical field of high-definition video compression coding and decoding, and particularly relates to a fast algorithm for intra-frame prediction partition judgment suitable for VVC standards. In the invention, the size of the LCU may be 128 × 128 by default of VVC, or may be other; the sizes of CUs in the VVCs are various, and the lengths and widths thereof may be 4, 8, 16, 32, 64, and 128, and there are rectangular CUs having different lengths and widths. The invention introduces the algorithm based on the variance and the gradient, can approximately obtain the texture complexity of the current CU, judges based on the information and obtains the most possible dividing mode, thereby greatly accelerating the block dividing process of the intra-frame prediction.
Description
Technical Field
The invention belongs to the technical field of high-definition video compression coding and decoding, and particularly relates to a rapid algorithm which is applicable to VVC video coding standards and accelerates the intra-frame prediction division judgment process.
Background
The new generation of Video Coding standard VVC (Versatile Video Coding) is established and released by JVT Team (Joint Video expansion Team) which is jointly established by two international Video Coding standards organizations, namely, ITU-T VCEG (Video Coding Experts group) and ISO/IEC MPEG (moving Picture Experts group). The goal of formulating the VVC standard is to double the coding performance compared to its predecessor h.265/HEVC.
In the VVC intra-frame prediction process, an image is firstly divided into LCU blocks for processing. The default size of the LCU is 128 x 128. Next, the LCU needs to be divided into small CUs according to the local texture of the region. The process of partitioning the LCU into CUs may perform quadtree partitioning like HEVC, or perform binary tree or ternary tree partitioning according to a new manner proposed by the VVC standard (see fig. 1 for five partitioning manners). The quadtree nodes can be divided into five kinds of partitions, and non-quadtree nodes and subnodes thereof cannot be divided into quadtree partitions. The length and width of a CU may have various combined lengths, which is different from the length and width of a CU must be equal in intra prediction of HEVC. Therefore, in the intra prediction of VVC, rectangular CUs having different lengths and widths may appear. In addition, the concept of the coding unit CU, the prediction unit PU, and the transform unit TU is blurred in the VVC, and the three are generally equivalent, but different names are used when different operations are performed. In the intra-frame prediction process, an optimal partition mode needs to be found, a block is divided into sizes consistent with textures of the block, so that the optimal performance is obtained, and the process of finding the optimal block size partition mode is called partition judgment.
In the VVC official reference software VTM, the division judgment of intra-frame prediction is finished through iteration, specifically, the total RDO under various division conditions is compared when a certain block is not divided, the optimal division of small blocks is firstly calculated during iteration, then the optimal division of a large block consisting of a plurality of small blocks is calculated, and the like until the whole LCU finishes the division judgment. Although the size of the block is more variable compared with that of the HEVC block and can be better adapted to the texture, the partitioning decision mode introduces a great amount of operation and is not suitable for hardware implementation, so that a fast algorithm is required to accelerate the partitioning decision process.
Since only one partitioning mode, namely, quad-tree partitioning, exists in HEVC, fast mode decision of HEVC is basically limited to determining whether a CU needs to be partitioned, and operations performed on a CU may be as follows: and judging only by dividing, only by not dividing, comparing the division with the non-division. In the VVC, the number of possible partitioning modes is increased from the original one to five, and in addition to the original quadtree partitioning, there are two binary tree partitions (horizontal and vertical) and two ternary tree partitions (horizontal and vertical). Therefore, the partition determination in the VVC not only determines whether or not a CU is partitioned, but also determines which way the CU should select for partitioning.
Disclosure of Invention
The invention aims to provide a fast algorithm for intra prediction partition judgment applicable to VVC standard.
The invention provides a rapid algorithm for intra-frame prediction partition judgment suitable for VVC standard, which comprises the following specific steps:
(1) firstly, calculating the variance of all pixel points contained in a CU, and judging whether the texture of the block is flat or not according to the variance; if the texture is flat, directly judging that the division is not needed to be continued, and skipping the subsequent calculation process of dividing the texture into subblocks;
(2) if the division of the subblocks is not skipped in the first step, proceeding with the gradient calculation; if the current block is a quadtree node (the necessary condition is that the current block is square, namely, the length and the width are equal), respectively calculating the total gradient of the horizontal direction and the vertical direction of the CU; judging whether to divide the quadtree according to the difference of the transverse total gradient and the longitudinal total gradient and an absolute numerical value; if a quadtree partition is selected in this step, then the other four binary tree and ternary tree partitions (i.e., horizontal binary tree partition and vertical binary tree partition, and horizontal ternary tree partition and vertical ternary tree partition) will be skipped;
(3) if no quadtree partition is selected in the second step, then under all possible partition modes, the overall variance of each sub-block is calculated, and then the variance of the sub-block variance is calculated, that is: calculating the variance of the 4 subblock variances for the quadtree partitioning; for binary tree partitioning, calculating the variance of 2 subblock variances; for the ternary tree partition, calculating the variance of 3 subblock variances; among all the feasible partitions, the corresponding partition mode with the largest variance value is selected as the final and unique partition.
In the present invention, the size of the LCU may be 128 × 128, which is a default of VVC, or may be other.
In the present invention, the size of a CU may be 4 × 4, 4 × 8, 8 × 32, 16 × 16, …, etc., as long as it is not larger than the size of an LCU and its size theoretically exists in the division of VVC intra prediction.
In the invention, the gradient calculation is based on calculation of a Sobel operator or other types of gradient calculation to obtain the total gradient values of the pixel points in the transverse direction and the longitudinal direction.
In the present invention, the sizes of the CUs in the VVC are various, and the lengths and widths thereof may be 4, 8, 16, 32, 64, and 128, and there are rectangular CUs having different lengths and widths. The invention introduces the algorithm based on the variance and the gradient, can approximately obtain the texture complexity of the current CU, judges based on the information and obtains the most possible dividing mode, thereby greatly accelerating the block dividing process of the intra-frame prediction.
Drawings
Fig. 1 is a schematic diagram of five division modes of VVC intra prediction, taking a quadtree node as an example. The method comprises the following steps of (a) quadtree division, (b) horizontal (transverse) binary tree division, (c) vertical (vertical) binary tree division, (d) horizontal (transverse) ternary tree division, and (e) vertical (vertical) ternary tree division. If the node is a non-quad tree node, the quad tree division can not be carried out.
Fig. 2 shows the filling method (for example, 32 × 32 blocks) when calculating the gradient.
Detailed Description
The present invention will be further described with reference to the accompanying drawings.
The fast algorithm for intra-frame prediction division judgment suitable for the VVC standard calculates the variance and the gradient according to the correlation between the pixel points in the coding block, and greatly accelerates the speed of intra-frame prediction division judgment.
First, the variance of all pixels in a block is calculated. The calculation method is shown in formula (1).
In the formula, var represents the calculated variance, W and H are the width and height of the calculated CU, X (i, j) is the pixel value of the point at the position (i, j), and μ is the average value of all the pixels of the calculated CU.
If the calculated variance is less than the threshold TH1Then the block texture is determined to be single and no further partitioning is necessary.
If the next division is not skipped in the previous step, then the edge points, i.e. the upper and lower rows and the left and right columns outside the CU, are filled into the current block as shown in fig. 2, which facilitates the calculation of the horizontal and vertical gradients of each point in the block. For blocks that can be quadtree-divided (the requirement is that the current block is square, i.e. equal in length and width), taking gradient calculation based on the Sobel operator as an example, the lateral gradient D of each pointxAnd a longitudinal gradient DyCalculated from equation (2). Transverse overall gradient DXAnd the longitudinal overall gradient DYCalculated from formula (3). If the ratio of the total transverse gradient to the total longitudinal gradient is less than the threshold TH2And each of them is greater than the threshold TH3If the texture in both horizontal and vertical directions is substantially the same, then the quadtree partition is selected directly, and two other binary tree partitions and two ternary tree partitions are skipped.
Formula (A), (B) and2) in M (i, j) represents a 3 × 3 pixel matrix centered on the point at position (i, j), the matrices multiplied by the latter being the Sobel operators in the horizontal and vertical directions, respectively, Dx(i, j) and Dy(i, j) represent the gradient values in the lateral and longitudinal directions at location (i, j), respectively; in the formula (3), W and H are the width and height of the calculated CU, abs (. eta.) represents the absolute value, and DXAnd DYRepresenting the sum of the absolute values of the calculated gradients of the CU in the lateral and longitudinal directions, respectively.
If the current block has not skipped either the full partition or the binary and ternary tree partitions, then calculations will be performed for all feasible partitions next. Under each division condition, the overall variance of each subblock is calculated firstly, and then the variance of the subblock variances is calculated, namely the variance of 4 subblock variances is calculated for the quad-tree division, the variance of 2 subblock variances is calculated for the binary-tree division, and the variance of 3 subblock variances is calculated for the tri-tree division. The corresponding partition mode with the largest variance value will be selected as the final and unique partition.
Specifically, the variance calculation expression of the variance in the case of 5 divisions is as shown in formula (4). In the case of QT, for example, varQTRepresents the variance calculation result, wkAnd hkDenotes the width and height of the kth sub-CU, X (i, j) denotes the pixel value of the point where the kth sub-CU is located at (i, j), μkDenotes the average, μ, of all points of the kth sub-CUQTRepresents the average of all points across the CU. Obtaining varQT、varBH、varBV、varTHAnd varTVAnd then comparing the sizes of the partition modes, and taking the corresponding partition mode with the largest var in the allowed partition modes as the final partition.
In the present invention, the above three thresholds TH1、TH2And TH3May be obtained in various ways using (without limitation) picture set training.
To obtain TH1、TH2And TH3The specific process is as follows：
The picture set or video sequence is first encoded using the official reference software VTM, resulting in the encoding time and encoding performance of the original algorithm in the four cases QP 22,27,32 and 37.
Determining TH1、TH2And TH3Take the case for a CU of 32 × 32 size as an example, TH in the case of CU width and height determination1With positive correlation to QP, the expression can be set to TH1 ═ α × QP, TH2And TH3Regardless of QP, TH can be set2＝β，TH3γ. Fixing beta and gamma, changing the value of alpha, encoding a picture set or a video sequence by using an official reference software VTM, obtaining the encoding time and the encoding performance of the algorithm provided by the invention under the four conditions of QP (22, 27,32 and 37), comparing with the original algorithm to obtain BDBR and time reduction, and obtaining a series of line graphs connecting BDBR and time reduction points for the test of a plurality of alpha values. Experiments prove that the time reduction has small change in a certain range, and the optimal value of alpha is selected mainly according to the BDBR fold line, namely, the point (red) with obvious change of the BDBR fold slope is selected as alpha. See the broken lines in fig. 3.
Similarly, after the α value is determined, α and γ are fixed, and a line graph connecting BDBR and time reduction points for different β values is obtained in the same manner as described above. The optimal beta value is selected mainly according to the BDBR broken line.
Similarly, after the β value is also determined, α and β are fixed, and the line graph connecting the BDBR and the time reduction points for different γ values is obtained in the same manner as described above. The optimal gamma value is selected mainly according to the BDBR broken line.
Claims (6)
1. A fast algorithm for intra prediction partitioning decision applicable to VVC standard, where the size of LCU is 128 × 128 by default for VVC, or others; the size of a CU is 4 × 4, 4 × 8, 8 × 32, 16 × 16, …, etc., is not larger than the size of an LCU and its size is theoretically present in the partitioning of VVC intra prediction; the method is characterized by comprising the following specific steps:
(1) firstly, calculating the variance of all pixel points contained in a CU, and judging whether the texture of the block is flat or not according to the variance; if the texture is flat, directly judging that the division is not needed to be continued, and skipping the subsequent calculation process of dividing the texture into subblocks;
(2) if the division of the subblocks is not skipped in the first step, proceeding with the gradient calculation; if the current block is a quad-tree node, namely the current block is a square, respectively calculating the horizontal and vertical total gradients of the CU; judging whether to divide the quadtree according to the difference of the transverse total gradient and the longitudinal total gradient and an absolute numerical value; if a quadtree partition is selected in this step, then the other four partitions, namely, the horizontal binary tree partition and the vertical binary tree partition, and the horizontal ternary tree partition and the vertical ternary tree partition, are skipped;
(3) if no quadtree partition is selected in the second step, then under all possible partition modes, the overall variance of each sub-block is calculated, and then the variance of the sub-block variance is calculated, that is: calculating the variance of the 4 subblock variances for the quadtree partitioning; for binary tree partitioning, calculating the variance of 2 subblock variances; for the ternary tree partition, calculating the variance of 3 subblock variances; among all the feasible partitions, the corresponding partition mode with the largest variance value is selected as the final and unique partition.
2. The fast algorithm for intra prediction partition decision applicable to VVC standard of claim 1, wherein in step (1), the variance of all pixels contained in a CU is calculated, and the calculation formula is shown in (1):
in the formula, var represents the calculated variance, W and H are the width and height of the calculated CU, X (i, j) is the pixel value of the point at the position (i, j), and μ is the average value of all the pixels of the calculated CU;
if the calculated variance is less than the threshold TH1Then the block texture is determined to be single and no further partitioning is performed.
3. The fast algorithm for intra prediction partition decision applicable to VVC standard of claim 1, wherein the gradient calculation in step (2) employs Sobel operator, and the lateral gradient D of each point is determined by Sobel operatorxAnd a longitudinal gradient DyCalculated by formula (2); transverse overall gradient DXAnd the longitudinal overall gradient DYCalculated from equation (3):
in the formula (2), M (i, j) represents a 3 × 3 pixel matrix centered on the point at the position (i, j), and the matrix multiplied by the latter is the Sobel operators in the horizontal and vertical directions, respectively, Dx(i, j) and Dy(i, j) represent the gradient values in the lateral and longitudinal directions at location (i, j), respectively; in the formula (3), W and H are the width and height of the calculated CU, abs (. eta.) represents the absolute value, and DXAnd DYRepresenting the sum of the absolute values of the calculated gradients of the CU in the lateral and longitudinal directions, respectively.
4. The algorithm for fast intra prediction partition decision applicable to VVC standard of claim 3, wherein the determination of whether to perform quadtree partition in step (2) is performed according to the following specific determination rules:
if the ratio of the total transverse gradient to the total longitudinal gradient is less than TH2And they are each greater than TH3If the texture in both horizontal and vertical directions is substantially consistent, the quadtree partition is directly selected, and two other binary tree partitions and two ternary tree partitions are skipped.
5. The fast algorithm for intra prediction partition decision applicable to VVC standard of claim 4, wherein the variance calculation expression of variance in 5 partition casesAs shown in equation (4); wherein, for the QT case, varQTRepresents the variance calculation result, wkAnd hkDenotes the width and height of the kth sub-CU, X (i, j) denotes the pixel value of the point where the kth sub-CU is located at (i, j), μkDenotes the average, μ, of all points of the kth sub-CUQTRepresents the average of all points of the entire CU; for BH, BV, HT, TV cases, and so on; obtaining varQT、varBH、varBV、varTHAnd varTVThen, comparing the sizes of the partition modes, and taking the corresponding partition mode with the maximum var as the final partition;
6. the fast algorithm for intra prediction partitioning decision applicable to VVC standard as claimed in claim 5, wherein three thresholds TH1、TH2And TH3The method is obtained by using a picture set training mode, and comprises the following specific processes:
firstly, encoding a picture set or a video sequence by using an official reference software VTM to obtain the encoding time and the encoding performance of an original algorithm under four conditions of QP (22, 27,32 and 37);
determining TH1、TH2And TH3Take the case for a CU of 32 × 32 size as an example, TH in the case of CU width and height determination1Positive correlation with QP, expression TH1 ═ α × QP, TH2And TH3Regardless of QP, set to TH2＝β，TH3γ; α, β, and γ are determined as follows:
fixing beta and gamma, changing the value of alpha, encoding a picture set or a video sequence by using an official reference software VTM, obtaining the encoding time and the encoding performance of the algorithm provided by the invention under the four conditions of QP (22, 27,32 and 37), and comparing the encoding time and the encoding performance with the original algorithm to obtain BDBR and time reduction; for the test of a plurality of alpha values, obtaining a series of BDBR and time reduction points which are connected into a line graph; selecting a point at which the slope of the BDBR broken line changes obviously as an alpha value;
similarly, after the alpha value is determined, fixing alpha and gamma, and obtaining a line graph connecting BDBR and time reduction points under different beta values by the same method as the method; selecting a point at which the slope of the BDBR broken line changes obviously as a beta value;
similarly, after the beta value is determined, fixing alpha and beta, and obtaining a line graph connecting BDBR and time reduction points under different gamma values by the same method; and selecting the point at which the slope of the BDBR broken line changes obviously as the gamma value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010515283.9A CN111818332A (en) | 2020-06-09 | 2020-06-09 | Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010515283.9A CN111818332A (en) | 2020-06-09 | 2020-06-09 | Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111818332A true CN111818332A (en) | 2020-10-23 |
Family
ID=72846054
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010515283.9A Pending CN111818332A (en) | 2020-06-09 | 2020-06-09 | Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111818332A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112104867A (en) * | 2020-11-09 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Video processing method, video processing device, intelligent equipment and storage medium |
| CN112714314A (en) * | 2020-12-28 | 2021-04-27 | 杭州电子科技大学 | Multi-type tree structure block partition mode decision-making early termination method |
| CN113014925A (en) * | 2021-01-27 | 2021-06-22 | 重庆邮电大学 | H.266/VVC inter-frame coding CU fast dividing method and storage medium |
| WO2024016171A1 (en) * | 2022-07-19 | 2024-01-25 | Oppo广东移动通信有限公司 | Video coding method and device, storage medium, and code stream |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105120291A (en) * | 2015-08-07 | 2015-12-02 | 中山大学 | Self-adaption rapid video coding method based on variance |
| CN110049338A (en) * | 2019-04-26 | 2019-07-23 | 杭州电子科技大学 | The quick inter-frame encoding methods of HEVC based on multilayer subseries |
| CN110691254A (en) * | 2019-09-20 | 2020-01-14 | 中山大学 | Quick judgment method, system and storage medium for multifunctional video coding |
| CN111147867A (en) * | 2019-12-18 | 2020-05-12 | 重庆邮电大学 | Multifunctional video coding CU partition rapid decision-making method and storage medium |
-
2020
- 2020-06-09 CN CN202010515283.9A patent/CN111818332A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105120291A (en) * | 2015-08-07 | 2015-12-02 | 中山大学 | Self-adaption rapid video coding method based on variance |
| CN110049338A (en) * | 2019-04-26 | 2019-07-23 | 杭州电子科技大学 | The quick inter-frame encoding methods of HEVC based on multilayer subseries |
| CN110691254A (en) * | 2019-09-20 | 2020-01-14 | 中山大学 | Quick judgment method, system and storage medium for multifunctional video coding |
| CN111147867A (en) * | 2019-12-18 | 2020-05-12 | 重庆邮电大学 | Multifunctional video coding CU partition rapid decision-making method and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| YIBO FAN 等, A FAST QTMT PARTITION DECISION STRATEGY FOR VVC INTRA PREDICTION, no. 8, pages 107900 - 107911 * |
| YIBOFAN等, A FAST QTMT PARTITION DECISION STRATEGY FOR VVC INTRA PREDICTION, IEEE ACCESS, VOLUME 8, pages 107900 - 107911 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112104867A (en) * | 2020-11-09 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Video processing method, video processing device, intelligent equipment and storage medium |
| WO2022095871A1 (en) * | 2020-11-09 | 2022-05-12 | 腾讯科技（深圳）有限公司 | Video processing method, video processing apparatus, smart device, and storage medium |
| CN112714314A (en) * | 2020-12-28 | 2021-04-27 | 杭州电子科技大学 | Multi-type tree structure block partition mode decision-making early termination method |
| CN112714314B (en) * | 2020-12-28 | 2022-07-26 | 杭州电子科技大学 | Multi-type tree structure block partition mode decision-making early termination method |
| CN113014925A (en) * | 2021-01-27 | 2021-06-22 | 重庆邮电大学 | H.266/VVC inter-frame coding CU fast dividing method and storage medium |
| WO2024016171A1 (en) * | 2022-07-19 | 2024-01-25 | Oppo广东移动通信有限公司 | Video coding method and device, storage medium, and code stream |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111818332A (en) | Fast algorithm for intra-frame prediction partition judgment suitable for VVC standard | |
| US10009616B2 (en) | Image encoding device, image decoding device, image encoding method, and image decoding method | |
| EP3114838B1 (en) | Hash table construction and availability checking for hash-based block matching | |
| US8204136B2 (en) | Image encoding apparatus | |
| CN109379594B (en) | Video coding compression method, device, equipment and medium | |
| CN110365982B (en) | Multi-transformation selection accelerating method for intra-frame coding in multipurpose coding | |
| KR101595899B1 (en) | Coding and decoding of an image or of a sequence of images sliced into partitions of pixels of linear form | |
| KR20220112864A (en) | Methods and devices for bit-width control for bi-directional optical flow | |
| US20110182524A1 (en) | Image processing device and image processing method | |
| CN113784124B (en) | Block matching encoding and decoding method for fine division using multi-shape sub-blocks | |
| JP2007243427A (en) | Encoder and decoder | |
| JP6953067B2 (en) | Coding unit division determination method and device, computing device and readable storage medium | |
| CN110519591B (en) | Method for quickly selecting prediction mode based on intra-frame coding in multipurpose coding | |
| CN104883566B (en) | The fast algorithm that a kind of intra prediction block size suitable for HEVC standard divides | |
| CN108737819B (en) | Flexible coding unit partitioning method based on quadtree binary tree structure | |
| US11882315B2 (en) | Method and apparatus for encoding/decoding image | |
| KR20190140423A (en) | A method and an apparatus for encoding/decoding a residual block using scaling | |
| EP1921865A2 (en) | Obtaining a motion vector in block-based motion estimation | |
| KR101902700B1 (en) | Apparatus for hevc coding and method for process of coding in intra prediction using the same | |
| CN110312127B (en) | Method for constructing most probable prediction mode list, image coding method and processing device | |
| Park | CU encoding depth prediction, early CU splitting termination and fast mode decision for fast HEVC intra-coding | |
| KR20220019731A (en) | A video encoding/decoding method and apparatus | |
| US8396308B2 (en) | Image coding based on interpolation information | |
| CN105992003A (en) | Method and device for image compression of palette color number based on order or frequency | |
| JP3866580B2 (en) | Image encoding device, image decoding device, image encoding program, image decoding program, and computer-readable recording medium recording these programs |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20201023 |