WO2022078304A1

WO2022078304A1 - Video decoding method and apparatus, computer readable medium, program, and electronic device

Info

Publication number: WO2022078304A1
Application number: PCT/CN2021/123154
Authority: WO
Inventors: 王力强
Original assignee: 腾讯科技（深圳）有限公司
Priority date: 2020-10-16
Filing date: 2021-10-12
Publication date: 2022-04-21
Also published as: CN112543338A; CN112543338B

Abstract

Provided in the embodiments of the present application are a video decoding method and apparatus, a computer readable medium, a program, and an electronic device. The video decoding method comprises: performing entropy decoding processing on a coding block of a video image frame to acquire a quantisation coefficient block of residual data corresponding to the coding block; performing inverse quantisation processing on the quantisation coefficient block to obtain an inverse quantisation coefficient matrix; performing coefficient flip replacement processing on the inverse quantisation coefficient matrix to obtain a quantisation matrix after flip replacement processing, the flip replacement processing comprising at least one of left-right flip replacement, up-down flip replacement, and flip replacement performed along the sub-diagonal of the inverse quantisation coefficient matrix; and, on the basis of the coefficient matrix after flip replacement processing, generating the residual data. The technical solutions in the embodiments of the present application can effectively increase the efficiency of video encoding and decoding.

Description

Video decoding method, apparatus, computer readable medium, program and electronic device

This application claims the priority of the Chinese patent application filed on October 16, 2020 with the application number 202011114676.5 and the application title is "video decoding method, device, computer readable medium and electronic equipment", the entire content of which is provided by Reference is incorporated in this application.

technical field

The present application relates to the field of computer and communication technologies, and in particular, to a video decoding method, apparatus, computer-readable medium, program, and electronic device.

Background technique

In the video encoding process, the encoder usually needs to transform, quantize, and entropy the residual data between the original video data and the predicted video data before sending it to the decoder. And there are also some residuals with weak correlation, which may skip the transformation process. Since the coefficient coding module has higher coding efficiency for the coefficient matrix whose non-zero coefficients are concentrated in the upper left corner, the coefficients after transformation or skipping transformation may not all meet the requirements of the coefficient coding module, which affects the coding and decoding efficiency of the video.

SUMMARY OF THE INVENTION

Embodiments of the present application provide a video decoding method, an apparatus, a computer-readable medium, a program, and an electronic device, which can effectively improve video encoding and decoding efficiency at least to a certain extent.

Other features and advantages of the present application will become apparent from the following detailed description, or be learned in part by practice of the present application.

In a first aspect, an embodiment of the present application provides a video decoding method, including: performing entropy decoding processing on a coding block of a video image frame to obtain a quantized coefficient block of residual data corresponding to the coding block; The block is subjected to inverse quantization processing to obtain an inverse quantization coefficient matrix; the inverse quantization coefficient matrix is subjected to coefficient inversion and replacement processing to obtain a coefficient matrix after the inversion and replacement processing, and the inversion and replacement processing includes left and right inversion replacement, up and down inversion replacement and edge At least one of inversion and replacement is performed on the sub-diagonal of the inverse quantized coefficient matrix; and the residual data is generated according to the coefficient matrix after the inversion and replacement process.

In a second aspect, an embodiment of the present application provides a video decoding apparatus, including: a decoding unit configured to perform entropy decoding processing on an encoded block of a video image frame, and obtain a quantized coefficient block of residual data corresponding to the encoded block; A first processing unit, configured to perform inverse quantization processing on the quantized coefficient block, to obtain an inverse quantized coefficient matrix; a second processing unit, configured to perform inversion and replacement processing of coefficients on the inverse quantization coefficient matrix, and obtain an inverse and replacement processed The coefficient matrix of The residual data is generated by replacing the processed coefficient matrix.

In a third aspect, embodiments of the present application provide a computer-readable medium on which a computer program is stored, and when the computer program is executed by a processor, implements the video decoding method described in the foregoing embodiments.

In a fourth aspect, embodiments of the present application provide an electronic device, including: one or more processors; a storage device for storing one or more programs, when the one or more programs are stored by the one or more programs When executed by the multiple processors, the one or more processors are caused to implement the video decoding method described in the above embodiments.

In a fifth aspect, embodiments of the present application provide a computer program product or computer program, where the computer program product or computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer executes the video decoding methods provided in the above embodiments.

Description of drawings

FIG. 1 shows a schematic diagram of an exemplary system architecture to which the technical solutions of the embodiments of the present application can be applied;

FIG. 2 shows a schematic diagram of a placement manner of a video encoding device and a video decoding device in a streaming transmission system;

Fig. 3 shows the basic flow chart of a video encoder;

Fig. 4 shows the scanning area marked by SRCC technology;

Fig. 5 shows the sequence schematic diagram of scanning the marked scanning area;

6 shows a flowchart of a video decoding method according to an embodiment of the present application;

7A and 7B show schematic diagrams of flipping and replacing along the sub-diagonal line according to an embodiment of the present application;

8A and 8B show schematic diagrams of left-right flipping replacement according to an embodiment of the present application;

9A and 9B show schematic diagrams of upside-down replacement according to an embodiment of the present application;

FIG. 10 shows a schematic diagram of prediction directions in an intra prediction mode;

11 shows a block diagram of a video decoding apparatus according to an embodiment of the present application;

FIG. 12 shows a schematic structural diagram of a computer system suitable for implementing the electronic device according to the embodiment of the present application.

Detailed ways

Several embodiments of the present application will be described in more detail below with reference to the accompanying drawings in order to enable those skilled in the art to understand and implement the present application.

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments, however, can be embodied in various forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this application will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.

Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided in order to give a thorough understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical solutions of the present application may be practiced without one or more of the specific details, or other methods, components, devices, steps, etc. may be employed. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the present application.

The block diagrams shown in the figures are merely functional entities and do not necessarily necessarily correspond to physically separate entities. That is, these functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices entity.

The flowcharts shown in the figures are only exemplary illustrations and do not necessarily include all contents and operations/steps, nor do they have to be performed in the order described. For example, some operations/steps can be decomposed, and some operations/steps can be combined or partially combined, so the actual execution order may be changed according to the actual situation.

