Encoding method, decoding method and related apparatus

Abstract

Provided in the present application are an encoding method, a decoding method and a related apparatus. The encoding method comprises: performing sub-image division on an image to be encoded, so as to obtain N sub-images; and for each of the N sub-images, executing the following operations: performing wavelet transform on the sub-image, so as to acquire a wavelet coefficient of a low-frequency sub-band of the sub-image and a wavelet coefficient of a high-frequency sub-band of the sub-image; on the basis of the wavelet coefficient of the low-frequency sub-band of the sub-image, acquiring first encoded data of the sub-image; on the basis of the wavelet coefficient of the high-frequency sub-band of the sub-image, acquiring second encoded data of the sub-image; and on the basis of the first encoded data and the second encoded data, acquiring an image bitstream of the image to be encoded. In the present application, on the basis of a wavelet transform architecture, an image is encoded or decoded at the granularity of a sub-image, thereby effectively improving the encoding and decoding efficiency while reducing the encoding and decoding complexity.

Description

Encoding methods, decoding methods and related devices

[0001] This application claims priority to Chinese patent application filed on January 24, 2025, with application number 202510122962.2 and entitled "Encoding Method, Decoding Method and Related Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of image processing, and in particular to an encoding method, a decoding method, and related apparatus. Background Technology

[0003] Digital video capabilities can be incorporated into a wide variety of devices, including digital television, digital live broadcast systems, wireless broadcasting systems, personal digital assistants (PDAs), laptops or desktop computers, tablets, e-book readers, digital cameras, digital recording devices, digital media players, video game devices, video game consoles, cellular or satellite radio phones (so-called "smartphones"), video conferencing devices, video streaming devices, and the like. Digital video devices implement video compression techniques, such as those described in standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264 / MPEG-4 Part 10 Advanced Video Coding (AVC), the H.265 / HEVC video coding standard, and extensions to such standards. By implementing such video compression techniques, video devices can transmit, receive, encode, decode, and / or store digital video information more efficiently.

[0004] Current encoding and decoding technologies suffer from high encoding and decoding complexity. Summary of the Invention

[0005] This application provides an encoding method, a decoding method, and related apparatus to improve the compression ratio while reducing the encoding and decoding complexity.

[0006] Firstly, this application provides a decoding method. The method includes: acquiring an image bitstream of an original image, the image bitstream including first encoded data and second encoded data for each of N sub-images, where N is an integer greater than 1; acquiring reconstruction coefficients of the low-frequency sub-band of the first sub-image based on the first encoded data of the first sub-image, the first sub-image being any one of the N sub-images; acquiring reconstruction coefficients of the high-frequency sub-band of the first sub-image based on the second encoded data of the first sub-image; performing an inverse wavelet transform on the reconstruction coefficients of the low-frequency and high-frequency sub-bands of the first sub-image to obtain a reconstructed sub-image of the first sub-image; and acquiring a reconstructed image of the original image based on the reconstructed sub-images of the N sub-images. Thus, this application effectively reduces the processing complexity on the encoding / decoding side and improves encoding / decoding efficiency and compression ratio by dividing the image into sub-images, thereby using a wavelet transform-based encoding / decoding architecture at the granularity of individual sub-images.

[0007] For example, the reconstruction coefficients of the low-frequency subband can be the inverse quantization coefficients of the low-frequency subband in this application, and the reconstruction coefficients of the high-frequency subband can be the inverse quantization coefficients of the high-frequency subband in this application.

[0008] For example, the reconstruction coefficients of the low-frequency subband can also be the reconstructed low-frequency subband in this application, and the reconstruction coefficients of the high-frequency subband can also be the reconstructed high-frequency subband in this application.

[0009] For example, the frequency of the high-frequency subband is greater than the frequency of the low-frequency subband. This can be understood as the frequency of various coefficients (such as wavelet coefficients, reconstruction coefficients, inverse quantization coefficients, etc.) corresponding to the high-frequency subband in this application being greater than the frequency of the coefficients of the low-frequency subband.

[0010] In one possible implementation, the first and second encoded data of each sub-graph can be decoded independently. Thus, this application performs encoding and decoding at the sub-graph granularity, and further performs independent encoding and decoding based on the low-frequency and high-frequency sub-bands of each sub-graph. This allows the decoding end to independently decode the second encoded data corresponding to the high-frequency sub-band and the first encoded data corresponding to the low-frequency sub-band of each sub-graph, thereby achieving parallel decoding of the high-frequency and low-frequency sub-bands of different sub-graphs and effectively improving decoding efficiency.

[0011] In one possible implementation, the first encoded data includes first encoded block data for each sub-graph; wherein the first encoded block data for each of the N sub-graphs is obtained as a block to be encoded based on the reconstruction coefficients of the low-frequency sub-bands of the sub-graph; the second encoded data includes second encoded block data for each sub-graph; wherein the second encoded block data for each of the N sub-graphs is obtained as a block to be encoded based on the reconstruction coefficients of the high-frequency sub-bands of the sub-graph. Thus, this application, by using macroblocks as the basic encoding / decoding unit, improves decoding efficiency by acquiring and decoding the blocks to be encoded for the high-frequency and low-frequency sub-bands of each independently decodeable sub-graph during the decoding process, thereby parallel decoding of the macroblocks of the high-frequency and low-frequency sub-bands of each sub-graph and obtaining the corresponding reconstructed sub-graph.

[0012] In one possible implementation, the second coded block data of each of the N sub-images is continuous in the image bitstream. By encoding the coded data of the high-frequency sub-bands of each sub-image together, the decoder can decode the high-frequency sub-band data of each sub-image at the sub-image granularity, thereby obtaining the reconstructed sub-image corresponding to each sub-image. This improves the decoding efficiency of the high-frequency sub-bands of each sub-image, and consequently improves the decoding efficiency of the entire original image.

[0013] In one possible implementation, the reconstruction coefficients of the high-frequency sub-bands include: reconstruction coefficients of a first high-frequency sub-band, reconstruction coefficients of a second high-frequency sub-band, and reconstruction coefficients of a third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first, third, fourth, and fifth encoded data can be decoded independently. Thus, this application decomposes each sub-image into low-frequency sub-bands and multiple high-frequency sub-bands through wavelet transform, enabling encoding and decoding of each low-frequency and high-frequency sub-band, thereby reducing the complexity of encoding and decoding. Furthermore, on the decoding side, the encoded data corresponding to each high-frequency sub-band can be decoded independently, effectively improving the decoding efficiency of the high-frequency sub-bands and thus improving the decoded image of the original image.

[0014] In one possible implementation, the third encoded data of N sub-images are consecutive in the image bitstream, the fourth encoded data of N sub-images are consecutive in the image bitstream, and the fifth encoded data of N sub-images are consecutive in the image bitstream. Thus, by encoding multiple high-frequency sub-bands of each sub-image consecutively in the image bitstream, this application allows the decoding end to decode the high-frequency sub-band encoded data of each sub-image independently when decoding sequentially, thereby obtaining the reconstructed high-frequency sub-band data of each sub-image according to the sub-image order.

[0015] In one possible implementation, the third, fourth, and fifth encoded data of each of the N sub-images are consecutive in the image bitstream. Thus, by making the multiple high-frequency subbands of each sub-image consecutive in the image bitstream, this application allows the decoding end to independently decode the encoded data of the high-frequency subbands of each sub-image when decoding sequentially, thereby obtaining the reconstructed data of the high-frequency subbands of each sub-image according to the sub-image order.

[0016] In one possible implementation, the image bitstream includes offset information that indicates the position of independently decodeable encoded data within the bitstream. This allows the decoder to perform parallel decoding of the independently decoded encoded data based on the offset information, thereby improving decoding efficiency.

[0017] In one possible implementation, the image bitstream includes the image size information of the original image. After obtaining the reconstructed image of the original image based on N sub-images, the method further includes: if the size of the reconstructed image is larger than the size of the original image, removing the padding portion of at least one reconstructed sub-image from the edges of the reconstructed image to obtain a display image, the size of which is the same as the size of the original image. In this way, on the encoding side, padding ensures that sub-images that originally did not meet the size requirements meet them, thus satisfying the macroblock partitioning requirements when performing subsequent macroblock partitioning on the sub-images. On the decoding side, removing the padding portion restores the size of the display image to the size of the original image.

[0018] In one possible implementation, the size of each sub-image includes at least one of the following: width is a multiple of 128; height is a multiple of 128; width is less than or equal to 1024 pixels. In this way, by setting the size of the sub-images, the requirements for subsequent macroblock partitioning can be met.

[0019] In one possible implementation, the resolution of the original image is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or, the length of the original image is greater than or equal to 4320 pixels, the width is greater than or equal to 2160 pixels, and N is an integer greater than 1 and less than or equal to 16; or, the length of the original image is greater than or equal to 7680 pixels, the width is greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32. In this way, by setting the size of the sub-image, the requirements for subsequent macroblock partitioning can be met.

[0020] Secondly, this application provides an encoding method, comprising: dividing an image to be encoded into sub-images to obtain N sub-images of the image to be encoded, where N is an integer greater than 1, and the image to be encoded corresponds to the original image; for each of the N sub-images, performing the following operations: performing wavelet transform on the sub-image to obtain wavelet coefficients of the low-frequency sub-band and the high-frequency sub-band of the sub-image; obtaining first encoded data of the sub-image based on the wavelet coefficients of the low-frequency sub-band; obtaining second encoded data of the sub-image based on the wavelet coefficients of the high-frequency sub-band; and obtaining the image bitstream of the image to be encoded based on the first encoded data and the second encoded data. Thus, this application, by dividing the image into sub-images, encodes and decodes each sub-image at the granularity of a single sub-image using a wavelet transform-based encoding and decoding architecture, thereby effectively reducing the processing complexity on the encoding and decoding side and improving encoding and decoding efficiency and compression ratio.

[0021] For example, the image to be encoded can be the original image, i.e., the original image has been subdivided into sub-images. For example, the image to be encoded can also be an image obtained by performing relevant processing on the original image.

[0022] In one possible implementation, the first and second encoded data of each sub-graph can be decoded independently. Thus, this application performs encoding and decoding at the sub-graph granularity, and further performs independent encoding and decoding based on the low-frequency and high-frequency sub-bands of each sub-graph. This allows the decoding end to independently decode the second encoded data corresponding to the high-frequency sub-band and the first encoded data corresponding to the low-frequency sub-band of each sub-graph, thereby achieving parallel decoding of the high-frequency and low-frequency sub-bands of different sub-graphs and effectively improving decoding efficiency.

[0023] In one possible implementation, the first coded data includes first coded block data of a subgraph; wherein the first coded block data of the subgraph is obtained from the coded block based on wavelet coefficients of the low-frequency subband; the second coded data includes second coded block data of each subgraph; wherein the second coded block data of the subgraph is obtained from the coded block based on wavelet coefficients of the high-frequency subband. Thus, this application improves coding efficiency by using macroblocks as the basic coding unit and, during the coding process, acquiring and coding the coded blocks of the high-frequency and low-frequency subbands of each independently coded subgraph, thereby parallel coding of the macroblocks of the high-frequency and low-frequency subbands of each subgraph and obtaining the corresponding reconstructed subgraph.

[0024] In one possible implementation, the second coded block data of the sub-image is continuous in the image bitstream. Thus, by encoding the coded data of the high-frequency sub-bands of each sub-image together, the decoder can decode the high-frequency sub-band data of each sub-image at the sub-image granularity, obtaining the reconstructed sub-image corresponding to each sub-image. This improves the decoding efficiency of the high-frequency sub-bands of each sub-image, thereby improving the decoding efficiency of the entire original image.

[0025] In one possible implementation, the wavelet coefficients of the high-frequency sub-band include: wavelet coefficients of a first high-frequency sub-band, wavelet coefficients of a second high-frequency sub-band, and wavelet coefficients of a third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first, third, fourth, and fifth encoded data can be decoded independently. Thus, this application decomposes each sub-image into low-frequency sub-bands and multiple high-frequency sub-bands through wavelet transform, enabling encoding and decoding of each low-frequency and high-frequency sub-band, thereby reducing the complexity of encoding and decoding. Furthermore, on the decoding side, the encoded data corresponding to each high-frequency sub-band can be decoded independently, effectively improving the decoding efficiency of the high-frequency sub-bands and thus improving the decoded image of the original image.

[0026] In one possible implementation, the image to be encoded is divided into sub-images to obtain N sub-images. This includes: dividing the image to be encoded into sub-images based on a sub-image division method to obtain N sub-images; the sub-image division method indicates the size of the sub-images. Thus, by making the multiple high-frequency sub-bands of each sub-image consecutive in the encoded image bitstream, this application allows the decoder to decode the high-frequency sub-bands of each sub-image independently during sequential decoding, thereby obtaining the reconstructed high-frequency sub-bands of each sub-image according to the sub-image order.

[0027] In one possible implementation, the size of the sub-image includes at least one of the following: a width that is a multiple of 128; a height that is a multiple of 128; or a width less than or equal to 1024 pixels. This way, by setting the size of the sub-image, the requirements for subsequent macroblock partitioning can be met.

[0028] In one possible implementation, the image to be encoded is divided into N sub-images, including: if there is at least one sub-image whose width and / or height is not a multiple of 128, at least one sub-image is padded; wherein the width and height of the padded at least one sub-image are multiples of 16. In this way, by padding on the encoding side, the sub-images that originally did not meet the size requirements are made to meet the size requirements, so that the requirements for macroblock partitioning can be met when the sub-images are subsequently partitioned into macroblocks.

[0029] In one possible implementation, the resolution of the original image is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or, the length of the original image is greater than or equal to 4320 pixels, the width is greater than or equal to 2160 pixels, and N is an integer greater than 1 and less than or equal to 16; or, the length of the original image is greater than or equal to 7680 pixels, the width is greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32. In this way, by setting the size of the sub-image, the requirements for subsequent macroblock partitioning can be met.

[0030] In one possible implementation, the image bitstream includes offset information to indicate the position of independently decodeable encoded data within the bitstream. This allows the encoding side to add offset information to the bitstream, enabling the decoding side to perform parallel decoding of the independently decodeable encoded data based on the offset information, thereby improving decoding efficiency.

[0031] Thirdly, this application provides an encoder comprising: a sub-image partitioning unit, configured to partition an image to be encoded into N sub-images, where N is an integer greater than 1, and the image to be encoded corresponds to the original image; a wavelet transform unit, configured to perform wavelet transform on each of the N sub-images to obtain wavelet coefficients of the low-frequency sub-band and the high-frequency sub-band of the sub-image; a low-frequency sub-band processing unit, configured to obtain first encoded data of the sub-image based on the wavelet coefficients of the low-frequency sub-band; a high-frequency sub-band processing unit, configured to obtain second encoded data of the sub-image based on the wavelet coefficients of the high-frequency sub-band; and a combination unit, configured to obtain an image bitstream of the image to be encoded based on the first encoded data and the second encoded data.

[0032] In one possible implementation, the first and second encoded data of each subgraph can be decoded independently.

[0033] In one possible implementation, the first coded data includes first coded block data for each subgraph; wherein the first coded block data for each of the N subgraphs is obtained as a block to be coded based on the reconstruction coefficients of the low-frequency subband of the subgraph; the second coded data includes second coded block data for each subgraph; wherein the second coded block data for each of the N subgraphs is obtained as a block to be coded based on the wavelet coefficients of the high-frequency subband of the subgraph.

[0034] In one possible implementation, the second coded block data of each of the N subgraphs is continuous in the image bitstream.

[0035] In one possible implementation, the reconstruction coefficients of the high-frequency subband include: reconstruction coefficients of the first high-frequency subband, reconstruction coefficients of the second high-frequency subband, and reconstruction coefficients of the third high-frequency subband. The second coded data includes third coded data generated based on the wavelet coefficients of the first high-frequency subband, fourth coded data generated based on the wavelet coefficients of the second high-frequency subband, and fifth coded data generated based on the wavelet coefficients of the third high-frequency subband. The first coded data, third coded data, fourth coded data, and fifth coded data can be decoded independently.

[0036] In one possible implementation, the third encoded data of the N sub-graphs are continuous in the image bitstream, the fourth encoded data of the N sub-graphs are continuous in the image bitstream, and the fifth encoded data of the N sub-graphs are continuous in the image bitstream.

[0037] In one possible implementation, the third, fourth, and fifth encoded data of each of the N subgraphs are consecutive in the image bitstream.

[0038] In one possible implementation, the image bitstream includes offset information that indicates the position of independently decodeable encoded data within the image bitstream.

