CN114666592A - CU block division method, device and medium based on AVS3 encoding history information - Google Patents
CU block division method, device and medium based on AVS3 encoding history information Download PDFInfo
- Publication number
- CN114666592A CN114666592A CN202210281642.8A CN202210281642A CN114666592A CN 114666592 A CN114666592 A CN 114666592A CN 202210281642 A CN202210281642 A CN 202210281642A CN 114666592 A CN114666592 A CN 114666592A
- Authority
- CN
- China
- Prior art keywords
- mode
- encoding
- partitioning
- block
- partition
- 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
- 238000000034 method Methods 0.000 title claims abstract description 83
- 238000000638 solvent extraction Methods 0.000 claims abstract description 57
- 238000005192 partition Methods 0.000 claims description 101
- 238000004422 calculation algorithm Methods 0.000 abstract description 16
- 238000001514 detection method Methods 0.000 abstract description 3
- 238000004590 computer program Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 5
- 238000013138 pruning Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000006835 compression Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000002349 favourable effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013139 quantization Methods 0.000 description 2
- 230000000630 rising effect Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 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/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
-
- 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
-
- 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- 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/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses a CU block dividing method based on AVS3 encoding history information, a computer device and a storage medium, which comprises the steps of selecting an optimal dividing mode from candidate dividing modes, dividing a CU block to be divided by the optimal dividing mode and the like, wherein for a first encoding process, the dividing mode to be skipped is determined through the following steps: and obtaining the intra-frame prediction angle of the CU block to be divided, skipping a horizontal division mode when the intra-frame prediction angle is in the vertical direction, and skipping a vertical division mode otherwise. According to the invention, by utilizing the historical property and repeatability of the AVS3 encoder found by statistics, the quick partitioning of the CU blocks is carried out on the basis of the encoding historical information such as the intra-frame prediction angle IPM, the first encoding CU optimal partitioning mode, the father CU partitioning mode and the like, so that the balance between the encoding speed and the encoding quality is obtained, a complex texture detection algorithm is not required, and the complexity is very low. The invention is widely applied to the technical field of video coding.
Description
Technical Field
The invention relates to the technical field of video coding, in particular to a CU block dividing method based on AVS3 coding history information, a computer device and a storage medium.
Background
With the development of network technology, the way of transmitting information through video becomes more and more extensive, and the requirements on video coding technology are also increasing. For example, although AVS3 has higher encoding quality than AVS2, the time complexity is doubled, and the encoding speed is reduced under the condition that other conditions are not changed, which is not favorable for the application of the new video encoding technology.
Interpretation of terms:
video coding: video coding is one of compression technologies, and a video source file is compressed into a bit stream file by a coding method on the premise of keeping quality as much as possible, so that the storage space and the transmission bandwidth of a video can be saved.
Video decoding: the video decoding is a decompression process corresponding to video coding, and the video can be obtained by decoding the bit stream file.
AVS 3: the Third Generation Audio and Video coding technology Standard (The Third Generation of Audio Video coding Standard) is The latest domestic Video coding Standard, still adopts a block-based hybrid coding framework, and has performance improvement of 30% compared with The previous Generation AVS 2.
Block division: in the encoding process, the AVS3 completes modules such as Prediction, Transform, quantization, entropy Coding and the like by taking a block as a Unit, and includes a Coding Unit (CU), a Prediction Unit (PU), and a Transform Unit (TU). Each frame of image in the video is divided into a plurality of 128 × 128 lcus (target Coding units), all possible partitioning modes are recursively traversed to smaller CUs, and the mode with the lowest Rate Distortion (RD) cost is selected as the optimal partitioning mode.
Dividing modes: the AVS3 has 6 partition modes, which are non-partition (No Split), Vertical Binary Tree partition (BV), Horizontal Binary Tree partition (BH), Vertical Extended Quad Tree partition (EQTV), Horizontal Extended Quad Tree partition (EQTH), and Quad Tree partition (QT). Fig. 1 is an example of quadtree partitioning (QT), extended quadtree partitioning (EQT), and binary tree partitioning (BT).
Intra-frame prediction: and predicting the current pixel by taking the adjacent pixels (A-E areas of the second image) on the upper side and the left side as reference pixels by utilizing the spatial correlation of the pixels, and completing the processes of encoding, transmitting, decoding and the like together with the difference value of the predicted value and the original value, namely the residual error and encoding parameter information. The accuracy of the prediction is strongly related to the compression performance. The AVS3 has 66 intra-frame prediction modes, namely a non-angle mode (0-2) and an angle mode (3-65), and the various angle modes refine the prediction direction, improve the sensitivity to the directional texture of the video and are more beneficial to the processing of the rich texture area.
Intra-frame derivation tree: (Intra Derived Tree, Intra DT): in order to improve the prediction accuracy, during prediction, a CU is divided into 2 or 4 PUs for prediction, and an optimal PU division mode is selected. Intra sub-block partitioning (ISP) in the foreign latest Video Coding (VVC) standard is similar to Intra DT in AVS 3. FIG. 2 is a diagram of reference pixel distribution for intra prediction, and FIG. 3 is a diagram of intra prediction modes.
Disclosure of Invention
In view of at least one technical problem of the current AVS3 video coding technology, such as the complexity of the coding algorithm, the present invention aims to provide a CU block partitioning method, a computer apparatus and a storage medium based on AVS3 coding history information.
In one aspect, an embodiment of the present invention includes a CU block partitioning method based on AVS3 encoding history information, including:
selecting an optimal partitioning mode from the candidate partitioning modes; the candidate partition modes include other partition modes than the skipped partition mode;
dividing the CU blocks to be divided in the optimal division mode;
wherein, for a first encoding process, a division mode to be skipped is determined by:
obtaining an intra-frame prediction angle of the CU block to be divided;
and when the intra-frame prediction angle is in the vertical direction, skipping a horizontal division mode, otherwise, skipping a vertical division mode.
Further, for non-first-time encoding processes, the partition mode to be skipped is determined by:
acquiring the optimal division mode and the intra-frame prediction angle selected in the primary coding process;
and when the optimal partition mode selected in the primary coding process is a non-partition mode, skipping all partition modes, otherwise, skipping the partition modes in the direction opposite to the optimal partition mode selected in the primary coding process and the intra-frame prediction angle.
Further, the partitioning modes in the opposite direction are the partitioning modes which are different from the optimal partitioning mode selected in the primary encoding process and the partitioning mode with the same tree branch number and different intra-frame prediction angle directions.
Further, for the first encoding process, after the optimal partition mode is selected, the selected optimal partition mode is recorded.
Further, for the first-time encoding process and the non-first-time encoding process, the partition mode to be skipped is also determined by:
determining a parent CU block of the CU block to be divided;
skipping an extended quad-tree partition mode when the partition mode selected when the parent CU block is partitioned is the extended quad-tree partition mode.
Further, the extended quadtree division mode includes a horizontal extended quadtree division mode and a vertical extended quadtree division mode.
Further, the selecting an optimal partition mode from the candidate partition modes includes:
respectively calculating rate-distortion costs for each of the candidate partition modes;
and taking the division mode with the minimum corresponding rate distortion cost as the optimal division mode.
Further, the obtaining the intra prediction angle of the CU block to be partitioned includes:
and carrying out intra-frame prediction on the CU blocks to be divided to obtain the intra-frame prediction angle.
In another aspect, embodiments of the present invention also include a computer apparatus including a memory for storing at least one program and a processor for loading the at least one program to perform a CU block partitioning method based on AVS3 encoding history information in an embodiment.
In another aspect, embodiments of the present invention further include a storage medium in which a processor-executable program is stored, the processor-executable program being configured to perform, when executed by a processor, the CU block partitioning method based on AVS3 encoding history information in the embodiments.
The invention has the beneficial effects that: according to the CU block dividing method based on AVS3 encoding historical information, the historical property and the repeatability of an AVS3 encoder found by statistics are utilized, quick CU block division is carried out on the basis of encoding historical information such as an intra-frame prediction angle IPM, a first encoding CU optimal dividing mode and a father CU dividing mode, balance is achieved between encoding speed and encoding quality, a complex texture detection algorithm is not needed, and complexity is low; by directly eliminating the improper division modes, the process of carrying out rate distortion cost calculation on the division modes with low selection possibility is avoided, and the realization method is reasonable. The pruning algorithm has high accuracy, and the division modes to be skipped are judged in advance and basically are the division modes which are unlikely to be selected as the optimal division modes finally, so that the BD-Rate is prevented from rising violently.
Drawings
FIG. 1 is an example of quadtree partitioning (QT), extended quadtree partitioning (EQT), and binary tree partitioning (BT);
FIG. 2 is a diagram illustrating a distribution of reference pixels for intra prediction;
FIG. 3 is a diagram illustrating intra prediction modes;
FIG. 4 is a flowchart of a CU block partitioning method based on AVS3 encoding history information according to an embodiment;
FIG. 5(a), FIG. 5(b), FIG. 6(a) and FIG. 6(b) are schematic diagrams of co-located blocks in a video encoding process;
FIG. 7 is a schematic diagram of the distribution of the collocated blocks in the City video.
Detailed Description
In this embodiment, referring to fig. 4, the CU block division method based on AVS3 encoding history information includes the following steps:
s1, determining a father CU block of a CU block to be divided;
s2, when the parent CU blocks are divided, the selected division mode is an extended quad-tree division mode, and the extended quad-tree division mode is skipped;
for the first encoding process, the division mode to be skipped is determined by the following steps S3-S4:
s3, obtaining an intra-frame prediction angle of the CU block to be divided;
s4, when the intra-frame prediction angle is in the vertical direction, skipping a horizontal division mode, otherwise, skipping a vertical division mode;
for non-primary encoding processes, the partition modes to be skipped are determined by the following steps S5-S6:
s5, acquiring an optimal partitioning mode selected in a first coding process;
s6, when the optimal partition mode selected in the primary coding process is a non-partition mode, skipping all partition modes, otherwise, skipping the partition modes in the direction opposite to the optimal partition mode selected in the primary coding process and the intra-frame prediction angle;
s7, selecting an optimal partitioning mode from the candidate partitioning modes; the candidate division modes include division modes other than the skipped division mode;
and S8, dividing the CU blocks to be divided in the optimal division mode.
In step S1, as long as the CU block to be divided is not an LCU of 128 × 128 size, there is a parent CU block corresponding to the CU block to be divided regardless of the first encoding process.
In step S2, the division mode used when the parent CU block is divided may be determined by reading the division record. If the division mode used when the parent CU block is divided is an extended quad-tree division mode such as a horizontal extended quad-tree division mode and a vertical extended quad-tree division mode, the extended quad-tree division mode is skipped, namely, the horizontal extended quad-tree division mode and the vertical extended quad-tree division mode are not tried any more, and termination judgment of the two modes is completed in advance. The extended quadtree division mode may not be skipped if the division mode used when the parent CU block is divided is not the extended quadtree division mode.
In the present embodiment, if it is the first encoding process when steps S1-S2 are performed on the CU block to be divided, steps S3-S4 are performed without performing steps S5-S6.
In step S3, an intra prediction angle IPM is obtained by performing intra prediction on the CU block to be divided.
In step S4, the direction of the intra prediction angle IPM is determined. If the intra prediction angle IPM is in the vertical direction, the horizontal division mode is skipped, whereas, if the intra prediction angle IPM is in the horizontal direction, the vertical division mode is skipped.
Specifically, in executing step S4, if the intra prediction angle IPM is in the vertical direction, horizontal division modes such as the horizontal binary tree division mode and the horizontal extended quad tree division mode may be skipped; if the intra-frame prediction angle IPM is in the horizontal direction, the vertical division modes such as the vertical binary tree division mode and the vertical expansion quad-tree division mode can be skipped.
By performing steps S3-S4, some of the partition modes are skipped, then the non-skipped partition modes will become part of the candidate partition modes, i.e., the resulting candidate partition modes are a set of some of the non-skipped partition modes. In step S7, each of the candidate partition modes is calculated to calculate a rate distortion cost RDO, and the partition mode with the smallest calculation rate distortion cost is selected as the optimal partition mode.
For the first encoding process, after the optimal partition mode is selected, the selected optimal partition mode (denoted as mode1 in this embodiment) is recorded, and in the subsequent encoding process, the optimal partition mode selected by the first encoding process is called.
In the present embodiment, if it is not the first encoding process when steps S1-S2 are performed on the CU block to be divided, steps S5-S6 are performed without performing steps S3-S4.
In step S5, the optimal partition mode1 and intra prediction angle IPM selected in the first encoding process are read. In step S6, it is determined what the optimal partition mode1 is specifically the partition mode selected in the first encoding process, and if mode1 is the non-partition mode, all the partition modes are skipped, which is equivalent to only the non-partition mode among the obtained candidate partition modes; conversely, that is, mode1 is not a non-partition mode, a partition mode in the opposite direction of mode1 and intra prediction angle IPM is skipped.
In step S6, when mode1 is not the non-partition mode, the partition mode in the opposite direction to mode1 and the intra prediction angle IPM is skipped, wherein the "partition mode in the opposite direction" may be the partition mode in the same tree branch number but in the different direction from mode 1. For example, if intra prediction angle IPM is in the horizontal direction and mode1 is in the horizontal binary tree partition mode, then the vertical binary tree partition mode and the vertical extended quadtree partition mode are skipped; if the intra prediction angle IPM is in the vertical direction and mode1 is in the vertical binary tree partition mode, then the horizontal binary tree partition mode and the horizontal extended quad-tree partition mode are skipped; if the intra prediction angle IPM is in the horizontal direction and mode1 is in the horizontal extended quadtree partitioning mode, then the vertical binary tree partitioning mode and the vertical extended quadtree partitioning mode are skipped; if the intra prediction angle IPM is vertical and mode1 is vertical extended quad-tree partition mode, then the horizontal binary tree partition mode and the horizontal extended quad-tree partition mode are skipped.
By performing steps S5-S6, some of the partition modes are skipped, then the non-skipped partition modes will become part of the candidate partition modes, i.e., the resulting candidate partition modes are a set of some of the non-skipped partition modes. If the so-division mode is skipped in step S6, the resulting candidate division mode can be regarded as a non-division mode. In step S7, each of the candidate partition modes is calculated to calculate a rate distortion cost RDO, and the partition mode with the smallest calculated rate distortion cost is selected as the optimal partition mode. If the division modes are skipped in step S6, the resulting candidate division modes can be regarded as non-division modes, and thus the non-division mode is selected as the optimal division mode in step S7.
In step S8, the CU block to be divided is divided in the optimal division mode selected in step S7. If the non-division mode is used as the optimal division mode, the CU block to be divided may not be divided in step S8.
In this embodiment, the principle of steps S1-S8 is described with reference to the data statistics of the video encoding process.
By performing data statistics on the video encoding process, the following characteristics can be found:
(1) in the process of trying to find the optimal partitioning mode, the encoder tries non-partitioning, vertical binary tree partitioning, horizontal binary tree partitioning, vertical extended quad tree partitioning, horizontal extended quad tree partitioning and quad tree partitioning in sequence. Attempts to certain partitioning modes are skipped if the size constraints of the encoder are not met. The process of this attempt may generate hundreds of partition combinations, and may repeat coding on CU blocks (co-located blocks) with the same position and size, as shown in fig. 5(a), a CU is partitioned by a quadtree to obtain 4 sub-blocks, as shown in fig. 5(b), the same CU is first partitioned by a horizontal binary tree to obtain upper and lower 2 sub-blocks, and the upper sub-block is partitioned by a vertical binary tree to obtain left and right 2 sub-blocks, and both of these two partition paths may similarly code the star sub-block at the upper left corner. Similarly, the CU blocks marked with an asterisk in fig. 6(a) and 6(b) are also parity blocks. This part of the coding process redundancy is the goal of the CU block partitioning fast algorithm.
(2) Referring to fig. 7, it is statistically found that, taking City video, which is often used as a case in video coding, 82.76% of CU blocks undergo at least 2 times of encoding, 61.98% of CU blocks undergo at least 3 times of encoding, and the existence ratio of co-located blocks is surprising.
(3) Statistics shows that the intra-frame prediction angle IPM obtained by intra-frame prediction contains texture direction information of the CU, the first-time coded CU needs to enable the partition mode to be more suitable for texture content of the CU, and the two modes are consistent and have strong correlation. If the IPM is 12 or an angle between 42 and 45, as can be seen from table 1, the IPM is very close to the vertical direction, most of the first-coded CUs will choose to skip the partition mode in the horizontal direction, and the same applies to the opposite direction, the accuracy of the pruning algorithm is over 95%, and the accuracy is high.
TABLE 1 relation of IPM of first-coded CU to partition mode selection
(4) Statistics shows that an optimal partition mode is determined by the CU after the first coding, the optimal balance between the coding bit number and the distortion rate is realized by the partition mode, and the optimal partition mode is most suitable for the texture distribution condition of the CU. The optimal partition Mode1 obtained by combining the intra prediction angle IPM and the first-time coding CU is more instructive in obtaining the texture direction of the CU, and when the co-located block needs to undergo the coding process again, the two pieces of information can be used to further simplify the partition Mode selection process. If both IPM and Mode1 obtained at the time of first encoding are the same direction, it is said that the texture direction of CU can be basically determined to be this direction. Referring to table 2, the parity block has previously undergone the first encoding, and the direction indicated by IPM and Mode1 can be directly used when the parity block is not first encoded, and the partition Mode in the opposite direction to Mode1 is skipped. Meanwhile, it is found that if Mode1 chooses not to divide, it indicates that the pixel distribution of CU is relatively flat, and the division can not be continued any more, and the probability of the non-first-coded co-located block choosing to skip the division is very high.
TABLE 2 relationship of IPM and partition Mode1 for first encoding to partition Mode selection
(5) Statistics show that if the parent CU of the current CU selects the extended quadtree partitioning mode, the probability that the current CU continues to select the extended quadtree partitioning mode is 2.22%. The candidate partition mode list of the current CU may be filtered according to the partition mode of the parent CU.
In the above analysis, (1) - (2) illustrate the problems of coding redundancy and data redundancy existing in the current encoder, which reflects the history and repeatability of the coding process, and belongs to the starting point of the present invention. (3) - (5) illustrates the data statistics basis of the invention, and the pruning strategy with the accuracy rate of more than 95 percent is favorable for realizing higher algorithm performance.
The CU block division method based on the AVS3 encoding history information in the present embodiment is proposed based on the analysis results of the above (1) to (5). According to the method, historical performance and repeatability of an AVS3 encoder found through statistics are utilized, and CU blocks are rapidly divided on the basis of encoding historical information such as intra-frame prediction angles IPM, the first-time encoding CU optimal dividing mode and the father CU dividing mode, so that balance is achieved between encoding speed and encoding quality. The CU block fast partitioning algorithm based on the encoding history information in this embodiment does not need to use a complex texture detection algorithm, and is very low in complexity. And the improper division modes are directly eliminated, so that the process of carrying out rate distortion cost calculation on the division modes with low selection possibility is avoided, and the realization method is reasonable. The accuracy of the pruning algorithm is high, the division modes to be skipped are judged in advance basically and are unlikely to be selected as the optimal division modes finally, and the BD-Rate is prevented from rising dramatically.
The invention can be implemented on the reference software HPM10.0 of AVS 3. The invention takes HPM10.0 as a reference group of algorithm, the invention is configured according to the universal test condition issued by AVS3, and the universal test sequence is tested in All Intra (AI) mode, including class A, class B and class C, and the quantization parameters QP are 27, 32, 38 and 45. Objective metrics commonly used in video compression are BD-PSNR, which characterizes video image quality, and BD-Rate, which characterizes bitrate level. When the BD-Rate is a negative value, the code Rate is reduced and the performance is improved under the same PSNR condition; a positive value indicates an increased code rate and a decreased performance. The invention mainly faces to a CU block division fast algorithm, so the quality is measured by Time Saving (TS) and BD-Rate. Wherein, the Time saving rate TS can be calculated by the following formulapropThe coding Time, consumed by the algorithm proposed by the present inventionbaseFor the coding Time consumed by the reference software HPM10.0 in AVS3, the object of the invention is to determine the TimebaseBasically reduces the Time as much as possible under the condition of limitation of AVS3 standard and hardwarepropThe time saving rate TS is improved.
The experimental results of the present invention are shown in table 3. It can be seen that the invention saves 24.81% of time and the normalized coding time saving Rate exceeds 50% in the case of only bringing about a BD-Rate rise of 0.56%, which means that if the BD-Rate rises by 1%, 50% of coding time can be saved on average as a whole, and the rapid CU block partitioning algorithm based on the AVS3 historical coding information enables the encoder of AVS3 to obtain significant performance improvement. From experimental data, it can be known that there is a certain effect difference between different sequences, the normalized time saving Rate is distributed between 40 and 80, sequences with little BD-Rate increase generally save less coding time, and generally fluctuate around the average value, except ParkRunning3 and daylighting road2, ParkRunning3 has the smallest BD-Rate increase of only 0.16%, and daylighting road2 has the largest BD-Rate increase of up to 1.10%. The main reason for this phenomenon is that the textures of different video sequences are different, the dayightroad 2 sequence itself has a large solid background, the number of CU blocks selected to be not divided is large, and the algorithm in the present invention evaluates these CU blocks as well, but because the division modes which can be skipped are limited, and finally only BD-Rate is added in space, a small portion of acceptable errors is introduced. And the ParkRunning3 sequence has rich texture, a large number of CU blocks with large division depth, large space which can be played by the algorithm and better effect compared with the effect obtained by Daylightroad 2.
TABLE 3 results of the experiment
The same technical effects as those of the CU block division method based on AVS3 encoding history information in the embodiment can be achieved by writing a computer program that executes the CU block division method based on AVS3 encoding history information in the embodiment, writing the computer program into a computer device or a storage medium, and executing the CU block division method based on AVS3 encoding history information in the embodiment when the computer program is read out and run.
It should be noted that, unless otherwise specified, when a feature is referred to as being "fixed" or "connected" to another feature, it may be directly fixed or connected to the other feature or indirectly fixed or connected to the other feature. Furthermore, the descriptions of upper, lower, left, right, etc. used in the present disclosure are only relative to the mutual positional relationship of the constituent parts of the present disclosure in the drawings. As used in this disclosure, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. In addition, unless defined otherwise, all technical and scientific terms used in this example have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in the description of the embodiments herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this embodiment, the term "and/or" includes any combination of one or more of the associated listed items.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element of the same type from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, without departing from the scope of the present disclosure. The use of any and all examples, or exemplary language ("e.g.," such as "or the like") provided with this embodiment is intended merely to better illuminate embodiments of the invention and does not pose a limitation on the scope of the invention unless otherwise claimed.
It should be recognized that embodiments of the present invention can be realized and implemented by computer hardware, a combination of hardware and software, or by computer instructions stored in a non-transitory computer readable memory. The methods may be implemented in a computer program using standard programming techniques, including a non-transitory computer-readable storage medium configured with the computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner, according to the methods and figures described in the detailed description. Each program may be implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the program(s) can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language. Furthermore, the program can be run on a programmed application specific integrated circuit for this purpose.
Further, operations of processes described in this embodiment can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The processes described in this embodiment (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions, and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) collectively executed on one or more processors, by hardware, or combinations thereof. The computer program includes a plurality of instructions executable by one or more processors.
Further, the method may be implemented in any type of computing platform operatively connected to a suitable interface, including but not limited to a personal computer, mini computer, mainframe, workstation, networked or distributed computing environment, separate or integrated computer platform, or in communication with a charged particle tool or other imaging device, and the like. Aspects of the invention may be implemented in machine-readable code stored on a non-transitory storage medium or device, whether removable or integrated onto a computing platform, such as a hard disk, optically read and/or write storage media, RAM, ROM, etc., so that it is readable by a programmable computer, which when read by the computer can be used to configure and operate the computer to perform the procedures described herein. Further, the machine-readable code, or portions thereof, may be transmitted over a wired or wireless network. The invention described in this embodiment includes these and other different types of non-transitory computer-readable storage media when such media includes instructions or programs that implement the steps described above in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described herein.
A computer program can be applied to input data to perform the functions described in the present embodiment to convert the input data to generate output data that is stored to a non-volatile memory. The output information may also be applied to one or more output devices, such as a display. In a preferred embodiment of the invention, the transformed data represents physical and tangible objects, including particular visual depictions of physical and tangible objects produced on a display.
The above description is only a preferred embodiment of the present invention, and the present invention is not limited to the above embodiment, and any modifications, equivalent substitutions, improvements, etc. within the spirit and principle of the present invention should be included in the protection scope of the present invention as long as the technical effects of the present invention are achieved by the same means. The invention is capable of other modifications and variations in its technical solution and/or its implementation, within the scope of protection of the invention.
Claims (10)
1. A CU block division method based on AVS3 encoding history information, wherein the CU block division method based on AVS3 encoding history information comprises the following steps:
selecting an optimal partitioning mode from the candidate partitioning modes; the candidate partition modes include other partition modes than the skipped partition mode;
dividing the CU blocks to be divided in the optimal division mode;
wherein, for a first encoding process, a division mode to be skipped is determined by:
obtaining an intra-frame prediction angle of the CU block to be divided;
and when the intra-frame prediction angle is in the vertical direction, skipping a horizontal division mode, otherwise, skipping a vertical division mode.
2. The AVS 3-based CU block partitioning method according to claim 1, wherein:
for non-first-time encoding processes, the partition mode to be skipped is determined by:
acquiring the optimal division mode and the intra-frame prediction angle selected in the primary coding process;
and when the optimal partition mode selected in the primary coding process is a non-partition mode, skipping all partition modes, otherwise, skipping the partition modes in the direction opposite to the optimal partition mode selected in the primary coding process and the intra-frame prediction angle.
3. The method according to claim 2, wherein the partitioning pattern in the opposite direction is a partitioning pattern having a same number of tree branches and different direction from the optimal partitioning pattern selected in the first encoding process and an intra-frame prediction angle direction.
4. The AVS 3-based CU block partitioning method according to claim 2, wherein:
for the first encoding process, after the optimal partitioning mode is selected, the selected optimal partitioning mode is recorded.
5. The method of AVS3 encoding history information-based CU block partitioning according to any of claims 1-4, wherein the partition mode to be skipped is further determined for the primary encoding pass and the non-primary encoding pass by:
determining a parent CU block of the CU block to be divided;
skipping an extended quad-tree partition mode when the partition mode selected when the parent CU block is partitioned is the extended quad-tree partition mode.
6. The AVS3 encoding history information-based CU block division method according to claim 1, wherein the extended quadtree division mode comprises a horizontal extended quadtree division mode and a vertical extended quadtree division mode.
7. The AVS3 encoding history information-based CU block partitioning method according to claim 1, wherein the selecting an optimal partitioning mode from the candidate partitioning modes comprises:
respectively calculating rate-distortion costs for each of the candidate partition modes;
and taking the division mode with the minimum corresponding rate distortion cost as the optimal division mode.
8. The method according to claim 1, wherein said obtaining intra prediction angles of the CU blocks to be divided comprises:
and carrying out intra-frame prediction on the CU blocks to be divided to obtain the intra-frame prediction angle.
9. A computer apparatus comprising a memory for storing at least one program and a processor for loading the at least one program to perform the method of CU block partitioning based on AVS3 encoding history information of any one of claims 1-8.
10. A storage medium in which a processor-executable program is stored, wherein the processor-executable program, when executed by a processor, is configured to perform the method of any one of claims 1 to 8 for CU block partitioning based on AVS3 encoding history information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210281642.8A CN114666592A (en) | 2022-03-22 | 2022-03-22 | CU block division method, device and medium based on AVS3 encoding history information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210281642.8A CN114666592A (en) | 2022-03-22 | 2022-03-22 | CU block division method, device and medium based on AVS3 encoding history information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114666592A true CN114666592A (en) | 2022-06-24 |
Family
ID=82032288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210281642.8A Pending CN114666592A (en) | 2022-03-22 | 2022-03-22 | CU block division method, device and medium based on AVS3 encoding history information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114666592A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115118977A (en) * | 2022-08-29 | 2022-09-27 | 华中科技大学 | Intra-frame prediction encoding method, system, and medium for 360-degree video |
-
2022
- 2022-03-22 CN CN202210281642.8A patent/CN114666592A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115118977A (en) * | 2022-08-29 | 2022-09-27 | 华中科技大学 | Intra-frame prediction encoding method, system, and medium for 360-degree video |
| CN115118977B (en) * | 2022-08-29 | 2022-11-04 | 华中科技大学 | Intra-frame prediction encoding method, system, and medium for 360-degree video |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110637462B (en) | Video coding and decoding method and device | |
| US20160044329A1 (en) | Image Predictive Coding Method and Image Encoder | |
| KR101516347B1 (en) | Method and Apparatus of Intra Coding for HEVC | |
| KR102038901B1 (en) | Apparatus and method for intra prediction coding/decoding based on adaptive candidate modes | |
| CN104702958A (en) | HEVC intraframe coding method and system based on spatial correlation | |
| CN108353175A (en) | The method and apparatus of prediction processing vision signal caused by coefficient of utilization | |
| US20240031576A1 (en) | Method and apparatus for video predictive coding | |
| CN113709488B (en) | Encoding and decoding method, device and equipment | |
| JP2024059909A (en) | Method and device for image encoding and decoding - Patents.com | |
| CN113347416B (en) | Chroma intra prediction method and device, and computer storage medium | |
| CN111669593A (en) | Video encoding method, video encoding device, electronic equipment and storage medium | |
| CN114666592A (en) | CU block division method, device and medium based on AVS3 encoding history information | |
| CN115699736A (en) | Geometric partitioning mode with motion vector refinement | |
| CN116601957A (en) | Intra-frame prediction method and device, decoder and encoder | |
| CN114827603A (en) | CU block division method, device and medium based on AVS3 texture information | |
| KR101382592B1 (en) | Method and apparatus for encoding intra mode | |
| EP3824624A1 (en) | Wide angle intra prediction and position dependent intra prediction combination | |
| CN114079783B (en) | Encoding and decoding method, device and equipment | |
| CN110049322A (en) | Method, apparatus, electronic equipment and the storage medium of model selection | |
| CN113794883B (en) | Encoding and decoding method, device and equipment | |
| CN109618152B (en) | Depth division coding method and device and electronic equipment | |
| CN112449181B (en) | Encoding and decoding method, device and equipment | |
| CN110662074B (en) | Motion vector determination method and device | |
| CN114598889B (en) | Encoding and decoding method, device and equipment | |
| Tang et al. | Optimization of CU Partition Based on Texture Degree in H. 266/VVC |
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 |