It should be noted that the "plurality" mentioned in this document refers to two or more. "And/or" describes the association relationship between associated objects, indicating that there can be three kinds of relationships, for example, A and/or B can indicate that A exists alone, A and B exist at the same time, and B exists alone. The character "/" generally indicates that the related objects are an "or" relationship.

FIG. 1 shows a schematic diagram of an exemplary system architecture to which the technical solutions of the embodiments of the present application can be applied.

As shown in FIG. 1 , the system architecture 100 includes a plurality of end devices that can communicate with each other through, for example, a network 150 . For example, the system architecture 100 may include a first end device 110 and a second end device 120 interconnected by a network 150 . In the embodiment of FIG. 1, the first terminal device 110 and the second terminal device 120 perform unidirectional data transmission.

For example, the first terminal device 110 may encode video data (eg, a video picture stream captured by the terminal device 110 ) for transmission to the second terminal device 120 through the network 150, and the encoded video data may be encoded in one or more The second terminal device 120 may receive the encoded video data from the network 150, decode the encoded video data to restore the video data, and display video pictures according to the restored video data.

In one embodiment of the present application, the system architecture 100 may include a third end device 130 and a fourth end device 140 that perform bidirectional transmission of encoded video data, such as may occur during a video conference. For bidirectional data transmission, each of the third end device 130 and the fourth end device 140 may encode video data (eg, a stream of video pictures captured by the end device) for transmission to the third end device over the network 150 130 and the other terminal device of the fourth terminal device 140 . Each of the third terminal device 130 and the fourth terminal device 140 may also receive encoded video data transmitted by the other one of the third terminal device 130 and the fourth terminal device 140, and may The video data is decoded to recover the video data, and a video picture can be displayed on an accessible display device based on the recovered video data.

In the embodiment of FIG. 1 , the first terminal device 110 , the second terminal device 120 , the third terminal device 130 and the fourth terminal device 140 may be servers, personal computers and smart phones, but the principles disclosed in this application may not be limited thereto . Embodiments disclosed herein are applicable to laptop computers, tablet computers, media players, and/or dedicated videoconferencing equipment. Network 150 represents any number of networks, including, for example, wired and/or wireless communication networks, that communicate encoded video data between first end device 110, second end device 120, third end device 130, and fourth end device 140. Communication network 150 may exchange data in circuit-switched and/or packet-switched channels. The network may include a telecommunications network, a local area network, a wide area network, and/or the Internet. For the purposes of this application, unless explained below, the architecture and topology of network 150 may be immaterial to the operations disclosed herein.

In one embodiment of the present application, FIG. 2 illustrates the placement of a video encoding device and a video decoding device in a streaming environment. The subject matter disclosed herein is equally applicable to other video-enabled applications including, for example, videoconferencing, digital TV (television), storing compressed video on digital media including CDs, DVDs, memory sticks, and the like.

The streaming transmission system may include a capture subsystem 213 , and the capture subsystem 213 may include a video source 201 such as a digital camera, and the video source 201 creates an uncompressed video picture stream 202 . In an embodiment, the video picture stream 202 includes samples captured by a digital camera. Compared to the encoded video data 204 (or the encoded video code stream 204), the video picture stream 202 is depicted as a thick line to emphasize the high data volume of the video picture stream, which can be processed by the electronic device 220, and the electronic Device 220 includes video encoding device 203 coupled to video source 201 . Video encoding device 203 may include hardware, software, or a combination of hardware and software to implement or implement various aspects of the disclosed subject matter as described in greater detail below. Compared to the video picture stream 202, the encoded video data 204 (or encoded video code stream 204) is depicted as a thin line to emphasize the lower amount of encoded video data 204 (or encoded video code stream 204) 204), which can be stored on the streaming server 205 for future use. One or more streaming client subsystems, such as client subsystem 206 and client subsystem 208 in FIG. 2 , may access streaming server 205 to retrieve

copies

207 and 209 of encoded video data 204 . Client subsystem 206 may include, for example, video decoding device 210 in electronic device 230 . The video decoding device 210 decodes the incoming copy 207 of the encoded video data and produces an output video picture stream 211 that can be presented on a display 212 (eg, a display screen) or another presentation device. In some streaming systems, encoded video data 204, video data 207, and video data 209 (eg, video bitstreams) may be encoded according to certain video encoding/compression standards. Examples of these standards include ITU-T H.265. In an embodiment, the video coding standard under development is informally referred to as Versatile Video Coding (VVC), and this application may be used in the context of the VVC standard.

It should be noted that the electronic device 220 and the electronic device 230 may include other components not shown in the figures. For example, electronic device 220 may include a video decoding device, and electronic device 230 may also include a video encoding device.

In an embodiment of the present application, the international video coding standard HEVC (High Efficiency Video Coding, high efficiency video coding), VVC (Versatile Video Coding, multifunctional video coding), and the Chinese national video coding standard AVS (Audio Video coding) Standard, source coding standard) as an example, when a video frame image is input, the video frame image will be divided into several non-overlapping processing units according to a block size, and each processing unit will perform similar compression operations. This processing unit is called CTU (Coding Tree Unit, coding tree unit), or LCU (Largest Coding Unit, largest coding unit). The CTU can continue to be further divided into finer divisions to obtain one or more basic coding units CU, and CU is the most basic element in a coding link. The following introduces some concepts when encoding CUs:

Predictive Coding: Predictive coding includes intra-frame prediction and inter-frame prediction. After the original video signal is predicted by the selected reconstructed video signal, a residual video signal is obtained. The encoder needs to decide which predictive coding mode to select for the current CU and inform the decoder. Among them, intra-frame prediction means that the predicted signal comes from an area that has been coded and reconstructed in the same image; inter-frame prediction means that the predicted signal comes from another image (called a reference image) that has been coded and different from the current image. .