[0039] In one possible implementation, the image bitstream includes image size information of the original image. After obtaining the reconstructed image of the original image based on N sub-images, the method further includes:

[0040] If the size of the reconstructed image is larger than the size of the original image, remove the padding portion of at least one reconstructed sub-image from the edges of the reconstructed image to obtain the display image, which has the same size as the original image.

[0041] In one possible implementation, the size of each sub-image includes at least one of the following: a width that is a multiple of 128; a height that is a multiple of 128; or a width of less than or equal to 1024 pixels.

[0042] In one possible implementation, the resolution of the original image is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or, the length of the original image is greater than or equal to 4320 pixels, and the width is greater than or equal to 2160 pixels, and N is an integer greater than 1 and less than or equal to 16; or, the length of the original image is greater than or equal to 7680 pixels, and the width is greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32.

[0043] Fourthly, this application provides a decoder, comprising: an entropy decoding unit for acquiring an image bitstream of an original image, the image bitstream including first encoded data and second encoded data for each of N sub-images, where N is an integer greater than 1; the entropy decoding unit is further configured to acquire reconstruction coefficients of the low-frequency sub-band of the first sub-image based on the first encoded data of the first sub-image, the first sub-image being any one of the N sub-images; the entropy decoding unit is further configured to acquire reconstruction coefficients of the high-frequency sub-band of the first sub-image based on the second encoded data of the first sub-image; a wavelet transform unit for performing inverse wavelet transform on the reconstruction coefficients of the low-frequency sub-band and the high-frequency sub-band of the first sub-image to acquire a reconstructed sub-image of the first sub-image; and an image reconstruction unit for acquiring a reconstructed image of the original image based on the reconstructed sub-images of the N sub-images.

[0044] In one possible implementation, the first and second encoded data of each subgraph can be decoded independently.

[0045] In one possible implementation, the first coded data includes first coded block data of a subgraph; wherein the first coded block data of the subgraph is obtained from a block to be coded based on wavelet coefficients of a low-frequency subband; the second coded data includes second coded block data of each subgraph; wherein the second coded block data of the subgraph is obtained from a block to be coded based on wavelet coefficients of a high-frequency subband.

[0046] In one possible implementation, the second coded block data of a subgraph is continuous in the image bitstream.

[0047] In one possible implementation, the reconstruction coefficients of the high-frequency subband include: reconstruction coefficients of the first high-frequency subband, reconstruction coefficients of the second high-frequency subband, and reconstruction coefficients of the third high-frequency subband. The second coded data includes third coded data generated based on the wavelet coefficients of the first high-frequency subband, fourth coded data generated based on the wavelet coefficients of the second high-frequency subband, and fifth coded data generated based on the wavelet coefficients of the third high-frequency subband. The first coded data, third coded data, fourth coded data, and fifth coded data can be decoded independently.

[0048] In one possible implementation, the image to be encoded is divided into sub-images to obtain N sub-images, including: dividing the image to be encoded into sub-images based on a sub-image division method to obtain N sub-images; the sub-image division method indicates the size of the sub-images.

[0049] In one possible implementation, the size of the subimage includes at least one of the following: a width that is a multiple of 128, a height that is a multiple of 128, or a width that is less than or equal to 1024 pixels.

[0050] In one possible implementation, the subgraph partitioning module is specifically used to: fill at least one subgraph if there exists a width and / or height that is not a multiple of 128; wherein the width and height of the filled at least one subgraph are multiples of 16.

[0051] In one possible implementation, the width of each sub-image is less than or equal to 1024 pixels.

[0052] In one possible implementation, the image bitstream includes offset information that indicates the position of independently decodeable encoded data within the image bitstream.

[0053] Fifthly, this application provides an encoder, including: a memory and a processor, the memory being coupled to the processor; the memory storing program instructions, which, when executed by the processor, cause the encoder to perform the method in the first aspect or any possible implementation thereof.

[0054] In a sixth aspect, this application provides a decoder, comprising: a memory and a processor, the memory being coupled to the processor; the memory storing program instructions, which, when executed by the processor, cause the decoder to perform the method in the second aspect or any possible implementation thereof.

[0055] In a seventh aspect, this application provides a chip including one or more interface circuits and one or more processors; the one or more processors receive or transmit data through the one or more interface circuits, and when the one or more processors execute computer instructions, cause the electronic device to perform the method in the first aspect or any possible implementation of the first aspect.

[0056] Eighthly, this application provides a chip including one or more interface circuits and one or more processors; the one or more processors receive or transmit data through the one or more interface circuits, and when the one or more processors execute computer instructions, cause the electronic device to perform the method in the second aspect or any possible implementation of the second aspect.

[0057] Ninthly, this application provides a computer-readable storage medium storing a computer program that, when run on a computer or processor, causes the computer or processor to perform the method of the first aspect or any possible implementation thereof.

[0058] In a tenth aspect, this application provides a computer-readable storage medium storing a computer program that, when run on a computer or processor, causes the computer or processor to perform the method of the second aspect or any possible implementation thereof.

[0059] In one aspect, this application provides a computer program product, which includes computer instructions that, when executed by a computer or processor, cause the computer or processor to perform the method in the first aspect or any possible implementation thereof.

[0060] In a twelfth aspect, this application provides a computer program product including computer instructions that, when executed by a computer or processor, cause the computer or processor to perform the method in the second aspect or any possible implementation thereof.

[0061] In a thirteenth aspect, this application provides a computer-readable storage medium that stores a bitstream from the third aspect or any possible implementation thereof.

[0062] In a fourteenth aspect, this application provides an encoder including processing circuitry that can be used to perform the methods in the first aspect or any possible implementation thereof.

[0063] In a fifteenth aspect, this application provides a decoder including processing circuitry that can be used to perform the methods in the second aspect or any possible implementation thereof.

[0064] In a sixteenth aspect, this application provides a bitstream generated according to the third aspect and any implementation thereof.

[0065] In this embodiment, the electronic device, computer-readable storage medium, computer program product, chip, or codec are all used to execute the corresponding methods provided above. Therefore, the beneficial effects that can be achieved can be referred to the beneficial effects in the corresponding methods provided above. Attached Figure Description

[0066] Figure 1A is a schematic block diagram of an exemplary video encoding and decoding system;

[0067] Figure 1B is a schematic block diagram of an exemplary video decoding system;

[0068] Figure 2 is a schematic block diagram of an encoder as an example;

[0069] Figure 3 is a schematic block diagram of an exemplary decoder;

[0070] Figure 4 is a schematic diagram of the structure of an exemplary video decoding device;

[0071] Figure 5 is a schematic diagram of the structure of an exemplary device;

[0072] Figure 6 is a schematic block diagram of an encoder based on wavelet transform, which is an example shown.

[0073] Figure 7 is a schematic block diagram of an exemplary wavelet transform-based decoder;

[0074] Figure 8 is a schematic block diagram of an encoder as an example;

[0075] Figure 9A is an exemplary schematic diagram of subgraph partitioning;

[0076] Figure 9B is an exemplary schematic diagram of subgraph partitioning;

[0077] Figure 10 is an exemplary schematic diagram of wavelet transform;

[0078] Figure 11 is a schematic block diagram of an exemplary decoder;

[0079] Figure 12 is a schematic block diagram of an encoder as an example;

[0080] Figure 13A is a schematic diagram of the structure of an image bitstream as an example;

[0081] Figure 13B is a schematic diagram of the structure of an image bitstream as an example;

[0082] Figure 14A is a schematic diagram of the structure of an image bitstream as an example;

[0083] Figure 14B is a schematic diagram of the structure of an image bitstream as an example;

[0084] Figure 15 is a schematic diagram of the structure of an image bitstream as an example;

[0085] Figures 16A to 16C are schematic diagrams illustrating the structure of an image bitstream as an example;

[0086] Figures 17A and 17B are schematic diagrams of the structure of an image bitstream as an example;

[0087] Figure 18 is a schematic block diagram of an exemplary decoder;

[0088] Figure 19 is a schematic block diagram of an exemplary decoder;

[0089] Figure 20 is a schematic diagram of the structure of an exemplary device. Detailed Implementation

[0090] The embodiments of this application are described below with reference to the accompanying drawings. In the following description, reference is made to the accompanying drawings, which form part of this application and illustrate specific aspects of the embodiments of this application or to which specific aspects of the embodiments of this application may be used. It should be understood that the embodiments of this application may be used in other aspects and may include structural or logical variations not depicted in the drawings. Therefore, the following detailed description should not be construed in a limiting sense, and the scope of this application is defined by the appended claims. For example, it should be understood that the disclosure of the described methods is equally applicable to corresponding devices or systems for performing the methods, and vice versa. For example, if one or more specific method steps are described, the corresponding device may include one or more units, such as functional units, to perform the described one or more method steps (e.g., one unit performs one or more steps, or multiple units, each performing one or more of multiple steps), even if such one or more units are not explicitly described or illustrated in the drawings. On the other hand, for example, if a specific apparatus is described based on one or more units such as functional units, the corresponding method may include a step to perform the functionality of one or more units (e.g., a step to perform the functionality of one or more units, or multiple steps, each of which performs the functionality of one or more units among a plurality of units), even if such one or more steps are not explicitly described or illustrated in the accompanying drawings. Furthermore, it should be understood that, unless otherwise expressly stated, features of the various exemplary embodiments and / or aspects described herein can be combined with each other.

[0091] In the embodiments of this application, the modules / components shown in the framework diagram (or structural diagram or system diagram) are merely examples of this application. The actual framework (or structure or system) may include more or fewer modules / components than those shown in the diagram, or may have different component configurations. Furthermore, the various components / modules shown in the diagrams may be implemented in hardware, software, or a combination of hardware and software, including one or more signal processing and / or application-specific integrated circuits.

[0092] The terminology used in the implementation section of this application is for the purpose of explaining specific embodiments of this application only, and is not intended to limit this application.

[0093] The following is a brief introduction to some concepts that may be involved in the embodiments of this application. These concepts are only used to explain the specific embodiments of this application and are not intended to limit this application.

[0094] The residual is the difference between the reconstructed value and the predicted value of a sample or data element.

[0095] A residual block is an M×N residual matrix composed of the residuals corresponding to the coded blocks.

[0096] Dequantization is the process of scaling the quantized residual to obtain the reconstructed residual value.

[0097] A partition divides a set into subsets. Each element in the set belongs to one and only one subset.

[0098] Partition type: The way the subsets obtained from the partition are organized.

[0099] A decoded picture is an image reconstructed by the decoder based on the bitstream.

[0100] Prediction is the specific implementation of the prediction process.

[0101] The prediction process uses previously decoded samples to obtain the predicted value for the current sample.

[0102] Syntax element: The result of parsing data units in a bitstream.

[0103] A bitstream is a binary data stream that encodes all or part of an image sample.

[0104] Video coding generally refers to the processing of a sequence of images that form a video or video sequence. In the field of video coding, the terms "picture," "frame," or "image" can be used synonymously. Video coding is performed on the source side and typically involves processing (e.g., by compression) the raw video images to reduce the amount of data required to represent them, thus enabling more efficient storage and / or transmission. Video decoding is performed on the destination side and typically involves inverse processing relative to the encoder to reconstruct the video images. The combination of encoding and decoding is also known as encoding and decoding.

[0105] A video sequence consists of a series of pictures, which are further divided into slices, and slices into blocks. Video coding is performed on a block-by-block basis. In some newer video coding standards, the concept of a block has been further expanded. For example, the H.264 standard uses macroblocks (MBs), which can be further divided into multiple prediction blocks (partitions) for predictive coding. The High Efficiency Video Coding (HEVC) standard uses basic concepts such as coding units (CUs), prediction units (PUs), and transform units (TUs) to functionally divide various block units, and employs a novel tree-based structure for description. For instance, a CU can be divided into smaller CUs using a quadtree, and these smaller CUs can be further divided, forming a quadtree structure. The CU is the basic unit for partitioning and encoding the image. Similar tree structures exist for PUs and TUs. A PU corresponds to a prediction block and is the basic unit for predictive coding. CUs are further divided into multiple PUs according to partitioning patterns. TU can correspond to a transform block, which is the basic unit for transforming the prediction residual. However, whether it is CU, PU or TU, they all essentially belong to the concept of a block (or image block).

[0106] For example, in HEVC, the CTU is split into multiple CUs using a quadtree structure represented as a coding tree. At the CU level, a decision is made on whether to use inter-picture (temporal) or intra-picture (spatial) prediction to encode picture regions. Each CU can be further split into one, two, or four PUs based on the PU splitting type. The same prediction process is applied within a PU, and relevant information is transmitted to the decoder based on the PU. After obtaining residual blocks by applying the prediction process based on the PU splitting type, the CU can be segmented into transform units (TUs) according to other quadtree structures similar to the coding tree used for CUs. In the latest developments in video compression technology, quadtree and binary tree (QTBT) frame segmentation is used to divide coding blocks. In the QTBT block structure, CUs can be square or rectangular in shape.

[0107] In this paper, for ease of description and understanding, the image block to be processed in the current image is referred to as the current block. For example, in encoding, it refers to the block currently being encoded; in decoding, it refers to the block currently being decoded. The decoded image block in the reference image used to predict the current block is called the reference block. That is, the reference block is the block that provides a reference signal for the current block, where the reference signal represents the pixel value within the image block. The block in the reference image that provides a prediction signal for the current block is called the prediction block, where the prediction signal represents the pixel value, sampled value, or sampled signal within the prediction block. For example, after traversing multiple reference blocks, an optimal reference block is found. This optimal reference block will provide prediction for the current block; this block is called the prediction block.

[0108] In lossless video coding, the original video image can be reconstructed, meaning the reconstructed video image has the same quality as the original (assuming no transmission loss or other data loss during storage or transmission). In lossy video coding, further compression is performed, for example, through quantization, to reduce the amount of data required to represent the video image. However, the decoder cannot fully reconstruct the video image, meaning the quality of the reconstructed video image is lower or worse than the original video image.

[0109] The system architecture used in the embodiments of this application is described below. Referring to FIG1A, FIG1A provides an exemplary schematic block diagram of a video encoding and decoding system 10 used in the embodiments of this application. As shown in FIG1A, the video encoding and decoding system 10 may include a source device 12 and a destination device 14. The source device 12 generates encoded video data, and therefore, the source device 12 may be referred to as a video encoding device. The destination device 14 can decode the encoded video data generated by the source device 12, and therefore, the destination device 14 may be referred to as a video decoding device. Various embodiments of the source device 12, the destination device 14, or both may include one or more processors and memory coupled to the one or more processors. The memory may include, but is not limited to, RAM, ROM, EEPROM, flash memory, or any other media that can be used to store desired program code in the form of computer-accessible instructions or data structures. The source device 12 and the destination device 14 may include a variety of devices, including desktop computers, mobile computing devices, notebook (e.g., laptop) computers, tablet computers, set-top boxes, handsets, televisions, cameras, display devices, digital media players, video game consoles, in-vehicle computers, wireless communication devices, or the like.

[0110] Source device 12 and destination device 14 can communicate via link 13, through which destination device 14 can receive encoded video data from source device 12. Link 13 may include one or more media or devices capable of transmitting encoded video data from source device 12 to destination device 14. In one example, link 13 may include one or more communication media enabling source device 12 to transmit encoded video data to destination device 14 in real time. In this example, source device 12 may modulate the encoded video data according to a communication standard (e.g., a wireless communication protocol) and transmit the modulated video data to destination device 14. The one or more communication media may include wireless and / or wired communication media, such as radio frequency (RF) spectrum or one or more physical transmission lines. The one or more communication media may form part of a packet-based network, such as a local area network, wide area network, or global network (e.g., the Internet). The one or more communication media may include routers, switches, base stations, or other devices facilitating communication from source device 12 to destination device 14.

[0111] The source device 12 includes an encoder 20. Optionally, the source device 12 may also include an image source 16, an image preprocessor 18, and a communication interface 22. In specific implementations, the encoder 20, image source 16, image preprocessor 18, and communication interface 22 may be hardware components or software programs within the source device 12. These are described below:

