CN112004088A - CU (computer Unit) level QP (quantization parameter) allocation algorithm suitable for AVS2 encoder - Google Patents
CU (computer Unit) level QP (quantization parameter) allocation algorithm suitable for AVS2 encoder Download PDFInfo
- Publication number
- CN112004088A CN112004088A CN202010780722.9A CN202010780722A CN112004088A CN 112004088 A CN112004088 A CN 112004088A CN 202010780722 A CN202010780722 A CN 202010780722A CN 112004088 A CN112004088 A CN 112004088A
- Authority
- CN
- China
- Prior art keywords
- frame
- current
- level
- avs2
- calculating
- 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
Links
- 238000013139 quantization Methods 0.000 title description 9
- 238000000034 method Methods 0.000 claims abstract description 18
- 238000004364 calculation method Methods 0.000 claims description 13
- FGXWKSZFVQUSTL-UHFFFAOYSA-N domperidone Chemical compound C12=CC=CC=C2NC(=O)N1CCCN(CC1)CCC1N1C2=CC=C(Cl)C=C2NC1=O FGXWKSZFVQUSTL-UHFFFAOYSA-N 0.000 claims description 6
- 238000005457 optimization Methods 0.000 abstract description 4
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 230000006835 compression Effects 0.000 description 5
- 238000007906 compression Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 230000009466 transformation Effects 0.000 description 3
- 241000219357 Cactaceae Species 0.000 description 2
- 241000023320 Luma <angiosperm> Species 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000012812 general test Methods 0.000 description 1
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical compound COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 description 1
- 238000000638 solvent extraction 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/146—Data rate or code amount at the encoder output
-
- 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/154—Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion
-
- 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/177—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 a group of pictures [GOP]
-
- 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
-
- 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/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
-
- 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
Abstract
The invention discloses a CU level QP allocation algorithm suitable for an AVS2 encoder. The method specifically comprises the following steps: in the pre-coding stage of the AVS2 coder, calculating intra _ cost and inter _ cost of each CU, and storing the motion vector of inter-frame prediction and the used reference frame; calculating the information amount of the current CU which serves as a reference block and contributes to a future frame, and accumulating all the information amounts from the current CU to obtain propagateOut; obtaining the propagation information amount PropagateOut of the current CU, and calculating a QP offset value of the current CU; and calculating the QP of the current CU according to the importance degree of the current CU to be referred to and the frame type of the CU. The invention has the beneficial effects that: the method can improve the coding quality of the video under the conditions of keeping the target code rate unchanged and basically not increasing the overall computation complexity, particularly the image quality of objects appearing in a background area and a picture for a long time, and has practical reference value for the optimization of an AVS2 coder.
Description
Technical Field
The invention relates to the technical field related to video coding, in particular to a CU-level QP allocation algorithm suitable for an AVS2 encoder.
Background
HEVC is a video coding standard jointly formulated by Moving Picture Experts Group (MPEG) and Video Coding Experts Group (VCEG), and compared with the coding standard h.264/AVC of the previous generation, the compression efficiency of HEVC is doubled, thereby providing great convenience for transmission and popularization of ultra high definition video.
The AVS2 standard is a second generation video coding standard of Chinese proprietary intellectual property, released in 2016 (12 months), and is an efficient video coding standard for ultrahigh-definition video and supporting ultrahigh-resolution (more than 4K) and high-dynamic-range video. The overall framework of AVS2 is similar to HEVC, but compared to HEVC, it provides more coding tools, with compression efficiency doubled over the previous generation standards AVS + and h.264/AVC, and also over the international standard of the same type HEVC. At the end of 8 months in 2018, by virtue of excellent performance and independent intellectual property rights, the AVS2 video standard becomes the only video coding standard adopted by the 4K ultra-high definition television technology application implementation guide (2018 edition) issued by the general office of radio and television. Furthermore, the Chinese AVS standard has fallen to such countries as Srilanka, Laos, Thailand and GilJesteins. The AVS standard is more and more accepted by domestic and foreign markets by virtue of a simple and efficient one-stop patent authorization mode and efficient compression efficiency.
The AVS2 adopts a hybrid coding framework, and the whole coding process comprises intra-frame prediction, inter-frame prediction, transformation quantization, inverse quantization and inverse transformation, loop filtering, entropy coding and other modules. For the characteristics of ultra high definition video, the AVS2 adopts a block division structure based on a quadtree, which includes a Coding Unit (CU), a Prediction Unit (PU) and a Transform Unit (TU), and each CU includes one luma coding block and two corresponding chroma coding blocks. To flexibly match the texture complexity of the image itself, the CU supports a recursive partitioning from 64 × 64 to a minimum of 8 × 8.
Compared with AVS, AVS2 increases the maximum number of candidate reference frames to 4 to accommodate a multi-level coding structure. The AVS2 supports a three-layer B frame coding structure as shown in fig. 1, a B frame with a Level of 2, such as B1, is not referred to by other frames, the importance Level is the lowest, a B frame with a Level of 1, such as B2, is referred to by a non-reference B frame only, the importance Level is the medium, a B frame with a Level of 0, such as B4, is referred to by the above two layers of B frames, the importance Level is the highest, and the invention uses the difference of the importance levels of the B frames in the AVS2 to allocate QP offset values with different weights.
The original AVS2 encoder working process is to pre-allocate quantization parameter QP of each frame, then adjust QP of each frame by code rate control algorithm, then select rate distortion mode by QP of each frame obtained by code rate control algorithm, and complete transformation and quantization operation under the quantization parameter.
During the encoding process, those CUs that are frequently used as reference blocks should be reconstructed with high quality, a higher quality reconstructed reference frame or reference block, which is beneficial for efficient encoding of the frame or CU block to which it refers. The current AVS2 encoder only has the frame level QP adjustment during the rate control stage, and does not consider that different CUs in the same frame should give QP values with different sizes according to their importance levels.
The BDRate index is currently adopted in the industry to measure the difference of compression efficiency of different encoders. The BDRate refers to the magnitude of the increase or saving of the coding rate for the same objective quality of the image. The objective quality of an image is generally measured by the Peak Signal to Noise Ratio (PSNR) between the decoded reconstructed image and the original image.
The AVS2 is a video coding standard belonging to the AVS series, and the compression efficiency is far superior to the previous generation standard. To better facilitate the application of AVS2, the encoder needs to be sufficiently optimized so that AVS2 dominates the international homogeneous encoder. The current AVS2 encoder only uses the rate control algorithm to adjust the frame-level quantization parameters, and no method for allocating CU-level quantization parameters has been proposed.
Disclosure of Invention
The present invention provides a CU-level QP allocation algorithm suitable for AVS2 encoder to improve video coding quality, in order to overcome the above-mentioned disadvantages in the prior art.
In order to achieve the purpose, the invention adopts the following technical scheme:
a CU level QP allocation algorithm applicable to an AVS2 encoder specifically comprises the following steps:
(1) in the pre-coding stage of the AVS2 coder, calculating intra _ cost and inter _ cost of each CU, and storing a motion vector predicted between frames and a used reference frame, wherein the CU is a coding unit, the intra _ cost represents an intra-frame coding cost, and the inter _ cost represents an inter-frame coding cost;
(2) calculating the information quantity of the current CU which serves as a reference block and contributes to a future frame, namely calculating the information quantity of a plurality of CUs of the future frame from the current CU, defining the sum of the information quantity of all CUs transmitted to the future frame by the current CU as propagateOut, and accumulating all the information quantity from the current CU to obtain the propagateOut, namely calculating the sum of the information quantity of all the CUs which take the current CU as the reference block and transmit to the current CU;
(3) obtaining the propagation information amount PropagateOut of the current CU, and calculating a QP offset value of the current CU;
(4) and calculating the QP of the current CU according to the importance degree of the current CU to be referred to and the frame type of the CU.
The invention starts from the importance degree of the CU blocks referenced by other blocks, in the code rate control stage, a large QP offset value is given to the important CU blocks in a frame, a small QP offset value is given to the CU blocks which are not referenced or are less referenced in the frame, meanwhile, the importance degree of different B frames in an AVS2 three-layer B frame coding structure is utilized for the CU belonging to a B frame, and then the QP offset value of the CU belonging to the B frame is adjusted. The invention can improve the coding quality of the video under the conditions of keeping the target code rate unchanged and basically not increasing the overall calculation complexity, in particular to the image quality of objects appearing in a background area and a picture for a long time, and has practical reference value for the optimization of an AVS2 encoder.
Preferably, in step (2), a CU in a future frame is assumediPoints to the current CU, the current CU is passed to the CUiIs calculated by the information amount ofThe method comprises the following steps:
the calculation method for the sum of the information amount transmitted by the current CU to all CUs of the future frame to be propagateOut is as follows:
PropagateOut＝∑PropagateOut_CUi
wherein PropageOut _ CUi indicates that the current CU passed to the CUiThe intra _ costi represents the CUiInter _ costi represents the CUiIndicates the CU is coded inter frame cost, propagetein indicates the CUiSum of information amount passed to other frames, i ═ 0, 1, 2, 3 …, if CUiIf the frame belongs to the non-reference B frame, the propagetein is equal to 0, otherwise, the calculation step of the propagetein is equal to the step (2).
Preferably, in step (3), the QP offset value of the current CU is calculated by:
where intra _ cost represents the intra coding cost of the current CU, and a is derived from the importance level to which the current CU is referred and the frame type in which the CU is located.
Preferably, the AVS2 encoder supports a three-layer B frame coding structure, where a B frame with a Level of 2 is not referred to by other frames, a B frame with a Level of 1 is referred to by a non-reference B frame only, a B frame with a Level of 0 is referred to by the above two-layer B frames, and if a B frame to which a CU belongs is at a Level of 1, a is 0.7; if the Level of the B frame to which the CU belongs is 0, A is 1.0; if the frame to which the CU belongs is an I frame or a P/F frame, a is 1.2.
Preferably, in step (4), the QP calculation method for the current CU is:
CUQP＝frameQP-QP_offset
wherein the frameQPRepresenting the QP of the current frame calculated during the rate control phase.
The invention has the beneficial effects that: the method can improve the coding quality of the video under the conditions of keeping the target code rate unchanged and basically not increasing the overall computation complexity, particularly the image quality of objects appearing in a background area and a picture for a long time, and has practical reference value for the optimization of an AVS2 coder.
Drawings
FIG. 1 is a schematic diagram of the GOP structure of a three-layer B frame in the AVS2 standard;
FIG. 2 is a 8 th frame reconstructed partial diagram of an original AVS2 encoder encoding a Cactus sequence at a 2M code rate;
FIG. 3 is a 8 th frame reconstruction partial diagram of the encoder coding the Cactus sequence at the 2M code rate according to the present invention;
FIG. 4 is a 19 th frame reconstructed local map of a BQTerace sequence of an original AVS2 encoder at a 2M code rate;
FIG. 5 is a 19 th frame reconstructed local map of the encoder encoding the BQTerace sequence at the 2M code rate.
Detailed Description
The invention is further described with reference to the following figures and detailed description.
A CU level QP allocation algorithm applicable to an AVS2 encoder specifically comprises the following steps:
(1) in the pre-coding stage of an AVS2 coder, calculating intra _ cost and inter _ cost of each CU, storing a motion vector predicted between frames and a used reference frame, wherein the CU is a coding unit, the intra _ cost represents intra-frame coding cost, and the inter _ cost represents inter-frame coding cost;
(2) calculating the information quantity of the current CU which serves as a reference block and contributes to a future frame, namely calculating the information quantity of a plurality of CUs of the future frame from the current CU, defining the sum of the information quantity of all CUs transmitted to the future frame by the current CU as propagateOut, and accumulating all the information quantity from the current CU to obtain the propagateOut, namely calculating the sum of the information quantity of all the CUs which take the current CU as the reference block and transmit to the current CU;
the method comprises the following specific steps: suppose a certain CU in a future frameiPoints to the current CU, the current CU is passed to the CUiThe information amount calculating method comprises the following steps:
the calculation method for the sum of the information amount transmitted by the current CU to all CUs of the future frame to be propagateOut is as follows:
PropagateOut＝∑PropagateOut_CUi (2)
wherein PropageOut _ CUi indicates that the current CU passed to the CUiThe intra _ costi represents the CUiInter _ costi represents the CUiIndicates the CU is coded inter frame cost, propagetein indicates the CUiSum of information amount delivered to other frames, i ═ 0, 1, 2, 3 …, if CU in equation (1)iAnd if the frame belongs to the non-reference B frame, the propagetein is equal to 0, otherwise, the calculation step of the propagetein is equal to the formula (1) and the formula (2) in the step (2).
(3) Obtaining the propagation information amount PropagateOut of the current CU, and calculating a QP offset value of the current CU; the QP offset value of the current CU is calculated by:
where intra _ cost represents the intra coding cost of the current CU, and a is derived from the importance level to which the current CU is referred and the frame type in which the CU is located. As shown in fig. 1, the AVS2 encoder supports a three-layer B frame coding structure, where a B frame with a Level of 2 is not referred to by other frames, a B frame with a Level of 1 is referred to by a non-reference B frame only, a B frame with a Level of 0 is referred to by the above two layers of B frames, and if a B frame to which a CU belongs is at a Level of 1, a is 0.7; if the Level of the B frame to which the CU belongs is 0, A is 1.0; if the frame to which the CU belongs is an I frame or a P/F frame, a is 1.2.
Explanation about the setting of a value:
the AVS2 encoder supports a two-layer B frame coding structure and also supports a three-layer B frame coding structure, and the invention is provided for the three-layer B frame coding structure, so the setting of the A value in the invention is obtained based on the AVS2 three-layer B frame structure. In the invention, the A value of each layer of B frame is directly assigned and is directly set according to the importance degree of the frame.
(4) Calculating the QP of the current CU according to the importance degree of the current CU to be referred to and the frame type of the CU, wherein the QP calculation method of the current CU is as follows:
CUQP＝frameQP-QP_offset (4)
wherein the frameQPRepresenting the QP of the current frame calculated during the rate control phase.
Before describing the specific embodiment, as shown in FIG. 1, the following variables are defined: definition B (upper case) represents a referenceable B frame, definition B (lower case) represents an unreferenceable B frame, definition F represents an F frame, definition P represents a P frame, definition intra _ cost represents an intra-coding cost, and definition inter _ cost represents an inter-coding cost. A GOP structure of 7B frames as shown in fig. 1, where B1, B3, B5, B7 are non-reference B frames, and B2, B6, B4 are referenceable B frames.
1. And B7 calculating the information quantity obtained from B6 and P8, and adding the corresponding information quantity to the corresponding CU of B6 or P8 according to the formula (1) and (2) according to the pointing direction of the motion vector of the CU in B7.
2. And B5 calculates the information quantity obtained from B4 and B6, and adds the corresponding information quantity to the corresponding CU in B4 or B6 according to the formula (1) and (2) according to the pointing direction of the CU motion vector in B5.
3. And calculating the information quantity obtained by the B6 from the B4 and the P8, and adding the corresponding information quantity to the corresponding CU of the B4 or the P8 according to the formulas (1) and (2) according to the pointing direction of the CU motion vector in the B6.
4. And B3 calculates the information quantity obtained from B2 and B4, and adds the corresponding information quantity to the corresponding CU in B2 or B4 according to the formula (1) and (2) according to the pointing direction of the CU motion vector in B3.
5. And calculating the information quantity obtained by B1 from I0/P0 and B2, and adding the corresponding information quantity to the corresponding CU of I0/P0 or B2 according to the formula (1) and (2) according to the pointing direction of the CU motion vector in B1.
6. And calculating the information quantity obtained by the B2 from the I0/P0 and the B4, and adding the corresponding information quantity to the corresponding CU of the I0/P0 or the B4 according to the formula (1) and the formula (2) according to the pointing direction of the CU motion vector in the B2.
7. And calculating the information quantity obtained by the B4 from the I0/P0 and the P8, and adding the corresponding information quantity to the corresponding CU of the I0/P0 or the P8 according to the formula (1) and the formula (2) according to the pointing direction of the CU motion vector in the B4.
8. And calculating the information quantity obtained by P8 from I0/P0, and adding the corresponding information quantity to the corresponding CU of I0/P0 according to the formulas (1) and (2) according to the pointing direction of the CU motion vector in P8.
9. And calculating QP values of the CUs in B6, B2, B4, P8 and I0/P0 in sequence according to the formula (3) and the formula (4).
10. The QP value of each CU in each frame except for the reference B frame in a GOP is obtained according to steps 1-9, and then each CU is encoded according to the calculated QP value of the CU in the real encoding stage.
To verify the effectiveness of the method of the present invention, the method of the present invention was applied to the encoder of AVS2, using the ClassA, ClassB part of HEVC general test sequence test. The hardware configuration of the experiment platform is Intel i5-8500, the memory is 16G, and Windows 1064 bit operating system. The coding parameters are that the GOP length is 64, the number of B frames is 7, the number of reference frames is 2, and the code rate is set to be 1Mbps, 2Mbps, 4Mbps and 6 Mbps.
Table 1 shows the RATE-distortion performance of each test sequence which is coded by the method of the invention and compared with the original AVS2 coder, BD-RATE in Table 1 represents the percentage of the code RATE change of the method of the invention compared with the original AVS2 coder under the same image quality, BD-PSNR represents the objective quality PSNR improved by the method of the invention compared with the original AVS2 coder under the same code RATE, and Delta TS represents the percentage of time consumption saved by the method of the invention compared with the original AVS2 coder when the same code RATE is set.
TABLE 1 test sequences encoded by the method of the present invention compare the rate-distortion performance of the original AVS2 encoder
As can be seen from the experimental results in Table 1, compared with the original AVS2 encoder, the BDRate of the invention is averagely reduced by 8.26%, the average BD-PSNR is improved by 0.28dB, and the overall encoding time consumption of the invention is slightly reduced compared with that of the original AVS2 encoder. For bqterace sequences, BDrate was reduced by 15.80% due to the high background region. Fig. 2, fig. 3, fig. 4 and fig. 5 show the subjective local contrast effect of the original AVS2 encoded reconstructed image and the encoded reconstructed image of the present invention at the same code rate, and it can be observed from fig. 2, fig. 3, fig. 4 and fig. 5 that the encoded reconstructed image of the present invention has better subjective quality compared with the original AVS2 encoder. The invention can effectively improve the image quality of the background area and the area which is not changed for a long time in the picture under the condition of basically not increasing the calculation complexity of the encoder, and has very high practical value.
After the AVS2 pre-coding stage is finished, calculating the information quantity of the current CU which is used as a reference frame and contributes to a future frame, wherein the larger the information quantity is, the more important the current CU is, reducing the QP value of the current CU, and enabling the reconstruction quality of the current CU to be higher. According to different importance degrees of different layers of B frames in an AVS2 three-layer B frame coding structure, different weights are applied to QP offset values obtained by calculating the different layers of B frames according to the importance degrees of the frames. For the three-layer B-frame coding structure of AVS2, a CU block QP value calculation method applicable to the seven-B-frame structure of fig. 1 is proposed.
The invention starts from the importance degree of the CU blocks referenced by other blocks, in the code rate control stage, a large QP offset value is given to the important CU blocks in a frame, a small QP offset value is given to the CU blocks which are not referenced or are less referenced in the frame, meanwhile, the importance degree of different B frames in an AVS2 three-layer B frame coding structure is utilized for the CU belonging to a B frame, and then the QP offset value of the CU belonging to the B frame is adjusted. The invention can improve the coding quality of the video under the conditions of keeping the target code rate unchanged and basically not increasing the overall calculation complexity, in particular to the image quality of objects appearing in a background area and a picture for a long time, and has practical reference value for the optimization of an AVS2 encoder.
Claims (5)
1. A CU level QP allocation algorithm suitable for an AVS2 encoder is characterized by comprising the following steps:
(1) in the pre-coding stage of the AVS2 coder, calculating intra _ cost and inter _ cost of each CU, and storing a motion vector predicted between frames and a used reference frame, wherein the CU is a coding unit, the intra _ cost represents an intra-frame coding cost, and the inter _ cost represents an inter-frame coding cost;
(2) calculating the information quantity of the current CU which serves as a reference block and contributes to a future frame, namely calculating the information quantity of a plurality of CUs of the future frame from the current CU, defining the sum of the information quantity of all CUs transmitted to the future frame by the current CU as propagateOut, and accumulating all the information quantity from the current CU to obtain the propagateOut, namely calculating the sum of the information quantity of all the CUs which take the current CU as the reference block and transmit to the current CU;
(3) obtaining the propagation information amount PropagateOut of the current CU, and calculating a QP offset value of the current CU;
(4) and calculating the QP of the current CU according to the importance degree of the current CU to be referred to and the frame type of the CU.
2. The CU level QP allocation algorithm for AVS2 encoder according to claim 1, wherein in step (2), a GU in future frame is assumediPoints to the current CU, the current CU is passed to the CUiThe information amount calculating method comprises the following steps:
the calculation method for the sum of the information amount transmitted by the current CU to all CUs of the future frame to be propagateOut is as follows:
PropagateOut＝∑PropagateOot_CUi
wherein PropageOut _ CUi indicates that the current CU passed to the CUiThe intra _ costi represents the CUiInter _ costi represents the CUiIndicates the CU is coded inter frame cost, propagetein indicates the CUiSum of information amount passed to other frames, i ═ 0, 1, 2, 3 …, if CUiIf the frame belongs to the non-reference B frame, the propagetein is equal to 0, otherwise, the calculation step of the propagetein is equal to the step (2).
3. The CU level QP allocation algorithm for an AVS2 encoder according to claim 2, wherein in step (3), the QP offset value of the current CU is calculated by:
where intra _ cost represents the intra coding cost of the current CU, and a is derived from the importance level to which the current CU is referred and the frame type in which the CU is located.
4. The algorithm of claim 3, wherein the AVS2 encoder supports a three-layer B-frame coding structure, wherein a B-frame with a Level of 2 is not referred to by other frames, a B-frame with a Level of 1 is referred to by a non-reference B-frame only, a B-frame with a Level of 0 is referred to by two above B-frames, and if the B-frame to which the CU belongs is at a Level of 1, then A is 0.7; if the Level of the B frame to which the CU belongs is 0, A is 1.0; if the frame to which the CU belongs is an I frame or a P/F frame, a is 1.2.
5. The CU level QP allocation algorithm for an AVS2 encoder according to claim 3 or 4, wherein in step (4), the QP calculation method for the current CU is as follows:
CUQP＝frameQP-QP_offset
wherein the frameQPRepresenting the QP of the current frame calculated during the rate control phase.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010780722.9A CN112004088B (en) | 2020-08-06 | CU-level QP allocation algorithm suitable for AVS2 encoder |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010780722.9A CN112004088B (en) | 2020-08-06 | CU-level QP allocation algorithm suitable for AVS2 encoder |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112004088A true CN112004088A (en) | 2020-11-27 |
| CN112004088B CN112004088B (en) | 2024-04-16 |
Family
ID=
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010187302A (en) * | 2009-02-13 | 2010-08-26 | Mitsubishi Electric Corp | Moving image encoding apparatus |
| US20100226433A1 (en) * | 2009-03-06 | 2010-09-09 | Fujitsu Limited | Moving image coding apparatus and moving image coding method |
| EP2258113A1 (en) * | 2008-02-22 | 2010-12-08 | Qualcomm Incorporated | Fast macroblock delta qp decision |
| KR20100129091A (en) * | 2009-05-29 | 2010-12-08 | 서울대학교산학협력단 | Method of rate control in frame-level for h.264/avc |
| US20110019736A1 (en) * | 2009-07-27 | 2011-01-27 | Kyohei Koyabu | Image encoding device and image encoding method |
| WO2015102975A2 (en) * | 2014-01-03 | 2015-07-09 | Microsoft Technology Licensing, Llc | Innovations in block vector prediction and estimation of reconstructed sample values within an overlap area |
| EP2950534A1 (en) * | 2010-04-23 | 2015-12-02 | M&K Holdings Inc. | Apparatus for encoding an image |
| WO2016115968A1 (en) * | 2015-01-20 | 2016-07-28 | 北京工业大学 | Visual perception feature-fused scaled video coding method |
| WO2018199459A1 (en) * | 2017-04-26 | 2018-11-01 | 강현인 | Image restoration machine learning algorithm using compression parameter, and image restoration method using same |
| JP2019004294A (en) * | 2017-06-14 | 2019-01-10 | 日本電信電話株式会社 | Feature amount estimation device and program |
| WO2019165863A1 (en) * | 2018-03-02 | 2019-09-06 | 电子科技大学 | Optimization method for encoding-block-level lagrangian multiplier of equirectangular image |
| WO2019203973A1 (en) * | 2018-04-16 | 2019-10-24 | Interdigital Vc Holdings, Inc. | Method and device for encoding an image or video with optimized compression efficiency preserving image or video fidelity |
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2258113A1 (en) * | 2008-02-22 | 2010-12-08 | Qualcomm Incorporated | Fast macroblock delta qp decision |
| JP2010187302A (en) * | 2009-02-13 | 2010-08-26 | Mitsubishi Electric Corp | Moving image encoding apparatus |
| US20100226433A1 (en) * | 2009-03-06 | 2010-09-09 | Fujitsu Limited | Moving image coding apparatus and moving image coding method |
| KR20100129091A (en) * | 2009-05-29 | 2010-12-08 | 서울대학교산학협력단 | Method of rate control in frame-level for h.264/avc |
| US20110019736A1 (en) * | 2009-07-27 | 2011-01-27 | Kyohei Koyabu | Image encoding device and image encoding method |
| EP2950534A1 (en) * | 2010-04-23 | 2015-12-02 | M&K Holdings Inc. | Apparatus for encoding an image |
| WO2015102975A2 (en) * | 2014-01-03 | 2015-07-09 | Microsoft Technology Licensing, Llc | Innovations in block vector prediction and estimation of reconstructed sample values within an overlap area |
| WO2016115968A1 (en) * | 2015-01-20 | 2016-07-28 | 北京工业大学 | Visual perception feature-fused scaled video coding method |
| WO2018199459A1 (en) * | 2017-04-26 | 2018-11-01 | 강현인 | Image restoration machine learning algorithm using compression parameter, and image restoration method using same |
| JP2019004294A (en) * | 2017-06-14 | 2019-01-10 | 日本電信電話株式会社 | Feature amount estimation device and program |
| WO2019165863A1 (en) * | 2018-03-02 | 2019-09-06 | 电子科技大学 | Optimization method for encoding-block-level lagrangian multiplier of equirectangular image |
| WO2019203973A1 (en) * | 2018-04-16 | 2019-10-24 | Interdigital Vc Holdings, Inc. | Method and device for encoding an image or video with optimized compression efficiency preserving image or video fidelity |
Non-Patent Citations (1)
| Title |
|---|
| 林琪;赵海武;王国中;滕国伟;李国平;: "面向AVS2的快速帧间预测算法", 电视技术, no. 17 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111901597B (en) | CU (CU) level QP (quantization parameter) allocation algorithm based on video complexity | |
| CN109688414B (en) | VVC intra-frame coding unit candidate prediction mode reduction and block division early termination method | |
| CN103004197B (en) | For to the equipment of Image Coding and method | |
| CN104702950B (en) | In the method for intra prediction mode decoding image | |
| CN100401789C (en) | Quick selection of prediction modes in H.264/AVC frame | |
| CN103634606B (en) | Video encoding method and apparatus | |
| CN102740077B (en) | H.264/AVC standard-based intra-frame prediction mode selection method | |
| US20050114093A1 (en) | Method and apparatus for motion estimation using variable block size of hierarchy structure | |
| CN1323555C (en) | Quick selecting method for H.264/AVC multiple reference frame | |
| CN105379284A (en) | Dynamic image encoding apparatus and operation method thereof | |
| CN101247525B (en) | Method for improving image intraframe coding velocity | |
| CN102648627A (en) | Speedup techniques for rate distortion optimized quantization | |
| CN102447907A (en) | Video sequence coding method aiming at HEVC (High Efficiency Video Coding) | |
| CN110365975A (en) | A kind of AVS2 video encoding and decoding standard prioritization scheme | |
| CN101742288A (en) | Video noise reduction encoding method and video noise reduction encoding device | |
| CN103442229A (en) | Bit rate estimation method of SAO mode decision applied to encoder of HEVC standard | |
| CN1457196A (en) | Video encoding method based on prediction time and space domain conerent movement vectors | |
| CN1809167A (en) | Quick inter-frame forecast mode selection method | |
| Milicevic et al. | H. 264/AVC standard: A proposal for selective intra-and optimized inter-prediction | |
| KR101086724B1 (en) | ?? Deciding Method of H.264/AVC Encoder using Complexity of Frame, and H.264/AVC Encoder implementing the same | |
| CN112004088B (en) | CU-level QP allocation algorithm suitable for AVS2 encoder | |
| CN112004088A (en) | CU (computer Unit) level QP (quantization parameter) allocation algorithm suitable for AVS2 encoder | |
| JP4806483B2 (en) | Image compression method | |
| KR101943425B1 (en) | Method and Apparatus for Image Encoding/Decoding using Efficient Non-fixed Quantization | |
| KR100963322B1 (en) | Method of Adaptive Rate Control in Frame-layer for Real-time H.264/AVC |
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 |