Transform & Quantization: After the residual video signal undergoes transformation operations such as DFT (Discrete Fourier Transform, Discrete Fourier Transform), DCT (Discrete Cosine Transform, Discrete Cosine Transform), the signal is converted into the transform domain, called is the transformation coefficient. The transform coefficient is further subjected to a lossy quantization operation, which loses a certain amount of information, so that the quantized signal is beneficial to the compressed expression. In some video coding standards, there may be more than one transformation mode to choose from, so the encoder also needs to select one of the transformation modes for the current CU and inform the decoder. The fineness of quantization is usually determined by the Quantization Parameter (QP for short). If the value of QP is larger, the coefficients representing a larger value range will be quantized into the same output, which usually brings greater distortion and distortion. A lower code rate; on the contrary, if the QP value is smaller, the coefficients representing a smaller value range will be quantized into the same output, so it usually brings less distortion and corresponds to a higher code rate.

Entropy Coding or Statistical Coding: The quantized transform domain signal will undergo statistical compression coding according to the frequency of occurrence of each value, and finally output a binarized (0 or 1) compressed code stream. At the same time, other information generated by encoding, such as the selected encoding mode, motion vector data, etc., also needs to be entropy encoded to reduce the bit rate. Statistical coding is a lossless coding method that can effectively reduce the code rate required to express the same signal. Common statistical coding methods include Variable Length Coding (VLC) or context-based binary arithmetic coding ( Content Adaptive Binary Arithmetic Coding, referred to as CABAC).

Loop Filtering: The changed and quantized signal will obtain a reconstructed image through the operations of inverse quantization, inverse transformation and prediction compensation. Compared with the original image, the reconstructed image is different from the original image due to the influence of quantization, that is, the reconstructed image will produce distortion (Distortion). Therefore, filtering operations can be performed on the reconstructed image, such as deblocking filter (DB), SAO (Sample Adaptive Offset, adaptive pixel compensation) or ALF (Adaptive Loop Filter, adaptive loop filter) and other filters , which can effectively reduce the degree of distortion caused by quantization. Since these filtered reconstructed images will be used as references for subsequent encoded images to predict future image signals, the above filtering operation is also called in-loop filtering, ie, a filtering operation in an encoding loop.

In an embodiment of the present application, FIG. 3 shows a basic flowchart of a video encoder, and intra-frame prediction is used as an example in the flowchart for illustration. Among them, the original image signal _sk [x,y] and the predicted image signal

Do the difference operation to obtain the residual signal u _k [x, y], and the residual signal u _k [x, y] is transformed and quantized to obtain quantized coefficients. On the one hand, the quantized coefficients are encoded by entropy coding to obtain the encoded bits On the other hand, the reconstructed residual signal u' _k [x, y] is obtained through inverse quantization and inverse transformation processing, and the predicted image signal

It is superimposed with the reconstructed residual signal u' _k [x, y] to generate an image signal

image signal

On the one hand, it is input to the _intra - _frame mode decision module and the intra-frame prediction module for intra-frame prediction processing; ] can be used as a reference image for the next frame for motion estimation and motion compensation prediction. Then based on the motion compensation prediction result s' _r [x+m _x ,y+m _y ] and the intra prediction result

Get the predicted image signal of the next frame

And continue to repeat the above process until the encoding is complete.

In addition, since the residual signal in the transformed and quantized quantized coefficient block has a high probability that the non-zero coefficients will be concentrated in the left and upper regions of the block, while the right and lower regions of the block are often 0, so the introduction of SRCC ( Scan Region Coefficient Coding, scanning region coefficient coding) technology. The size of the upper left region of the non-zero coefficients included in each quantized coefficient block (size W×H) can be marked by SRCC technology SRx×SRy, where SRx is the abscissa of the rightmost non-zero coefficient in the quantized coefficient block, SRy is the ordinate of the lowest non-zero coefficient in the quantized coefficient block, and 1≤SRx≤W, 1≤SRy≤H, and the coefficients outside the upper left area are all 0. The SRCC technology uses (SRx, SRy) to determine the quantized coefficient area that needs to be scanned in a quantized coefficient block. As shown in Figure 4, only the quantized coefficients in the scanning area marked by (SRx, SRy) need to be coded. The scanning order of the coding is as follows As shown in Figure 5, it can be a reverse zigzag scan from the lower right corner to the upper left corner.

Based on the above encoding process, for each CU, the decoding end performs entropy decoding to obtain various mode information and quantization coefficients after obtaining the compressed code stream (ie, the bit stream). Then, the quantized coefficients undergo inverse quantization and inverse transformation to obtain residual signals. On the other hand, according to the known coding mode information, the predicted signal corresponding to the CU can be obtained, and then the reconstructed signal can be obtained by adding the residual signal and the predicted signal. The reconstructed signal is then subjected to loop filtering and other operations to generate the final output signal.

In the above encoding and decoding process, the transform processing of the residual signal makes the energy of the residual signal concentrate on less low-frequency coefficients, that is, most coefficients have smaller values. Then after the subsequent quantization module, the smaller coefficient value will become zero value, which greatly reduces the cost of coding the residual signal. However, due to the diversity of residual distribution, a single DCT transformation cannot adapt to all residual characteristics. Therefore, transformation kernels such as DST7 and DCT8 are introduced into the transformation process, and the horizontal transformation and vertical transformation of the residual signal are carried out. Direct transforms can use different transform kernels. Taking AMT (Adaptive multiple core transform) technology as an example, the possible transformation combinations for transform processing of a residual signal are as follows: (DCT2, DCT2), (DCT8, DCT8), (DCT8, DST7) ), (DST7, DCT8) and (DST7, DST7).

For the specific choice of transformation combination for the residual signal, it is necessary to use RDO (Rate-Distortion Optimization, rate-distortion optimization) at the encoding end to make a decision. And there are also some residuals with weak correlation, which may skip the transformation process. Taking the residual of transform skipping as an example, the current transform skipping method in the AVS3 standard directly skips the transform process of the residual. However, due to the characteristics of intra-frame prediction, the residual energy in the lower right corner of the residual block is higher, and the direct When coefficient coding is performed, it is difficult to reduce the size of the SRCC region, which reduces the efficiency of the SRCC, and thus also affects the coding efficiency of the video.

In view of the above problems, the embodiments of the present application propose to perform coefficient flipping and replacement processing on the inverse quantization coefficient matrix, so as to concentrate more non-zero coefficients in the coefficient matrix in the left, upper and upper left regions of the coefficient matrix, and further The area of the SRCC region can be reduced during encoding, thereby effectively improving video encoding and decoding efficiency.

