TW202337212A - Video decoding method, apparatus, video decoder and storage medium - Google Patents

Abstract

Embodiments of the present application provide a video decoding method, apparatus, video decoder and storage medium, which relate to the field of video decoding technology and can save resources in a bit stream and improve the transmission efficiency of the bit stream. The method includes: obtaining one or more code rate control parameters of a current block in a picture to be decoded; determining a quantization parameter of the current block based on the one or more code rate control parameters; and decoding the current block based on the quantization parameter of the current block.

Description

A video decoding method, device, video decoder and storage medium

The present invention relates to the technical field of video decoding, and in particular, to a video decoding method and device, a video decoder and a storage medium.

Video coding and decoding technology plays an important role in the field of video transmission and storage. Among them, quantization is a key step in determining image quality in the video encoding and decoding process. Quantization mainly reduces the redundancy of data by quantifying parameters, but it may also bring the risk of image distortion. Currently, the quantization parameters used for quantization are written into the code stream during the video encoding stage, and the video decoding end implements decoding by parsing the quantization parameters in the code stream. The quantization parameters occupy more resources in the code stream and affect the transmission efficiency.

Embodiments of the present invention provide a video decoding method, device and storage medium, which help save resources in the code stream and improve the transmission efficiency of the code stream.

In order to achieve the above objects, the embodiments of the present invention adopt the following technical solutions:

In a first aspect, embodiments of the present invention provide a video decoding method, which method is applied to a video decoding device or a chip of a video decoding device. The method includes: obtaining one or more rate control parameters of a current block in an image to be decoded. ; Determine the quantization parameter of the current block based on one or more code rate control parameters; decode the current block based on the quantization parameter of the current block.

Since quantization parameters occupy more resources in the code stream, they affect transmission efficiency. Therefore, using the video decoding method proposed by the present invention, the decoding end obtains the code rate control parameters, and calculates the quantization parameters through the code rate control parameters for decoding, thereby saving resources in the code stream and improving the efficiency of code stream transmission.

In a possible implementation, obtaining one or more rate control parameters of the current block in the image to be decoded includes: obtaining information of the image to be decoded, and the information of the image to be decoded includes basic information of the image to be decoded. and information of the image block in the image to be decoded; determining one or more rate control parameters of the current block based on part or all of the information of the image to be decoded.

This possible implementation provides a specific implementation method for obtaining rate control parameters. By obtaining the basic information of the image to be decoded and the information of the image blocks in the image to be decoded, the code rate used to generate the quantization parameters is calculated. control parameters. The calculation of quantitative parameters is completed through some features of the image.

In a possible implementation, the code rate control parameters include the resource adequacy of the current block, the complexity of the current block, the number of predicted bits of the current block, the average quantization parameter of the current block, and the change value of the quantization parameter of the current block; where , the average quantization parameter is used to characterize the average degree of quantization parameters of the decoded image blocks in the image to be decoded, and the resource adequacy refers to the adequacy of the resources used to store the current block in the resources used to store the image to be decoded. , complexity refers to the complexity of the decoded image block in the image to be decoded, the number of predicted bits refers to the estimated resources occupied by the current block after decoding, and the change value of the quantization parameter refers to the decoded image in the image to be decoded The changing value of the quantization parameter between blocks.

This possible implementation method provides a variety of code rate control parameters, and these various code rate control parameters can generate quantization parameters in different ways, improving the implementability of the solution.

In a possible implementation, determining the quantization parameters of the current block based on one or more code rate control parameters includes: obtaining the code rate control parameters of the decoded image block; determining based on the code rate control parameters of the decoded image block Quantization parameters of the current block.

This possible implementation provides a specific implementation method of generating quantization parameters based on code rate control parameters. The quantization parameters of the current block are determined through the code rate control parameters of the decoded image blocks, which helps to establish the relationship between image blocks. correlation.

In a possible implementation, determining the quantization parameter of the current block based on one or more code rate control parameters includes: obtaining the quantization parameter of the decoded image block; determining the quantization parameter of the current block based on the quantization parameter of the decoded image block. parameters.

This possible implementation provides a specific implementation method of generating quantization parameters based on code rate control parameters. The quantization parameters of the current block are determined through the quantization parameters of the decoded image blocks, which helps to establish correlation between image blocks. sex.

In a possible implementation, after obtaining the information of the image to be decoded, the method further includes: calculating the total number of bits of the current block based on the current block information. The total number of bits of the current block is the bits occupied by the current block after decoding. number; determine the number of available bits based on the total number of bits, the number of available bits is to store the decoded image data of the current block, and the number of available bits is used to determine one or more rate control parameters of the current block.

This possible implementation provides a specific implementation method for determining the rate control parameters based on the information of the image to be decoded. By calculating the number of available bits of the image block, it helps to improve the accuracy of the rate control parameters and improves Plan feasibility.

In one possible implementation, determining the number of available bits based on the total number of bits includes: removing other bits used to store non-image data from the total number of bits.

This possible implementation provides a specific implementation method for determining the number of available bits, in which the number of available bits for storing image data is determined by removing some of the other bits used to store non-image data, which is helpful. In order to improve the accuracy of code rate control parameters and improve the implementability of the solution.

In a possible implementation, the method further includes: initializing intermediate parameters, which are used to determine the quantization parameter of the current block in combination with one or more rate control parameters.

This possible implementation provides an initialization process for determining the intermediate parameters of the quantization parameters, which is helpful for the generation of the quantization parameters.

In a possible implementation, after determining the quantization parameter of the current block based on one or more code rate control parameters, the method further includes: modifying the quantization parameter based on the one or more code rate control parameters.

This possible implementation provides a method of correcting the quantization parameters after determining the quantization parameters, which helps to improve the quality of the decoded image.

In a possible implementation, after determining the quantization parameter according to the one or more rate control parameters, the method further includes: updating the one or more rate control parameters.

This possible implementation provides a method for updating the code rate control parameters, and adaptively adjusts the image blocks in the image to be decoded, which helps to improve the flexibility of the solution application.

In a second aspect, embodiments of the present invention provide a video decoding device, which has the function of implementing any of the video decoding methods in the first aspect. This function can be realized by hardware, or it can be realized by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

In a third aspect, a video decoding device is provided, including: a processor and a memory; the memory is used to store computer execution instructions, and when the video decoding device is running, the processor executes the computer execution instructions stored in the memory, So that the video decoding device performs the video decoding method in any one of the above-mentioned first aspects.

In a fourth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores instructions that, when run on a computer, enable the computer to execute any of the video decoding methods of the first aspect.

A fifth aspect provides a computer program product containing instructions that, when run on a computer, enables the computer to execute any of the video decoding methods of the first aspect.

A sixth aspect provides an electronic device. The electronic device includes a video decoding device, and the processing circuit is configured to perform the video decoding method in any one of the above-mentioned first aspects.

A seventh aspect provides a chip. The chip includes a processor. The processor is coupled to a memory. The memory stores program instructions. When the program instructions stored in the memory are executed by the processor, the video of any one of the above first aspects is realized. Decoding method.

The technical effects brought by any implementation method in the second to seventh aspects can be found in the technical effects brought by the corresponding implementation method in the first aspect, and will not be described again here.

,

,

,

,

:過程

,

,

,

,

:Process

0,1:Central processing unit (CPU)

10: Source device

100:Decoding device

1001: Get the module

1002: Confirm module

1003:Decoding module

101:Video source

102:Video encoder

103:Output interface

11:Destination device

111:Display device

112:Video decoder

113:Input interface

12:Link

13:Storage device

2: Parallel unit

20: Preprocessing module

201,202,301:summer

21,31: Prediction module

22:Transformation module

23:Quantization module

24:Entropy coding module

25,32: Anti-quantization module

26,33:Inverse transformation module

27,34: Reference image memory

30:Entropy decoding module

50: Codec device

501: Processor

502:Memory

503: Communication interface

504:Bus

S601, S602, S603, S901, S902, S903: steps

Figure 1 is a system architecture diagram of a coding and decoding system provided by an embodiment of the present invention;

Figure 2 is a schematic structural diagram of a video encoder provided by an embodiment of the present invention;

Figure 3 is a schematic structural diagram of a video decoder provided by an embodiment of the present invention;

Figure 4 is a schematic flow chart of video decoding provided by an embodiment of the present invention;

Figure 5 is a schematic structural diagram of a video decoder provided by an embodiment of the present invention;

Figure 6 is a flow chart of a video decoding method provided by an embodiment of the present invention;

Figure 7 is a schematic diagram of image block position information provided by an embodiment of the present invention;

Figure 8 is a schematic diagram of the sigmoid function provided by the embodiment of the present invention;

Figure 9 is a flow chart for determining parameter initialization provided by an embodiment of the present invention;

Figure 10 is a schematic structural diagram of an encoding device provided by an embodiment of the present invention.

In the description of the present invention, unless otherwise stated, "/" means "or". For example, A/B can mean A or B. "And/or" in this article is just an association relationship that describes related objects, indicating that there can be three kinds of relationships, for example, A and/or B, which can mean: A alone exists, A and B exist simultaneously, and B alone exists. condition. In addition, "at least one" means one or more, and "plurality" means two or more. Words such as "first" and "second" do not limit the quantity and order of execution, and words such as "first" and "second" do not limit the number or order of execution.

It should be noted that in the present invention, words such as “exemplary” or “for example” are used to represent examples, illustrations or explanations. Any embodiment or design described in the invention as "exemplary" or "such as" is not intended to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the words "exemplary" or "such as" is intended to present the concept in a concrete manner.

First, the technical terms involved in the embodiments of the present invention are introduced:

1. Video coding technology

Video sequences have a series of redundant information such as spatial redundancy, temporal redundancy, visual redundancy, information entropy redundancy, structural redundancy, knowledge redundancy, and importance redundancy. In order to remove redundant information in video sequences as much as possible and reduce the amount of data representing videos, video coding technology is proposed to achieve To reduce storage space and save transmission bandwidth. Video encoding technology is also called video compression technology.

Internationally, video compression coding standards include but are not limited to: Advanced Video Codec (Advanced Video Codec) Part 10 of the MPEG-2 and MPEG-4 standards developed by the Motion Picture Experts Group (MPEG). Video Coding (AVC), H.263, H.264 and H.265 (also known as High Efficiency Video Coding) formulated by the International Telecommunication Union-Telecommunication Standardization Sector (ITU-T) Coding, HEVC) standard).

It should be noted that in a coding algorithm based on a hybrid coding architecture, the above compression coding methods can be mixed and used.