[0112] Image source 16 may include or be any type of image capture device for, for example, capturing real-world images, and / or any type of image or commentary (for screen content encoding, some text on the screen is also considered as an image to be encoded or part of an image) generation device, such as a computer graphics processor for generating computer-animated images, or any type of device for acquiring and / or providing real-world images, computer-animated images (e.g., screen content, virtual reality (VR) images), and / or any combination thereof (e.g., augmented reality (AR) images). Image source 16 may be a camera for capturing images or a memory for storing images. Image source 16 may also include any type of (internal or external) interface for storing previously captured or generated images and / or acquiring or receiving images. When image source 16 is a camera, image source 16 may be, for example, a local or integrated camera integrated into a source device; when image source 16 is a memory, image source 16 may be a local or integrated memory integrated into a source device. When the image source 16 includes an interface, the interface may be, for example, an external interface for receiving images from an external video source, such as an external image capture device, like a camera, external storage, or an external image generation device, such as an external computer graphics processor, computer, or server. The interface can be any type of interface according to any proprietary or standardized interface protocol, such as a wired or wireless interface, or an optical interface.

[0113] An image can be viewed as a two-dimensional array or matrix of pixels. Pixels in the array are also called sampling points. The number of sampling points in the array or image along the horizontal and vertical directions (or axes) defines the image's size and / or resolution. To represent color, three color components are typically used; that is, an image can be represented as or contain three sampling arrays. For example, in RBG format or color space, an image includes corresponding red, green, and blue sampling arrays. However, in video coding, each pixel is typically represented in a luma / chroma format or color space. For example, for a YUV format image, this includes a luma component indicated by Y (sometimes also indicated by L) and two chroma components indicated by U and V. The luma component Y represents the brightness or grayscale level intensity (e.g., both are the same in a grayscale image), while the two chroma components U and V represent chroma or color information components. Accordingly, a YUV format image includes a luma sampling array of luma sample values ​​(Y) and two chroma sampling arrays of chroma values ​​(U and V). An RGB format image can be converted or transformed to YUV format, and vice versa; this process is also called color transformation or conversion. If the image is black and white, it may only include a luminance sampling array. In this embodiment, the image transmitted from image source 16 to image processor can also be referred to as raw image data 17.

[0114] Image preprocessor 18 is configured to receive raw image data 17 and perform preprocessing on the raw image data 17 to obtain a preprocessed image 19 or preprocessed image data 19. For example, the preprocessing performed by image preprocessor 18 may include retouching, color format conversion (e.g., from RGB format to YUV format), color correction, or noise reduction.

[0115] Encoder 20 (or video encoder 20) is used to receive preprocessed image data 19 and process the preprocessed image data 19 using a relevant prediction mode (such as the prediction mode in the various embodiments herein) to provide encoded image data 21. In some embodiments, encoder 20 may be used to perform the various embodiments described below to implement the encoding method described herein on the encoding side.

[0116] Communication interface 22 can be used to receive encoded image data 21 and transmit the encoded image data 21 via link 13 to destination device 14 or any other device (such as a memory) for storage or direct reconstruction. The other device can be any device used for decoding or storage. Communication interface 22 can, for example, be used to encapsulate the encoded image data 21 into a suitable format, such as data packets, for transmission over link 13.

[0117] Destination device 14 includes decoder 30. Optionally, destination device 14 may also include communication interface 28, image post-processor 32, and display device 34. These are described below:

[0118] Communication interface 28 can be used to receive encoded image data 21 from source device 12 or any other source, such as a storage device, for example, an encoded image data storage device. Communication interface 28 can be used to transmit or receive encoded image data 21 via link 13 between source device 12 and destination device 14 or via any type of network, such as a wired or wireless connection, any type of network, such as a wired or wireless network or any combination thereof, or any type of private and public network, or any combination thereof. Communication interface 28 can be used, for example, to decapsulate data packets transmitted by communication interface 22 to obtain encoded image data 21.

[0119] Both communication interface 28 and communication interface 22 can be configured as unidirectional or bidirectional communication interfaces, and can be used, for example, to send and receive messages to establish connections, acknowledge and exchange any other information related to the communication link and / or data transmission, such as encoded image data transmission.

[0120] Decoder 30 (or video decoder 30) is used to receive encoded image data 21 and provide decoded image data 31 or decoded image 31 (the structural details of decoder 30 will be further described below based on FIG3, FIG4 or FIG5). In some embodiments, decoder 30 can be used to perform the various embodiments described below to implement the decoding method described in this application on the decoding side.

[0121] Image post-processor 32 is used to perform post-processing on decoded image data 31 (also referred to as reconstructed image data) to obtain post-processed image data 33. The post-processing performed by image post-processor 32 may include: color format conversion (e.g., from YUV format to RGB format), color correction, retouching or resampling, or any other processing, and may also be used to transmit the post-processed image data 33 to display device 34.

[0122] Display device 34 is used to receive post-processed image data 33 to display an image to, for example, a user or viewer. Display device 34 can be or may include any class of displays for presenting reconstructed images, such as integrated or external displays or monitors. For example, displays may include liquid crystal displays (LCDs), organic light emitting diode (OLED) displays, plasma displays, projectors, micro-LED displays, liquid crystal on silicon (LCoS), digital light processors (DLP), or any other class of displays.

[0123] Although Figure 1A illustrates source device 12 and destination device 14 as separate devices, device embodiments may also include the functionality of both source device 12 and destination device 14, or both; that is, the functionality of source device 12 or its corresponding features and the functionality of destination device 14 or its corresponding features. In such embodiments, the same hardware and / or software, or separate hardware and / or software, or any combination thereof, may be used to implement the functionality of source device 12 or its corresponding features and the functionality of destination device 14 or its corresponding features.

[0124] Both encoder 20 and decoder 30 can be implemented as any of a variety of suitable circuits, such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, hardware, or any combination thereof. If the technology is implemented in part in software, the device can store the software instructions in a suitable non-transitory computer-readable storage medium, and one or more processors can be used to execute the instructions in hardware to perform the technology of this disclosure. Any of the foregoing (including hardware, software, combinations of hardware and software, etc.) can be considered as one or more processors.

[0125] In some cases, the video encoding and decoding system 10 shown in Figure 1A is merely an example, and the technology of this application can be applied to video encoding setups (e.g., video encoding or video decoding) that do not necessarily involve any data communication between the encoding and decoding devices. In other instances, data may be retrieved from local storage, streamed over a network, etc. The video encoding device may encode the data and store it in storage, and / or the video decoding device may retrieve the data from storage and decode it. In some instances, encoding and decoding are performed by devices that do not communicate with each other but only encode data to storage and / or retrieve data from storage and decode the data.

[0126] Referring to FIG1B, FIG1B is an illustrative diagram of an example of a video decoding system 40 including the encoder 20 of FIG2 and / or the decoder 30 of FIG3 according to an exemplary embodiment. The video decoding system 40 can implement various combinations of technologies of the embodiments of this application. In the illustrated embodiment, the video decoding system 40 may include an imaging device 41, an encoder 20, a decoder 30 (and / or a video encoder / decoder implemented by logic circuitry of a processing unit 46), an antenna 42, one or more processors 43, one or more memories 44, and a display device 45.

[0127] As shown in Figure 1B, the imaging device 41, antenna 42, processing unit 46, logic circuit, encoder 20, decoder 30, processor 43, memory 44, and display device 45 are capable of communicating with each other. As discussed, although encoder 20 and decoder 30 are used as examples to describe the video decoding system 40, in different instances, the video decoding system 40 may contain only encoder 20 or only decoder 30.

[0128] In some instances, antenna 42 can be used to transmit or receive encoded video data streams. Additionally, in some instances, display device 45 can be used to present video data. In some instances, logic circuitry can be implemented using processing unit 46. Processing unit 46 can include an ASIC, graphics processor, general-purpose processor, etc. Video decoding system 40 can also include an optional processor 43, which can similarly include an ASIC, graphics processor, general-purpose processor, etc. In some instances, logic circuitry can be implemented in hardware, such as dedicated video encoding hardware, while processor 43 can be implemented in general-purpose software, operating system, etc. Furthermore, memory 44 can be any type of memory, such as volatile memory (e.g., static random access memory (SRAM), dynamic random access memory (DRAM), etc.) or non-volatile memory (e.g., flash memory, etc.). In a non-limiting instance, memory 44 can be implemented using cache memory. In some instances, logic circuitry can access memory 44 (e.g., for implementing an image buffer). In other instances, the logic circuitry and / or processing unit 46 may include memory (e.g., cache, etc.) for implementing image buffers, etc.

[0129] In some instances, the encoder 20 implemented via logic circuitry may include (e.g., implemented via processing unit 46 or memory 44) an image buffer and (e.g., implemented via processing unit 46) a graphics processing unit. The graphics processing unit may be communicatively coupled to the image buffer. The graphics processing unit may include the encoder 20 implemented via logic circuitry to implement various modules discussed with reference to Figure 2 and / or any other encoder system or subsystem described herein. The logic circuitry may be used to perform various operations discussed herein.

[0130] In some instances, decoder 30 may be implemented via logic circuitry in a similar manner to implement the various modules discussed in reference to decoder 30 of Figure 3 and / or any other decoder system or subsystem described herein. In some instances, the logic circuitry-implemented decoder 30 may include an image buffer (implemented via processing unit 46 or memory 44) and a graphics processing unit (e.g., implemented via processing unit 46). The graphics processing unit may be communicatively coupled to the image buffer. The graphics processing unit may include decoder 30 implemented via logic circuitry to implement the various modules discussed in reference to Figure 3 and / or any other decoder system or subsystem described herein.

[0131] In some instances, antenna 42 can be used to receive an encoded stream of video data. As discussed herein, the encoded stream may contain data related to encoded video frames, indicators, index values, mode selection data, etc., such as data related to code segmentation (e.g., transform coefficients or quantized transform coefficients, optional indicators, and / or data defining code segmentation). Video decoding system 40 may also include a decoder 30 coupled to antenna 42 for decoding the encoded stream. Display device 45 is used to display the video frames.

[0132] It should be understood that, referring to the examples described for encoder 20 in the embodiments of this application, decoder 30 can be used to perform the reverse process. Regarding signaling syntax elements, decoder 30 can be used to receive and parse such syntax elements, and accordingly decode the associated video data. In some examples, encoder 20 can entropy-encode syntax elements into an encoded video stream. In such instances, decoder 30 can parse such syntax elements and accordingly decode the associated video data.

[0133] It should be noted that the encoding and decoding method described in the embodiments of this application is mainly used for the encoding and decoding process of video or images. This process exists in both the encoder 20 and the decoder 30. The encoder 20 and decoder 30 in the embodiments of this application can be, for example, the encoder / decoder corresponding to video standard protocols such as H.263, H.264, HEVV, MPEG-2, MPEG-4, VP8, VP9, ​​or next-generation video standard protocols (such as H.266).

[0134] Referring to Figure 2, which is a schematic / conceptual block diagram of an exemplary example of encoder 20, encoder 20 includes a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, an inverse transform processing unit 212, a reconstruction unit 214, a buffer 216, a loop filter unit 220, a decoded picture buffer (DPB) 230, a prediction processing unit 260, and an entropy coding unit 270. Prediction processing unit 260 may include inter-frame prediction unit 244, intra-frame prediction unit 254, and mode selection unit 262. Inter-frame prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). Encoder 20 shown in Figure 2 may also be referred to as a hybrid video encoder or a video encoder based on a hybrid video codec.

[0135] Referring to Figure 3, which is a schematic / conceptual block diagram of an example of a decoder 30, the decoder 30 is used to receive, for example, encoded image data (e.g., encoded bitstream) 21 encoded by encoder 20 to obtain a decoded image 331. During the decoding process, the decoder 30 receives video data from encoder 20, such as encoded video bitstreams representing image blocks of encoded video stripes and associated syntax elements.

[0136] In the example of Figure 3, decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g., a summer 314), a buffer 316, a loop filter 320, a decoded image buffer 330, and a prediction processing unit 360. Prediction processing unit 360 may include an inter-frame prediction unit 344, an intra-frame prediction unit 354, and a mode selection unit 362. In some instances, decoder 30 may perform a decoding process that is generally the inverse of the encoding process described in video encoder 20 of Figure 2.

[0137] Referring to Figure 4, Figure 4 is a structural schematic diagram of a video decoding device 400 (e.g., a video encoding device 400 or a video decoding device 400) provided in an embodiment of this application. The video decoding device 400 is adapted to implement the embodiments described herein. In one embodiment, the video decoding device 400 may be a video decoder (e.g., decoder 30 of Figure 1A) or a video encoder (e.g., encoder 20 of Figure 1A). In another embodiment, the video decoding device 400 may be one or more components of the decoder 30 of Figure 1A or the encoder 20 of Figure 1A.

[0138] The video decoding device 400 includes: an input port 410 and a receiving unit (Rx) 420 for receiving data; a processor, logic unit, or central processing unit (CPU) 430 for processing data; a transmitter unit (Tx) 440 and an output port 450 for transmitting data; and a memory 460 for storing data. The video decoding device 400 may also include photoelectric conversion components and electro-optical (EO) components coupled to the input port 410, receiver unit 420, transmitter unit 440, and output port 450 for the input or output of optical or electrical signals.

[0139] Processor 430 is implemented in both hardware and software. Processor 430 can be implemented as one or more CPU chips, cores (e.g., multi-core processors), FPGAs, ASICs, and DSPs. Processor 430 communicates with ingress port 410, receiver unit 420, transmitter unit 440, egress port 450, and memory 460. Processor 430 includes either an encoding module 470 or a decoding module 470. The encoding / decoding module 470 implements the embodiments disclosed herein to implement the encoding or decoding methods provided in the embodiments of this application. For example, the encoding / decoding module 470 implements, processes, or provides various encoding operations. Therefore, the encoding / decoding module 470 provides a substantial improvement to the functionality of the video decoding device 400 and affects the transitions of the video decoding device 400 to different states. Alternatively, the encoding / decoding module 470 can be implemented with instructions stored in memory 460 and executed by processor 430.

[0140] Memory 460 includes one or more disks, tape drives, and solid-state drives, which can be used as overflow data storage devices to store programs while they are selectively executed, and to store instructions and data read during program execution. Memory 460 can be volatile and / or non-volatile, and can be read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and / or static random access memory (SRAM).

[0141] Referring to FIG5, FIG5 is a simplified block diagram of an apparatus 500 that can be used as either or both of the source device 12 and destination device 14 in FIG1A according to an exemplary embodiment. The apparatus 500 can implement the technology of this application. In other words, FIG5 is a schematic block diagram of an implementation of an encoding or decoding apparatus (hereinafter referred to as decoding apparatus 500) according to an embodiment of this application. The decoding apparatus 500 may include a processor 510, a memory 530, and a bus system 550. The processor and the memory are connected via the bus system. The memory is used to store instructions, and the processor is used to execute the instructions stored in the memory. The memory of the decoding apparatus stores program code, and the processor can call the program code stored in the memory to execute various video encoding or decoding methods described in this application. To avoid repetition, detailed descriptions are not provided here.

[0142] In this embodiment, the processor 510 may be a central processing unit (CPU), or it may be other general-purpose processors, DSPs, ASICs, FPGAs, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0143] The memory 530 may include a read-only memory (ROM) device or a random access memory (RAM) device. Any other suitable type of storage device may also be used as memory 530. Memory 530 may include code and data 531 accessed by processor 510 using bus 550. Memory 530 may further include an operating system 533 and an application program 535, which includes at least one program that allows processor 510 to execute the encoding or decoding methods described in this application. For example, application program 535 may include applications 1 to N, which further include video encoding or decoding applications that execute the encoding or decoding methods described in this application.

[0144] In addition to the data bus, the bus system 550 may also include a power bus, a control bus, and a status signal bus. However, for clarity, all buses are labeled as bus system 550 in the diagram.

[0145] Optionally, the decoding device 500 may also include one or more output devices, such as a display 570. In one example, the display 570 may be a haptic display that combines a display with a haptic unit capable of operatively sensing touch input. The display 570 may be connected to the processor 510 via a bus 550.

[0146] For example, commonly used transform methods in image coding include discrete cosine transform and wavelet transform. Wavelet transform is a local transform method that can perform localized, multi-scale analysis of images, focusing on the details of signal changes, making it very suitable for image coding tasks.

[0147] Referring to Figure 6, which is an exemplary schematic / conceptual block diagram of a wavelet transform-based encoder, the encoder 60 includes, but is not limited to, a wavelet forward transform unit 610, a quantization unit 620, and an entropy coding unit 630. Specifically, the encoder acquires the original image 601 through an interface unit (also called an input interface, not shown in the figure). The original image 601 is input to the wavelet forward transform unit 610, and after wavelet transform (also called wavelet forward transform), wavelet transform coefficients 602 are obtained, which can also be simply referred to as wavelet coefficients in this embodiment. The quantization unit 620 quantizes the wavelet transform coefficients 602 to obtain quantization coefficients 603. The entropy coding unit 630 entropy codes the quantization coefficients 603 to obtain the image bitstream 604 of the original image, which can also be called a compressed bitstream or bitstream.