The implementation details of the technical solutions of the embodiments of the present application are described in detail below:

FIG. 6 shows a flowchart of a video decoding method according to an embodiment of the present application. The video decoding method may be executed by an electronic device with a computing processing function, such as a terminal device or a server. Referring to FIG. 6 , the video decoding method at least includes steps S610 to S640, which are described in detail as follows:

In step S610, entropy decoding processing is performed on the coded block of the video image frame to obtain a quantized coefficient block of residual data corresponding to the coded block.

In one embodiment of the present application, the video image frame sequence includes a series of images, each image can be further divided into slices, and the slices can be further divided into a series of LCUs (or CTUs). The LCUs include There are several CUs. The video image frame is encoded in block units. In some new video encoding standards, such as the H.264 standard, there is a macroblock (MB), which can be further divided into multiple blocks that can be used for Prediction block (prediction) for predictive coding. In the HEVC standard, basic concepts such as coding unit CU, prediction unit (PU) and transform unit (TU) are used to functionally divide a variety of block units, and adopt a new tree-based structure for describe. For example, a CU can be divided into smaller CUs according to a quadtree, and the smaller CUs can be further divided to form a quadtree structure. The coding block in this embodiment of the present application may be a CU, or a block smaller than the CU, such as a smaller block obtained by dividing the CU.

In step S620, inverse quantization processing is performed on the quantized coefficient block to obtain an inverse quantized coefficient matrix. The inverse quantization process is the inverse process of the quantization process of the video image frame during encoding to obtain inverse quantization coefficients. For example, based on or using the same quantization step size as in the quantization process, an inverse quantization scheme corresponding to the quantization processing scheme is applied. Perform inverse quantization processing.

In step S630, the inverse quantization coefficient matrix is subjected to inversion and replacement of the coefficients to obtain a coefficient matrix after the inversion and substitution process. The inversion and substitution processing includes left and right inversion, up and down inversion, and inversion along the sub-diagonal of the inverse quantization coefficient matrix. at least one of the substitutions.

In an embodiment of the present application, before step S630 is performed, this embodiment of the present application may also determine whether it is necessary to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix according to at least one of the following methods:

The value of the index identifier included in the sequence header of the coding block corresponding to the video image frame sequence;

The value of the index identifier included in the image header of the coding block corresponding to the video image frame;

The coding mode used by the coding block;

The size of the coding block;

The value of the index identification contained in the coding block or the implicit indication of the coefficient statistics in the quantized coefficient block.

In this way, in this embodiment of the present application, step S630 may be performed when it is determined that the inverse quantization coefficient matrix needs to be subjected to coefficient inversion and replacement processing. On the contrary, when it is determined that the inverse quantization coefficient matrix does not need to perform coefficient inversion and replacement processing, step S630 may not be performed in this embodiment of the present application.

Specifically, when determining whether the corresponding coding block needs to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix, the following methods may be used:

1. It is indicated by the index identifier contained in the sequence header of the video image frame sequence. For example, if the index identifier contained in the sequence header is 1 (the value is only an example), it means that all coding blocks corresponding to the video image frame sequence need to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing .

2. It is indicated by the index identifier contained in the image header of the video image frame. For example, if the index flag included in the image header is 1 (the value is only an example), it means that all coding blocks corresponding to the video image frame need to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing.

3. Indicated by the coding mode adopted by the coding block. For example, if an encoding block adopts the intra-frame encoding mode, it means that the encoding block needs to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing.

4. Indicated by the size of the coding block. For example, if the size of a coding block is smaller than the set value, it means that the coding block needs to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing.

5. It is indicated by the value of the index identifier contained in the coding block. For example, if the index identifier included in a coding block is 1 (the value is only an example), it means that the coding block needs to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing.

6. Implicit indication is made by quantizing coefficient statistics in the coefficient block. For example, the number of non-zero coefficients, even-numbered coefficients, non-zero even-numbered coefficients or odd-numbered coefficients in the quantization coefficient block can be counted, and then according to the parity of the number, it is implicitly indicated whether the encoding block needs to be obtained by entropy decoding and inverse quantization processing. The inverse quantization coefficient matrix performs the inversion and replacement processing of the coefficients. In short, the number of parities is taken as the coefficient statistic result in the quantized coefficient block, so as to determine whether the coefficient inversion and replacement process needs to be performed according to the coefficient statistic result. If the number is an odd number, it means that the coding block needs to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization; on the contrary, if the number is an even number, it means that the coding block does not require entropy decoding. And the inverse quantization coefficient matrix obtained by the inverse quantization process performs the inversion and replacement process of the coefficients. Of course, when the number is an odd number, it can also indicate that the coding block does not need to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization; and when the number is even, it means that the coding block needs The inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing is subjected to inversion and replacement processing of the coefficients.

In an embodiment of the present application, when the coefficients in the quantization coefficient block are counted, the whole area in the quantization coefficient block, or a part of the area in the quantization coefficient block, or the SRCC in the quantization coefficient block may be counted. area (such as the entire SRCC area or part of the SRCC area). For example, one or more positions specified in the statistical quantization coefficient block, at least one row specified in the statistical quantization coefficient block, at least one column specified in the statistical quantization coefficient block, at least one row specified in the statistical quantization coefficient block, and at least one column specified in the statistical quantization coefficient block , the position on at least one oblique line in the statistical quantization coefficient block, and the like.

7. Use two or more of the above methods 1 to 5 to give instructions.

For example, the index identifier included in the sequence header of the video image frame sequence, the index identifier included in the image header of the video image frame, the encoding mode adopted by the encoding block, the size of the encoding block, and the index identifier included in the encoding block can be used. value to indicate together.

Specifically, if the index flag contained in the sequence header is 1 (the value is only an example), the index flag contained in the image header is 1 (the value is only an example), the coding block adopts the intra-frame coding method, and the size of the coding block is is smaller than the set size, then if the value of the index identifier contained in the coding block is 1 (the value is only an example), then it means that the coding block needs to perform coefficient calculation on the inverse quantization coefficient matrix obtained by entropy decoding and inverse quantization processing. Flip replacement processing.