The basic processing unit in the video compression encoding process is the image block, which is obtained by dividing a frame/image at the encoding end. Taking HEVC as an example, HEVC defines a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), and a Transform Unit (TU). CTU, CU, PU and TU can all be used as image blocks obtained after division. Both PU and TU are divided based on CU.

2. Video sampling

A pixel is the smallest complete sample of a video or image. Therefore, data processing of image blocks is based on pixels. Among them, each pixel records color information. For example, color can be represented by RGB, including three image channels, R represents red, G represents green, and B represents blue. For example, color can be represented by YUV, including Three image channels, Y represents luminance, U represents the first chromaticity Cb, and V represents the second chromaticity Cr. Since people are more sensitive to brightness than chroma, storage space can be reduced by storing more brightness and less chroma. Specifically, in video encoding and decoding, YUV format is usually used for video sampling, including 420 sampling format, 444 sampling format, etc. This sampling format determines the number of samples for two chroma based on the number of luma samples. For example, assuming a CU has 4×2 pixels in the following format:

[Y0,U0,V0][Y1,U1,V1][Y2,U2,V2][Y3,U3,V3]

[Y4, U4, V4] [Y5, U5, V5] [Y6, U6, V6] [Y7, U7, V7]

The 420 sampling format means that YUV is sampled in a 4:2:0 format, that is, the brightness and the first chroma or the second chroma are selected in a 4:2 ratio, where the first chroma and the second chroma are selected in alternate rows. Then the above-mentioned CU sampling selects the brightness Y0-Y3 of the first row, and the first chroma U0 and U2, and selects the brightness Y4-Y7 of the second row, and the second chroma V4 and V6. The CU is sampled and composed of a brightness coding unit and a chroma coding unit, where the brightness coding unit is:

[Y0][Y1][Y2][Y3]

[Y4][Y5][Y6][Y7]

The chroma coding unit is:

[U0][U2]

[V4][V6]

Similarly, the 444 sampling format means that YUV is sampled in a 4:4:4 format, that is, the brightness, first chroma and second chroma are selected in a 4:4:4 ratio. Then the sampled brightness coding unit of the above CU is:

[Y0][Y1][Y2][Y3]

[Y4][Y5][Y6][Y7]

The chroma coding unit is:

[U0,V0][U1,V1][U2,V2][U3,V3]

[U4,V4][U5,V5][U6,V6][U7,V7]

The above-sampled brightness coding unit and chroma coding unit are used as data units for subsequent coding processing.

The decoding method provided by the present invention is suitable for video encoding and decoding systems. Figure 1 shows the structure of a video encoding and decoding system.

As shown in FIG. 1 , the video coding and decoding system includes a source device 10 and a destination device 11 . The source device 10 generates encoded video data. The source device 10 may also be called a video encoding device or a video encoding device. The destination device 11 may decode the encoded video data generated by the source device 10. The destination device 11 also Can be called a video decoding device or video decoding device. Source device 10 and/or destination device 11 may include at least one processor and memory coupled to the at least one processor. The memory may include but is not limited to Read-Only Memory (ROM), Random Access Memory (RAM), Electronically Erasable Programmable Read -Only Memory, EEPROM), flash memory or any other media that can be used to store the required program code in the form of instructions or data structures that can be accessed by the computer, which is not specifically limited by the present invention.

Source device 10 and destination device 11 may include a variety of devices, including desktop computers, mobile computing devices, notebook (e.g., laptop) computers, tablet computers, set-top boxes, telephone handsets such as so-called "smart" phones. Computers, televisions, cameras, display devices, digital media players, video game consoles, in-vehicle computers or the like.

Destination device 11 may receive encoded video material from source device 10 via link 12 . Link 12 may include one or more media and/or devices capable of moving encoded video material from source device 10 to destination device 11 . In one example, link 12 may include one or more communication media that enables source device 10 to instantly transmit encoded video material directly to destination device 11 . In this example, the source device 10 can modulate the encoded video material according to a communication standard (eg, a wireless communication protocol), and can transmit the modulated video material to the destination device 11 . The one or more communication media mentioned above may include wireless and/or wired communication media, such as: radio frequency (Radio Frequency, RF) spectrum, one or more physical transmission lines. The above one or more communication media may form part of a packet-based network, such as a local area network, a wide area network, or a global network (eg, the Internet). The above-mentioned one or more communication media may include routers, switches, base stations, or other devices that implement communication from the source device 10 to the destination device 11 .

In another example, the encoded video data can be output from the output interface 103 to storage device 13. Similarly, the encoded video data can be accessed from the storage device 13 through the input interface 113 . The storage device 13 may include a variety of local access data storage media, such as Blu-ray Disc, Digital Video Disc (DVD), Compact Disc Read-Only Memory (CD-ROM), and flash memory. media, or other suitable digital storage media for storing encoded video material.

In another example, storage device 13 may correspond to a file server or another intermediate storage device that stores encoded video data generated by source device 10 . In this example, the destination device 11 may obtain its stored video material from the storage device 13 via data streaming or downloading. The file server may be any type of server capable of storing encoded video data and transmitting the encoded video data to destination device 11 . For example, file servers may include World Wide Web (Web) servers (for example, used for websites), File Transfer Protocol (FTP) servers, Network Attached Storage (NAS) ) device and the local drive.

Destination device 11 can access the encoded video data through any standard data connection (eg, an Internet connection). Instance types of data connections include wireless channels, wired connections (eg, cable modems, etc.), or a combination of both, suitable for accessing encoded video data stored on a file server. The encoded video data can be transmitted from the file server by streaming, downloading, or a combination of the two.

The decoding method of the present invention is not limited to wireless application scenarios. For example, the decoding method of the present invention can be applied to video codecs that support the following multimedia applications: over-the-air TV broadcasting, cable TV transmission, satellite TV transmission, data stream video transmission ( For example, via the Internet), encoding of video data stored on a data storage medium, decoding of video data stored on a data storage medium, or other applications. In some examples, the video codec system may be configured to support one-way or two-way video transmission to support applications such as video streaming, video playback, video broadcasting, and/or video telephony.

It should be noted that the video coding and decoding system shown in FIG. 1 is only an example of the video coding and decoding system, and does not limit the video coding and decoding system in the present invention. The encoding and decoding method provided by the present invention can also be applied to scenarios where there is no data communication between the encoding device and the decoding device. In its In this example, the video data to be encoded or the encoded video data can be retrieved from the local storage area or streamed on the network. The video encoding device can encode the video data to be encoded and store the encoded video data in the memory. The video decoding device can also obtain the encoded video data from the memory and decode the encoded video data.

In FIG. 1, source device 10 includes video source 101, video encoder 102, and output interface 103. In some examples, output interface 103 may include a modulator/demodulator (modem) and/or a transmitter. Video source 101 may include a video capture device (e.g., a camera), a video archive containing previously captured video material, a video input interface for receiving video material from a video content provider, and/or computer graphics for generating video material. system, or a combination of these sources of video material.

Video encoder 102 may encode video material from video source 101. In some examples, the source device 10 transmits the encoded video data directly to the destination device 11 via the output interface 103 . In other examples, the encoded video material can also be stored on the storage device 13 for later access by the destination device 11 for decoding and/or playing.

In the example of FIG. 1 , the destination device 11 includes a display device 111 , a video decoder 112 and an input interface 113 . In some examples, input interface 113 includes a receiver and/or modem. The input interface 113 may receive encoded video data via the link 12 and/or from the storage device 13 . Display device 111 may be integrated with destination device 11 or may be external to destination device 11 . Generally speaking, the display device 111 displays the decoded video material. The display device 111 may include a variety of display devices, such as a liquid crystal display, a plasma display, an organic light emitting diode display, or other types of display devices.

Optionally, video encoder 102 and video decoder 112 may each be integrated with an audio encoder and decoder, and may include appropriate multiplexer-demultiplexer units or other hardware and software to process common data. Encoding of both audio and video in the process or in separate data streams.

The video encoder 102 and the video decoder 112 may include a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), or a field programmable logic gate array. (Field Programmable Gate Array, FPGA), discrete logic circuits, hardware, or any combination thereof. If the decoding method provided by the present invention is implemented by software, the instructions for the software can be stored in a suitable non-volatile computer-readable storage medium, and at least one processor can be used to execute the instructions to implement the present invention.

The video encoder 102 and the video decoder 112 in the present invention may operate according to a video compression standard (such as HEVC) or other industry standards, which are not specifically limited by the present invention.

FIG. 2 is a schematic block diagram of the video encoder 102 in the embodiment of the present invention. The video encoder 102 may perform prediction, transformation, quantization and entropy coding processes in the prediction module 21, the transformation module 22, the quantization module 23 and the entropy coding module 24 respectively. The video encoder 102 also includes a preprocessing module 20 and a summer 202, where the preprocessing module 20 includes a segmentation module and a code rate control module. For video block reconstruction, the video encoder 102 also includes an inverse quantization module 25, an inverse transform module 26, a summer 201 and a reference image memory 27.

As shown in Figure 2, video encoder 102 receives video data, and a segmentation module in pre-processing module 20 segments the data into original blocks. This partitioning may also include partitioning into slices, image blocks, or other larger units, and video block partitioning, for example, based on a quadtree structure of a Largest Coding Unit (LCU) and a CU. Illustratively, video encoder 102 encodes components of video blocks within a video slice to be encoded. Generally, a slice may be divided into a plurality of primitive blocks (and possibly into a collection of primitive blocks called image blocks). The sizes of CU, PU and TU are usually determined in the partition module.

The code rate control module in the preprocessing module 20 obtains the sizes of CU, PU and TU, as well as the input parameters of the video data, where the input parameters include the resolution, format, and bits of the image in the video data. Width and input pixel depth (bits per pixel, bpp); target bpp. The code rate control module generates code rate control parameters according to the input parameters and the image block size. The code rate control parameters are used to generate quantization parameters so that the quantization module 23 and the inverse quantization module 25 perform related calculations. The code rate control module can also update the code rate control parameters based on the reconstructed block obtained by the summer 201.

The prediction module 21 may provide the prediction block to the summer 202 to generate a residual block, and provide the prediction block to the summer 201 for reconstruction to obtain a reconstruction block, which is used as a reference pixel for subsequent prediction. The video encoder 102 forms a pixel difference value by subtracting the pixel value of the prediction block from the pixel value of the original block. The pixel difference value constitutes a residual block. The data in the residual block may include a brightness difference and a chroma difference. . Summer 201 represents one or more components that perform this addition operation. The prediction module 21 may also send relevant syntax elements to the entropy encoding module 24 for merging the syntax elements into the code stream.