[0148] It should be noted that the wavelet transform-based encoder architecture in Figure 6 is for illustrative purposes only, and other instances may include more units or modules. For example, it may include, but is not limited to, prediction units, transform units, etc., and this application does not impose any limitations.

[0149] Referring to Figure 7, which is an exemplary schematic / conceptual block diagram of a wavelet transform-based decoder, the decoder 70 in the example of Figure 7 includes, but is not limited to, an entropy decoding unit 710, an inverse quantization unit 720, and an inverse wavelet transform unit 730. Specifically, at the decoding end, the decoder interfaces with the image bitstream 701 through an input interface (also called an interface unit, not shown in the figure). The entropy decoding unit 710 performs entropy decoding on the image bitstream 701 to obtain quantization coefficients 702. The image bitstream 701 can be a bitstream 604 generated based on the encoder 60 in Figure 6. The inverse quantization unit 720 performs inverse quantization on the quantization coefficients 702 to obtain inverse quantization coefficients 703 (dequantized coefficient(s)), which can also be called reconstructed coefficients, reconstructed wavelet coefficients, etc. The inverse wavelet transform unit 730 performs inverse wavelet transform on the inverse quantization coefficients 703 to obtain the reconstructed image 704.

[0150] It should be noted that the wavelet transform-based decoder architecture in Figure 7 is for illustrative purposes only, and other instances may include more units or modules. For example, it may include, but is not limited to, prediction units, inverse transform units, etc., and this application does not impose any limitations.

[0151] For example, the wavelet coefficients obtained after wavelet transform include wavelet coefficients of the high-frequency subband and wavelet coefficients of the low-frequency subband. In the architecture shown in Figures 6 and 7, the codec performs the same processing on the wavelet coefficients of the high-frequency subband and the low-frequency subband, which has high processing complexity. In the embodiments of this application, the wavelet coefficients of the high-frequency subband can be simply referred to as the high-frequency subband, and the wavelet coefficients of the low-frequency subband can be simply referred to as the low-frequency subband. It can be understood that the high-frequency subband obtained after wavelet transform can optionally be the set of wavelet coefficients of the high-frequency subband, and the low-frequency subband obtained after wavelet transform can optionally be the set of wavelet coefficients of the low-frequency subband.

[0152] For example, the frequency of the high-frequency sub-band is greater than the frequency of the low-frequency sub-band. This can be understood as the frequency of various coefficients corresponding to the high-frequency sub-band in this application (such as wavelet coefficients, reconstruction coefficients, inverse quantization coefficients, etc. involved in this application) being greater than the frequency of the coefficients of the low-frequency sub-band.

[0153] This application provides a wavelet transform-based codec that can independently encode and decode low-frequency and high-frequency sub-bands, effectively reducing encoding and decoding complexity and improving efficiency. For example, an image undergoes wavelet transform to obtain low-frequency and high-frequency sub-bands, which are then encoded to generate low-frequency and high-frequency sub-band bitstreams, respectively. The low-frequency sub-band can be understood as a sub-image representing the low-frequency signal (or low-frequency information) of the original image, and the high-frequency sub-band can be understood as a sub-image representing the high-frequency signal (or high-frequency information) of the original image.

[0154] Referring to Figure 8, which is a schematic / conceptual block diagram of an encoder as an example, the encoder 80 includes, but is not limited to, a sub-graph partitioning unit 810, a wavelet forward transform unit 820, a low-frequency sub-band processing path 830, and a high-frequency sub-band processing path 840. Optionally, the wavelet forward transform unit and the wavelet inverse transform unit in this embodiment can also be collectively referred to as wavelet transform units, which can be understood as performing both wavelet forward transform processing and wavelet inverse transform processing. In this application, the low-frequency sub-band processing path can also be referred to as a low-frequency sub-band processing unit, and the high-frequency sub-band processing path can also be referred to as a high-frequency sub-band processing unit.

[0155] The low-frequency subband processing path 830 includes, but is not limited to: a transform / quantization unit 831 (also known as a low-frequency subband transform / quantization unit) and a low-frequency subband entropy coding unit 832.

[0156] The high-frequency subband processing path 840 includes, but is not limited to: a transform / quantization unit 841 (also known as a high-frequency subband transform / quantization unit) and a high-frequency subband entropy coding unit 842.

[0157] Specifically, encoder 80 receives image 801. Image 801 can be an image in an image sequence that forms a video or video sequence. Image 801 can be referred to as the current image or the image to be encoded, and image 801 can be the original image or an image obtained by processing the original image.

[0158] The sub-image partitioning unit 810 is used to acquire the current image and partition it to obtain at least one sub-image. Specifically, the sub-image partitioning unit 810 partitions the current image into N sub-images according to a sub-image partitioning method, where N is an integer greater than 0 (or an integer greater than 1). The sub-image partitioning method can include, but is not limited to, at least one of the following:

[0159] The width and / or height of the subgraph are multiples of 128;

[0160] The maximum width of the subimage is 1024 pixels;

[0161] The minimum height and / or width of the subimage is 256 pixels;

[0162] The original image resolution is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or,

[0163] The original image has a length greater than or equal to 4320 pixels, a width greater than or equal to 2160 pixels, and N is an integer greater than 1 and less than or equal to 16; or,

[0164] The original image has a length greater than or equal to 7680 pixels, a width greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32.

[0165] For example, common video resolutions are shown in Table 1:

[0166] Table 1

[0167] The values ​​mentioned above are merely illustrative examples and can be set according to actual needs.

[0168] For example, the subgraph partitioning unit 810 can set specific subgraph specifications (including width and height) based on the above subgraph partitioning method. The specific values ​​can be set according to actual needs within the range specified by the subgraph partitioning method.

[0169] Referring to Figure 9A, which is an exemplary schematic diagram of sub-image partitioning, in the example of Figure 9A, the sub-image partitioning unit 810 can partition the image 801 into m*n sub-images according to the sub-image partitioning method. Optionally, in this example, the width and height of each sub-image satisfy a multiple of 128.

[0170] Referring to Figure 9B, which is an exemplary schematic diagram of sub-image partitioning, in the example of Figure 9B, the sub-image partitioning unit 810 can partition the image into m*n sub-images according to the sub-image partitioning method. When the sub-image partitioning unit 810 partitions the boundary portion of the current image, the width and / or height of the boundary sub-images may optionally not satisfy a multiple of 128. Figure 9B only illustrates this by showing that the width of some boundaries does not satisfy a multiple of 128. Referring to Figure 9B, in this embodiment, for sub-images whose width and height do not satisfy a multiple of 128, the sub-image partitioning unit 810 can pad these sub-images, such as the gray portion in Figure 9B. Taking sub-image 1_n as an example, the height of sub-image 1_n satisfies a multiple of 128, but its width does not. The sub-image partitioning unit 810 pads sub-image 1_n.

[0171] In one possible implementation, the width and / or height of the filled subgraph can optionally be less than or equal to the subgraph size set by the subgraph partitioning method. For example, the size (i.e., width and height) of the filled subgraph 1_n can be the same as that of subgraph 1_1. As another example, the size of the filled subgraph 1_n can be less than the size of subgraph 1_1, where the width of subgraph 1_1 is a, the height is b, the width of subgraph 1_n before filling is c, the height is b, c is less than b, and c is not a multiple of 128. The subgraph partitioning unit 810 fills the subgraph 1_n, and the width of the filled subgraph 1_n is d, and the height is b. Here, d can optionally be a multiple of 16, and d is greater than c and less than or equal to a.

[0172] In this way, by padding the sub-images, each macroblock can meet the 8x8 (pixel) partitioning requirement during the block division process of the encoding. Furthermore, by finding the least common multiple of the width and / or height of the sub-image before padding and 16, sub-images that do not meet the multiple of 16 are padded. This ensures that the size of the sub-image is a multiple of 16 while minimizing the size of the padded sub-image, thereby reducing the encoding complexity of the padded sub-image.

[0173] Optionally, the sub-image partitioning method can be the same for each image in the same video sequence.

[0174] Optionally, the sub-image division unit 810 can divide the image into sub-images along the horizontal and vertical directions, starting from the upper left corner, according to a preset sub-image size. The division order can be set according to actual needs. Typically, the sub-images that need to be filled are boundary sub-images, as shown in Figure 9B.

[0175] In this embodiment, each sub-image is encoded and decoded independently. Specifically, the image is divided into N sub-images, and the encoder 80 encodes each of the N sub-images separately. During the encoding process, a sub-image can also be referred to as the current sub-image or the sub-image to be encoded.

[0176] Referring again to Figure 8, the wavelet forward transform unit 820 is used to perform wavelet transform (also called wavelet forward transform) on the subgraph to obtain low-frequency subband and high-frequency subband. The low-frequency subband includes low-frequency signals in the subgraph that satisfy the low-frequency filter coefficients, and the high-frequency subband includes high-frequency signals in the subgraph that have been decomposed by the high-frequency filter in the wavelet transform.

[0177] Referring to Figure 10, which is an exemplary schematic diagram of wavelet transform, in the example of Figure 10, the wavelet forward transform unit 820 acquires the current sub-image, for example, sub-image 1_1. The wavelet forward transform unit 820 performs a wavelet transform on the current sub-image, wherein the wavelet transform includes one horizontal wavelet transform and one vertical wavelet transform to obtain the wavelet coefficients of the low-low (LL) sub-band (abbreviated as LL sub-band), the wavelet coefficients of the low-high (LH) sub-band (abbreviated as LH sub-band), the wavelet coefficients of the high-high (HH) sub-band (abbreviated as HH sub-band), and the wavelet coefficients of the high-low (HL) sub-band (abbreviated as HL sub-band).

[0178] In this embodiment, the low-frequency subband includes an LL subband, and the high-frequency subband includes an LH subband, an HH subband, and an HL subband. Optionally, the LL subband, LH subband, HH subband, and HL subband have the same dimensions (including width and height).

[0179] Referring again to Figure 8, the low-frequency subband processing path 830 is used to encode the low-frequency subband to obtain low-frequency subband encoded data 806, which can also be referred to as coded low-frequency subband. The high-frequency subband processing path 840 is used to encode the high-frequency subband to obtain high-frequency subband encoded data 809, which can also be referred to as coded high-frequency subband. In this application, the high-frequency subband encoded data can also be referred to as second encoded data.

[0180] Specifically, the wavelet forward transform unit 820 outputs wavelet coefficients 803 of the low-frequency subband to the transform / quantization unit 831, and outputs wavelet coefficients 804 of the high-frequency subband to the transform / quantization unit 841.

[0181] For example, the transform / quantization unit 831 is used to obtain the wavelet coefficients 803 of the low-frequency sub-band, perform quantization processing on the wavelet coefficients 803 of the low-frequency sub-band, or perform transform and quantization processing, and output the quantized coefficients 805 of the low-frequency sub-band, or the quantized wavelet coefficients of the low-frequency sub-band.

[0182] The transform / quantization unit 831 outputs the quantization coefficients 805 of the low-frequency subband to the low-frequency subband entropy encoding unit 832. Optionally, the transform / quantization unit 831 may include, but is not limited to, a transform processing unit and a quantization processing unit (not shown in the figure).

[0183] The transform processing unit is used to transform the low-frequency subband and output transform coefficients, also known as low-frequency subband transform coefficients. The quantization processing unit is used to quantize the subband or the transformed transform coefficients and output quantized coefficients (also known as quantization results).

[0184] The low-frequency subband entropy coding unit 832 is used to acquire the data to be encoded and perform entropy coding on the data to be encoded to obtain low-frequency subband encoded data. The data to be encoded may include, but is not limited to, the quantization coefficients 805 of the low-frequency subband. In some instances, the data to be encoded may also include parameters or information (or syntax elements) input from other modules not shown in the figure. The low-frequency subband encoded data may also be referred to as the first encoded data in this application.

[0185] Referring again to Figure 8, the transform / quantization unit 841 is used to quantize the wavelet coefficients 804 of the high-frequency subband, or to perform both transform and quantization processing, to obtain the quantized coefficients 807 of the high-frequency subband, which can also be referred to as the quantized wavelet coefficients of the high-frequency subband. The transform / quantization unit 841 outputs the quantized coefficients 807 of the high-frequency subband to the high-frequency subband entropy coding unit 842. For parts not described, please refer to the low-frequency subband transform / quantization unit 831; further details are omitted here.

[0186] The high-frequency subband entropy coding unit 842 is used to acquire the data to be encoded and perform entropy coding on the data to be encoded to obtain high-frequency subband encoded data 808, which can also be called encoded high-frequency subband. Optionally, the data to be encoded may include, but is not limited to, the quantization coefficients 807 of the high-frequency subband. In some instances, the data to be encoded may also include parameters or information (or syntax elements) input from other modules not shown in the figure.

[0187] Optionally, the entropy coding unit (including the low-frequency subband entropy coding unit 832 and the high-frequency subband entropy coding unit 842) is used to encode the data to be encoded using an entropy coding algorithm or scheme. The aforementioned entropy coding scheme may be, for example, at least one of the following: variable-length coding (VLC), context-adaptive VLC (CAVLC), arithmetic coding, and context-adaptive binary arithmetic coding (CABAC).

[0188] Optionally, the encoder 80 may also include, but is not limited to, a combining unit (not shown in the figure), which may also be called a multiplexer (MUX). The combining unit is used to generate an image bitstream based on the low-frequency subband coded data 806 and the high-frequency subband coded data 808.

[0189] Specifically, the combining unit writes low-frequency subband coded data 806 into the image bitstream and writes high-frequency subband coded data 808 into the image bitstream. In this embodiment, by encoding the low-frequency subband and high-frequency subband separately, the low-frequency subband coded data and high-frequency subband coded data can be decoded independently. That is, at the decoding end, it can independently decode the low-frequency subband coded data and high-frequency subband coded data in the image bitstream, thereby improving decoding efficiency.

[0190] As mentioned above, a single image can be divided into multiple sub-images, for example, N sub-images. Each sub-image can be decomposed into wavelet coefficients of a high-frequency sub-band and wavelet coefficients of a low-frequency sub-band after wavelet forward transform. Encoder 80 independently encodes the low-frequency and high-frequency sub-bands of each sub-image to obtain the low-frequency sub-band encoded data and high-frequency sub-band encoded data of a single sub-image. In this way, the combining unit can obtain the high-frequency sub-band encoded data and low-frequency sub-band encoded data of each of the N sub-images, that is, obtain N high-frequency sub-band encoded data (optionally, the high-frequency sub-band encoded data of each sub-image includes the HL sub-band encoded data corresponding to the HL sub-band, the HH sub-band encoded data corresponding to the HH sub-band, and the LH sub-band encoded data corresponding to the LH sub-band) and N low-frequency sub-band encoded data. The combining unit can optionally write the low-frequency sub-band encoded data and high-frequency sub-band encoded data of the N sub-images into the image bitstream. The format (or structure) of the image bitstream will be described in detail below.

[0191] Referring to Figure 11, which is a schematic / conceptual block diagram of an exemplary decoder, decoder 110 is used to receive, for example, a bitstream encoded by an encoder to obtain a decoded image, also referred to as a reconstructed image 1108. During the decoding process, the decoder receives a bitstream (also referred to as the bitstream of the original image, or the image data of the original image) from the encoder.

[0192] In the example shown in Figure 11, the decoder 110 includes, but is not limited to: a high-frequency subband processing path 1120, a low-frequency subband processing path 1110, a wavelet inverse transform unit 1130, and a subgraph stitching unit 1140.

[0193] The low-frequency subband processing path 1110 includes, but is not limited to: a low-frequency subband entropy decoding unit 1111 and an inverse quantization / inverse transform unit 1112 (also referred to as a low-frequency subband inverse quantization / inverse transform unit). The high-frequency subband decoding path 1120 includes, but is not limited to: a high-frequency subband entropy decoding unit 1121 and an inverse quantization / inverse transform unit 1122 (also referred to as a high-frequency subband inverse quantization / inverse transform unit).

[0194] For example, decoder 110 receives an image bitstream and obtains a reconstructed image 1108 (also known as a decoded image) based on high-frequency subband coded data 1102 and low-frequency subband coded data 1101 in the image bitstream.