In one embodiment, if the index identifier included in the sequence header is 1 (the value is only an example), the index identifier included in the image header is 1 (the value is only an example), the encoding block adopts the intra-frame encoding method, and the encoding The size of the block is smaller than the set size, then if the value of the index identifier contained in the coding block is 0 (the value is only an example), it means that the coding block does not require the inverse quantization coefficient matrix to perform coefficient inversion and replacement processing, and can Inverse transform processing is performed on the inverse quantization coefficient matrix of the coding block by means of DCT transform.

8. Use two or more of the above methods 1 to 4 and method 6 to give instructions.

For example, the index identifier included in the sequence header of the video image frame sequence, the index identifier included in the image header of the video image frame, the encoding mode adopted by the encoding block, the size of the encoding block, and the coefficient statistics in the quantization coefficient block can be obtained. to jointly instruct. Specifically, if the index flag contained in the sequence header is 1 (the value is only an example), the index flag contained in the image header is 1 (the value is only an example), the coding block adopts the intra-frame coding method, and the size of the coding block is is smaller than the set size, then if the statistical result of the quantization coefficient block corresponding to the coding block is the first value (for example, the first value can be an odd value, which is only an example), it means that the inverse quantization coefficient matrix needs to be calculated. Flip replacement processing.

In an embodiment of the present application, if the index identifier included in the sequence header is 1 (the value is only an example), the index identifier included in the image header is 1 (the value is only an example), the coding block adopts the intra-frame coding method, And the size of the coding block is smaller than the set size, then if the statistical result of the quantization coefficient block corresponding to the coding block is the second value (for example, the second value can be an even value, which is only an example), it is not necessary to contradict it. The quantized coefficient matrix is subjected to inversion and replacement processing of the coefficients, and the inverse transformation processing of the inverse quantized coefficient matrix of the coding block can be performed by means of DCT transformation.

In one embodiment of the present application, the inverse quantization coefficient matrix is flipped along the sub-diagonal of the inverse quantization coefficient matrix as shown in FIG. 7A , that is, the inverse quantization coefficient matrix is flipped along the sub-diagonal, and then the coefficients at the corresponding positions are inverted. Perform replacement processing. In this case, before performing quantization processing on the coefficient matrix, the encoding end may also perform flipping and replacement processing on the coefficient matrix along the sub-diagonal, as shown in FIG. 7B .

In an embodiment of the present application, as shown in FIG. 8A , the left and right inversion may be performed along the center line of the width of the inverse quantization coefficient matrix, and then the coefficients at the corresponding positions are replaced. In this case, before performing the quantization process on the coefficient matrix, the encoding end may also perform the left-right inversion and replacement process on the coefficient matrix, as shown in FIG. 8B . It should be noted that the left-right inversion shown in FIGS. 8A and 8B is a left-right symmetrical inversion, and in other embodiments of the present application, an asymmetrical inversion may also be adopted.

In an embodiment of the present application, as shown in FIG. 9A , the upside-down replacement can be performed along the center line of the inverse quantization coefficient matrix in height, and then the coefficients at the corresponding positions are replaced. In this case, before performing quantization processing on the coefficient matrix, the encoding end may also perform up-down inversion and replacement processing on the coefficient matrix, as shown in FIG. 9B . It should be noted that the upside-down inversion method shown in FIG. 9A and FIG. 9B is up-down symmetrical inversion, and in other embodiments of the present application, an asymmetrical inversion manner may also be adopted.

In an embodiment of the present application, when the inverse quantization coefficient matrix is subjected to coefficient inversion and replacement processing, the inverse quantization coefficient matrix may be determined according to the relationship between the width and height of the inverse quantization coefficient matrix. The determined inversion and replacement mode performs coefficient inversion and replacement processing on the inverse quantized coefficient matrix.

For example, if the width and height of the inverse quantization coefficient matrix are equal, it is determined that the inverse quantization coefficient matrix is flipped and replaced along the sub-diagonal of the inverse quantization coefficient matrix, as shown in the embodiment shown in FIG. 7A . Of course, if the width and height of the inverse quantization coefficient matrix are equal, the method of flipping up and down, or the method of flipping left and right, can also be used. Flip at least two of the substitutions.

If the width of the inverse quantization coefficient matrix is greater than the height, it is determined that the inverse quantization coefficient matrix is to be replaced by a left-right inversion, as shown in the embodiment shown in FIG. 8A .

If the width of the inverse quantization coefficient matrix is smaller than the height, it is determined that the inverse quantization coefficient matrix is replaced by up and down, as shown in the embodiment shown in FIG. 9A .

In an embodiment of the present application, when performing coefficient inversion and replacement processing on the inverse quantization coefficient matrix, the inversion and replacement method of the inverse quantization coefficient matrix may be determined according to the intra-frame prediction mode adopted by the coding block, and then based on the determined inversion and replacement The method performs the inversion and replacement processing of the coefficients on the inverse quantized coefficient matrix.

Specifically, if the direction of the intra-frame prediction mode of the coding block is towards the lower left, it is determined that the inverse quantization coefficient matrix is replaced by up and down; if the direction of the intra-frame prediction mode of the coding block is towards the upper right, it is determined that the The inverse quantization coefficient matrix adopts the method of left and right flip replacement.

In an embodiment of the present application, as shown in FIG. 10 , the intra prediction modes with the direction toward the lower left may be mode 3 to mode 11, and the mode 34 to mode 43; the intra prediction mode with the direction toward the upper right may be the mode 25 to Mode 32, Mode 58 to Mode 65.

In an embodiment of the present application, if the intra prediction mode of the coding block is another intra prediction mode except toward the lower left and toward the upper right, then according to the relationship between the width and height of the inverse quantization coefficient matrix, Determines the flip replacement for the inverse quantized coefficient matrix. Specifically, as shown in FIG. 10 , other intra prediction modes in this embodiment may be mode 0 to mode 2, mode 12 to mode 24, and mode 44 to mode 57. Among them, mode 0 represents a DC prediction mode, mode 1 represents a plane (Plane) prediction mode, and mode 2 represents a bilinear (Bilinear) prediction mode. In this embodiment, according to the relationship between the width and the height of the inverse quantization coefficient matrix, the solution of determining the inversion and replacement mode of the inverse quantization coefficient matrix may refer to the technical solutions of the foregoing embodiments, and will not be repeated.