The transformation module 22 may divide the residual block into one or more TUs for transformation. Transform module 22 may transform the residual block from the pixel domain to the transform domain (eg, frequency domain). For example, a discrete cosine transform (Discrete Cosine Transform, DCT) or a discrete sine transform (Discrete Sine Transform, DST) is used to transform the residual block to obtain the transform coefficient. Transform module 22 may send the resulting transform coefficients to quantization module 23.

The quantization module 23 quantizes the transform coefficients to further reduce the code rate to obtain quantized coefficients. The quantization process can reduce the bit depth associated with some or all of the coefficients. The degree of quantization can be modified by adjusting the quantization parameters. In some possible implementations, quantization module 23 may then perform a scan of the matrix containing the quantized transform coefficients. Alternatively, entropy encoding module 24 may perform scanning.

After quantization, entropy encoding module 24 may entropy encode the quantized coefficients. For example, the entropy coding module 24 can execute context-based (or previously referenced) adaptive variable length coding (Context-Based Adaptive Variable-Length Coding, CAVLC), previously referenced adaptive arithmetic coding (Context-based Adaptive Binary Arithmetic). Coding (CABAC), Syntax-Based Context-Adaptive Binary Arithmetic Coding (SBAC), Probability Interval Partitioning Entropy (PIPE) decoding or other entropy coding methods or technologies . After entropy encoding by entropy encoding module 24, the encoded codestream may be transmitted to video decoder 112 or archived for later transmission or retrieval by video decoder 112.

The inverse quantization module 25 and the inverse transform module 26 apply inverse quantization and inverse transform respectively, and the summer 201 adds the inversely transformed residual block and the predicted residual block to generate a reconstruction block. The reconstructed block is used as a reference pixel for subsequent original blocks for prediction. The reconstructed block is stored in the reference image memory 27 .

FIG. 3 is a schematic structural diagram of the video decoder 112 in an embodiment of the present invention. As shown in FIG. 3 , the video decoder 112 includes an entropy decoding module 30 , a prediction module 31 , an inverse quantization module 32 , an inverse transform module 33 , a summer 301 and a reference image memory 34 . Among them, the entropy decoding module 30 includes an analysis module and a code rate control module. In some possible implementations, video decoder 112 may perform an exemplary reciprocal decoding process to the encoding process described with respect to video encoder 102 from FIG. 2 .

During the decoding process, video decoder 112 receives a codestream of encoded video from video encoder 102 . The parsing module in the entropy decoding module 30 of the video decoder 112 entropy decodes the code stream to generate quantization coefficients and syntax elements. Entropy decoding module 30 passes the syntax elements to prediction module 31. Video decoder 112 may receive syntax elements at the video slice level and/or the video block level.

The code rate control module in the entropy decoding module 30 generates code rate control parameters based on the information of the image to be decoded obtained by the analysis module. The code rate control parameters are used to generate quantization parameters to enable the inverse quantization module 32 to perform correlation calculate. The code rate control module can also update the code rate control parameters based on the reconstructed block obtained by the summer 301.

The inverse quantization module 32 performs inverse quantization (eg, dequantization) on the quantization coefficients provided in the code stream and decoded by the entropy decoding module 30 and the generated quantization parameters. The inverse quantization process may include determining the degree of quantization using quantization parameters calculated by video encoder 102 for each video block in the video slice, and likewise determining the degree of inverse quantization applied. The inverse transform module 33 applies the inverse transform (for example, the inverse transform method corresponding to DCT, DST and other transform methods) to the inverse quantized transform coefficients, and uses the inverse transform coefficients to generate inverse transforms in the pixel domain according to the inverse transform unit. The final residual block. Among them, the size of the inverse transformation unit is the same as the size of the TU, and the inverse transformation method and the transformation method adopt the corresponding forward transformation and inverse transformation in the same transformation method. For example, the inverse transformation of DCT and DST is inverse DCT, inverse DST or conceptually Similar inverse transformation process.

After the prediction module 31 generates the prediction block, the video decoder 112 inverts the The decoded video block is formed by summing the inverse-transformed residual block of transform group 33 with the prediction block. Summer 301 represents one or more components that perform this summation operation. When necessary, a deblocking filter may also be applied to filter the decoded blocks in order to remove blocking artifacts. Decoded visual blocks in a given frame or image are stored in reference image memory 34 as reference pixels for subsequent predictions.

至過程

，過程

至過程

可以由上述的源裝置10、視頻編碼器102、目的裝置11或視頻解碼器112中的任意一個或多個執行。 The present invention provides a possible video encoding/decoding implementation, as shown in Figure 4. Figure 4 is a schematic flow chart of a video encoding/decoding provided by the present invention. The video encoding/decoding implementation includes a process

to process

,Process

to process

It may be executed by any one or more of the above-mentioned source device 10, video encoder 102, destination device 11 or video decoder 112.

：將一幀圖像分成一個或多個互相不重疊的並行單元。該一個或多個並行單元間無依賴關係，可完全並行/獨立編碼和解碼，如圖4所示出的並行單元1和並行單元2。 Process

: Divide a frame of image into one or more parallel units that do not overlap with each other. There is no dependency between the one or more parallel units, and they can be fully parallel/independently encoded and decoded, as shown in Figure 4 as parallel unit 1 and parallel unit 2.

：對於每個並行單元，可再將其分成一個或多個互相不重疊的獨立單元，各個獨立單元間可相互不依賴，但可以共用一些並行單元頭資訊。 Process

: For each parallel unit, it can be divided into one or more independent units that do not overlap with each other. The independent units may not depend on each other, but they can share some parallel unit header information.

The independent unit may include three components of brightness Y, first chromaticity Cb, and second chromaticity Cr, or three components of RGB, or may include only one of the components. If the independent unit contains three components, the sizes of the three components can be exactly the same or different, depending on the input format of the image.

：對於每個獨立單元，可再將其分成一個或多個互相不重疊的編碼單元，獨立單元內的各個編碼單元可相互依賴，如多個編碼單元可以進行相互參考預編解碼。 Process

: For each independent unit, it can be divided into one or more coding units that do not overlap with each other. Each coding unit within the independent unit can be dependent on each other. For example, multiple coding units can perform mutual reference precoding and decoding.

所述的所有尺寸。 If the coding unit is the same size as the independent unit (that is, the independent unit is only divided into one coding unit), its size can be

All sizes stated.

The coding unit may include three components of brightness Y, first chroma Cb, and second chroma Cr (or three RGB components), or may include only one of the components. If it contains three components, the sizes of the components can be exactly the same or different, depending on the image input. Format related.

是視頻編解碼方法中一個可選的步驟，視頻編/解碼器可以對過程

獲得的獨立單元進行殘差係數(或殘差值)進行編/解碼。 It is worth noting that the process

It is an optional step in the video encoding and decoding method. The video encoding/decoder can

The obtained independent unit performs encoding/decoding on the residual coefficients (or residual values).

：對於編碼單元，可以將其可再將其分成一個或多個互相不重疊的預測組(Prediction Group，PG)，PG也可簡稱為Group，各個PG按照選定預測模式進行編解碼，得到PG的預測值，組成整個編碼單元的預測值，基於預測值和編碼單元的原始值，獲得編碼單元的殘差值。 Process

: For the coding unit, it can be divided into one or more non-overlapping prediction groups (PG). PG can also be referred to as Group. Each PG is encoded and decoded according to the selected prediction mode to obtain the PG The predicted value constitutes the predicted value of the entire coding unit. Based on the predicted value and the original value of the coding unit, the residual value of the coding unit is obtained.

：基於編碼單元的殘差值，對編碼單元進行分組，獲得一個或多個相不重疊的殘差小塊(Residual Block，RB)，各個RB的殘差係數按照選定模式進行編解碼，形成殘差係數流。具體的，可分為對殘差係數進行變換和不進行變換兩類。 Process

: Based on the residual value of the coding unit, the coding units are grouped to obtain one or more non-overlapping residual blocks (RB). The residual coefficients of each RB are encoded and decoded according to the selected mode to form a residual block. Differential coefficient flow. Specifically, it can be divided into two categories: transforming the residual coefficients and not transforming them.

中殘差係數編解碼方法的選定模式可以包括，但不限於下述任一種：半定長編碼方式、指數哥倫布(Golomb)編碼方法、Golomb-Rice編碼方法、截斷一元碼編碼方法、游程編碼方法、直接編碼原始殘差值等。 Among them, the process

The selected mode of the residual coefficient encoding and decoding method may include, but is not limited to any of the following: semi-fixed length encoding method, exponential Golomb encoding method, Golomb-Rice encoding method, truncated unary code encoding method, run-length encoding method , directly encoding the original residual value, etc.

For example, the video encoder may directly encode the coefficients within the RB. As another example, the video encoder can also transform the residual block, such as DCT, DST, Hadamard transform, etc., and then encode the transformed coefficients.

As a possible example, when the RB is small, the video encoder can directly quantize each coefficient in the RB uniformly, and then perform binary encoding. If the RB is large, it can be further divided into multiple coefficient groups (CG), and then each CG can be uniformly quantized and then binary encoded. In some embodiments of the invention, the coefficient group (CG) and the quantization group (QG) may be the same.

The following is an exemplary description of the residual coefficient coding part using semi-fixed length coding. First, the maximum value of the absolute value of the residual within an RB block is defined as the modified maximum (mm). Secondly, determine the coding bits of the residual coefficient in the RB block number (the number of coding bits of the residual coefficient in the same RB block is consistent). For example, if the critical limit (CL) of the current RB block is 2 and the current residual coefficient is 1, then 2 bits are needed to encode the residual coefficient 1, which is expressed as 01. If the CL of the current RB block is 7, it means encoding an 8-bit residual coefficient and a 1-bit sign bit. The determination of CL is to find the minimum M value that satisfies all residuals of the current sub-block to be within the range of [-2^(M-1), 2^(M-1)]. If there are two boundary values -2^(M-1) and 2^(M-1) at the same time, M should be increased by 1, that is, M+1 bits are needed to encode all the residuals of the current RB block; if there are only - One of the two boundary values 2^(M-1) and 2^(M-1), you need to encode a Trailing bit to determine whether the boundary value is -2^(M-1) or 2^(M-1 ); If none of -2^(M-1) and 2^(M-1) exists in all residuals, there is no need to encode the Trailing bit.

In addition, for some special cases, the video encoder can also directly encode the original value of the image instead of the residual value.

The above-mentioned video encoder 102 and video decoder 112 can also be implemented in another implementation form, for example, using a general-purpose digital processor system, such as the codec device 50 shown in Figure 5. The codec device 50 can be the above-mentioned codec device 50. Some or all of the devices in the video encoder 102 may also be some or all of the devices in the video decoder 112 described above.