[0195] For example, the low-frequency subband entropy decoding unit 1111 is used to acquire low-frequency subband encoded data 1101 in the image bitstream to obtain entropy decoding data, which includes, but is not limited to, the quantization coefficients 1103 of the low-frequency subband. Specifically, the low-frequency subband entropy decoding unit 1111 performs entropy decoding processing on the low-frequency subband encoded data 1101 to obtain entropy decoding data. The low-frequency subband entropy decoding unit 1111 outputs the quantization coefficients 1103 of the low-frequency subband to the inverse quantization / inverse transform unit 1112.

[0196] The inverse quantization / inverse transform unit 1112 is used to obtain the quantization coefficients 1103 of the low-frequency subband to obtain the reconstruction coefficients 1105 of the low-frequency subband, which can also be simply referred to as the reconstructed low-frequency subband. In some instances, it can also be called the reconstructed value of the low-frequency subband, the reconstruction coefficient of the low-frequency subband, or the reconstructed wavelet coefficients of the low-frequency subband. Specifically, the low-frequency inverse quantization / inverse transform unit performs inverse quantization and / or inverse transform processing on the quantization coefficients to obtain the reconstructed low-frequency subband, such as the reconstructed LL subband. Optionally, the inverse quantization / inverse transform unit 1112 may include, but is not limited to, an inverse quantization processing unit and an inverse transform processing unit (not shown in the figure). The inverse quantization processing unit can be used to perform inverse quantization processing on the input parameters to obtain inverse quantization coefficients. The inverse transform unit can be used to perform inverse transform processing on the input parameters to obtain inverse transform coefficients, which can also be called inverse transform coefficients. For example, the inverse transform processing unit can perform inverse transform processing on the inverse quantization coefficients output by the inverse quantization processing unit to obtain inverse transform inverse quantization coefficients.

[0197] The high-frequency subband entropy decoding unit 1121 is used to acquire the high-frequency subband encoded data 1102 in the image bitstream to obtain entropy-decoded data. The entropy-decoded data includes, but is not limited to, the quantization coefficients 1104 of the high-frequency subband. Specifically, the high-frequency subband entropy decoding unit 1121 performs entropy decoding processing on the high-frequency subband encoded data 1102 to obtain the entropy-decoded data. The high-frequency subband entropy decoding unit 1121 outputs the quantization coefficients 1104 of the high-frequency subband to the inverse quantization / inverse transform unit 1122.

[0198] The inverse quantization / inverse transform unit 1122 is used to obtain the quantization coefficients 1104 of the high-frequency subband, resulting in the reconstructed coefficients 1106 of the high-frequency subband, which can be simply referred to as the reconstructed high-frequency subband. In some instances, it can also be called the reconstructed value of the high-frequency subband, the reconstructed wavelet coefficients of the high-frequency subband, etc. The inverse quantization / inverse transform unit 1122 outputs the reconstructed high-frequency subband to the wavelet inverse transform unit 1130. Specifically, the inverse quantization / inverse transform unit 1122 performs inverse quantization processing on the quantization coefficients 1104 of the high-frequency subband, or performs inverse quantization and inverse transform processing, to obtain the reconstructed high-frequency subband. For example, this includes reconstructing the HH subband (e.g., the reconstructed coefficients of the HH subband), reconstructing the HL subband (e.g., the reconstructed coefficients of the HL subband), and reconstructing the LH subband (e.g., the reconstructed coefficients of the LH subband).

[0199] For example, the wavelet inverse transform unit 1130 is used to obtain the reconstruction coefficients 1105 of the low-frequency sub-band and the reconstruction coefficients 1106 of the high-frequency sub-band to obtain the reconstructed sub-map 1107. Specifically, the wavelet inverse transform unit 1130 can obtain the reconstructed low-frequency sub-band and the reconstructed high-frequency sub-band of each sub-map. The wavelet inverse transform unit performs wavelet inverse transform processing on the obtained reconstructed low-frequency sub-band and reconstructed high-frequency sub-band corresponding to the same sub-map to obtain the reconstructed sub-map. Its inverse transform process is the inverse of the wavelet forward transform process, which will not be described in detail here.

[0200] The sub-image stitching unit 1140, also known as an image reconstruction unit or sub-image combination unit, is used to obtain reconstructed sub-images of the original image to obtain a reconstructed image of the original image. Specifically, the sub-image stitching unit 1140 obtains N reconstructed sub-images corresponding to the current decoded image. Based on the N reconstructed sub-images, the sub-image stitching unit 1140 can obtain the reconstructed image (also known as the decoded image or the decoded image) of the current image.

[0201] Based on the codecs shown in Figures 8 and 11, there can be more variations of the codec, such as including more processing units or modules.

[0202] Referring to Figure 12, which is a schematic / conceptual block diagram of an encoder as an example, the encoder in the example of Figure 12 includes, but is not limited to, a sub-graph partitioning unit 1210, a wavelet forward transform unit 1220, a low-frequency sub-band processing path 1230, and a high-frequency sub-band processing path 1240.

[0203] The descriptions of the subgraph partitioning unit 1210 and the wavelet forward transform unit 1220 can be found in the relevant content in Figure 8, and will not be repeated here.

[0204] The low-frequency subband processing path 1230 is used to obtain the wavelet coefficients 1203 of the low-frequency subband to obtain the low-frequency subband encoded data 1213. The low-frequency subband processing path 1230 includes, but is not limited to: a block partitioning unit 1231 (also called the low-frequency subband block partitioning unit 1231 or the first block partitioning unit 1231), a residual calculation unit 1232, a prediction unit 1237, a control unit 1238, a transform / quantization unit (also called the low-frequency subband transform / quantization unit 1233 or the first transform / quantization unit), an inverse quantization / inverse transform unit 1234 (also called the low-frequency subband inverse quantization / inverse transform unit 1234 or the first inverse transform / inverse quantization unit), a low-frequency subband wavelet coefficient 1203 splicing unit 1246, a low-frequency subband wavelet coefficient 1203 splicing unit 1246, and a low-frequency subband entropy coding unit 1239, etc.

[0205] The high-frequency subband processing path 1240 is used to acquire high-frequency subbands to obtain high-frequency subband encoded data. The high-frequency subband processing path 1240 includes, but is not limited to: block partitioning unit 1231 (also referred to as high-frequency subband block partitioning unit 1231 or second block partitioning unit 1231), transform / quantization unit (also referred to as transform / quantization unit 1242 or second transform / quantization unit), high-frequency subband entropy coding unit 1243, etc.

[0206] Alternatively, in some instances, the encoder may include more or fewer units or modules than in the structure shown in Figure 12.

[0207] The image 1201 encoding method provided in this application will be described in detail below with reference to the encoder shown in Figure 12:

[0208] The codec receives image 1201. A description of image 1201 can be found above and will not be repeated here.

[0209] Sub-image partitioning unit 1210 partitions image 1201 into sub-images and outputs N sub-images. N is an integer greater than 0. In this embodiment, each sub-image is encoded and decoded independently. During the encoding process, sub-image 1202 can be referred to as the current sub-image or the sub-image to be encoded.

[0210] Wavelet forward transform unit 1220 performs wavelet forward transform on the current sub-image to obtain wavelet coefficients 1203 (hereinafter referred to as low-frequency sub-band) and wavelet coefficients 1214 (hereinafter referred to as high-frequency sub-band) of the current sub-image. The wavelet coefficients 1203 of the low-frequency sub-band include the wavelet coefficients of the LL sub-band, and the high-frequency sub-band includes the wavelet coefficients of the LH, HL, and HH sub-bands. In this embodiment, each sub-image of the image can be independently encoded and decoded, and the high-frequency sub-band and low-frequency sub-band of each sub-image are independently encoded and decoded. The LH, HL, and HH sub-bands in the high-frequency sub-band can also be independently encoded and decoded.

[0211] The block partitioning unit 1231 (which may be called the low-frequency sub-band block partitioning unit) is used to obtain the wavelet coefficients 1203 of the low-frequency sub-band of the current sub-graph 1202, so as to obtain at least one macroblock 1204 of the low-frequency sub-band of the sub-graph 1202, wherein the macroblock can also be understood as a set of partial coefficients in the wavelet coefficients of the low-frequency sub-band.

[0212] Specifically, the block partitioning unit 1231 partitions the wavelet coefficients 1203 of the low-frequency sub-band of the current subgraph 1202 into blocks based on the block partitioning method, obtaining at least one macroblock 1204 of the low-frequency sub-band of the current subgraph, for example, M macroblocks, where M is an integer greater than 0 (or greater than 1). The low-frequency block partitioning unit 1231 outputs the macroblocks 1204 of the wavelet coefficients 1203 of the current low-frequency sub-band one by one to the residual calculation unit 1232 and the control unit 1238.

[0213] In this embodiment, macroblock 1204 is a basic encoding / decoding unit. During the encoding process, macroblock 1204 can also be referred to as the current block, current image 1201 block, macroblock 1204 to be encoded, block to be encoded, image 1204 block to be encoded, etc.

[0214] Alternatively, the block partitioning method includes, but is not limited to:

[0215] The wavelet coefficients 1203 of both the high-frequency subband and the low-frequency subband are divided into basic coding units of 8x8 macroblocks 1204 (unit is pixels).

[0216] For example, as described above, each subband uses macroblock 1204 as the basic coding unit. The macroblock 1204 currently to be encoded is referred to as the current macroblock 1204. Specifically, the low-frequency subband processing path 1230 encodes each macroblock 1204 of the wavelet coefficients 1203 of the low-frequency subband block by block. For example, encoding and prediction are performed on each macroblock 1204. The following description only uses the encoding process of the current macroblock 1204; the processing processes for other macroblocks are the same, and will not be described in detail here. For example, in encoding, it refers to the macroblock currently being encoded; in decoding, it refers to the macroblock currently being decoded. The decoded macroblock in the reference image used for predicting the current macroblock 1204 is called the reference block (i.e., the low-frequency subband reconstruction block 1209 in the figure). The reference block is the block that provides the reference signal for the current block, where the reference signal represents the pixel value within the macroblock 1204. The block in the reference image that provides the prediction signal for the current block can be called prediction block 1205, where the prediction signal represents the pixel value, sample value, or sample signal within prediction block 1205. For example, after traversing multiple reference blocks, an optimal reference block is found, which will provide the prediction for the current block; this block is called prediction block 1205.

[0217] Specifically, referring to Figure 12, the residual calculation unit 1232 is used to obtain the current macroblock 1204 and the prediction block 1205 (further details of the prediction block 1205 are provided below) to obtain the residual block 1206. Specifically, the residual calculation unit performs residual calculations on the current macroblock 1204 and the prediction block 1205 to obtain the residual block 1206. The residual calculation unit 1232 outputs the residual block 1206 to the transform / quantization unit 1233.

[0218] The transform / quantization unit 1233 is used to acquire the residual block 1206 to obtain the residual coefficients 1207. Specifically, the transform / quantization unit 1233 performs transform and / or quantization processing on the residual block 1206 to obtain the residual coefficients 1207, which can also be called the quantization coefficients of the residual block, or the quantized residual block. The transform / quantization unit 1233 outputs the residual coefficients 1207 to the inverse quantization single / inverse transform unit 1234 and the low-frequency subband entropy coding unit 1239.

[0219] The inverse quantization / inverse transform unit 1234, also known as the inverse quantization / inverse transform unit, is used to obtain the residual coefficients 1207 to obtain the residual reconstruction block 1208. Specifically, the inverse quantization / inverse transform unit 1234 performs inverse quantization and / or inverse transform processing on the residual coefficients 1207 to obtain the residual reconstruction block 1208, which can also be referred to as the inverse quantization coefficients of the residual block, the inverse quantized residual block, etc. The inverse quantization / inverse transform unit 1234 outputs the residual reconstruction block 1208 to the low-frequency subband splicing unit 1236.

[0220] The dequantization / inverse transform unit 1234 may include a dequantization unit and an inverse transform unit (not shown in the figure). The dequantization unit is used to dequantize the input coefficients, and the inverse transform unit is used to inverse transform the input coefficients.

[0221] The low-frequency subband reconstruction unit 1235 is used to obtain a low-frequency subband reconstruction block 1209 based on the prediction block 1205 and the residual reconstruction block 1208. Specifically, the low-frequency subband reconstruction unit 1235 adds the residual reconstruction block 1208 to the prediction block 1205 to obtain the low-frequency subband reconstruction block 1209, which can also be referred to as the reconstructed low-frequency subband macroblock. Optionally, the low-frequency subband reconstruction unit 1235 outputs the low-frequency subband reconstruction block 1209 to the prediction unit 1237 and the low-frequency subband splicing unit 1236. Optionally, the low-frequency subband reconstruction unit 1235 outputs the low-frequency subband reconstruction block 1209 to the control unit 1238.

[0222] The low-frequency subband stitching unit 1236 is used to obtain the reconstructed low-frequency subband 1211, which can also be referred to as the reconstructed value or reconstructed data of the low-frequency subband, based on the low-frequency subband reconstruction block 1209. Optionally, the low-frequency subband stitching unit 1236 outputs the reconstructed low-frequency subband 1211 to the prediction unit 1237. Optionally, the low-frequency subband stitching unit 1236 outputs the reconstructed low-frequency subband 1211 to the control unit 1238.

[0223] Specifically, as described above, the low-frequency subband uses macroblocks as the basic coding unit, and the low-frequency subband splicing unit 1236 can obtain M low-frequency subband reconstruction blocks of a low-frequency subband. The low-frequency subband splicing unit 1236 can reconstruct the corresponding low-frequency subband based on the M low-frequency subband reconstruction blocks, that is, obtain the reconstructed low-frequency subband 1211.

[0224] The control unit 1238, also known as the mode selection unit, is used to determine the syntax element 1213 based on the macroblock 1204 (i.e. the current block); or to determine the syntax element 1213 based on the current macroblock 1204, the low-frequency subband reconstruction block 1209, and the reconstructed low-frequency subband 1211.

[0225] Syntax element 1213 includes at least one syntax element, such as pattern information. Pattern information, also known as prediction mode information, is used to indicate the prediction mode (or prediction method) of prediction unit 1237, such as inter-frame or intra-frame prediction mode. Control unit 1238 can output syntax element 1213 to prediction unit 1237 and low-frequency subband entropy coding unit 1239.

[0226] Prediction unit 1237, also known as prediction processing unit, is used to acquire syntax element 1213 and perform prediction processing based on syntax element 1213. Specifically, prediction unit 1237 may select a prediction mode based on syntax element 1213 (e.g., mode information in the syntax element). In one example, prediction unit 1237 may acquire low-frequency subband reconstruction block 1209 based on syntax element 1213 to acquire prediction block 1205. Specifically, prediction unit 1237 may perform intra-frame prediction based on low-frequency subband reconstruction block 1209 to acquire prediction block 1205. In another example, prediction unit 1237 may acquire reconstructed low-frequency subband 1211 based on syntax element 1213 to acquire prediction block 1205.

[0227] The prediction unit 1237 outputs prediction block 1205 to the residual calculation unit 1232 and the low-frequency sub-band splicing unit 1236.

[0228] The low-frequency subband entropy coding unit 1239 is used to obtain low-frequency subband encoded data 1213, also known as encoded low-frequency subband, based on residual coefficients 1207 and syntax elements 1213. Specifically, the low-frequency subband entropy coding unit 1239 uses an entropy coding algorithm or scheme (e.g., variable length coding (VLC) scheme, context adaptive VLC (CAVLC) scheme, arithmetic coding scheme, context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding, or other entropy coding methods or techniques) to entropy encode the residual coefficients 1207 and syntax elements 1213 to obtain low-frequency subband encoded data 1213 output in the form of, for example, an encoded bitstream.

[0229] Referring again to Figure 12, the block partitioning unit 1241, also known as the high-frequency subband block partitioning unit, is used to obtain the high-frequency subband of the current subgraph 1202 to obtain at least one macroblock 1215 of the high-frequency subband of the subgraph 1202. For a detailed description, please refer to the low-frequency subband section; it will not be repeated here. Specifically, the block partitioning unit 1241 partitions the high-frequency subband 1214 of the current subgraph 1202 (hereinafter referred to as the current high-frequency subband) into blocks based on the block partitioning method, obtaining at least one macroblock 1215 of the current subgraph 1202, for example, M macroblocks, where M is an integer greater than 0 (or an integer greater than 1). Other undescribed parts can be referred to the relevant description of the block partitioning unit 1231; it will not be repeated here.

[0230] Block partitioning unit 1241 outputs the macroblocks of the current high-frequency subband one by one to quantization / conversion unit 1242.