Continuing to refer to FIG. 6 , in step S640, residual data is generated according to the coefficient matrix after the inversion and replacement process.

In an embodiment of the present application, the coefficient matrix after the flipping and replacement processing may be used as the residual data obtained by reconstruction, or other processing may be performed on the coefficient matrix after the flipping and replacement processing to obtain the residual data.

The technical solutions of the above embodiments of the present application enable more non-zero coefficients in the coefficient matrix to be concentrated in the left, upper and upper left regions of the coefficient matrix by inverting and replacing the inverse quantization coefficient matrix. When reducing the area of the SRCC region, the video coding and decoding efficiency can be effectively improved.

To sum up, according to the video decoding method of the embodiment of the present application, a coefficient matrix after the inversion and replacement process is obtained by performing the inversion and replacement of the coefficients on the inverse quantization coefficient matrix, and the inversion and replacement process includes left-right inversion, up-down inversion and edge At least one of inversion and replacement is performed on the sub-diagonal of the inverse quantization coefficient matrix, and then residual data is generated according to the coefficient matrix after the inversion and substitution process, so that the inverse quantization coefficient matrix can be inverted and replaced by the coefficient matrix. The non-zero coefficients are more concentrated in the left, upper and upper left regions of the coefficient matrix, so that the area of the SRCC region can be reduced during encoding and decoding, thereby effectively improving the video encoding and decoding efficiency. The apparatus embodiments of the present application are described below, which can be used to execute the video decoding methods in the above-mentioned embodiments of the present application. For details not disclosed in the device embodiments of the present application, please refer to the above-mentioned embodiments of the video decoding method of the present application.

FIG. 11 shows a block diagram of a video decoding apparatus according to an embodiment of the present application. The video decoding apparatus may be set in an electronic device with a computing processing function, such as a terminal device or a server.

Referring to FIG. 11 , a video decoding apparatus 1100 according to an embodiment of the present application includes: a decoding unit 1102 , a first processing unit 1104 , a second processing unit 1106 and a third processing unit 1108 .

The decoding unit 1102 is configured to perform entropy decoding processing on the coding block of the video image frame to obtain a quantized coefficient block of residual data corresponding to the coding block; the first processing unit 1104 is configured to perform inverse quantization on the quantized coefficient block processing to obtain an inverse quantization coefficient matrix; the second processing unit 1106 is configured to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix to obtain a coefficient matrix after the inversion and replacement processing, and the inversion and replacement processing includes left-right inversion and up-down inversion. at least one of replacing and flipping and replacing along the sub-diagonal of the inverse quantized coefficient matrix; the third processing unit 1108 is configured to generate the residual data according to the coefficient matrix after flipping and replacing.

To sum up, according to the video decoding apparatus according to the embodiment of the present application, a coefficient matrix after the inversion and replacement processing is obtained by performing the inversion and replacement of the coefficients on the inverse quantization coefficient matrix, and the inversion and replacement processing includes left-right inversion, up-down inversion, and edge At least one of inversion and replacement is performed on the sub-diagonal of the inverse quantization coefficient matrix, and then residual data is generated according to the coefficient matrix after the inversion and substitution process, so that the inverse quantization coefficient matrix can be inverted and replaced by the coefficient matrix. The non-zero coefficients are more concentrated in the left, upper and upper left regions of the coefficient matrix, so that the area of the SRCC region can be reduced during encoding and decoding, thereby effectively improving the video encoding and decoding efficiency.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is further configured to: determine whether to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix according to at least one of the following manners:

The value of the index identifier contained in the sequence header of the video image frame sequence;

The value of the index identifier contained in the image header of the video image frame;

The coding mode used by the coding block;

The size of the coding block;

The value of the index identifier contained in the coding block or the implicit indication of the coefficient statistics result in the quantized coefficient block.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: if the index identifier included in the sequence header of the video image frame sequence and the index identifier included in the image header of the video image frame are both The specified value, the encoding mode adopted by the encoding block is the intra-frame encoding mode, and the size of the encoding block is smaller than the set size, then when the statistical result of the quantization coefficient block is the first value, it is determined that the coefficients of the inverse quantization coefficient matrix need to be calculated. Flip replacement processing.

In some embodiments of the present application, based on the aforementioned solution, the second processing unit 1106 is configured to: if the index identifier included in the sequence header of the video image frame sequence and the index identifier included in the image header of the video image frame are both specified values , the encoding mode adopted by the encoding block of the video image frame is the intra-frame encoding mode, and the size of the encoding block is smaller than the set size, then when the statistical result of the quantization coefficient block is the second value, it is determined that the discrete The inverse transform is performed on the inverse quantization coefficient matrix by means of cosine transform DCT.

In some embodiments of the present application, based on the foregoing solution, if it is at least necessary to determine whether it is necessary to perform the inverse quantization coefficient matrix inversion and replacement of coefficients according to the implicit indication of the coefficient statistics in the quantization coefficient block, the second process The unit 1106 is further configured to: count the number of non-zero coefficients, even-numbered coefficients, non-zero even-numbered coefficients or odd-numbered coefficients in the specified area in the quantized coefficient block, and use the parity of the number as the coefficients in the quantized coefficient block According to the statistical result, the designated area includes part or all of the area in the quantized coefficient block, or part or all of the SRCC area in the quantized coefficient block.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: determine a flipping replacement method of the inverse quantization coefficient matrix according to the relationship between the width and height of the inverse quantization coefficient matrix; based on The determined inversion and replacement mode performs coefficient inversion and replacement processing on the inverse quantization coefficient matrix.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: if the width and height of the inverse quantization coefficient matrix are equal, determine to use the inverse quantization coefficient matrix along the inverse quantization coefficient matrix. The method of flipping and replacing the sub-diagonal of the matrix; if the width of the inverse quantization coefficient matrix is greater than the height, it is determined that the inverse quantization coefficient matrix adopts the left and right flip replacement method; if the width of the inverse quantization coefficient matrix is less than height, it is determined to use the upside-down replacement method for the inverse quantization coefficient matrix.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: determine, according to the intra-frame prediction mode adopted by the coding block, an inversion and replacement manner of the inverse quantization coefficient matrix; The inversion and replacement mode performs coefficient inversion and replacement processing on the inverse quantized coefficient matrix.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: if the direction of the intra prediction mode of the coding block is toward the lower left, determine to use upside-down inversion for the inverse quantization coefficient matrix Replacement mode; if the direction of the intra prediction mode of the coding block is toward the upper right, it is determined to adopt a left-right inversion replacement mode for the inverse quantization coefficient matrix.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: if the intra prediction mode of the coding block is an intra prediction mode other than the lower left and the upper right, then According to the relationship between the width and the height of the inverse quantization coefficient matrix, a flip replacement mode of the inverse quantization coefficient matrix is determined.