The codec device 50 may be applied to the encoding side or the decoding side. The encoding and decoding device 50 includes a processor 501 and a memory 502. The processor 501 is connected to the memory 502 (eg, connected to each other through a bus 504). Optionally, the encoding and decoding device 50 may also include a communication interface 503, which is connected to the processor 501 and the memory 502 for receiving/sending data.

The memory 502 can be a random access memory (Random Access Memory, RAM), a read-only memory (Read-Only Memory, ROM), an erasable programmable read-only memory (Erasable Programmable Read Only Memory, EPROM) or Compact Disc Read-Only Memory (CD-ROM). The memory 502 is used to store relevant program codes and video data.

The processor 501 may be one or more central processing units (Central Processing Units, CPUs), such as CPU 0 and CPU 1 shown in FIG. 5 . The processor 501 is a In the case of a CPU, the CPU can be a single-core CPU or a multi-core CPU.

The processor 501 is used to read the program code stored in the memory 502 and perform operations corresponding to any one of the implementations and various feasible implementations corresponding to FIG. 6 .

The decoding method provided by the present invention will be described in detail below with reference to the above-mentioned video encoding and decoding system shown in FIG. 1 , the video encoder 102 shown in FIG. 2 , and the video decoder 112 shown in FIG. 3 .

As shown in Figure 6, it is a flow chart of a video decoding method provided by the present invention. The method includes the following steps.

Step S601: The video decoder obtains one or more rate control parameters of the current block in the image to be decoded. The image to be decoded is composed of multiple image blocks, and the current block is any one of the multiple image blocks. Among them, the code rate control parameters are used to generate quantization parameters, and the quantization parameters are used in the inverse quantization process in the decoding process, as described above for the inverse quantization module 32 in FIG. 3 . The code rate control parameters include the resource adequacy of the current block, the complexity of the current block, the number of predicted bits of the current block, the average quantization parameter of the current block, and the change value of the quantization parameter. The resource adequacy refers to the adequacy of the resources used to store the current block among the resources used to store the image to be decoded. The complexity of the current block refers to the complexity of the decoded image blocks in the image to be decoded. The predicted number of bits of the current block refers to the estimated resources occupied by the current block after decoding. The average quantization parameter of the current block is used to characterize the average degree of the quantization parameter of the decoded image block in the image to be decoded. The change value of the quantization parameter refers to the change value of the quantization parameter between decoded image blocks in the image to be decoded.

Optionally, before step S601, the method also includes: the video decoder obtains information of the image to be decoded, where the information of the image to be decoded includes basic information of the image to be decoded and image blocks in the image to be decoded. information. Among them, basic information includes one or more of the following information.

The resolution of the image to be decoded is used to represent the number of pixels contained in the image to be decoded, which is usually composed of horizontal pixels and vertical pixels. For example, 640×480 means that the horizontal pixels are 640 units and the vertical pixels are 480 units. The resolution of the image is 307,200 pixels, which can also be expressed as 300,000 pixels.

The format of the image to be decoded refers to the sampling format of the image to be decoded. Please refer to the above Describes video sampling.

The bit width of the image to be decoded refers to the depth of each pixel used to store the image to be decoded. For example, each pixel of a color image is represented by three components: R, G, and B. If each component is represented by 8 bits, then one pixel is represented by a total of 24 bits, which means that the depth of the pixel is 24.

The information of the image blocks in the image to be decoded includes one or more of the following information.

The input pixel depth (bpp) of the image to be decoded refers to the depth of each pixel of the image to be decoded. For example, it is expected that the image will be transmitted in the code stream with each pixel occupying 18 bits. If the image is represented by RGB three components, each component will occupy 6 bits. Compared with the above bit width used to store the image Save 2 bits. It should be noted that bpp is usually less than or equal to the bit width. The bpp is usually determined during the encoding stage and written into the code stream for the decoder to obtain.

The size information (block_size) of the image blocks in the image to be decoded, where the sizes of the image blocks can be the same or different. Correspondingly, the size information of all image blocks in the image to be decoded can also be calculated based on this information, or It is obtained directly from the code stream, and the present invention does not limit this. Regarding the size information of the image block, please refer to the above description of Figure 2, such as one or more sizes of CU, PU, and TU, which may be other sizes such as 8×8, 16×8, etc.

The position information of the current block refers to the position information of the current block in the image to be encoded. As shown in Figure 7, the size of the image to be encoded is 8×4 and is divided according to the image block size of 2×2, which can be divided into 8 small blocks. Assume that the shaded part in the figure is the current block, then the current block The position in the image to be encoded can be expressed in the form of coordinates as (1, 1).

The reconstructed image block, which can also be called a reconstruction block, refers to an image block formed by multiple pixels obtained by reconstructing the inverse-transformed residual block and the predicted residual block. The reconstruction block shown in Figure 3 .

Among them, according to the above basic information and the information of each image block, at least the resources of the image to be decoded and the resources occupied by each image block in the image to be decoded can be obtained. The resources can be obtained through some or all of the following information: Represents: the remaining bits of the current block (remain_bits), which refers to the resources that store the image to be decoded that are not occupied by the decoded image block. bit resources;

The number of remaining blocks (remain_blocks) of the current block refers to the number of undecoded image blocks in the image to be decoded;

The actual number of bits refers to the bit resources occupied by each decoded image block in the resource that stores the image to be decoded.

It should be noted that the above-mentioned method of obtaining the information of the image to be decoded is well known to those skilled in the art. For example, a video decoder can obtain the basic information of the image to be decoded by obtaining the header information of the code stream. The basic information It refers to the format, resolution, size and other information of the image file. The code stream also includes information about the image blocks in the image to be decoded, such as the size of the image blocks and bpp information.

The video decoder determines the rate control parameters based on part or all of the information of the image to be decoded. Specifically, the following five situations are included.

Case 1: The video decoder determines the resource sufficiency of the current block based on the information of the image to be decoded.

1) The video decoder determines resource adequacy based on the number of remaining bits (remain_bits), the number of remaining blocks (remain_blocks), the size information of the current block (block_size), and the input pixel depth bpp.

If (remain_bits/remain_blocks)>block_size×bpp×M, it means that the resources are sufficient; if (remain_bits/remain_blocks)<block_size×bpp×N, it means that the resources are insufficient; where, M>N>0.

2) The video decoder determines resource adequacy based on the number of remaining bits, the number of remaining blocks, and the location information of the current block.

Specifically, the video decoder determines the position of the current block in the image to be decoded, and further determines the position of the current block in the parallel unit in the image to be decoded. The parallel unit may be a slice and/or group processing unit. Specifically, if the current block is in the first 1/n position of the parallel unit, then the first weight coefficient w1 is set to 1+a; if the current block is in the middle 1/n position of the parallel unit, Then set w1 to 1; if the current block is at the last 1/n position of the parallel unit, set w1 to 1-a, where 0<a<1.

Optionally, a increases as the distance between the front 1/n and the back 1/n increases relative to the middle 1/n. By changing the value of a, the corresponding first weight coefficient is adjusted.

sufficiency=w1×(remain_bits/remain_blocks).

It can be understood that the parallel units are different and the first weight coefficients are different. When considering the position of the current block in the slice in the image to be decoded and the position of the group processing unit at the same time, the video decoder can multiply the weight coefficients of the respective parallel units. as the first weight coefficient.

Case 2: The video decoder determines the complexity of the current block based on the reconstructed image block in the information of the decoded image block.

1) Transform coefficient weighting method.

n

已解碼圖像塊的個數。已解碼圖像塊的個數可以通過解析碼流獲取，或者根據剩餘塊個數與待解碼圖像的圖像塊個數進行計算得到。其中，變換方法可以為DCT變換、Hadamard變換或DST變換。 Specifically, the video decoder weights the transform coefficients of the previous n reconstructed blocks of the current block, 1

n

The number of decoded image blocks. The number of decoded image blocks can be obtained by parsing the code stream, or calculated based on the number of remaining blocks and the number of image blocks of the image to be decoded. Among them, the transformation method can be DCT transformation, Hadamard transformation or DST transformation.

Among them, C _i represents the transformation coefficient of the i-th reconstruction block, _{and Wi} represents the weight coefficient of the transformation coefficient of the i-th reconstruction block. For example, in the DCT transformation, DC coefficients and AC coefficients are included. The DC coefficient represents the transformation coefficient of the first image block in the decoded image block, and the AC coefficient represents the transformation of other image blocks in the decoded image block. coefficient. For example, when n is the number of decoded image blocks, the weight coefficient of the DC coefficient is set to 0, and the weight coefficient of other AC coefficients is set to 1. The above selection method helps simplify the calculation process.

It should be noted that the present invention does not limit the selection method of n. For example, n is a preset fixed value, or n can refer to the above-mentioned resource adequacy. When resources are sufficient, n takes a smaller value. When resources are insufficient, n takes a smaller value. The value is larger.

n

已解碼圖像塊的個數。 2) The video decoder takes the variance of the pixel values of the first n reconstructed blocks of the current block as the complexity, where, 1

n

The number of decoded image blocks.

3)Gradient weighting method

n

已解碼圖像塊的個數。 Specifically, the video decoder is weighted according to the gradient of the previous n reconstructed blocks of the current block, 1

n

The number of decoded image blocks.

Horizontal gradient x = reconstruction of column t - reconstruction of column t-1;

Vertical gradient y = sth row reconstruction - s-1th row reconstruction;

Horizontal complexity (complexity1) = sum of horizontal gradients (gradx)/grad_block_size;

Vertical complexity (complexity2) = sum of vertical gradients (grady)/grad_block_size;

x

重建塊的總列數，0

y

重建塊的總行數，第t列重建-第t-1列重建表示第t列和第t-1列對應位置的樣本的值兩兩相減，第s行重建-第s-1行重建表示第s行和第s-1行對應位置的樣本的值兩兩相減，grad_block_size是計算梯度重建塊中涉及到的像素點的個數。例如，當前重建塊為4×2，水平複雜度中的grad_block_size為3×2=6(水平方向減少一行)，垂直複雜度中的grad_block_size為4×1=4(垂直方向減少一列)。 Among them, 0

x

The total number of columns in the reconstruction block, 0

y

The total number of rows of the reconstruction block, the tth column reconstruction - the t-1th column reconstruction means that the values of the samples at the corresponding positions in the tth column and the t-1th column are subtracted, the sth row reconstruction - the s-1th row reconstruction means The values of the samples at the corresponding positions in row s and row s-1 are subtracted. grad_block_size is the number of pixels involved in calculating the gradient reconstruction block. For example, the current reconstruction block is 4×2, the grad_block_size in the horizontal complexity is 3×2=6 (reduce one row in the horizontal direction), and the grad_block_size in the vertical complexity is 4×1=4 (reduce one column in the vertical direction).