[0231] The transform / quantization unit 1242 is used to transform and / or quantize the macroblock 1215 to obtain the quantization coefficients 1216 of the high-frequency subband block (i.e., the quantization coefficients of the current macroblock). The transform / quantization unit 1242 outputs the quantization coefficients 1216 of the high-frequency subband block to the high-frequency subband entropy coding unit 1243.

[0232] The high-frequency subband entropy coding unit 1243 is used to perform entropy coding on the data to be encoded to obtain high-frequency subband encoded data 1217. The data to be encoded may include, but is not limited to, the quantization coefficients and syntax elements of each high-frequency subband block. The high-frequency subband encoded data 1217 includes, but is not limited to, HH subband encoded data, HL subband encoded data, and LH subband encoded data.

[0233] The encoding and decoding method provided in this application supports two scenarios: full I-frame configuration and I / P frame alternating encoding configuration. The encoder architecture shown in Figure 12 adds relevant modules required for the prediction process based on the wavelet transform architecture shown in Figure 8, which can improve the compression efficiency of I / P frame alternating encoding for scenarios such as fixed camera positions and slow camera movement.

[0234] Optionally, the encoder may also include a combination unit (not shown in the figure) for generating an image bitstream based on low-frequency subband coded data and high-frequency subband coded data. The specific process can be referred to the relevant description in Figure 8 above.

[0235] The bitstream output by the encoder in the embodiments of this application will be described in detail below. The bitstream structure described below can be applied to the encoders shown in Figures 8 and 12, and of course, it can also be applied to other encoder variations based on Figures 8 or 12.

[0236] For example, as described above, the low-frequency subband entropy coding unit 1239 and the high-frequency subband entropy coding unit 1243 output low-frequency subband coded data 1213 and high-frequency subband coded data 1217, respectively. This can be understood as the encoder 120 independently encoding the low-frequency and high-frequency subbands of each subgraph, outputting low-frequency and high-frequency subband coded data corresponding to the current subgraph.

[0237] Referring to Figure 13A, which is an exemplary schematic diagram of an image bitstream structure, the image bitstream in the example of Figure 13A includes, but is not limited to, image header information and image data (also referred to as an image data region).

[0238] For example, the image data includes at least one image data region (also referred to as an image data sub-region), such as, but not limited to, a first image data region and a second image data region. During the encoding process, the encoder (e.g., through a combination unit) writes high-frequency subband encoded data and low-frequency subband encoded data into the image bitstream. Specifically, the encoder writes high-frequency subband encoded data into the first image data region and low-frequency subband encoded data into the second image data region.

[0239] For example, image header information includes, but is not limited to, offset information and image size information.

[0240] For example, image size information is used to indicate the size of the original image. As mentioned above, during the encoding process, some sub-images may be padded during sub-image partitioning to ensure that the length and width of each sub-image are multiples of 16. Thus, during decoding, the size of the reconstructed image obtained by the decoder may be larger than the original image size. The decoder can process the reconstructed image based on the image size information to remove the padded portions.

[0241] For example, offset information is used to indicate the position of a data region in the image bitstream, and can also be understood as indicating the position of independently decodeable coded data in the image bitstream. When decoding coded data (i.e., the image bitstream) according to this application, the offset information in the image header information can be used to obtain independently decodeable coded data, and decoding operations can be performed on the coded data. The independently decodeable coded data (e.g., low-frequency subband coded data and high-frequency subband coded data) can be decoded synchronously during decoding to improve decoding efficiency.

[0242] In one example, the offset information can be the length of the image data region containing adjacent, independently decodeable encoded data in the image bitstream.

[0243] In another example, the offset information can be the offset (i.e., the difference) between the starting position of the image data region where the independently decoded encoded data is located and the ending position of the image header information.

[0244] Referring to Figure 13B, which is an exemplary schematic diagram of an image bitstream structure, the bitstream in the example of Figure 13B includes, but is not limited to, image header information and image data. The image header information includes, but is not limited to, offset information, etc., detailed concepts of which can be found above and will not be repeated here. The image data includes, but is not limited to, low-frequency subband coded data and high-frequency subband coded data. The low-frequency subband coded data is written to the first image data area, and the high-frequency subband coded data is written to the second image data area. Other descriptions can be found in Figure 13A and will not be repeated here.

[0245] It should be noted that the embodiments in this application only use the image bitstream of a single image as an example for illustration, that is, the bitstream includes only one image data. In the process of encoding video images, the encoder can generate an encoded image bitstream for each image, that is, the image bitstream includes multiple image data, and each image data carries the encoded data of the corresponding image.

[0246] Referring to Figure 14A, which is an exemplary schematic diagram of an image bitstream structure, in the example of Figure 14A, as described above, the high-frequency subband coding data of each sub-image further includes: HH subband coding data, HL subband coding data, and LH subband coding data. Accordingly, in this example, the image data includes, but is not limited to: HH subband coding data, HL subband coding data, and LH subband coding data of each sub-image of the image.

[0247] For example, in the example shown in Figure 14A, LL subband coded data is written to the second image data region, HL subband coded data is written to the first image data subregion, HH subband coded data is written to the second image data subregion, and LH subband coded data is written to the dotted image data subregion. The writing order of each high-frequency subband is only an illustrative example and will not be repeated below.

[0248] Optionally, in the example shown in Figure 14A, the offset information of each segment of independently decodeable encoded data in the image header information may include, but is not limited to: the offset of the starting position of the first image data sub-region relative to the ending position of the image header information (this data is usually measured in n bytes), the offset of the starting position of the second image data sub-region relative to the ending position of the image header information, and the offset of the starting position of the third image data sub-region relative to the ending position of the image header information. After obtaining these offsets by decoding the image header information, the starting position of each segment of independently decodeable encoded data can be obtained, so that the LL subband encoded data, HH subband encoded data, HL subband encoded data, and LH subband encoded data can be decoded independently during decoding.

[0249] Optionally, in the example shown in Figure 14A, the offset information may include, but is not limited to: the length information L0 of the first image data region (this length is typically measured in n bytes), the length information L1 of the first image data sub-region, and the length information L2 of the second image data sub-region. L0 is the offset of the starting position of the first image data sub-region relative to the ending position of the image header information. L0 + L1 yields the offset of the starting position of the second image data sub-region relative to the ending position of the image header information. L0 + L1 + L2 yields the offset of the starting position of the third image data sub-region relative to the ending position of the image header information. After obtaining the offset information by decoding the image header information, the starting position of each independently decodeable segment of encoded data can be obtained by addition calculation, so that the LL subband encoded data, HH subband encoded data, HL subband encoded data, and LH subband encoded data can be decoded independently during decoding.

[0250] Referring to Figure 14B, which is an exemplary schematic diagram of an image bitstream structure, in the example of Figure 14B, low-frequency subband coded data is written to the first image data region, and high-frequency subband coded data is written to the second image data region. Further details can be found in Figure 14A, and will not be repeated here.

[0251] Referring to Figure 15, which is an exemplary schematic diagram of an image bitstream structure, in the example of Figure 15, the high-frequency subband encoded data is written to the corresponding image data region according to the type of subband. Specifically, the description of the first image data region and its sub-regions, and the second image data region, can be referred to above and will not be repeated here. Taking HL subband encoded data as an example, the HL subbands of each sub-image (e.g., sub-image 1 to sub-image N) of the image are written to the first image data sub-region; the order is only illustrative.

[0252] In this context, for example, sub-image 1-HL in the figure represents the HL subband encoded data of sub-image 1 of the image. The HL subband encoded data of each sub-image further includes the encoded macroblocks of the HL subband of that sub-image. For example, sub-image 1-HL includes, but is not limited to: sub-image 1-HL-MB0 to sub-image 1-HL-MBm. Sub-image 1-HL-MBx represents the encoded macroblock MBx in the HL subband of sub-image 1. The HH subband encoded data and LH subband encoded data are similar to the HL subband encoded data and will not be described further here.

[0253] Referring again to Figure 15, the LL subband coding data includes, but is not limited to, the LL subband coding data of each sub-image of the image. For example, sub-image 1-LL to sub-image N-LL. Sub-image 1-LL represents the LL subband coding data of sub-image 1 of the image. Each sub-image-LL further includes, but is not limited to, the coding data of each macroblock of that sub-image, i.e., the coded macroblock. For example, sub-image 1-LL includes, but is not limited to, sub-image 1-LL-MB0 to sub-image 1-LL-MBn. Sub-image 1-LL-MBx represents the coding data of macroblock MBx of the LL subband of sub-image 1 of the image.

[0254] For example, during the encoding process, each sub-band of each subgraph is encoded independently; correspondingly, during the decoding process, each encoded sub-band of each subgraph can be decoded independently. In the example shown in Figure 15, it can be understood that the four encoded sub-bands of each subgraph can be decoded independently. For instance, during decoding, the decoder can obtain the HL sub-band encoded data, LH sub-band encoded data, HH sub-band encoded data, and LL sub-band encoded data of subgraph 1 based on the offset information, and perform independent decoding to obtain the decoded subgraph 1.

[0255] In this example, the coded subbands and their coded macroblocks of each sub-image in the figure can also be written into the corresponding image data sub-regions, which are not shown in the figure and will not be repeated below. Accordingly, offset information can be used to indicate the position of the image region to which the independently coded subbands of each sub-image belong. Thus, during decoding, the decoder can obtain the positions of the four coded subbands (LL subband coded data, HH subband coded data, HL subband coded data, and LH subband coded data) of a single sub-image in the image data based on the offset information, and perform decoding on them to obtain the decoded subbands of the corresponding sub-image (including LL subband decoded data, HH subband decoded data, HL subband decoded data, and LH subband decoded data). For example, during decoding, the decoder obtains sub-image 1-HL (including each coded macroblock contained in its sub-region, the same below, and will not be repeated), sub-image 1-HH, sub-image 1-LH, and sub-image 1-LL. In this way, the decoder can obtain the decoded sub-graph 1 based on the above encoded sub-bands without having to decode other sub-graphs one by one according to the order of the bitstream. This can improve decoding efficiency while reducing the occupation of the decoding buffer (e.g., DPB) and reducing the hardware processing pressure and storage burden on the decoding end.

[0256] In one possible implementation, on the encoding side, the low-frequency subband entropy encoding unit can output low-frequency subband encoded data (e.g., LL subband bitstream), and the high-frequency subband entropy encoding unit can output high-frequency subband encoded data (e.g., including HH subband decoded data, HL subband decoded data, and LH subband decoded data). The combining unit writes this data into the image data to generate an image bitstream.

[0257] In another possible implementation, the low-frequency subband entropy coding unit and the high-frequency subband entropy coding unit can also output the coded macroblock of the coded subband to the combining unit after each macroblock is encoded. The combining unit can generate the bitstream structure as shown in the figures (e.g., Figures 15, 16A-16C, 17A-17B, etc.) according to the specified order of the coded macroblocks of the image data.

[0258] Optionally, the subgraph and bitstream structure in Figure 15 can also be applied to the bitstream structures shown in Figures 13B and 14B, and will not be illustrated in detail here.

[0259] In the embodiments of this application, the subbands in the high-frequency subband coded data of the image data can be interleaved and sorted. The interleaving and sorting can be at the sub-image granularity, the subband type granularity, or the macroblock (MB) granularity. Several interleaving and sorting methods are provided below. It should be noted that the interleaving methods shown in the embodiments of this application are only illustrative examples. In other embodiments, other interleaving methods can also be set according to the encoding and decoding requirements.

[0260] Referring to Figure 16A, which is an exemplary schematic diagram of an image bitstream structure, the interleaving method in the example of Figure 16A is interleaving at the subband type of the subimage. Specifically, as shown in Figure 16A, the HL subband encoded data, encoded HH, and encoded LH of each subimage of the image are continuously written into the image bitstream. The subimage order and macroblock order shown in the figure are merely illustrative examples. The format of the low-frequency subband is not shown in the figure; please refer to Figure 15 and its related description, which will not be repeated here.

[0261] For example, as shown in Figure 16A, sub-images 1-HL, 1-HH, and 1-LH are continuously written into the image bitstream. Sub-image 1-HL represents the HL subband encoded data of sub-image 1, which includes, but is not limited to, all encoded macroblocks (MB) of the HL subband of sub-image 1, such as MB0-HL to MBm-HL. Only the bitstream format of sub-image 1 is shown in the figure; other sub-images are similar and will not be described individually here. The LL subband encoded data can be referred to above and will not be repeated here.

[0262] In this example, similar to the description in Figure 15, each coded subband of each sub-image can be decoded independently. Accordingly, offset information can be used to indicate the location of the image region to which the independently coded subband of each sub-image belongs. This allows, during decoding, the positions of the four coded subbands (LL subband coded data, HH subband coded data, HL subband coded data, and LH subband coded data) of a single sub-image can be obtained in the image data based on the offset information, and decoding can be performed on them to obtain the decoded subbands of the corresponding sub-image (including LL subband decoded data, HH subband decoded data, HL subband decoded data, and LH subband decoded data). Details not described herein can be found in Figure 15 and will not be repeated here.

[0263] Referring to Figure 16B, which is an exemplary schematic diagram of the image bitstream structure, the interleaving method in the example of Figure 16B is interleaving at the macroblock level for each sub-image.

[0264] Specifically, in the example shown in Figure 16B, the high-frequency subband encoded data (including LH subband encoded data, HH subband encoded data, and HL subband encoded data) of each sub-image of the image are continuously written into the first image data region. A description of the second image data region can be found in Figure 15, and will not be repeated here.

[0265] For example, as shown in Figure 16B, sub-images 1-HL-MB0, 1-HH-MB0, and 1-LH-MB0 are consecutively written into the first image data region. Here, 1-HL-MB0 represents the encoded macroblock MB0 of the HL subband of 1, 1-HH-MB0 represents the encoded macroblock MB0 of the HH subband of 1, and 1-LH-MB0 represents the encoded macroblock MB0 of the LH subband of 1. The figure only shows the encoded data structure of 1 in the bitstream; the other sub-images are similar and will not be illustrated individually here.

[0266] In this example, during decoding, the decoding end can decode the high-frequency subband encoded data according to the sub-image order, that is, each sub-image in the first image data region is decoded independently. The low-frequency subband encoded data is also decoded according to the sub-image order, that is, each sub-image in the second image data region is decoded independently. Unlike Figures 15, 16A, and 16C, when the bitstream structure in the above figures is applied to decoding, the decoding end decodes the different types of encoded subbands of each sub-image separately. This can also be understood as needing to simultaneously decode the four sub-bitstreams (each sub-bitstream corresponds to one type of encoded subband) of each sub-image to obtain four decoded subbands of an image at the output end, thereby obtaining the decoded sub-image and storing additional data. For the bitstream structure shown in Figure 16B, the decoding end only needs to decode the high-frequency subband and low-frequency subband of each sub-image, that is, two bitstreams. For example, as shown in Figure 16B, when the decoding end decodes the first image data region, it can decode each encoded macroblock one by one according to the encoded macroblock order of each sub-image in the region. That is, the three high-frequency subband encoded data of sub-Figure 1 are written continuously into the first image data area. Therefore, during decoding, the three high-frequency subband encoded data of sub-Figure 1 can be decoded one by one to obtain the decoded high-frequency subband. The processing of LL subband encoded data can be referred to Figure 15, and will not be described in detail here.

[0267] In the example shown in Figure 16B, the offset information is used to indicate the position of the first image data region and the position of the second image data region. That is, the example shown in Figure 16B includes two sub-bitstreams that can be decoded independently. Compared with the framework and decoding methods in Figures 15, 16A, and 16C, it has lower hardware performance requirements, only requiring simultaneous decoding of the two sub-bitstreams of the sub-image (corresponding to low-frequency sub-band encoded data and high-frequency sub-band encoded data).

[0268] Referring to Figure 16C, which is an exemplary schematic diagram of an image bitstream structure, the interleaving method in Figure 16C is based on the sub-bands of each sub-image. Specifically, as shown in Figure 16C, each sub-image of the image is continuously written into the first image data region according to its high-frequency sub-band type. For example, taking sub-image 1 as an example, the coded macroblocks of the HL sub-band encoded data of sub-image 1 are continuously written into the first image data region, that is, sub-image 1-HL-MB0 to sub-image 1-HL-MBm of sub-image 1 are continuously written into the image bitstream. The coded macroblocks of the HH sub-band encoded data of sub-image 1 are continuously written into the first image data region, that is, sub-image 1-HH-MB0 to sub-image 1-HH-MBm of sub-image 1 are continuously written into the image bitstream. The coded macroblocks of the LH sub-band encoded data of sub-image 1 are continuously written into the first image data region, that is, sub-image 1-LH-MB0 to sub-image 1-LH-MBm of sub-image 1 are continuously written into the image bitstream. Other subgraphs are similar and will not be described in detail here. The order of subband types is for illustrative purposes only.