In some embodiments of the present application, based on the foregoing solution, the second processing unit 1106 is configured to: sequentially perform the left-right inversion and up-down inversion replacement processing of the coefficients on the inverse quantization coefficient matrix; or perform the inverse quantization coefficient matrix The up-down inversion and left-right inversion substitution processing of the coefficients are sequentially performed.

In some embodiments of the present application, based on the foregoing solution, the left-right flipping and replacement includes performing left-right flipping and replacing along the center line of the inverse quantization coefficient matrix in width; Make a flip-up replacement on the centerline in height. FIG. 12 shows a schematic structural diagram of a computer system suitable for implementing the electronic device according to the embodiment of the present application.

It should be noted that the computer system 1200 of the electronic device shown in FIG. 12 is only an example, and should not impose any limitations on the functions and scope of use of the embodiments of the present application.

As shown in FIG. 12 , the computer system 1200 includes a central processing unit (Central Processing Unit, CPU) 1201, which can be loaded into a random device according to a program stored in a read-only memory (Read-Only Memory, ROM) 1202 or from a storage part 1208 A program in a memory (Random Access Memory, RAM) 1203 is accessed to perform various appropriate actions and processes, such as performing the methods described in the above embodiments. In the RAM 1203, various programs and data required for system operation are also stored. The CPU 1201, the ROM 1202, and the RAM 1203 are connected to each other through a bus 1204. An Input/Output (I/O) interface 1205 is also connected to the bus 1204 .

The following components are connected to the I/O interface 1205: an input section 1206 including a keyboard, a mouse, etc.; an output section 1207 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc. ; a storage part 1208 including a hard disk and the like; and a communication part 1209 including a network interface card such as a LAN (Local Area Network) card, a modem, and the like. The communication section 1209 performs communication processing via a network such as the Internet. Drivers 1210 are also connected to I/O interface 1205 as needed. A removable medium 1211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 1210 as needed so that a computer program read therefrom is installed into the storage section 1208 as needed.

In particular, according to embodiments of the present application, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program comprising a computer program for performing the method illustrated in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network via the communication portion 1209, and/or installed from the removable medium 1211. When the computer program is executed by the central processing unit (CPU) 1201, various functions defined in the system of the present application are executed.

It should be noted that the computer-readable medium shown in the embodiments of the present application may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Erasable Programmable Read Only Memory (EPROM), flash memory, optical fiber, portable Compact Disc Read-Only Memory (CD-ROM), optical storage device, magnetic storage device, or any suitable of the above The combination. In this application, a computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this application, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying a computer-readable computer program therein. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . A computer program embodied on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. Wherein, each block in the flowchart or block diagram may represent a module, program segment, or part of code, and the above-mentioned module, program segment, or part of code contains one or more executables for realizing the specified logical function instruction. It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams or flowchart illustrations, and combinations of blocks in the block diagrams or flowchart illustrations, can be implemented in special purpose hardware-based systems that perform the specified functions or operations, or can be implemented using A combination of dedicated hardware and computer instructions is implemented.

The units involved in the embodiments of the present application may be implemented in software or hardware, and the described units may also be provided in a processor. Among them, the names of these units do not constitute a limitation on the unit itself under certain circumstances.

As another aspect, the present application also provides a computer-readable medium. The computer-readable medium may be included in the electronic device described in the above embodiments; it may also exist alone without being assembled into the electronic device. middle. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by an electronic device, enables the electronic device to implement the methods described in the above-mentioned embodiments.

It should be noted that although several modules or units of the apparatus for action performance are mentioned in the above detailed description, this division is not mandatory. Indeed, according to embodiments of the present application, the features and functions of two or more modules or units described above may be embodied in one module or unit. Conversely, the features and functions of one module or unit described above may be further divided into multiple modules or units to be embodied.