4) Sharpening weighting method

n

已解碼圖像塊的個數。常見的銳化演算法包括Robert、Prewitt、Sobel、Laplacian和Kirsch。 Specifically, the video decoder performs sharpening based on the first n reconstructed blocks of the current block and weights the sharpening results. Among them, 1

n

The number of decoded image blocks. Common sharpening algorithms include Robert, Prewitt, Sobel, Laplacian and Kirsch.

complexity1=A1×P;

complexity2=A2×P;

complexity=| complexity1|+| complexity2|;

Among them, P represents all pixel values of the reconstruction block, A1 and A2 respectively represent the horizontal and vertical operands of any of the above-mentioned sharpening algorithms, and A1×P represents the application of the A1 operand on P.

Case 3: The video decoder determines the prediction of the current block based on the information of the image to be decoded. Number of measured bits (pred_bits).

1) The video decoder obtains the number of predicted bits based on the number of remaining bits and the number of remaining blocks.

pred_bits=remain_bits/remain_blocks.

2) The video decoder weights the number of predicted bits according to the actual number of bits (real_bits) of the decoded image block.

n

已解碼圖像塊的個數。 Specifically, the video decoder is weighted according to the actual number of bits of the first n decoded image blocks, 1

n

The number of decoded image blocks.

pred_bits=B1×real_bits1+B2×real_bits2+……+Bn×real_bitsn;

Among them, B1, B2,..., Bn are all greater than 0, and B1+B2+...+Bn=1.

Optionally, on the basis of determining at least one rate control parameter through the information of the image to be encoded, other rate control parameters can also be calculated based on at least one rate control parameter. Specifically, the following three situations are included:

Scenario 1. The video decoder determines resource adequacy based on the number of predicted bits and complexity.

1) The video decoder determines resource adequacy based on the information of the current block (number of remaining bits, number of remaining blocks) and the number of predicted bits.

If (remain_bits/remain_blocks)>1+a×pred_bits, it means that the resources are sufficient;

1-a×pred_bits，則表示資源不足； if(remain_bits/remain_blocks)

1-a×pred_bits means insufficient resources;

Among them, 0<a<1.

n

已解碼圖像塊的個數。 2) The video decoder determines resource adequacy based on the complexity and number of predicted bits of the current block, as well as the maximum complexity (max_complexity) of the first n decoded image blocks, combined with the size information of the current block and the input pixel depth. Among them, 1

n

The number of decoded image blocks.

If complexity/max_complexity×C×block_size×bpp<pred_bits, it means that the resources are sufficient;

If complexity/max_complexity×C×block_size×bpp>pred_bits, it means insufficient resources.

Among them, C>1.

Scenario 2. The video decoder determines the complexity based on the number of predicted bits and resource abundance.

1) Complexity weighting method

n

已解碼圖像塊的個數； The video decoder is weighted based on the complexity of the first n decoded image blocks, 1

n

The number of decoded image blocks;

complexity=D1×complexity1+D2×complexity2+……+Dn×complexityn

Among them, D1, D2,..., Dn are all greater than 0, and D1+D2+...+Dn=1.

n

已解碼圖像塊的個數。 2) The video decoder determines the complexity of the current block based on the complexity of the previous n decoded image blocks (pre_complexity) and the position information of the current block. Among them, 1

n

The number of decoded image blocks.

Specifically, the video decoder determines the position of the current block in the image to be decoded, and further determines the position of the current block in the parallel unit in the image to be decoded. The parallel unit may be a slice and/or group processing unit. If the current block is in the first 1/n position of the parallel unit, set the second weight coefficient w2 to 1+a; if the current block is in the middle 1/n position of the parallel unit, set w2 to 1; if the current block is in the middle 1/n position of the parallel unit, set w2 to 1 If the block is at the last 1/n position of the parallel unit, then w2 is set to 1-a, where 0<a<1.

Optionally, a increases as the distance between the front 1/n and the back 1/n increases relative to the middle 1/n. By changing the value of a, the corresponding second weight coefficient is adjusted.

complexity=w2×pre_complexity;

It can be understood that the parallel units are different and the second weight coefficients are different. When considering both the position of the slice of the current block in the image to be decoded and the position of the group processing unit, the video decoder can use the product of the respective weight coefficients as the third Two weight coefficients.

3) The video decoder determines based on the number of predicted bits (pre_pred_bits) of the first n decoded image blocks, the resource sufficiency (pre_sufficiency) of the first n decoded image blocks, and the number of predicted bits and resource sufficiency of the current block. The complexity of the current block.

If pred_bits>pre_pred_bits and sufficiency>pre_sufficiency is considered to have low complexity;

If pred_bits<pre_pred_bits and sufficiency<pre_sufficiency is considered to be complex.

Scenario 3. The video decoder determines the number of predicted bits based on resource abundance and complexity.

n

已解碼圖像塊的個數。 1) The video decoder weights the predicted bit numbers of the previous n decoded image blocks to obtain the predicted bit number of the current block, 1

n

The number of decoded image blocks.

pred_bits=E1×pred_bits1+E2×pred_bits2+……+En×pred_bitsn;

Among them, E1, E2,..., En are all greater than 0, and E1+E2+...+En=1.

n

已解碼圖像塊的個數。 2) The video decoder weights the predicted bit number of the previous n decoded image blocks and the actual bit number to obtain the predicted bit number of the current block, 1

n

The number of decoded image blocks.

pred_bits=F1×pred_bits1+……+Fn×pred_bitsn+G1×real_bits1+……+Gn×real_bitsn

Among them, F1,...,Fn,G1,...,Gn are all greater than 0, and F1+...+Fn+G1+...+Gn=1.

n

已解碼圖像塊的個數。其中，pre_complexity為可變值，以滿足以下公式的計算： 3) The video decoder weights the current block based on the overall complexity of the first n decoded image blocks (pre_complexity), the number of predicted bits of the first n decoded image blocks (pre_pred_bits), and the complexity of the current block (complexity). Number of predicted bits for the block, 1

n

The number of decoded image blocks. Among them, pre_complexity is a variable value to satisfy the calculation of the following formula:

pred_bits=clip(complexity/pre_complexity,1-a,1+a)×pre_pred_bits;

Among them, clip(complexity/pre_complexity, 1-a, 1+a) means adjusting pre_complexity so that the value of complexity/pre_complexity is within the interval range of (1-a, 1+a), 0<a<1.

It should be noted that pre_complexity can be the average complexity of the first n decoded image blocks; or, it can be any complexity of the first n decoded image blocks; or, it can be the first n decoded images. The maximum complexity of the block and other coefficients that represent the overall complexity.

n

已解碼圖像塊的個數。其中，pre_complexity為可變值，以滿足以下公式的計算； 4) The video decoder obtains the predicted number of bits of the current block based on the overall complexity of the previous n decoded image blocks, the actual number of bits, and the complexity of the current block, 1

n

The number of decoded image blocks. Among them, pre_complexity is a variable value to satisfy the calculation of the following formula;

pred_bits=clip(complexity/pre_complexity,1-a,1+a)×real_bits;

The value of the correlation coefficient is the same as 3) above, and will not be described again here.

n

已解碼圖像塊的個數。 5) The video decoder obtains the empirical value based on the position information, the complexity of the current block, and the predicted bit number of the previous n decoded image blocks to obtain the predicted bit number of the current block, 1

n

The number of decoded image blocks.

Specifically, the video decoder determines the position of the current block in the image to be decoded, and further determines the position of the current block in the parallel unit in the image to be decoded. The parallel unit may be a slice and/or group processing unit. Specifically, if the current block is in the first 1/n position of the parallel unit and the complexity is less than the first preset complexity, then the third weight coefficient w3 is set to 1+a; if the current block is in the middle 1 of the parallel unit /n position, then set w3 to 1; if the current block is at the last 1/n position of the parallel unit and the complexity is greater than the second preset complexity, then set w3 to 1-a, where 0<a< 1. The first preset complexity is smaller than the second preset complexity. For example, a is 0.2, the first preset complexity is 2000, and the second preset complexity is 10000.

Optionally, a increases as the distance between the front 1/n and the back 1/n increases relative to the middle 1/n. By changing the value of a, the corresponding third weight coefficient is adjusted.

It can be understood that the parallel units are different and the third weight coefficient is different. When considering both the position of the slice of the current block in the image to be decoded and the position of the group processing unit, video decoding The device may use the product of respective weight coefficients as the third weight coefficient.

Through the above three scenarios, utilizing the correlation between code rate control parameters can help improve the implementability of the solution.

Case 4: The video decoder determines the average quantization parameter (average_quantization) based on the information of the image to be decoded.

n

已解碼圖像塊的個數，獲取前n個已解碼圖像塊的量化參數可參考下文步驟S602的描述。 Optionally, the video decoder uses any of the above three situations to obtain the quantization parameters of the first n decoded image blocks, 1

n

The number of decoded image blocks. To obtain the quantization parameters of the first n decoded image blocks, please refer to the description of step S602 below.

1)Global average

average_quantization=sum of the quantization parameters of the first n blocks (total_sum)/n(total_blocks)

2) Moving average

Specifically, the video decoder calculates the average quantization parameters according to different weights corresponding to the position information:

average_quantization _t =average_quantization _t-1 ×H1+H2×pre_quantization

Among them, t represents the current block, t-1 represents the previous decoded image block of the current block, average_quantization _t-1 represents the average quantization parameter of the previous decoded image block, and pre_quantization represents the quantization of the previous decoded image block. parameters. Among them, H1+H2=1, H1 and H2 are both greater than 0.

3) The video decoder determines the average quantization parameter based on the complexity of the previous n decoded image blocks and the complexity of the current block.

Specifically, the video decoder divides the complexity of the first n decoded image blocks into k levels, determines the position of the complexity of the current block in the k levels, and calculates the average of the quantization parameters of this level as the current block quantification parameters. For example, level 1 is complexity>10000, level 2 is 1000<complexity<10000, and level 3 is complexity<1000. If the complexity of the current block is within the range of level 3, calculate the average value of the quantization parameters of level 3. As the average quantization parameter of the current block.

4) The video decoder determines the average quantization parameter based on the resource adequacy of the previous n decoded image blocks and the resource adequacy of the current block.

5) The video decoder determines the average quantization parameter based on the number of predicted bits of the previous n decoded image blocks and the number of predicted bits of the current block.

Among them, 4) and 5) are similar to the above 3), dividing levels and calculating the average value of the quantization parameters of the corresponding levels, which will not be described again here.