[0269] In this example, similar to the description in Figure 15, each coded subband of each sub-image can be decoded independently. Accordingly, offset information can be used to indicate the location of the image region to which the independently coded subband of each sub-image belongs. This allows, during decoding, the positions of the four coded subbands (LL subband encoded data, HH subband encoded data, HL subband encoded data, and LH subband encoded data) of a single sub-image can be obtained in the image data based on the offset information, and decoding can be performed on them to obtain the decoded subbands of the corresponding sub-image (including LL decoded data, HH decoded data, HL decoded data, and LH decoded data). Parts not described herein can be referred to Figure 15 and will not be repeated here.

[0270] For example, in the example of Figure 16C, during decoding, the decoder obtains the HH subband encoded data, LH subband encoded data, HL subband encoded data, and LL subband encoded data of sub-Figure 1 from the image bitstream based on offset information (not shown in Figure 16C, see Figure 15). The decoder decodes the encoded data of the four subbands of sub-Figure 1 to obtain the reconstructed sub-Figure 1, which can also be called decoded sub-Figure 1 or decoded sub-Figure 1.

[0271] In the embodiments of this application, multiple independently decoded encoded data can be decoded simultaneously, or one or more high-frequency subbands can be decoded simultaneously, and the number of simultaneous decodes depends on the decoder hardware performance.

[0272] Referring to Figure 17A, which is an exemplary schematic diagram of an image bitstream structure, the interleaving method in the example of Figure 17A is granular at the low-frequency and high-frequency subbands of the subgraph. Only the interleaving method of subgraph 1 is shown; other subgraphs are similar and will not be described in detail here. For example, the structure of the low-frequency subband encoded data of the subgraph can be seen in Figure 15, and will not be repeated here. In one example, the structure of the high-frequency subband encoded data of the subgraph can use any of the interleaving methods for high-frequency subband encoded data in Figures 16A to 16C.

[0273] Referring to Figure 17B, which is an exemplary schematic diagram of the bitstream structure, in the example of Figure 17B, the splicing order of the sub-graphs can be low-frequency subband coded data followed by high-frequency subband coded data. Other descriptions can be found in Figure 17A, and will not be repeated here.

[0274] Optionally, for the examples shown in Figures 17A and 17B, the offset information in the image header information is also used to indicate each encoded data that can be decoded independently. The indication method can be seen in Figures 15 and 16A to 16C, which will not be repeated here.

[0275] Referring to Figure 18, which is a schematic / conceptual block diagram of an exemplary decoder, in the example of Figure 18, the decoder receives, for example, an image bitstream encoded by an encoder to obtain a decoded image of the original image, also referred to as a decoded image, reconstructed image, etc. During the decoding process, the decoder receives the image bitstream from the encoder, including, but not limited to, image header information and image data. The image bitstream can be any of the bitstream formats shown in Figures 13A to 17B.

[0276] In the example shown in Figure 18, the decoder includes, but is not limited to: low-frequency subband processing path 1810, high-frequency subband processing path 1820, wavelet inverse transform unit 1830, image combination unit 1840 (also known as image stitching unit), etc.

[0277] For example, the low-frequency subband processing path 1810 is used to acquire low-frequency subband encoded data to obtain reconstructed low-frequency subband 1806 (also known as decoded low-frequency subband). The low-frequency subband processing path includes, but is not limited to: low-frequency subband entropy decoding unit 1811, inverse quantization / inverse transform unit 1812 (also known as low-frequency subband inverse quantization / inverse transform unit), low-frequency subband reconstruction unit 1813, low-frequency subband splicing unit 1815, prediction unit 1814, etc.

[0278] The high-frequency subband processing path 1820 is used to acquire high-frequency subband encoded data to obtain the reconstructed high-frequency subband 1831, which can also be called the reconstructed value of the high-frequency subband or the reconstructed data of the high-frequency subband, including but not limited to: high-frequency subband entropy decoding unit 1821, inverse quantization / inverse transform unit 1821 (also called high-frequency subband inverse quantization / inverse transform unit), high-frequency subband reconstruction unit 1831, etc.

[0279] In some instances, the decoder shown in Figure 18 can perform a decoding process that is largely the reverse of the encoding process described with reference to the encoder in Figure 12.

[0280] The decoding method in the embodiments of this application will be described in detail below with reference to the decoder 180 shown in Figure 18.

[0281] For example, the decoder 180 can obtain high-frequency subband encoded data and low-frequency subband encoded data in the image bitstream based on the image header information in the image bitstream. Furthermore, as described above, during the encoding process, the encoder uses macroblocks as the basic encoding unit, and correspondingly, during the decoding process, the decoder also uses macroblocks (e.g., encoded macroblocks) as the basic decoding unit for decoding.

[0282] For example, the low-frequency subband entropy decoding unit 1811 performs entropy decoding on the low-frequency subband encoded data 1801 in the image bitstream, using macroblocks as the basic decoding unit, to obtain the quantization coefficients 1802 (i.e., the quantization coefficients of the current macroblock) and syntax elements 1807 of the low-frequency subband block. The description of the quantization coefficients 1802 of the low-frequency subband can be found on the encoder side and will not be repeated here. Specifically, the low-frequency subband entropy decoding unit 1811 obtains the encoded macroblocks (i.e., the encoded data of the macroblocks) of the low-frequency subbands (e.g., LL subbands) of each sub-image in the image bitstream, and performs entropy decoding on each encoded macroblock to obtain the quantization coefficients 1802 (which can be simply referred to as the quantization coefficients of the macroblock of the low-frequency subband) and syntax elements 1807 of the corresponding low-frequency subband for each encoded macroblock. During the decoding process, the currently decoded encoded macroblock can be called the current block.

[0283] The low-frequency subband decoding unit is used to output the quantization coefficients 1802 of the low-frequency subband block to the inverse quantization / inverse transform unit 1812, and to output the syntax elements 1807 to the prediction unit 1814.

[0284] The inverse quantization / inverse transform unit 1812 is used to obtain the quantization coefficients 1802 of the low-frequency subband block to obtain the inverse quantization coefficients 1803 of the low-frequency subband block. Alternatively, it can be the inverse transform coefficients of the current block of the low-frequency subband (depending on whether inverse transform processing was performed). Specifically, the inverse quantization / inverse transform unit 1812 performs inverse quantization on the quantization coefficients of the current block of the low-frequency subband, or performs both inverse quantization and inverse transform, to obtain the inverse quantization coefficients of the current block of the low-frequency subband. The inverse quantization / inverse transform unit 1812 outputs the inverse quantization coefficients 1803 of the low-frequency subband block to the low-frequency subband reconstruction unit 1813, for example, the inverse quantization coefficients of the current block of the low-frequency subband.

[0285] The low-frequency subband reconstruction unit 1813 is used to obtain the low-frequency subband reconstruction block 1804, which can also be called the reconstruction coefficient of the low-frequency subband block, based on the quantization coefficients 1803 and prediction block 1805 of the low-frequency subband. Specifically, the low-frequency subband reconstruction unit 1813 adds a prediction block to the inverse quantization coefficients of the current block of the low-frequency subband to obtain the low-frequency subband reconstruction block 1804 corresponding to the current macroblock.

[0286] The prediction unit 1814 is used to obtain syntax element 1807 and perform corresponding prediction processing according to syntax element 1807. For example, intra-frame prediction can be performed based on low-frequency subband reconstruction block 1804, or inter-frame prediction can be performed based on reconstructed low-frequency subband 1806. Its execution method can be referred to the coding side, and will not be elaborated here. The prediction unit 1814 outputs prediction block 1805 to the low-frequency subband reconstruction block 1804 unit.

[0287] For example, the high-frequency subband entropy decoding unit 1821 acquires the high-frequency subband encoded data 1802 in the image bitstream, and, using macroblocks as the basic decoding unit, acquires the quantization coefficients 1808 (which are the quantization coefficients of the current macroblock) of each high-frequency subband block. Specifically, the high-frequency subband entropy decoding unit 1821 performs entropy decoding on the current block of the high-frequency subband encoded data 1802 to obtain the quantization coefficients of the current block of the high-frequency subband. Optionally, based on entropy decoding, the syntax elements corresponding to the current block can also be obtained. The high-frequency subband entropy decoding unit 1821 outputs the quantization coefficients 1808 of the high-frequency subband block to the inverse quantization / inverse transform unit 1822.

[0288] The inverse quantization / inverse transform unit 1822, also known as the high-frequency subband inverse quantization / inverse transform unit, is used to obtain the quantization coefficients 1808 of the high-frequency subband block to obtain the reconstruction coefficients 1809 of the high-frequency subband block. The reconstruction coefficients can be either inverse quantization coefficients after inverse quantization processing, or inverse transform coefficients after inverse quantization and inverse transform processing.

[0289] The high-frequency subband reconstruction unit 1823 (also known as the high-frequency subband splicing unit) is used to obtain the reconstruction coefficients 1809 of the high-frequency subband block to obtain the reconstructed high-frequency subband 1831, which can also be referred to as the reconstructed value or reconstructed data of the high-frequency subband. Specifically, the high-frequency subband reconstruction unit 1823 can obtain the reconstruction coefficients corresponding to each macroblock of the high-frequency subband, that is, reconstruct the high-frequency subband block. The high-frequency subband reconstruction unit 1823 can splice the obtained multiple macroblocks to obtain the corresponding high-frequency subband. Among them, the reconstructed high-frequency subband may optionally include reconstructing the HL subband (e.g., the reconstruction coefficients of the HL subband), reconstructing the HH subband (e.g., the reconstruction coefficients of the HH subband), and reconstructing the LH subband (e.g., the reconstruction coefficients of the LH subband).

[0290] The inverse wavelet transform unit 1830 is used to acquire the reconstructed high-frequency subband 1831 and the reconstructed low-frequency subband 1806 to obtain the reconstructed sub-image 1832. Specifically, the inverse wavelet transform unit 1830 acquires the reconstructed low-frequency subband 1806 output by the low-frequency subband stitching unit 1815 and the reconstructed high-frequency subband 1831 output by the high-frequency subband reconstruction unit 1823, and performs an inverse wavelet transform on the reconstructed low-frequency subband 1806 and the reconstructed high-frequency subband 1831 to obtain the reconstructed sub-image 1832. The inverse wavelet transform unit 1830 outputs the reconstructed sub-image 1832 to the image combining unit (which may also be called the image stitching unit, etc.).

[0291] Image combining unit 1840 is used to acquire reconstructed sub-images 1832 to obtain a reconstructed image 1833 of the original image, which can also be called a decoded image or a decoded image, etc. Specifically, image combining unit 1840 can acquire N reconstructed sub-images (N is an integer greater than 0) of the image (referring to the original image), and stitch (or combine) the N reconstructed sub-images according to the division method (including size and position) of each reconstructed sub-image during encoding to obtain the reconstructed image 1833.

[0292] Optionally, after obtaining the reconstructed image, the image combining unit 1840 can determine whether the reconstructed image contains a padding portion based on the image size information in the image header information and the size information of the current reconstructed image. In one example, if the size of the current reconstructed image is the same as the size indicated by the image size information (i.e., the same as the original image size), the image combining unit 1840 can send the reconstructed image to the display device. In this case, the sizes of the displayed image, the original image, and the reconstructed image are all the same. In another example, if the size of the current reconstructed image is different from the size indicated by the image size information (e.g., larger than the original image size), the image combining unit 1840 can remove the padding portion of the current reconstructed image based on the size indicated by the image size information to obtain the displayed image. The size of the displayed image is the same as the size of the original image. Specifically, in this embodiment, when the encoding side performs sub-image division, the division order is preset, usually from left to right in the horizontal direction and from top to bottom in the vertical direction. Correspondingly, at least one padding sub-image is usually located at the edge of the image, as shown in Figure 9B. For example, the image combining unit 1840 may crop the vertical and / or horizontal edges of the image according to the size information to remove the fill portion of the sub-image at the edge.

[0293] Optionally, in some instances, the image reconstruction unit may also perform the above-mentioned operation of removing the padding portion during the process of acquiring the reconstructed image, so that the size of the reconstructed image is the same as the size of the original image.

[0294] Optionally, the decoder is used, for example, to output a reconstructed image via the decoder's output port (or output interface) for presentation to or viewing by the user.

[0295] Other variations of the decoder can be used to decode compressed image bitstreams.

[0296] For example, as described above, each sub-image in the image bitstream may include two or four independently decodeable encoded data. For instance, in the examples shown in Figures 15, 16A, and 16C, the encoded HH sub-band, encoded LH sub-band, encoded HL sub-band, and encoded LL sub-band of each sub-image can be independently decoded. In the above scenario, the high-frequency sub-band entropy decoding unit can obtain each independently decodeable image data region based on the offset information in the image header information, and obtain the encoded data within the image data region. The high-frequency sub-band entropy decoding unit can simultaneously decode the encoded data of one or more independently decoded image data regions.

[0297] Optionally, in the above scenario, the high-frequency subband processing path may include at least one high-frequency processing subpath (not shown in the figure). For example, the high-frequency subband processing path may include three high-frequency processing subpaths to process three coded subbands of a subgraph simultaneously. Of course, in some instances, there may be more than three or fewer high-frequency subband processing subpaths. The more high-frequency subband processing paths there are, the higher the decoding efficiency. The fewer the paths, the lower the hardware design complexity requirements.

[0298] The decoding method is illustrated below using the bitstream structure shown in Figure 16A. In the example shown in Figure 16A, the low-frequency entropy decoding unit 1801 acquires the LL subband encoded data and performs decoding based on macroblocks. Taking sub-Figure 1 as an example, the low-frequency entropy decoding unit 1801 acquires the LL subband encoded data of sub-Figure 1 and decodes each encoded macroblock. The low-frequency subband decoding path 1810 processes the current block (inverse quantization / inverse transform, prediction, reconstruction, etc.) to output the reconstructed low-frequency subband of sub-Figure 1 to the wavelet inverse transform unit.

[0299] The high-frequency subband entropy decoding unit 1821 acquires LH subband encoded data, HL subband encoded data, and HH subband encoded data, and performs decoding based on the encoded macroblocks. Taking sub-image 1 as an example, specifically, the high-frequency entropy decoding unit 1821 acquires the LH subband encoded data, HL subband encoded data, and HH subband encoded data of sub-image 1 in the image bitstream based on offset information. The acquisition order can be in the order of the bitstream or according to actual needs. The high-frequency subband processing path 1820 processes the decoded macroblocks of sub-image 1 output by the high-frequency subband entropy decoding unit. In one example, the high-frequency subband entropy decoding unit can optionally decode the LH subband encoded data, HL subband encoded data, and HH subband encoded data of sub-Figure 1 simultaneously. The high-frequency subband processing path obtains multiple decoded high-frequency subbands output by the high-frequency subband entropy decoding unit and processes each macroblock in the multiple decoded high-frequency subbands simultaneously to output the reconstructed HH subband, reconstructed HL subband, and reconstructed LH subband of sub-Figure 1 to the wavelet inverse transform unit.

[0300] In another example, the high-frequency subband entropy decoding unit can optionally decode the LH, HL, and HH subband encoded data of sub-Figure 1 simultaneously. The high-frequency subband processing path acquires multiple decoded high-frequency subbands output by the high-frequency subband entropy encoding unit. It can process each macroblock in at least one decoded high-frequency subband, and the decoded data of other received but unprocessed high-frequency subbands can be cached in storage. The processing order can follow the order in the bitstream or be set according to actual needs. Similarly, the high-frequency subband processing path outputs to the wavelet inverse transform unit after acquiring a reconstructed high-frequency subband of sub-Figure 1.

[0301] After the wavelet inverse transform unit obtains the four reconstructed high-frequency subbands of sub-figure 1, including the reconstructed LL subband, reconstructed HL subband, reconstructed HH subband, and reconstructed LH subband, it performs wavelet inverse transform to obtain the reconstructed sub-figure 1.

[0302] Optionally, before acquiring the four reconstructed high-frequency subbands of sub-graph 1, the wavelet inverse transform unit can cache each reconstructed subband acquired. After acquiring all the reconstructed high-frequency subbands of sub-graph 1, it can acquire the cached reconstructed high-frequency subbands of sub-graph 1 and perform the wavelet inverse transform.