From the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein may be implemented by software, or may be implemented by software combined with necessary hardware. Therefore, the technical solutions according to the embodiments of the present application may be embodied in the form of software products, and the software products may be stored in a non-volatile storage medium (which may be CD-ROM, U disk, mobile hard disk, etc.) or on the network , which includes several instructions to cause a computing device (which may be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiments of the present application.

Other embodiments of the present application will readily occur to those skilled in the art upon consideration of the specification and practice of the embodiments disclosed herein. This application is intended to cover any variations, uses or adaptations of this application that follow the general principles of this application and include common knowledge or conventional techniques in the technical field not disclosed in this application .

It is to be understood that the present application is not limited to the precise structures described above and illustrated in the accompanying drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims

A video decoding method, applied to electronic equipment, the video decoding method comprising:

Entropy decoding processing is performed on the coding block of the video image frame to obtain a quantized coefficient block of residual data corresponding to the coding block;

performing inverse quantization processing on the quantization coefficient block to obtain an inverse quantization coefficient matrix;

Perform inversion and replacement processing of coefficients on the inverse quantization coefficient matrix to obtain a coefficient matrix after the inversion and replacement processing, and the inversion and replacement processing includes left and right inversion replacement, up and down inversion replacement, and performing along the sub-diagonal of the inverse quantization coefficient matrix. at least one of flip replacement;

The residual data is generated according to the coefficient matrix after the flip replacement process.
The video decoding method according to claim 1, further comprising: determining whether it is necessary to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix according to at least one of the following methods:

The value of the index identifier contained in the sequence header of the video image frame sequence;

the value of the index mark contained in the image header of the video image frame;

the coding mode adopted by the coding block;

the size of the coding block;

The value of the index identifier contained in the coding block or an implicit indication of the coefficient statistics result in the quantized coefficient block.
The video decoding method according to claim 2, wherein according to the value of the index identifier included in the sequence header of the video image frame sequence, the value of the index identifier included in the image header of the video image frame, the When the encoding mode adopted by the encoding block, the size of the encoding block, and the implicit indication of the coefficient statistics in the quantized coefficient block are used to determine whether the flipping and replacement processing is required, the video decoding method further includes:

The index identifier included in the sequence header of the video image frame sequence and the index identifier included in the image header of the video image frame are both specified values, the encoding mode adopted by the encoding block is the intra-frame encoding mode, and the When the size of the coding block is smaller than the set size, and the statistical result of the quantization coefficient block is the first value, it is determined that the inverse quantization coefficient matrix needs to be subjected to coefficient inversion and replacement processing.
The video decoding method according to claim 3, further comprising:

The index identifier included in the sequence header of the video image frame sequence and the index identifier included in the image header of the video image frame are both specified values, the encoding mode adopted by the encoding block is the intra-frame encoding mode, and the When the size of the coding block is smaller than the set size, and the statistical result of the quantization coefficient block is the second value, it is determined that the inverse quantization coefficient matrix needs to be inversely transformed by means of discrete cosine transform DCT.
The video decoding method according to claim 2, when it is at least necessary to determine whether it is necessary to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix according to an implicit indication of coefficient statistics in the quantization coefficient block, the video Decoding methods also include:

Counting the number of non-zero coefficients, even-numbered coefficients, non-zero even-numbered coefficients or odd-numbered coefficients in the specified area in the quantized coefficient block, and using the parity of the number as the coefficient statistics result in the quantized coefficient block, the specified The region includes part or all of the region in the quantized coefficient block, or part or all of the scanning region coefficient coding SRCC region in the quantized coefficient block.
The video decoding method according to claim 1, performing coefficient inversion and replacement processing on the inverse quantization coefficient matrix, comprising:

According to the relationship between the width and the height of the inverse quantization coefficient matrix, determine the flip replacement mode of the inverse quantization coefficient matrix;

The inverse quantization coefficient matrix is subjected to coefficient inversion and substitution processing based on the determined inversion and substitution manner.
The video decoding method according to claim 6, wherein according to the relationship between the width and the height of the inverse quantization coefficient matrix, determining the inversion and replacement mode of the inverse quantization coefficient matrix, comprising:

When the width and height of the inverse quantization coefficient matrix are equal, it is determined that the inverse quantization coefficient matrix is performed by flipping and replacing along the sub-diagonal of the inverse quantization coefficient matrix;

When the width of the inverse quantization coefficient matrix is greater than the height, it is determined to adopt a left-right flipping replacement method for the inverse quantization coefficient matrix;

When the width of the inverse quantization coefficient matrix is smaller than the height, it is determined to use the upside-down replacement method for the inverse quantization coefficient matrix.
The video decoding method according to claim 1, performing coefficient inversion and replacement processing on the inverse quantization coefficient matrix, comprising:

According to the intra-frame prediction mode adopted by the coding block, determine the inversion and replacement mode of the inverse quantization coefficient matrix;

The inverse quantization coefficient matrix is subjected to coefficient inversion and substitution processing based on the determined inversion and substitution manner.
The video decoding method according to claim 8, wherein determining a flipping and replacement mode of the inverse quantization coefficient matrix according to an intra-frame prediction mode adopted by the coding block, comprising:

When the direction of the intra prediction mode of the coding block is toward the lower left, it is determined that the inverse quantization coefficient matrix is replaced by upside-down replacement;

When the direction of the intra-frame prediction mode of the coding block is toward the upper right, it is determined to adopt a left-right inversion replacement manner for the inverse quantization coefficient matrix.
The video decoding method according to claim 9, further comprising:

When the intra prediction mode of the coding block is another intra prediction mode except toward the lower left and toward the upper right, the inverse quantization is determined according to the relationship between the width and the height of the inverse quantization coefficient matrix Flip replacement for the coefficient matrix.
The video decoding method according to claim 1, performing coefficient inversion and replacement processing on the inverse quantization coefficient matrix, comprising:

The inverse quantization coefficient matrix is sequentially subjected to a left-right inversion replacement process and an up-down inversion replacement process of the coefficients.
The video decoding method according to claim 1, performing coefficient inversion and replacement processing on the inverse quantization coefficient matrix, comprising: sequentially performing up-down inversion and left-right inversion replacement processing of coefficients on the inverse quantization coefficient matrix.
The video decoding method according to any one of claims 1 to 12, wherein the left-right flipping replacement comprises performing left-right flipping replacement along a center line of the inverse quantization coefficient matrix in width;

The upside-down replacement includes upside-down replacement along a height-wise center line of the inverse quantization coefficient matrix.
A video decoding device, applied to electronic equipment, the video decoding device comprising:

a decoding unit, configured to perform entropy decoding processing on an encoded block of a video image frame to obtain a quantized coefficient block of residual data corresponding to the encoded block;

a first processing unit, configured to perform inverse quantization processing on the quantized coefficient block to obtain an inverse quantized coefficient matrix;

The second processing unit is configured to perform coefficient inversion and replacement processing on the inverse quantization coefficient matrix to obtain a coefficient matrix after inversion and replacement processing, where the inversion and replacement processing includes left and right inversion replacement, up and down inversion replacement, and along the inverse quantized coefficients at least one of flipping and replacing the sub-diagonal of the matrix;

The third processing unit is configured to generate the residual data according to the coefficient matrix after the inversion and replacement processing.
A computer-readable medium having a computer program stored thereon, the computer program implementing the video decoding method according to any one of claims 1 to 13 when executed by a processor.
An electronic device comprising:

one or more processors;

A storage device for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to implement any one of claims 1 to 13 A video decoding method as described.
A computer program comprising computer instructions stored in a computer readable storage medium, the computer instructions being executed by the processor to cause a computer to perform the video as claimed in any one of claims 1 to 13 decoding method.