6) The video decoder uses the predicted bit number of the current block and the actual bit number of the previous block to perform clustering.

It should be noted that the above methods 3)-6) mainly use clustering based on certain information of the current block and certain information of the previous N blocks, and average the quantification parameters of the blocks in similar categories. Among them, Different coefficients can be used for weighted averaging for different blocks in the level to obtain the average quantization parameter. In addition, the information used for clustering can be a combination of multiple information, such as at least two of complexity, resource adequacy, and number of predicted bits.

Case 5: The video decoder determines the change value of the quantization parameter (Δquantization) based on the information of the image to be decoded.

1) The video decoder obtains the change value of the quantization parameter based on the accumulation of the difference between the predicted bit number and the actual bit number of the previous n decoded image blocks, and the size information mapping of the current block.

，1

n

已解碼圖像塊的個數。 Among them, the accumulation of the difference between the predicted number of bits and the actual number of bits of the first n decoded image blocks is represented by pred_real_sum, that is

,1

n

The number of decoded image blocks.

△quantization=clip(pred_real_sum/block_size,J1,J2);

Among them, |J1| and |J2| are both smaller than the maximum quantization parameter. The maximum quantization parameter is a preset value and represents the maximum quantization parameter that can be used for the image block to be decoded.

Optionally, pred_real_sum can be replaced by target_real_sum, which represents the accumulation of differences between the target number of bits and the actual number of bits of the first n decoded image blocks. Among them, the target number of bits (target_bits) refers to the target pixel depth (target bpp) The product of the current block's size information.

It can be understood that the target pixel depth is in units of block processing units and is used to represent the pixel depth of the current block to be transmitted, that is, a further defined parameter based on the input bpp of the image to be decoded.

target_bits=target bpp×block_size;

，1

n

已解碼圖像塊的個數

,1

n

The number of decoded image blocks

△quantization=clip(target_real_sum/block_size,J1,J2)

Optionally, pred_real_sum can be replaced by target_pred_sum, which represents the accumulation of the difference between the target bit number and the predicted bit number of the first n decoded image blocks.

，1

n

已解碼圖像塊的個數

,1

n

The number of decoded image blocks

△quantization=clip(target_pred_sum/block_size,J1,J2)

For example, the maximum quantization parameter is represented by max_quantization, J1 is -max_quantization/3, and J2 is max_quantization/3. For example, J1 is -4 and J2 is 4.

2) The video decoder maps the change value of the quantization parameter based on the accumulation of the difference between the target number of bits and the number of predicted bits of the first n decoded image blocks.

△quantization=sigmoid(target_pred_sum/block_size)×J3, where J3 is the parameter.

As shown in Figure 8, the function y=sigmoid(x) is a sigmoid function. The value range of y is [0, 1]. When x goes to positive infinity, y=1. When x goes to negative infinity, y =0.

It should be noted that target_pred_sum can also be replaced by pred_real_sum or target_real_sum.

3) The video decoder determines the change value of the quantization parameter based on the complexity of the current block, the complexity of the previous decoded image block, and the maximum quantization parameter.

If complexity>pre_complexity, then △quantization= clip(△pre_quantization+1,0,max_△quantization);

If complexity<pre_complexity, then △quantization=clip(△pre_quantization-1,0,max_△quantization).

Among them, △pre_quantization represents the change value of the quantization parameter of the previous decoded image block, and max_△quantization represents the change value of the maximum quantization parameter of the image block in the image to be decoded. The maximum value can be a preset fixed value.

5) The video decoder sets the change value of the quantization parameter to a fixed value.

For example, the fixed value is Δquantization=1.

6) The video decoder adjusts the change value of the quantization parameter according to the information of the image to be decoded and other coding control parameters of the current block.

If the image bit width is greater than 8 bits, then △quantization=2; or if the current channel is a chrominance component, then △quantization=2; or if the position of the current block is in the first 1/n position of the parallel unit, then △ quantization=1; if the position of the current block is at the last 1/n position of the parallel unit, then △quantization=2; if the position of the current block is at the boundary of the parallel unit, then △quantization=1.

It should be noted that the video decoder can also adjust fixed values based on other input parameters.

Optionally, the video decoder sets the change value of the quantization parameter to a fixed value according to the resource adequacy in other coding control parameters of the current block. For example, if the resources of the current block are sufficient, then △quantization=1; if the resources of the current block are insufficient, then △quantization=4.

Optionally, before the above step S601, the method also includes the video decoder initializing the code rate control parameters, as shown in Figure 9, including the following steps.

Step S901: The video decoder calculates the total number of bits of the current block based on the information of the image to be decoded.

The total number of bits refers to the number of bits occupied by the current block. The total number of bits is calculated based on the sampling format, resolution, and bpp in the basic information of the image to be decoded.

Optionally, the total number of bits can be calculated according to the sampling format of the image. For example, if the image is in YUV format, the total number of bits of the Y channel, the total number of bits of the U channel, and the total number of bits of the V channel can be calculated respectively. Among them, multiple channels can also form different sets to calculate the total number of bits.

N)。示例性的，Y通道為第一集合，U通道和V通道為第二集合。 Specifically, the N-channel image is divided into M sets (M

N). For example, the Y channel is the first set, and the U channel and V channel are the second set.

In the first possible implementation, the parameters of each set are independent of each other. Among them, the parameters include initialization parameters, rate control parameters, quantization parameters and other variable parameters in the decoding process. This parameter may also include some of the above-mentioned variable parameters, that is, some or all of the parameters in each set are independent of each other.

The second possible implementation method is that the parameters of each collection are common. Similarly, the parameters may include some or all of the above-mentioned variable parameters, and some or all of the parameters are common to each set. For example, the common parameters of the first set and the second set include initialized parameters, updated parameter thresholds and quantization parameters, and independent parameters include intermediate variables and code rate control parameters. The intermediate variable refers to an intermediate parameter generated in calculating the quantization parameter, for example, the number of decoded image blocks based on the current block.

Optionally, the above parameters are updated according to M sets. Specifically, after each set completes decoding, the parameters are updated; or after all sets complete decoding, the parameters are updated.

Step S902: The video decoder determines the number of available bits based on the total number of bits. The number of available bits is used to store the image data before the current block is decoded.

Optionally, the video decoder removes other bits used to store non-image data from the total number of bits to obtain the number of available bits. For example, other bits include the following types of data, such as reserved bits used to store header information of an image, and inter-block offset bits used to determine the position of the data in the code stream. Optionally, the video decoder uses the total number of bits as the number of available bits, because in some applications, the total number of bits does not include other bits.

Optionally, after the above step S902, a branching step may also be included, in which the video decoder combines according to channel division and calculates the total number of available bits in each set; the total resources are divided into Distribute to each set according to the proportion of M sets.

Among them, the proportion of the M sets can be determined with reference to the number of image blocks in each set. The video decoder allocates the total number of available bits for the current block in proportion to the set.

Optionally, this branching step can also be applied to the video decoder calculating the number of available bits for each of the M sets before step S902.

Among them, other non-image bit numbers in step S902 are removed respectively after dividing the set.

It can be understood that first dividing the sets and then removing other bits used to store non-image data in each set will help increase the flexibility of the number of available bits in each set and improve the performance of the video decoder; first, The total number of bits used to store non-image data is removed from the total number of bits to obtain the total number of available bits. When the number of available bits in each set is divided, it helps to ensure the consistency of the number of available bits in each set.

Optionally, after the above step S901, the video decoder also calculates the target bpp (target_bpp) based on bpp; for example, target_bpp=bpp-0.1; optionally, the target_bpp can be common to M sets, or it can Is an independent target_bpp for each collection.

If each set has an independent target_bpp, the target_bpp obtained by weighting all sets must meet the bpp limit, for example, bpp=target_bpp+0.1 (empirical value).

It should be noted that the target bpp is used to determine the target number of bits and other parameters related to the target number of bits.

Step S903: The video decoder initializes intermediate parameters, which are used to determine the quantization parameters of the current block in combination with one or more rate control parameters.

For example, the following parameters target_bits, target_real_sum and pred_real_sum are included. During initialization, these parameters can be set to:

target_bits=total_bits/total_blocks;

target_real_sum=target_bits×total_blocks-total_bits;

pred_real_sum=0.

Optionally, some intermediate variables in calculating the rate control parameters can also be predefined in this step, such as the maximum quantization parameter, the maximum allowed complexity, etc.

Step S602: The video decoder determines the quantization parameter of the current block according to one or more rate control parameters.

Specifically, the following 7 options are included.

Solution 1: Use the average quantization parameter as the quantization parameter.

Option 2: Obtain the quantization parameters by weighting them based on the average quantization parameters and the change values of the quantization parameters.

quantization=clip(average_quantization+△quantization,0,max_quantization).

Solution 3: Determine the quantization parameter based on the complexity of the current block, the complexity of the previous decoded image block, and the quantization parameter of the previous decoded image block.

quantization=clip(complexity/pre_complexity,1-a,1+a)×pre_quantization;

Among them, 0<a<1.

Solution 4: Determine the quantization parameter of the current block based on the position information and complexity of the current block, and the quantization parameter of the previous decoded image block.

If the current block is in the first 1/n position of the parallel unit, the fourth weight coefficient w4 is 1-a; if it is in the last 1/2 position of the parallel unit, then w4 is 1+a, 0<a<1;

quantization=w4×pre_quantization;

Optional, if the complexity of the current block is greater than K1 (or the resource abundance is less than L1), then quantization=w4×pre_quantization×(1+b); if the complexity is less than K2 (or the resource abundance is greater than L2), then quantization =w4×pre_quantization×(1-b), 0<b<1, 0<K1<K2, 0<L1<L2;

Solution 5: Determine the quantization parameter of the current block based on the information of the previous decoded image block.

1) If the target_real_sum of the previous decoded image block>0, then quantization=clip(pre_quantization+M,0,max_quantization); if the target_real_sum of the previous decoded image block<0, then quantization=clip(pre_quantization-M ,0,max_quantization); where, M>1.

2) Or according to pred_real_sum, if pred_real_sum is greater than the preset threshold, the quantization parameter increases, otherwise, the quantization parameter decreases.

Solution 6: Determine the quantization parameter of the current block based on the position information of the current block.

For example, if the current block is the first block in the parallel unit, quantization=0.

Solution 7: Determine the quantization parameters of the current block based on multiple complexities of the current block.

If {complexity1<N1∥complexity2<N2}, at least one of complexity1<N1 and complexity2<N2 satisfies the condition; then quantization=0. N1 and N2 can be calibrated by bit width, and both N1 and N2 are greater than 0.