[0303] It can be understood that, in the embodiments of this application, when the high-frequency subband processing path and the low-frequency subband processing path process the encoded data of the sub-graph, the order of the sub-graphs and their macroblocks in each independent decoded data is the same. For example, as shown in Figure 15, the high-frequency subband entropy decoding unit can obtain the HH subband encoded data, HL subband encoded data, and LH subband encoded data of a single sub-graph (e.g., sub-graph 1) from the offset. In this way, when decoding, the high-frequency subband entropy decoding unit can obtain each encoded subband and its encoded macroblock of sub-graph 1 to decode sub-graph 1. Correspondingly, the high-frequency subband processing path can process the decoded macroblocks corresponding to the high-frequency subbands of sub-graph 1 to obtain each reconstructed high-frequency subband of sub-graph 1 and output it to the wavelet inverse transform unit so that the wavelet inverse transform unit can output the reconstructed sub-graph 1. In this way, the wavelet inverse transform unit only needs to buffer the decoded data of sub-graph 1 during the processing. If the high-frequency processing unit processes the encoded data in the code stream as shown in Figure 15, the wavelet inverse transform unit will cache the reconstructed HL subbands of other sub-graphs before obtaining the reconstructed HH subband of sub-graph 1, which increases the storage burden and requires a large hardware cache space, affecting the complexity of hardware design.

[0304] For example, in the example shown in Figure 16B, the high-frequency subband encoded data in the image bitstream is interleaved at the MB granularity. That is, during decoding, the high-frequency subband encoded data and low-frequency subband encoded data of each sub-image can be decoded independently. The high-frequency subband processing path can process each macroblock according to the order of the encoded macroblocks of the sub-image in the image bitstream, that is, the reconstructed subbands of each sub-image are obtained according to the order of the sub-images, which can reduce the hardware design complexity of the decoding end.

[0305] Referring to Figure 19, which is an exemplary schematic / conceptual block diagram of a decoder, the decoder 190 includes, but is not limited to: a low-frequency subband processing path 1910, a high-frequency subband processing path 1920, a wavelet inverse transform unit 1930, a sub-image combination unit 1940, and an image combination unit 1950. The low-frequency subband processing path 1910 includes, but is not limited to: a low-frequency subband entropy coding unit 1911, an inverse quantization / inverse transform unit 1912, a low-frequency subband reconstruction unit 1913, a low-frequency subband stitching unit 1915, and a prediction unit 1914. Detailed descriptions can be found in Figure 18, and will not be repeated here. The descriptions of the input and output coefficients or data of each unit (such as low-frequency subband coding data 1901, low-frequency subband quantization coefficients 1902, low-frequency subband inverse quantization coefficients 1903, low-frequency subband reconstruction block 1904, reconstructed low-frequency subband 1906, prediction block 1905, and syntax element 1907) can be found in Figure 18, and will not be repeated here.

[0306] The high-frequency subband processing path 1920 includes, but is not limited to: high-frequency subband entropy coding unit 1921, inverse quantization / inverse transform unit 1922, and high-frequency subband reconstruction unit 1923.

[0307] The high-frequency subband entropy coding unit 1921 obtains the quantization coefficients 1908 of the high-frequency subband block based on the high-frequency subband coded data 1902. The inverse quantization / inverse transform unit 1922 obtains the reconstruction coefficients 1909 of the high-frequency subband block based on the quantization coefficients 1908 of the high-frequency subband block, which can also be called the high-frequency subband reconstruction block.

[0308] The wavelet inverse transform unit 1903 is used to obtain the reconstruction coefficients 1909 of the high-frequency subband block, i.e., the high-frequency subband reconstruction block, and the low-frequency subband reconstruction block 1904 output by the low-frequency subband reconstruction block unit 1913. The wavelet inverse transform is performed on the high-frequency subband reconstruction block (e.g., including HH subband reconstruction block, HL subband reconstruction block, LH subband reconstruction block) and the low-frequency subband reconstruction block 1904 to obtain the reconstruction block 1931, which is the reconstruction block of the current subgraph. It can also be called the reconstruction data of the current block of the current subgraph or the reconstruction value of the current block of the current subgraph.

[0309] The wavelet inverse transform unit 1930 outputs a reconstructed block 1931 to the subgraph combination unit 1940. The subgraph combination unit 1940 can obtain the reconstructed subgraph of the current subgraph based on at least one reconstructed block corresponding to the current subgraph, which can also be referred to as the reconstructed value or reconstructed data of the current subgraph.

[0310] Subgraph combining unit 1940 outputs reconstructed subgraph 1932 to image combining unit 1950.

[0311] The image combination unit 1950 is used to acquire the reconstructed sub-image 1932 to obtain the reconstructed image 1933 of the original image, or the reconstructed value or reconstructed data of the original image, etc. The undescribed parts of Figure 19 can be referred to Figure 18, and will not be repeated here.

[0312] In one example, FIG20 shows a schematic block diagram of an apparatus 2000 according to an embodiment of the present application. The apparatus 2000 may include a processor 2001 and a transceiver 2002, and optionally, a memory 2003.

[0313] The various components of device 2000 are coupled together via bus 2004, which includes a data bus, a power bus, a control bus, and a status signal bus. However, for clarity, all buses are referred to as bus 2004 in the figure.

[0314] Optionally, the memory 2003 can be used to store instructions for implementing the foregoing method embodiments. The processor 2001 can be used to execute the instructions in the memory 2003, control the transceiver 2002 to receive signals, and control the transceiver 2002 to transmit signals.

[0315] The device 2000 may be an encoder and / or decoder as described in the above method embodiments. Exemplarily, the device may be a terminal device or a server.

[0316] All relevant content of each step involved in the above method embodiments can be referenced from the functional description of the corresponding functional module, and will not be repeated here.

[0317] This application also provides a chip, including one or more interface circuits and one or more processors; the one or more processors receive or send data through the one or more interface circuits, and when the one or more processors execute computer instructions, the steps of the above-described related method steps to implement the methods in the above embodiments are executed. This embodiment also provides a computer-readable storage medium storing computer instructions, which, when executed on an electronic device, cause the electronic device to execute the above-described related method steps to implement the methods in the above embodiments. Exemplarily, the computer-readable storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0318] This embodiment also provides a computer program product containing computer instructions that, when executed by a computer or processor, cause the computer to perform the aforementioned steps to implement the methods in the above embodiments. Exemplarily, the computer program product can be stored in random access memory (RAM), flash memory, read-only memory (ROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), registers, hard disks, portable hard disks, CD-ROMs, or any other form of storage medium known in the art.

[0319] In addition, embodiments of this application also provide an apparatus, which may specifically be a chip, component, or module. The apparatus may include a connected processor and a memory; wherein the memory is used to store computer execution instructions, and when the apparatus is running, the processor may execute the computer execution instructions stored in the memory to cause the chip to execute the methods in the above-described method embodiments.

[0320] In this embodiment, the device, computer-readable storage medium, computer program product, or chip are all used to execute the corresponding methods provided above. Therefore, the beneficial effects they can achieve can be referred to the beneficial effects in the corresponding methods provided above, and will not be repeated here.

[0321] Through the above description of the embodiments, those skilled in the art will understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0322] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0323] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0324] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0325] Any content in the various embodiments of this application, as well as any content in the same embodiment, can be freely combined. Any combination of the above content is within the scope of this application.

[0326] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A decoding method, characterized in that, include: Obtain the image bitstream of the original image, wherein the image bitstream includes the first encoded data and the second encoded data of each of the N sub-images, where N is an integer greater than 1; Based on the first encoded data of the first sub-graph, the reconstruction coefficients of the low-frequency sub-band of the first sub-graph are obtained, wherein the first sub-graph is any one of the N sub-graphs; Based on the second encoded data of the first sub-graph, the reconstruction coefficients of the high-frequency sub-band of the first sub-graph are obtained; Perform wavelet inverse transform on the reconstruction coefficients of the low-frequency sub-band and the high-frequency sub-band of the first sub-graph to obtain the reconstructed sub-graph of the first sub-graph; Based on the reconstructed sub-images of the N sub-images, the reconstructed image of the original image is obtained.

2. The method according to claim 1, characterized in that, The first encoded data and the second encoded data of each subgraph can be decoded independently.

3. The method according to claim 2, characterized in that, The first encoded data includes first encoded block data for each of the N sub-graphs; wherein, the first encoded block data for each sub-graph is obtained from the block to be encoded based on the reconstruction coefficients of the low-frequency sub-band of the sub-graph; The second encoded data includes second encoded block data for each of the N subgraphs; wherein the second encoded block data for each subgraph is obtained from the wavelet coefficients of the high-frequency subband of the subgraph.

4. The method according to claim 3, characterized in that, The second coded block data of each of the N sub-graphs is continuous in the image bitstream.

5. The method according to any one of claims 1-3, characterized in that, The reconstruction coefficients of the high-frequency sub-band include: reconstruction coefficients of the first high-frequency sub-band, reconstruction coefficients of the second high-frequency sub-band, and reconstruction coefficients of the third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first encoded data, the third encoded data, the fourth encoded data, and the fifth encoded data can be decoded independently.

6. The method according to claim 5, characterized in that, The third encoded data of the N sub-images are continuous in the image bitstream, the fourth encoded data of the N sub-images are continuous in the image bitstream, and the fifth encoded data of the N sub-images are continuous in the image bitstream.

7. The method according to claim 5, characterized in that, The third, fourth, and fifth encoded data of each of the N sub-images are consecutive in the image bitstream.

8. The method according to any one of claims 2-7, characterized in that, The image bitstream includes offset information, which is used to indicate the position of independently decodeable encoded data in the image bitstream.

9. The method according to any one of claims 1-8, characterized in that, The image bitstream includes the image size information of the original image. After obtaining the reconstructed image of the original image based on the reconstructed sub-images of the N sub-images, the method further includes: If the size of the reconstructed image is larger than the size of the original image, at least one fill portion of the reconstructed sub-image of the edge of the reconstructed image is removed to obtain a display image, the size of which is the same as the size of the original image.

10. The method according to any one of claims 1-9, characterized in that, The dimensions of each subgraph include at least one of the following: Width is a multiple of 128; The height is a multiple of 128; Width less than or equal to 1024 pixels.

11. The method according to any one of claims 1-9, characterized in that, The resolution of the original image is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or, The original image has a length greater than or equal to 4320 pixels and a width greater than or equal to 2160 pixels, where N is an integer greater than 1 and less than or equal to 16; or, The original image has a length greater than or equal to 7680 pixels and a width greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32.

12. An encoding method, characterized in that, include: The image to be encoded is divided into sub-images to obtain N sub-images of the image to be encoded, where N is an integer greater than 1, and the image to be encoded corresponds to the original image; For each of the N subgraphs, perform the following operation: Perform wavelet transform on the subgraph to obtain the wavelet coefficients of the low-frequency subband and the high-frequency subband of the subgraph; Based on the wavelet coefficients of the low-frequency sub-band of the subgraph, the first coded data of the subgraph is obtained; Based on the wavelet coefficients of the high-frequency sub-band of the subgraph, the second coded data of the subgraph is obtained; Based on the first encoded data and the second encoded data, the image bitstream of the image to be encoded is obtained.

13. The method according to claim 12, characterized in that, The first encoded data and the second encoded data of each subgraph can be decoded independently.

14. The method according to claim 13, characterized in that, The first encoded data includes the first encoded block data of the subgraph; wherein, the first encoded block data of the subgraph is obtained from the block to be encoded based on the wavelet coefficients of the low-frequency subband; The second encoded data includes the second encoded block data of the subgraph; wherein the second encoded block data of the subgraph is obtained from the block to be encoded based on the wavelet coefficients of the high-frequency subband.

15. The method according to claim 14, characterized in that, The second coded block data of the subgraph is continuous in the image bitstream.

16. The method according to any one of claims 12-15, characterized in that, The wavelet coefficients of the high-frequency sub-band include: wavelet coefficients of the first high-frequency sub-band, wavelet coefficients of the second high-frequency sub-band, and wavelet coefficients of the third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first encoded data, the third encoded data, the fourth encoded data, and the fifth encoded data can be decoded independently.

17. The method according to any one of claims 12-16, characterized in that, The process of dividing the image to be encoded into sub-images to obtain N sub-images of the image to be encoded includes: Based on the sub-graph partitioning method, the image to be encoded is partitioned into sub-graphs to obtain the N sub-graphs; The subgraph partitioning method indicates the size of the subgraph.

18. The method according to claim 7, characterized in that, The size of the subgraph includes at least one of the following: Width is a multiple of 128; The height is a multiple of 128; Width less than or equal to 1024 pixels.

19. The method according to claim 18, characterized in that, The process of dividing the image to be encoded into sub-images to obtain N sub-images of the image to be encoded includes: If there is at least one subgraph whose width and / or height are not multiples of 128, the at least one subgraph is filled; wherein the width and height of the filled at least one subgraph are multiples of 16.

20. The method according to claim 17, characterized in that, The resolution of the original image is less than or equal to 1080p, and N is an integer greater than 1 and less than or equal to 8; or, The original image has a length greater than or equal to 4320 pixels and a width greater than or equal to 2160 pixels, where N is an integer greater than 1 and less than or equal to 16; or, The original image has a length greater than or equal to 7680 pixels and a width greater than or equal to 4320 pixels, and N is an integer greater than 1 and less than or equal to 32.

21. The method according to any one of claims 13-16, characterized in that, The image bitstream includes offset information, which is used to indicate the position of independently decodeable encoded data in the image bitstream.

22. An encoder, characterized in that, include: The sub-image partitioning unit is used to partition the image to be encoded into N sub-images, where N is an integer greater than 1, and the image to be encoded corresponds to the original image. The wavelet transform unit is used to perform wavelet transform on each of the N subgraphs to obtain the wavelet coefficients of the low-frequency subband and the wavelet coefficients of the high-frequency subband of the subgraph. A low-frequency sub-band processing unit is used to obtain the first coded data of the sub-graph based on the wavelet coefficients of the low-frequency sub-band of the sub-graph. A high-frequency sub-band processing unit is used to obtain the second encoded data of the sub-graph based on the wavelet coefficients of the high-frequency sub-band of the sub-graph; The combining unit is used to obtain the image bitstream of the image to be encoded based on the first encoded data and the second encoded data.

23. The encoder according to claim 22, characterized in that, The first encoded data and the second encoded data of each subgraph can be decoded independently.

24. The encoder according to claim 22, characterized in that, The wavelet coefficients of the high-frequency sub-band include: wavelet coefficients of the first high-frequency sub-band, wavelet coefficients of the second high-frequency sub-band, and wavelet coefficients of the third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first encoded data, the third encoded data, the fourth encoded data, and the fifth encoded data can be decoded independently.

25. A decoder, characterized in that, include: Entropy decoding unit, used for: Obtain the image bitstream of the original image, wherein the image bitstream includes the first encoded data and the second encoded data of each of the N sub-images, where N is an integer greater than 1; Based on the first encoded data of the first sub-graph, the reconstruction coefficients of the low-frequency sub-band of the first sub-graph are obtained, wherein the first sub-graph is any one of the N sub-graphs; Based on the second encoded data of the first sub-graph, the reconstruction coefficients of the high-frequency sub-band of the first sub-graph are obtained; The wavelet transform unit is used to perform inverse wavelet transform on the reconstruction coefficients of the low-frequency sub-band and the reconstruction coefficients of the high-frequency sub-band of the first sub-image to obtain the reconstructed sub-image of the first sub-image. An image reconstruction unit is used to obtain a reconstructed image of the original image based on the reconstructed sub-images of the N sub-images.

26. The decoder according to claim 25, characterized in that, The first encoded data and the second encoded data of each subgraph can be decoded independently.

27. The decoder according to claim 25, characterized in that, The reconstruction coefficients of the high-frequency sub-band include: reconstruction coefficients of the first high-frequency sub-band, reconstruction coefficients of the second high-frequency sub-band, and reconstruction coefficients of the third high-frequency sub-band. The second encoded data includes third encoded data generated based on the wavelet coefficients of the first high-frequency sub-band, fourth encoded data generated based on the wavelet coefficients of the second high-frequency sub-band, and fifth encoded data generated based on the wavelet coefficients of the third high-frequency sub-band. The first encoded data, the third encoded data, the fourth encoded data, and the fifth encoded data can be decoded independently.

28. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed on a computer or processor, causes the computer or processor to perform the method as described in any one of claims 1 to 21.

29. A computer program product, characterized in that, The computer program product includes computer instructions that, when executed by a computer or processor, cause the steps of the method as described in any one of claims 1 to 21 to be performed.

30. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a bitstream generated according to the encoding method described in any one of claims 12 to 21.

Images