It should be noted that, in conjunction with the encoding process described above with respect to Figure 2, the specific implementation method of the video encoder generating quantization parameters based on the code rate control parameters is a reciprocal encoding process with the above-mentioned embodiment on the decoding side, and will not be described again.

Optionally, after the quantization parameter is determined above, the video decoder corrects the quantization parameter.

The first possible implementation method is to adjust according to the resource abundance of the current block; if it exceeds the range of the resource abundance, make corresponding adjustments.

For example, if resources are sufficient, then quantization=clip(quantization -x,0,max_quantization); if resources are insufficient, then quantization=clip(quantization +x,0,max_quantization); x>0.

The second possible implementation method is to adjust based on the above number of bits.

1) Adjust based on all previous target bit numbers and actual bit numbers.

P1×target_bits且quntization

pre_quantization，則quantization=clip(quantization+Q1,0,max_quantization)； 如果target_real_sum<P2×target_bits且quantization>pre_quantization，quantization=clip(quantization+Q2,0,max_quantization)。其中，P1、P2、Q1、Q2的絕對值均大於1。 if target_real_sum

P1×target_bits and quntization

pre_quantization, then quantization=clip(quantization+Q1,0,max_quantization); If target_real_sum<P2×target_bits and quantization>pre_quantization, quantization=clip(quantization+Q2,0,max_quantization). Among them, the absolute values of P1, P2, Q1, and Q2 are all greater than 1.

2) Adjust according to the predicted number of bits and the actual number of bits.

If pred_real_sum<P3, then quantization=clip(quantization+Q3,0,max_quantization); if pred_real_sum>P4, then quantization=clip(quantization+Q4,0,max_quantization). Among them, the absolute values of P3, P4, Q3, and Q4 are all greater than 1.

The third possible implementation method is adjusted according to the actual number of bits of the first n blocks and the code control buffer size (buffer_size) of the current block.

target_real_sum is actually the same as buffer_size.

((max_buffer_size * 63)>>6)，則quantization=max_quantization；如果是10bit圖像，且((max_buffer_size *15)>>4)

buffer_size，則quantization=max_quantization；如果是其它比特圖像，且((max_buffer_size * 7)>>3)

buffer_size，則quantization=max_quantization；如果buffer_size>0，則quantization=max(buffer_size * max_quantization/max_buffer_size,quantization)；如果buffer_size<0，則quantization=0，buffer_size=0。 For example, if it is an 8bit image and buffer_size

((max_buffer_size * 63)>>6), then quantization=max_quantization; if it is a 10bit image, and ((max_buffer_size *15)>>4)

buffer_size, then quantization=max_quantization; if it is other bit images, and ((max_buffer_size * 7)>>3)

buffer_size, then quantization=max_quantization; if buffer_size>0, then quantization=max(buffer_size * max_quantization/max_buffer_size,quantization); if buffer_size<0, then quantization=0, buffer_size=0.

The fourth possible implementation is to adjust the quantization parameters according to the position of the current block.

For example, if it is at the boundary of a parallel unit, then quantization=quantization/2; the difference between the parallel units on the left and right of the boundary of the parallel unit cannot be greater than 3; the quantization parameter difference between the middle, upper, lower, and left blocks of the same parallel unit cannot be greater than max_quantization/ 4.

The fifth possible implementation method is to adjust based on the smoothness of code rate control.

Constant Bit Rate (CBR): This rate control method has a buffer_size, and each block is updated according to the actual number of bits and the target number of bits. buffer_size, buffer_size strictly cannot exceed the first preset threshold and cannot be less than 0. Among them, buffer_size is target_real_sum, or the input bpp is used as the target bpp to calculate target_real_sum. As an example, two-level buffers are used, and the two-level buffers are parallel and independent to perform CBR.

a) First-level buffering, the video decoder limits the modification of quantization parameters.

buffer_size，則quantization=max_quantization；如果max_buffer_size×R1<buffer_size<max_buffer_size×R2，則quantization=max(buffer_size×max_quantization/max_buffer_size,quantization)；如果max_buffer_size×R2

buffer_size，則quantization=0；如果buffer_size<0，表示編碼端在編碼過程中該當前塊包括多個無效資料；相應地，解碼端填充-buffer_size個比特數，該比特數為多個無效資料的比特數，並令buffer_size=0，使得解碼後圖像塊於編碼的圖像塊相同。 If max_buffer_size×R1

buffer_size, then quantization=max_quantization; if max_buffer_size×R1<buffer_size<max_buffer_size×R2, then quantization=max(buffer_size×max_quantization/max_buffer_size,quantization); if max_buffer_size×R2

buffer_size, then quantization=0; if buffer_size<0, it means that the current block at the encoding end includes multiple invalid data during the encoding process; accordingly, the decoding end fills in -buffer_size bits, which is the number of bits of multiple invalid data. number, and set buffer_size=0, so that the decoded image block is the same as the encoded image block.

It should be noted that the above-mentioned first-level buffer can also be applied to the video encoder to calculate the quantization parameters and then correct them.

Optional, b) secondary buffering, the correction of the quantization parameter is applied to the encoding process.

If the real_bits of the currently selected optimal mode will make buffer_size<max_buffer_size×U1, then select a mode with the smallest distortion; if the currently selected real_bits of the optimal mode will make buffer_size<max_buffer_size×U2, then choose the mode without distortion. Or the mode with the smallest distortion; if the real_bits of the currently selected optimal mode will make buffer_size>max_buffer_size×U3, then choose a mode that will not exceed max_buffer_size x U3 and have less distortion; if the real_bits of the currently selected optimal mode will make buffer_size >max_buffer_size×U4, at this time select a new mode with the smallest cost.

It should be noted that U1-U4 can be calculated based on the cost of the minimum cost mode in max_buffer_size, or different fixed values can be preset.

max_buffer_size的情況，要求buffer_size處於理想範圍內，即 max_buffer_size×V1<buffer_size<max_buffer_size×V2，其中，0

V1

V2

1。 The sixth possible implementation method is to ensure that buffer_size<0 or buffer_size does not occur.

In the case of max_buffer_size, buffer_size is required to be within the ideal range, that is, max_buffer_size×V1<buffer_size<max_buffer_size×V2, where, 0

V1

V2

1.

1。其中，該預留資源在參數初始化中確定可用比特數時，屬於預留比特數，需要扣除以滿足後續資源的補充。 In order to achieve buffer_size within the above ideal range, the encoding end or decoding end can reserve resources during parameter initialization. The reserved resources are max_buffer_size×V3, where, V3

1. Among them, when the number of available bits of the reserved resource is determined in parameter initialization, it belongs to the number of reserved bits and needs to be deducted to meet the subsequent replenishment of resources.

It can be understood that, under the condition that the buffer_size does not overflow, the reserved resources can also be used to encode and decode the last few image blocks, or used for the boundaries of parallel units, and the reserved resources can be released when the resources are relatively infrequent. Plenty of space.

It should be noted that any of the above solutions for modifying quantization parameters that are not specifically explained can be performed after the quantization parameters are generated at the decoding end or the encoding end.

Optionally, the above steps S601-S603 are implemented according to different parallel units.

Embodiment 1, block, row, group, slice level parallelism

Specifically, the encoding end records the offset information of the current block of data. The offset information refers to the position of the current block in the parallel unit, represented by the sum of actual bit numbers from the first block of the parallel unit to the previous image block of the current block.

On the encoding side, the video encoder writes the offset information into the code stream, which is used at the decoding end to parse the code stream and obtain the offset information to locate the position of the current block in the parallel unit.

Optionally, the position written by the encoding end in the code stream is the beginning of the entire parallel unit code stream.

At the decoding end, the video decoder obtains the offset information in the code stream, locates the position of the current block based on the offset information, and performs decoding.

It should be noted that during the execution of the above solution, this offset information can be removed as the number of other bits for storing non-image data during the parameter initialization stage, or it can be included in the actual number of bits as consumption of parallel units during the encoding and decoding process. , or the actual bit consumption is not included in the encoding and decoding process. Among them, the counting methods are different. For some parameters in the above scheme, Calculate the impact and make a choice based on comprehensive considerations.

Embodiment 2, row-level parallelism

Specifically, the encoding end fills the code stream according to rules.

The first possible implementation is that each row is divided into several units, and each unit is aligned according to a given parameter (such as 128bit); (if the number of bits in the unit is not a multiple of 128bits, fill the unit to a multiple of 128bits ). The given parameters can be: empirical parameters, or obtained from the width, height and one or more information in the bpp.

The second possible implementation method is the maximum number of bits between slice rows: the number of bits consumed by the longest row among all slice rows at the same position. Align according to the maximum number of bits between slice rows; (if the number of bits consumed by the row is not a multiple of the maximum number of bits between slice rows, fill the number of consumed bits to a multiple of the maximum number of bits between slice rows).

0) The third possible implementation method is to fill in -buffer_size bits after the encoding of the slice is completed (CBR guarantees buffer_size

0)

For the above three possible implementation methods, the decoding end includes three possible implementation methods:

The first possible implementation method is to determine whether the currently consumed bits satisfy the alignment of the given parameter bits when reading to the end of the unit. If so, there is no need to read the filling bits. Otherwise, read the number of bits filled that satisfies the given bits multiple.

The second possible implementation method is to determine whether the currently consumed bits satisfy the alignment of the maximum number of bits between slice rows when decoding to the end of the row. If so, there is no need to read the filling bits. Otherwise, read the number of filling bits that is a multiple of the maximum number of bits between slice rows. .

The third possible implementation is to read -buffer_size padding bits.

An exemplary code stream arrangement method, taking 2 slices as an example, in which the slice will only be divided vertically: the first unit of slice1 (filling), the first unit of slice2 (filling), the second unit of slice1 units, the second unit of slice2 (padding)...the last unit of the first row of slice1, the last unit of the first row of slice2 (padding).

It should be noted that the maximum number of bits between the first row of slice is slice1 encoding one row. The number of bits consumed.

It should be noted that the number of bits consumed by the filling is included in the actual bit consumption of the corresponding block, or the number of bits consumed by the filling is not included in the actual bit consumption of the corresponding block.

Embodiment 3, slice-level parallelism

The encoding end calculates the unit bit number and writes it into the code stream.

Optionally, when the unit is determined, the number of bits of each unit can be calculated based on one or more of the width and height of the slice and bpp (or target_bpp). For example, the width of the slice × height × bpp = 10,000 bits, and the 10,000 bits are the number of bits of the unit in the slice.

Optionally, the number of bits of the unit can also be a preset fixed value.

Among them, code stream arrangement is a code stream arrangement method. Taking 2 slices as an example, the slice will only be divided vertically: the first unit of slice1, the first unit of slice2, the second unit of slice1, slice2 The second unit of...the last unit of slice1, the last unit of slice2.

It should be noted that the number of bits of each unit is a constant size determined by either of the above two optional methods.

The decoding end parses the code stream in the order of the first unit of the first slice, the first unit of the second slice, the second unit of the first slice, and the second unit of the second slice.

It should be noted that any of the above parallel solutions that are not specifically explained can be performed on the decoding side or the encoding side.

It should be noted that, as long as there is no conflict, part or all of the contents of any of the above embodiments may constitute a new embodiment.

An embodiment of the present invention provides a decoding device, which may be a video decoder. Specifically, the decoding device is used to perform the steps performed by the video decoder in the above decoding method. The decoding device provided by the embodiment of the present invention may include modules corresponding to corresponding steps.

Embodiments of the present invention can divide the decoding device into functional modules according to the above method examples. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or software function modules. The division of modules in the embodiment of the present invention is schematic and is only a logical function division. In actual implementation, there may be other division methods.

In the case where each functional module is divided according to each function, FIG. 10 shows a possible structural diagram of the decoding device involved in the above embodiment. As shown in Figure 10, the decoding device 100 includes an acquisition module 1001, a determination module 1002 and a decoding module 1003.

The acquisition module 1001 is used to acquire one or more code rate control parameters of the current block in the image to be decoded, such as the above step S601.

The determination module 1002 is used to determine the quantization parameter of the current block according to one or more code rate control parameters; for example, step S602 above.

The decoding module 1003 is used to decode the current block based on the quantization parameters of the current block, such as the above step S603.

In one example, the acquisition module 1001 is specifically used to obtain the information of the image to be decoded. The information of the image to be decoded includes the basic information of the image to be decoded and the information of the image blocks in the image to be decoded; according to the image to be decoded, Some or all of the image's information determines one or more rate control parameters for the current block.

In one example, the code rate control parameters include the resource adequacy of the current block, the complexity of the current block, the predicted number of bits of the current block, the average quantization parameter of the current block, and the change value of the quantization parameter of the current block; wherein, the average quantization Parameters are used to characterize the average degree of quantization parameters of decoded image blocks in the image to be decoded. Resource adequacy refers to the adequacy of the resources used to store the current block in the resources used to store the image to be decoded. Complexity It refers to the complexity of the decoded image blocks in the image to be decoded. The number of predicted bits refers to the estimated resources occupied by the current block after decoding. The change value of the quantization parameter refers to the difference between the decoded image blocks in the image to be decoded. The change value of the quantization parameter.

In one example, the determination module 1002 is specifically used to obtain the decoded image block The rate control parameters of the decoded image block; determine the quantization parameters of the current block according to the rate control parameters of the decoded image block.

In one example, the determination module 1002 is specifically used to obtain the quantization parameter of the decoded image block; and determine the quantization parameter of the current block based on the quantization parameter of the decoded image block.

In one example, the determination module 1002 is also used to calculate the total number of bits of the current block based on the current block information. The total number of bits of the current block is the number of bits occupied by the current block after decoding; determine the number of available bits based on the total number of bits. , the number of available bits is to store the decoded image data of the current block, and the number of available bits is used to determine one or more rate control parameters of the current block.

In one example, the determination module 1002 is specifically configured to remove the number of other bits used to store non-image data from the total number of bits.

In one example, the determination module 1002 is also used to initialize intermediate parameters, which are used to determine the quantization parameters of the current block in combination with one or more code rate control parameters.

In one example, the determination module 1002 is also used to correct the quantization parameter based on one or more rate control parameters.

In one example, the determination module 1002 is also used to update one or more rate control parameters.

An embodiment of the present invention also provides an electronic device. The electronic device includes the above-mentioned decoding device 100. The decoding device 100 executes any of the methods performed by the video decoder provided above.

Embodiments of the present invention also provide a communication system. The communication system includes the above-mentioned decoding device 100 and an encoding device. The decoding device 100 executes any of the methods performed by the video decoder provided above. The encoding device executes the method provided above. Any method performed by a video encoder.

Embodiments of the present invention also provide a computer-readable storage medium. A computer program is stored on the computer-readable storage medium. When the computer program is run on a computer, it causes the computer to execute any of the video decoders provided above. method of execution.

For explanations of relevant contents and descriptions of beneficial effects in any of the computer-readable storage media provided above, please refer to the above corresponding embodiments and will not be described again here.

An embodiment of the present invention also provides a wafer. The chip integrates a control circuit and one or more ports for realizing the functions of the decoding device 100 described above. Optionally, the functions supported by this chip can be referred to above and will not be described again here. Those of ordinary skill in the art can understand that all or part of the steps to implement the above embodiments can be completed by instructing relevant hardware through programs. The program can be stored in a computer-readable storage medium. The storage media mentioned above can be read-only memory, random access memory, etc. The above-mentioned processing unit or processor may be a central processing unit, a general-purpose processor, an Application Specific Integrated Circuit (ASIC), a Digital Signal Processor (DSP), or a Field Programmable Logic Array (Field Programmable Logic Array). Programmable Gate Array (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof.

Embodiments of the present invention also provide a computer program product containing instructions. When the instructions are run on a computer, they cause the computer to execute any of the methods in the above embodiments. The computer program product includes one or more computer instructions. When computer program instructions are loaded and executed on a computer, processes or functions according to embodiments of the present invention are generated in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device. Computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions may be transmitted from a website, computer, server, or data center over a wired (such as coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to another website, computer, server or data center. Computer-readable storage media can be any available media that can be accessed by a computer or include one or more servers, data centers, and other data storage devices that can be integrated with the media. Available media may be magnetic media (eg, magnetic disks, hard disks, tapes), optical media (eg, DVD), or semiconductor media (eg, solid state disk (Solid State Disk, SSD)), etc.

It should be noted that the above-mentioned devices for storing computer instructions or computer programs provided by embodiments of the present invention include, but are not limited to, the above-mentioned memories, computer-readable storage media and communication crystals. Chips, etc., are all non-transitory.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using a software program, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When computer program instructions are loaded and executed on a computer, processes or functions according to embodiments of the present invention are generated in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device. Computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions may be transmitted from a website, computer, server, or data center over a wired (such as coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to another website, computer, server or data center. Computer-readable storage media can be any available media that can be accessed by a computer or include one or more servers, data centers, and other data storage devices that can be integrated with the media. Available media may be magnetic media (eg, magnetic disks, hard disks, tapes), optical media (eg, DVD), or semiconductor media (eg, solid state disk (Solid State Disk, SSD)), etc.

Although the present invention has been described herein in conjunction with various embodiments, those skilled in the art can understand and implement the invention by reviewing the drawings, the content of the invention, and the appended patent scope in implementing the claimed invention. Other variations of the embodiment. In a request, the word "comprising" does not exclude other components or steps, and the word "a" or "an" does not exclude a plurality. A single processor or other unit may perform several of the functions listed in the request. The fact that certain measures are described in mutually different dependent claims does not mean that these measures cannot be combined to good effect.

Although the invention has been described in conjunction with specific features and embodiments thereof, it will be apparent that various modifications and combinations may be made without departing from the spirit and scope of the invention. Accordingly, the specification and drawings are merely illustrative of the invention defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the invention. Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the invention. In this way, if these modifications and variations of the present invention belong to the present invention, Within the scope of the claims and equivalent technologies, the present invention is also intended to include these changes and modifications.

S601, S602, S603: steps

Claims (13)

A video decoding method, characterized by including: Obtain one or more rate control parameters of the current block in the image to be decoded; Determine the quantization parameter of the current block according to the one or more rate control parameters; The current block is decoded based on a quantization parameter of the current block. The method according to claim 1, wherein the obtaining one or more rate control parameters of the current block in the image to be decoded includes: Obtaining information of the image to be decoded, where the information of the image to be decoded includes basic information of the image to be decoded and information of image blocks in the image to be decoded; One or more rate control parameters of the current block are determined based on part or all of the information of the image to be decoded. The method according to claim 1 or 2, wherein the code rate control parameters include resource adequacy of the current block, complexity of the current block, predicted bit number of the current block, The average quantization parameter and the change value of the quantization parameter of the current block; Wherein, the average quantization parameter is used to characterize the average degree of quantization parameters of the decoded image blocks in the image to be decoded, and the resource adequacy refers to the resource used to store the current block. The sufficiency of the resources of the image to be decoded, the complexity refers to the complexity of the decoded image blocks in the image to be decoded, and the number of predicted bits refers to the estimated occupation of the current block after decoding resource, the change value of the quantization parameter refers to the change value of the quantization parameter between decoded image blocks in the image to be decoded. The method according to claim 1, wherein the determining the quantization parameter of the current block according to the one or more rate control parameters includes: Obtain the code rate control parameters of the decoded image block; The quantization parameter of the current block is determined according to the rate control parameter of the decoded image block. The method according to claim 1, wherein the determining the quantization parameter of the current block according to the one or more rate control parameters includes: Obtain the quantization parameters of the decoded image block; The quantization parameter of the current block is determined based on the quantization parameter of the decoded image block. The method according to claim 2, wherein after obtaining the information of the image to be decoded, the method further includes: Calculate the total number of bits of the current block according to the current block information, where the total number of bits of the current block is the number of bits occupied by the current block after decoding; The number of available bits is determined according to the total number of bits. The number of available bits is to store the decoded image data of the current block. The number of available bits is used to determine one or more code rate control parameters of the current block. . The method according to claim 6, wherein determining the number of available bits according to the total number of bits includes: Other bits used to store non-image data are removed from the total number of bits. The method as described in request item 6, wherein the method further includes: Initialize intermediate parameters, which are used to determine the quantization parameter of the current block in combination with the one or more rate control parameters. The method as described in claim 1 or 2, wherein, after determining the quantization parameter of the current block according to the one or more rate control parameters, the method further includes: The quantization parameter is modified based on the one or more rate control parameters. The method as described in claim 1 or 2, wherein after determining the quantization parameter according to the one or more rate control parameters, the method further includes: Update the one or more rate control parameters. A video decoding device, characterized by including: The acquisition module is used to obtain one or more rate control parameters of the current block in the image to be decoded; Determine the module to determine the quantization parameter of the current block according to the one or more code rate control parameters; A decoding module configured to decode the current block based on the quantization parameter of the current block. A video decoder, characterized in that the video decoder is used to perform the method described in any one of claims 1 to 10. A computer-readable storage medium, characterized in that a program is stored in the computer-readable storage medium, and when the program is run on the computer, the computer is caused to execute any one of claims 1 to 10. the method described.

Images