WO2019041219A1

WO2019041219A1 - Encoding method, decoding method, encoding apparatus and decoding apparatus

Info

Publication number: WO2019041219A1
Application number: PCT/CN2017/099892
Authority: WO
Inventors: 郑萧桢; 余良
Original assignee: 深圳市大疆创新科技有限公司
Priority date: 2017-08-31
Filing date: 2017-08-31
Publication date: 2019-03-07
Also published as: CN108476320A

Abstract

An encoding method, a decoding method, an encoding apparatus and a decoding apparatus, wherein same have a relatively low implementation complexity. The encoding method comprises: according to data in a fragment to be encoded of an image, determining, from left-side data and upper-side data of the fragment to be encoded, reference data of the fragment to be encoded; and according to the reference data, performing encoding processing on the fragment to be encoded, so as to obtain an encoded bit stream of the fragment to be encoded, wherein the image comprises at least one rectangular area, each rectangular area comprises at least one fragment, each fragment comprises at least one pixel point, and the number of encoded bits corresponding to rectangular areas having the same length is less than or equal to a pre-set number of bits; and the left-side data of the fragment to be encoded comprises data located at at least one first pixel point on the left side of the fragment to be encoded, and the upper-side data of the fragment to be encoded comprises data located at at least one second pixel point on the upper side of the fragment to be encoded.

Description

Encoding method, decoding method, and encoding device and decoding device

Copyright statement

The disclosure of this patent document contains material that is subject to copyright protection. This copyright is the property of the copyright holder. The copyright owner has no objection to the reproduction of the patent document or the patent disclosure in the official records and files of the Patent and Trademark Office.

Technical field

The present application relates to the field of video coding, and more particularly to an encoding method, a decoding method, and an encoding device and a decoding device.

Background technique

In order to reduce the bandwidth occupied by video storage and transmission, it is necessary to encode and compress the video data. Several existing typical coding techniques can achieve higher coding quality, but have higher implementation complexity, and are not applicable in some video coding and decoding systems. For example, in a display system or a camera system, in order to reduce bandwidth pressure for interaction between random access memory (RAM) and double data rate (DDR) memory or sensor and DDR Video compression technology is usually used to encode the generated video data from the RAM or sensor into the DDR. As the reverse process of the process, the compressed data is usually read into the RAM from the DDR, and then Decoding the data to obtain decoded video data. The compression ratio of such data to video data is usually not too high. For example, a typical compression ratio is usually between 1 and 5 times. In addition, such systems require video coding and decoding algorithms with lower implementation complexity to meet the overall system implementation requirements and overall system complexity. Existing video compression techniques are often not suitable for such systems.

Summary of the invention

The present application provides an encoding method, a decoding method, and an encoding apparatus and a decoding apparatus, which have low implementation complexity.

In a first aspect, an encoding method is provided, including: an encoding method, comprising: determining, according to data in a fragment to be encoded of an image, a reference of the fragment to be encoded from a left side data and an upper side data of the fragment to be encoded Data; encoding the segment to be encoded according to the reference data, An encoded bit stream of the segment to be encoded is obtained.

Optionally, the image may comprise at least one rectangular region, each rectangular region comprising at least one segment, each segment comprising at least one pixel.

Alternatively, the image may be divided into a plurality of rectangular regions, wherein at least one rectangular region spaced apart from the image boundary has the same length.

Optionally, the first rectangular area in the at least one rectangular area may be divided into a plurality of segments, wherein at least one segment spaced apart from the boundary of the first rectangular area has the same length.

Optionally, the height of the rectangular area may be one or more lines, that is, one rectangular area may include one or more pixel points belonging to the same column.

Optionally, the height of the segment may be one row, that is, the number of data points belonging to the same column included in one segment may be one.

Optionally, the rectangular area of the same length may have a corresponding number of coded bits less than or equal to a preset number of bits.

When the number of coded bits is equal to the preset number of bits, the rectangular areas of the same length correspond to the same number of coded bits, that is, the rectangular area in the image is encoded at a fixed magnification.

When the number of coded bits is less than or equal to a preset number of bits, the code compression ratio of the image corresponding to the rectangular area is greater than or equal to the compression ratio of the same number of coded bits corresponding to the same rectangular area.

The purpose of the processing method is to ensure the coding compression ratio of the entire image, and at the same time, since it is not strictly guaranteed that each rectangular area corresponds to the same number of coding bits, the coding flexibility of each rectangular area can be improved and the coding efficiency can be improved.

Optionally, the left side data of the fragment to be encoded may include data of at least one first pixel point located to the left of the fragment to be encoded.

Optionally, the at least one first pixel may be adjacent to the segment to be encoded. For example, the rightmost pixel point of the at least one first pixel and the leftmost pixel point of the to-be-coded segment may be adjacent pixel points.

Optionally, the at least one first pixel may be adjacent to but spaced apart from the segment to be encoded. For example, the at least one first pixel may be spaced apart from the segment to be encoded by at least one pixel. For example, at least one pixel point may be spaced between the rightmost pixel point of the at least one first pixel and the leftmost pixel point of the to-be-coded segment.

Optionally, the data of the at least one first pixel may include original data of one or more first pixels of the at least one first pixel.

Optionally, the data of the at least one first pixel may also include encoded data of one or more first pixels of the at least one first pixel.

Optionally, the upper side data of the data to be encoded may include data of at least one second pixel point located above the fragment to be encoded.

Optionally, the at least one second pixel may be adjacent to the segment to be encoded. For example, the lowest pixel point of the at least one second pixel and the uppermost pixel point of the to-be-coded segment may be adjacent pixel points.

Optionally, the at least one second pixel may be adjacent to but spaced apart from the segment to be encoded. For example, the at least one second pixel may be spaced apart from the segment to be encoded by at least one pixel. For example, at least one pixel point may be spaced between the lowest pixel point of the at least one second pixel and the uppermost pixel point of the to-be-coded segment.

Optionally, the data of the at least one second pixel may include original data of one or more second pixels of the at least one second pixel.

Optionally, the data of the at least one second pixel may also include encoded data of one or more second of the at least one second pixel.

Alternatively, the encoded data of the pixel may include the encoded data of the pixel.

Optionally, the reference pixel of the to-be-coded segment may be determined from at least one first pixel point on the left side of the fragment to be encoded and at least one second pixel point above the fragment to be encoded according to data in the fragment to be encoded. point. That is, the at least one first pixel or the at least one second pixel may be determined as a reference pixel of the segment to be encoded.

Correspondingly, the data of the at least one first pixel or the data of the at least one second pixel may be determined as reference data of the segment to be encoded.

Therefore, the coding method provided by the present application encodes a rectangular area by a fixed magnification, and has a lower implementation complexity while having a higher coding quality.

In a first possible implementation manner of the first aspect, the determining, according to the data in the fragment to be encoded, the reference data of the fragment to be encoded from the left side data and the upper side data of the to-be-coded fragment, including: Determining, by the data in the to-be-coded segment and the data of the at least one first pixel, a correlation between the segment to be encoded and the left-side data of the segment to be encoded; according to the data in the segment to be encoded and the at least one Data of the second pixel, determining the segment to be encoded and the code to be encoded Correlation between the upper side data of the fragment; the degree of correlation between the fragment to be encoded and the left side data of the fragment to be encoded, and the correlation between the fragment to be encoded and the upper side of the fragment to be encoded, From the left side data and the upper side data of the to-be-coded slice, reference data of the segment to be encoded is determined.

Optionally, an absolute value of a difference between the data in the to-be-coded segment and the left-side data of the to-be-coded segment may be determined, and the to-be-coded segment and the to-be-coded segment are determined according to an absolute value of the difference. The correlation between the data on the left side.

Optionally, the absolute value of the difference between the data in the fragment to be encoded and the data on the left side of the encoded segment may be based on data of each pixel in the encoded segment and corresponding to each pixel The absolute value of the difference between the data of a pixel is obtained.

As an example, the absolute value of the difference between the data in the segment to be encoded and the data on the left side of the segment to be encoded may be data of each pixel in the segment and corresponding to each pixel. A function of the sum of the absolute values of the differences between the data of a pixel.

Alternatively, the function may be an absolute value function or an average variance function of the absolute difference.

Optionally, the smaller the absolute value of the difference between the data in the fragment to be encoded and the data on the left side of the fragment to be encoded, the correlation between the fragment to be encoded and the left side data of the fragment to be encoded may be indicated. The greater the degree.

In conjunction with the first aspect or the foregoing possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the correlation between the fragment to be encoded and the left side data of the fragment to be encoded is Correlation between the to-be-coded segment and the upper-side data of the to-be-coded segment, determining the reference data of the to-be-coded segment from the left-side data and the upper-side data of the to-be-coded segment, including: the segment to be encoded The data of the left side data and the upper side data which are highly correlated with the fragment to be encoded are determined as reference data of the fragment to be encoded.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a third possible implementation manner of the foregoing aspect, the method further includes: adding a first identifier to the encoded bit stream of the to-be-coded segment, The first identifier is used to indicate the location of the reference data of the segment to be encoded.

Optionally, the encoded bitstream of the image may include at least one first identifier corresponding to at least one segment of the image, each first identifier may be used to identify reference data or reference pixel point of the corresponding segment position. For example, the first identifier may be used to identify that the reference pixel of the segment corresponding to the first identifier is located on the left or upper side of the segment.

In combination with the first aspect or the above possible implementation of the first aspect, the fourth aspect in the first aspect According to the reference data, the encoding process of the to-be-coded segment is performed according to the reference data, and the prediction residual of the to-be-coded segment is obtained, and the prediction residual is used. a quantization parameter of the fragment to be encoded, performing quantization processing on the prediction residual of the fragment to be encoded, obtaining a quantization result of the fragment to be encoded; performing entropy encoding processing on the quantization result of the fragment to be encoded, to obtain an encoding result of the fragment to be encoded .

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, the prediction result of the to-be-coded segment is quantized by using the quantization parameter of the to-be-coded segment Before the processing, the method further comprises: determining, according to the reference data, a quantization parameter of the segment to be encoded.

Optionally, determining the quantization parameter of the to-be-coded segment according to the reference data, including: determining, according to the reference data and the data in the to-be-coded segment, the complexity of the segment to be encoded; according to the complexity of the segment to be encoded Degree, the quantization parameter of the segment to be encoded is determined.

Optionally, determining, according to the reference data and the data in the to-be-coded segment, the complexity of the to-be-coded segment, including: determining, according to the reference data and the data in the to-be-coded segment, each of the to-be-coded segments The residual of the pixel; determining the complexity of the segment to be encoded according to the residual of each pixel in the segment to be encoded.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, determining the quantization parameter of the to-be-coded segment according to the complexity of the to-be-coded segment includes: Determining the complexity of the rectangular region to which the segment to be encoded belongs according to the complexity of each segment in the rectangular region to which the segment to be encoded belongs; by comparing the complexity of the segment to be encoded and the complexity of the rectangular region to which the segment to be encoded belongs, A quantization parameter of the segment to be encoded is determined.

Alternatively, the complexity of the rectangular region may be equal to a function of the complexity of each segment in the rectangular region, such as an average function or an average variance function, and the like.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, the determining the to-be-coded fragment from the left side data and the upper side data of the to-be-coded fragment The reference data includes: if the to-be-coded segment has available left-side data and available upper-side data, determining a reference of the to-be-coded segment from available left-side data of the to-be-coded segment and available upper-side data data.

At this time, in a case where it is determined that the segment to be encoded has available left side data and has available upper side data, the reference to the segment to be encoded is determined from the left side data and the available upper side data available for the segment to be encoded. data.

Optionally, if the segment to be encoded has only available left data, the left data of the segment to be encoded may be determined as reference data of the segment to be encoded.

Optionally, if the segment to be encoded has only available upper side data, the upper side data of the segment to be encoded may be determined as reference data of the segment to be encoded.

Optionally, whether the segment to be encoded has available left side data and/or upper side data may be determined according to whether the segment to be encoded is located at a boundary of a rectangular area, a boundary of a sub image, or a boundary of an image.

As an example, data belonging to the same image as the segment to be encoded may be used as left side data and/or upper side data available for the piece to be encoded. Correspondingly, whether the segment to be encoded has available left side data and/or upper side data can be determined according to whether the segment to be encoded is located at the boundary of the image.

Optionally, the upper side data of the fragment to be encoded may be used as the reference data of the fragment to be encoded as much as possible, thereby facilitating the improvement of the encoding quality.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the image and the to-be-coded segment is adjacent to a left boundary of the image, the predicted value of the first N pixels in the to-be-coded segment may be determined as Determining a value, and encoding, according to the data of the first N pixels, the remaining (TN) pixels in the to-be-coded segment, where T is the number of pixels included in the segment to be encoded, 1 ≤ N ≤ T.

Specifically, if the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded is adjacent to a left boundary of the image, the segment to be encoded may have neither available left data nor available. Upper side data.

Optionally, the preset value may be 1<<(BitDepth-1), indicating that 1 is shifted to the left by the BitDepth-1 bit, where BitDepth is the pixel bit depth.

Alternatively, N may be determined according to the number M of simultaneous processing pixels and the timing logic delay L.

Optionally, the first N pixels of the to-be-coded segment may be specifically the N-most pixel points of the T pixels included in the to-be-coded segment.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the image, and the to-be-coded segment is spaced apart from a left boundary of the image, the left-side data of the to-be-coded segment may be used in the segment to be encoded. The pixel is encoded.

Specifically, if the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded Distributed with the left border of the image, the segment to be encoded may have available left side data and no upper side data available. At this time, the left side data of the to-be-encoded segment may be determined as reference data of the to-be-encoded segment, where the left-side data of the to-be-coded segment may specifically refer to at least one pixel located in the image to the left of the segment to be encoded. The data.

Optionally, if the to-be-coded segment is spaced apart from an upper boundary of the image, and the to-be-coded segment is adjacent to a left boundary of the image, the upper-side data of the to-be-coded segment may be used in the segment to be encoded. The pixel is encoded.

Specifically, if the segment to be encoded is adjacent to the left boundary of the image and the segment to be encoded is spaced apart from the upper boundary of the image, the segment to be encoded may have available upper side data and no available left side data. . At this time, the upper side data of the to-be-encoded fragment may be determined as reference data of the to-be-encoded fragment, where the upper side data of the to-be-coded fragment may specifically refer to at least one pixel located in the image above the to-be-coded fragment. data.

As another example, only data belonging to the same rectangular region as the segment to be encoded can be used as the left side data and/or the upper side data available for the segment to be encoded. Correspondingly, assuming that the segment to be encoded belongs to the first rectangular region, whether the segment to be encoded has available left side data and/or upper side data may be determined according to whether the segment to be encoded is located at a boundary of the first rectangular region.

In this way, the coding between the respective rectangular regions can be made independent of each other.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the first rectangular region and the to-be-coded segment is adjacent to a left boundary of the first rectangular region, prediction of the first N pixel points in the to-be-coded segment The value is determined as a preset value, and according to the data of the first N pixels, the remaining (TN) pixels in the to-be-coded segment are encoded, where T is the pixel included in the segment to be encoded. The number, 1 ≤ N ≤ T.

If the segment to be encoded is adjacent to an upper boundary of the first rectangular region and the segment to be encoded is adjacent to a left boundary of the first rectangular region, the segment to be encoded may have neither left side data available nor The upper side data is available.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the first rectangular region and the to-be-coded segment is spaced apart from a left boundary of the first rectangular region, the to-be-coded segment is configured according to the left-side data of the segment to be encoded. The pixel points in the encoded segment are subjected to encoding processing.

Specifically, if the to-be-coded segment is adjacent to an upper boundary of the first rectangular region and the to-be-coded segment is spaced apart from a left boundary of the first rectangular region, the fragment to be encoded may have available left-side data and not Has available upper side data. At this point, you can left the fragment to be encoded. The side data is determined as the reference data of the fragment to be encoded, wherein the left side data of the fragment to be encoded may specifically refer to the same rectangular area (ie, located in the first rectangular area) and located in the to-be-coded fragment. Data for at least one pixel on the left side.

Optionally, if the to-be-coded segment is spaced apart from an upper boundary of the first rectangular region and the to-be-coded segment is adjacent to a left boundary of the first rectangular region, according to the upper side data of the to-be-coded segment, the to-be-coded segment The pixel points in the encoded segment are subjected to encoding processing.

Specifically, if the to-be-coded segment is adjacent to a left boundary of the first rectangular region and the to-be-coded segment is spaced apart from an upper boundary of the first rectangular region, the to-be-coded segment may have available upper-side data and not Has left side data available. At this time, the upper side data of the to-be-coded fragment may be determined as the reference data of the to-be-encoded fragment, where the upper side data of the to-be-coded fragment may specifically belong to the same rectangular area as the to-be-coded fragment (ie, located at the Data in at least one pixel of the rectangular region and located above the segment to be encoded.

As another example, the image may include at least one sub-image, each sub-image including at least one rectangular region. For example, each sub-image may include one or more rectangular regions in the height direction.

At this time, optionally, only the data belonging to the same sub-image as the segment to be encoded can be used as the left side data and/or the upper side data available for the segment to be encoded. Correspondingly, whether the segment to be encoded has available left side data and/or upper side data can be determined according to whether the segment to be encoded is located at the boundary of the sub-image to which it belongs.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the to-be-coded segment belongs and the to-be-coded segment is adjacent to a left boundary of the sub-image to which the to-be-coded segment belongs, the first N in the to-be-coded segment The predicted value of the pixel is determined as a preset value, and according to the data of the first N pixels, the remaining (TN) pixels in the to-be-coded segment are encoded, where T is the segment to be encoded. The number of pixels included in the figure, 1 ≤ N ≤ T.

If the segment to be encoded is adjacent to the upper boundary of the sub-image to which it belongs and the segment to be encoded is adjacent to the left boundary of the sub-image to which it belongs, the segment to be encoded may have neither available left data nor available Side data.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the fragment to be encoded belongs, and the to-be-coded segment is spaced apart from a left boundary of the sub-image to which the fragment to be encoded belongs, according to the left-side data of the fragment to be encoded. And encoding the pixel points in the segment to be encoded.

Specifically, if the segment to be encoded is adjacent to the upper boundary of the sub-image to which it belongs and the to-be-written The code segment is spaced apart from the left boundary of the sub-image to which it belongs, and the segment to be encoded may have available left side data and no available upper side data. At this time, the left side data of the to-be-coded fragment may be determined as the reference data of the to-be-coded fragment, where the left-hand data of the to-be-coded fragment may specifically belong to the same sub-image as the to-be-coded fragment and is located in the to-be-coded The data of at least one pixel on the left side of the segment.

Optionally, if the to-be-coded segment is spaced apart from the upper boundary of the sub-image to which the fragment to be encoded belongs, and the to-be-coded segment is adjacent to the left boundary of the sub-image to which the fragment to be encoded belongs, according to the upper data of the fragment to be encoded. And encoding the pixel points in the segment to be encoded.

Specifically, if the segment to be encoded is adjacent to the left boundary of the sub-image to which it belongs and the segment to be encoded is spaced apart from the upper boundary of the sub-image to which it belongs, the segment to be encoded may have available upper side data and has no available left. Side data. At this time, the upper side data of the to-be-coded fragment may be determined as the reference data of the to-be-encoded fragment, where the upper-side data of the to-be-coded fragment may specifically belong to the same sub-image as the to-be-coded fragment and is located in the to-be-coded The data of at least one pixel above the segment.

As another example, it may also be determined according to different criteria whether the segment to be encoded has available upper side data and left side data. For example, the segment to be encoded may use the upper side data in the same sub-image as the available upper side data and only the left side data in the same rectangular area as the available left side data. For another example, the segment to be encoded may use the left side data in the same sub image as the available left side data and only the left side data in the same rectangular area as the available left side data, and the like.

Optionally, if the to-be-coded segment is adjacent to a left boundary of the sub-image to which the to-be-coded segment belongs, and the to-be-coded segment is spaced apart from an upper boundary of the image, the to-be-coded according to the upper-side data of the to-be-coded segment The pixels in the segment are encoded.

Specifically, only data belonging to the same sub-image as the segment to be encoded can be used as the left side data available for the segment to be encoded, and the data located on the upper side of the segment to be encoded in the image can be used as the available segment of the segment to be encoded. Side data. Correspondingly, whether the segment to be encoded has available left side data is determined according to whether the segment to be encoded is located at a left boundary of the sub-image to which it is to be included, and whether the segment to be encoded is determined according to whether the segment to be encoded is located at an upper boundary of the image Has available upper side data.

Optionally, if the fragment to be encoded is adjacent to a left boundary of the sub-image to which the sub-image is to be located and the segment to be encoded is spaced apart from an upper boundary of the image, at this time, regardless of whether the segment to be encoded is in its The upper boundary of the sub-image can be considered to have available upper side data. At this time, the upper side data of the to-be-encoded fragment may be determined as reference data of the to-be-encoded fragment, where the upper side data of the to-be-coded fragment may specifically refer to at least one pixel located in the image above the to-be-coded fragment. data.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the to-be-coded segment belongs and the to-be-coded segment is spaced apart from the left boundary of the image, the to-be-coded according to the left-side data of the to-be-coded segment The pixels in the segment are encoded.

Specifically, only the data belonging to the same sub-image as the segment to be encoded can be used as the upper side data of the segment to be encoded, and the data located in the image to the left of the segment to be encoded can be used as the available left of the segment to be encoded. Side data. Correspondingly, whether the segment to be encoded has available upper side data may be determined according to whether the segment to be encoded is located at an upper boundary of the sub-image to which it is to be included, and whether the segment to be encoded is determined according to whether the segment to be encoded is located at a left boundary of the image Has left side data available.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the sub-image is to be located and the segment to be encoded is spaced apart from the left boundary of the image, at this time, whether the segment to be encoded is at the left boundary of the sub-image to which the sub-image belongs , can be considered to have available left side data. At this time, the left side data of the to-be-encoded segment may be determined as reference data of the to-be-encoded segment, where the left-side data of the to-be-coded segment may specifically refer to at least one pixel located in the image to the left of the segment to be encoded. The data.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in an eighth possible implementation manner of the first aspect, each of the M adjacent pixel points in the to-be-coded segment corresponds to the same reference pixel point, The reference data of the segment to be encoded includes data of the reference pixel, and M≥1.

Alternatively, M adjacent pixel points located in the same row may correspond to the same reference pixel point. Accordingly, encoding processing can be performed on M adjacent pixel points located in the same row at the same time.

In this way, M pixel points can be simultaneously encoded, so that data processing efficiency can be improved.

With reference to the first aspect or the foregoing possible implementation manner of the first aspect, in a ninth possible implementation manner of the first aspect, the method further includes: if the number of coded bits currently used by the rectangular area to which the fragment to be encoded belongs is Bi Less than or equal to the number of coded bits B allowed for the rectangular region to which the segment to be encoded belongs, and the coded bits to be used by the current pixel to be coded in the segment to be encoded The sum of the numbers bi+1 and Bi is greater than B, and an end code is added to the encoded bit stream of the fragment to be encoded, where the end code is used to identify that the encoding of the rectangular area to which the fragment to be encoded belongs is ended and the rectangular area to which the fragment to be encoded belongs has At least one uncoded pixel.

Alternatively, B may be equal to the number of coded bits corresponding to the fixed code rate.

If the number of coded bits of the rectangular area is exhausted and the rectangular area has at least one pixel that is not encoded, an end code corresponding to the rectangular area may be added to the encoded bit stream of the image to indicate that the rectangular area has at least one Uncoded pixels.

A second aspect provides a decoding method, including: acquiring a first identifier corresponding to a segment to be decoded in an encoded bitstream of an image; determining a reference of the segment to be decoded according to the first identifier corresponding to the segment to be encoded The data is the upper side data or the left side data of the to-be-decoded segment, where the left side data of the to-be-decoded segment includes data of at least one first pixel point located on the left side of the to-be-decoded segment, and the upper side of the to-be-decoded data The data includes data of at least one second pixel located above the segment to be decoded; and the segment to be decoded is decoded according to the reference data of the segment to be decoded.

The image may include at least one rectangular region, each rectangular region including at least one segment, each segment including at least one pixel point, wherein the rectangular regions of the same length correspond to a number of coded bits less than or equal to a preset number of bits.

Optionally, the encoded bitstream of the image may include a first identifier corresponding to each of the at least one segment included in the image, and the first identifier corresponding to each segment is used to identify reference data of each segment (or reference pixel point) where.

In a first possible implementation manner of the second aspect, the decoding process of the to-be-decoded segment according to the reference data includes: performing entropy decoding processing on the to-be-decoded segment to obtain a quantization parameter of the to-be-decoded segment; Performing inverse quantization processing on the to-be-decoded segment according to the quantization parameter of the to-be-decoded segment to obtain residual data of the to-be-decoded segment; and performing inverse prediction (or compensation) on the residual data of the to-be-decoded segment according to the reference data. Processing, obtaining a decoding result of the segment to be decoded.

In a third aspect, there is provided an encoding apparatus for performing the method of any of the above first aspect or any of the possible implementations of the first aspect.

In particular, the apparatus comprises means for performing the method of any of the above-described first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, there is provided a decoding apparatus for performing the method of any of the above-described second aspect or any of the possible implementations of the second aspect.

In particular, the apparatus comprises means for performing the method of any of the above-described second aspect or any of the possible implementations of the second aspect.

In a fifth aspect, there is provided another encoding apparatus comprising: a memory for storing instructions for executing instructions stored in the memory, and a processor, and when the processor executes the instructions stored by the memory, The execution causes the processor to perform the method of the first aspect or any possible implementation of the first aspect.

In a sixth aspect, there is provided another decoding apparatus comprising: a memory for storing instructions for executing instructions stored in the memory, and a processor, when the processor executes the instructions stored by the memory, The execution causes the processor to perform the method of the second aspect or any possible implementation of the second aspect.

A seventh aspect, a computer readable medium for storing a computer program, the computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.

In an eighth aspect, a computer readable medium is provided for storing a computer program comprising instructions for performing the method of the second aspect or any of the possible implementations of the second aspect.

In a ninth aspect, a computer program product comprising instructions, when executed on a computer, causes the computer to perform the method of any of the first aspect or the first aspect of the first aspect.

In a tenth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of any of the above-described second or second aspects.

In an eleventh aspect, a codec system is provided, comprising any of the encoding devices of the third aspect and any of the fourth aspects, or any of the encoding devices of the fifth aspect and any of the sixth aspects.

DRAWINGS

FIG. 1 is a schematic flowchart of an encoding method provided by an embodiment of the present application.

FIG. 2 is a schematic flowchart of a decoding method provided by an embodiment of the present application.

FIG. 3 is a schematic block diagram of an encoding apparatus according to an embodiment of the present application.

FIG. 4 is another schematic block diagram of an encoding apparatus according to an embodiment of the present application.

FIG. 5 is a schematic block diagram of a decoding apparatus provided by an embodiment of the present application.

FIG. 6 is another schematic block diagram of an encoding apparatus according to an embodiment of the present application.

FIG. 7 is another schematic block diagram of a decoding apparatus provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings in the embodiments of the present application.

The technical solutions provided in the embodiments of the present application can be applied to various video application systems, such as a camera system, a display system, and the like.

In the embodiment of the present application, the image may be divided into at least one rectangular area, and each rectangular area includes a plurality of pixel points. Alternatively, a rectangular area may be referred to as a tile or other name, but this embodiment of the present application does not limit this. Alternatively, if the image is divided into a plurality of rectangular regions, different rectangular regions in the image may have the same or different lengths. As an example, at least one rectangular area spaced from the image boundary may have the same length. Optionally, in the embodiment of the present application, the height of the rectangular area may be 1 pixel point or a plurality of pixel points, which is not limited in this embodiment of the present application.

For example, an image may be divided into a plurality of rectangular regions according to a first preset size, and rectangular regions not located at an image boundary may have the same size. The rectangular area located at the boundary of the image is limited by the size of the image, and its size may be determined by the first preset size and the image size, and may be the same size as other rectangular areas not located at the boundary of the image, or may be different from other rectangular areas. the same. For example, assuming that the image length is 3840 pixels and the first preset size is 1056 pixels, the image can be divided into four rectangular regions in order from left to right, wherein the lengths of the first to third rectangular regions are It can be 1056 pixels, and the fourth rectangular area is located at the image boundary. If the length of the rectangular area is still 1056 pixels, the rectangular area will exceed the image boundary. At this time, the length of the fourth rectangular area can be set. It is 672 pixels, but the embodiment of the present application is not limited thereto.

Optionally, some or all of the rectangular regions in the at least one rectangular region may be further divided into at least one segment, each segment including at least one pixel. Alternatively, if a rectangular area is divided into a plurality of segments, different segments in the rectangular region may have the same or different lengths. As an example, at least one segment spaced apart from the boundary of the rectangular region may have the same length, but the embodiment of the present application is not limited thereto.

For example, a rectangular area may be divided into a plurality of segments according to a second preset size, and segments not located at a boundary of the rectangular area may have the same size, and the segments located at the boundary of the rectangular area are limited by the size of the rectangular area, and the size may be different from other sizes. The segments that are not located at the boundary of the rectangular area are the same or different in size, which is not limited by the embodiment of the present application.

In the embodiment of the present application, the pixel points in the image may be encoded and decoded by using a fixed magnification in units of rectangular regions. That is to say, the number of coded bits corresponding to the rectangular area of the same length is less than or equal to the preset number of bits.

Specifically, when the number of encoded bits is equal to the preset number of bits, the rectangular areas of the same length correspond to the same number of coded bits, that is, the rectangular area in the image is encoded at a fixed magnification.

Thus, the technical solution provided by the embodiment of the present application has lower implementation complexity and higher coding efficiency.

For example, assuming that the length of the rectangular area is 1056 pixels, each pixel contains three components of Y, U, and V, and the number of bits of each component is 12 bits, the total number of uncoded bits included in the rectangular area is 12672. If the compression ratio is 2 times, the number of bits (ie, the number of coded bits) after compression corresponding to the rectangular area is 6336.

In the embodiment of the present application, optionally, the left side data or the upper side data is used as the reference data for each segment in the rectangular area, which is beneficial to improve the encoding quality.

In addition, in the embodiment of the present application, optionally, the number of coded bits of the segment may be coded and processed without using a fixed magnification, thereby ensuring the coding quality of the segment in the rectangular region and the flexibility of encoding and decoding.

FIG. 1 is a schematic flowchart of an encoding method 100 provided by an embodiment of the present application.

S110. Determine reference data of the segment to be encoded.

As an optional embodiment, the reference data of the fragment to be encoded may be determined from the left side data and the upper side data of the to-be-coded fragment according to data in the to-be-coded fragment.

The left side data of the fragment to be encoded may include data of at least one first pixel point located to the left of the fragment to be encoded. Optionally, the number of the at least one first pixel may be equal to the number of pixels included in the segment to be encoded, or the number of the at least one first pixel may be greater or smaller than the segment to be encoded. The number of the pixel points is not limited in this embodiment of the present application.

The at least one first pixel may be located to the left of the segment to be encoded. Optionally, the at least one first pixel may be adjacent to the to-be-coded segment, that is, the rightmost pixel in the at least one first pixel may be adjacent to the leftmost pixel in the to-be-coded segment. . Or the at least one first pixel may be spaced apart from the to-be-coded segment. For example, the at least one first pixel and the to-be-coded segment may be separated by at least one pixel, that is, the at least one first pixel. The rightmost pixel in the image may be spaced apart from the leftmost pixel in the segment to be encoded by at least one pixel, wherein the number of pixels spaced between the at least one first pixel and the segment to be encoded It may be less than a certain threshold, that is, the at least one first pixel may be adjacent to the fragment to be encoded, but the embodiment of the present application does not limit this.

Alternatively, the data of the first pixel may refer to raw data or encoded data of the first pixel. Correspondingly, the data of the at least one first pixel may include original data of each of the at least one first pixel, or may include each of the at least one first pixel The encoded data, or may include the original data of the partial pixels in the at least one first pixel and the encoded data of the other partial pixels, and the like, which is not limited in this embodiment of the present application.

The upper side data of the data to be encoded includes data of at least one second pixel point located above the fragment to be encoded. Optionally, the number of the at least one second pixel may be equal to the number of pixels included in the segment to be encoded, or the number of the at least one second pixel may be greater or smaller than the segment to be encoded. The number of the pixel points is not limited in this embodiment of the present application.

The at least one second pixel may be located above the segment to be encoded. Optionally, the at least one second pixel may be adjacent to the segment to be encoded. Or the at least one second pixel may be spaced apart from the to-be-coded segment. For example, the at least one second pixel and the to-be-coded segment may be separated by at least one pixel, wherein the at least one second pixel The number of the pixels in the interval between the point and the to-be-coded segment may be less than a certain threshold, that is, the at least one second pixel may be adjacent to the segment to be encoded, but the embodiment of the present application does not limit this.

Optionally, the data of the second pixel may refer to the original data of the second pixel or has been edited. Code data. Correspondingly, the data of the at least one second pixel may include original data of each of the at least one second pixel, or may include each second pixel of the at least one second pixel The encoded data, or may include the original data of the partial pixels of the at least one second pixel and the encoded data of the other partial pixels, and the like, which is not limited by the embodiment of the present application.

In the embodiment of the present application, the reference data of the segment may be selected from the left side data and the upper side data of the segment according to at least one pixel included in the segment. Specifically, the reference pixel point of the segment may be determined from at least one first pixel point on the left side of the segment and at least one second pixel point above the segment according to at least one pixel point included in the segment to be encoded. For example, at least one first pixel on the left side of the segment to be encoded may be determined as a reference pixel of the segment to be encoded, and correspondingly, the left side data of the segment to be encoded may be determined as reference data of the segment to be encoded. For example, at least one second pixel above the segment to be encoded may be determined as a reference pixel of the segment to be encoded, and correspondingly, the upper data of the segment to be encoded may be determined as reference data of the segment to be encoded. The reference data herein may specifically refer to the data of the reference pixel, which is not limited by the embodiment of the present application.

As an optional embodiment, the correlation between the fragment to be encoded and the at least one first pixel and the correlation between the fragment to be encoded and the at least one second pixel may be selected from the at least one A reference pixel of the segment to be encoded is determined from a pixel and the at least one second pixel. Correspondingly, according to the correlation between the to-be-coded segment and the left-side data of the to-be-coded segment and the correlation between the segment to be encoded and the upper-side data of the segment to be encoded, from the left of the segment to be encoded In the side data and the upper side data, reference data of the segment to be encoded is determined.

Optionally, in the embodiment of the present application, the data to be encoded and the left side data of the to-be-coded segment may be determined according to data of at least one pixel included in the to-be-coded segment and left-side data of the segment to be encoded. The correlation between the two. As an example, the absolute value of the difference between the data in the fragment to be encoded and the data on the left side of the fragment to be encoded may be determined, and the fragment to be encoded and the fragment to be encoded are determined according to the absolute value of the difference. The correlation between the data on the left side. Optionally, the variance between the to-be-coded segment and the left-side data of the to-be-coded segment or the data transformation, such as a Hadamard transform, and subsequent data, may be used to determine the coded segment and the left side data. The correlation between the two. As an example, the smaller the absolute value of the difference between the data in the fragment to be encoded and the data on the left side of the fragment to be encoded, the smaller the number of the difference between the data to be encoded and the data to be encoded. The correlation between the data on the left side of the segment is larger, but the embodiment of the present application is not limited thereto.

Optionally, in the embodiment of the present application, the absolute value of the difference between the data in the to-be-coded segment and the left-side data of the encoded segment may be based on data of each pixel in the encoded segment and The absolute value of the difference between the data of the first pixel corresponding to each pixel is obtained. For example, the absolute value of the difference between the data in the segment to be encoded and the data on the left side of the segment to be encoded may be data of each pixel in the segment and a first pixel corresponding to each pixel. A function of the sum of the absolute values of the differences between the points of the data, the function may be an average function or a mean square function, etc., but the embodiment of the present application is not limited thereto.

For example, assume that the data of the segment to be encoded can be represented by the following set: {currSegi, i=1, . . . , n}, and assume that the left side data of the segment to be encoded can be represented by the following set {neiSegj, j=1, . . . , m }, where n is the number of pixels included in the segment to be encoded, and m is the number of the at least one first pixel. If n=m, the difference diff between the segment to be encoded and the left side data of the segment to be encoded can be determined by:

If n>m, the difference diff between the to-be-coded segment and the left-side data of the segment to be encoded can be determined by:

Wherein, {currSeg'i, i=1, . . . , m} may be m pieces of data obtained by sampling the data {currSegi, i=1, . . . , n} of the segment to be encoded with a specific step size. The sampled data may be obtained by averaging data within a specific step size in the data of the segment to be encoded, or may be obtained by extracting a point in the data of the segment to be encoded within a specific step size, etc. This embodiment of the present application does not limit this. Alternatively, the particular step size may be determined based on n and m. For example, if n is equal to an integer multiple of m, then the particular step size can optionally be a divisor of n and m; or, if n is not equal to an integer multiple of m, then the particular step size can optionally be n and m The approximation of the divisor is such that the divisor of n and m is rounded up, rounded down, or rounded off, but the embodiment of the present application is not limited thereto.

If n < m, the difference diff between the data to be encoded and the left data of the data to be encoded can be determined by:

Wherein, {neiSeg'i, i=1, . . . , m} may be n pieces of data obtained by sampling the left side data {neiSegi, i=1, . . . , n} of the coded segment with a specific step size. The sampled data can Is obtained by averaging data within a specific step size in the left side data of the coded segment, or may be obtained by extracting a point in the left side data of the slice to be encoded within a specific step size, etc. This embodiment of the present application does not limit this. Alternatively, the particular step size may be determined based on n and m. For example, if m is equal to an integer multiple of n, then the particular step size can optionally be a divisor of n and m; or, if m is not equal to an integer multiple of n, the particular step size can optionally be n and m The approximation of the divisor, such as the divisor of m and n is rounded up, rounded down or rounded to the value obtained, but the embodiment of the present application is not limited thereto.

Optionally, the correlation between the to-be-coded segment and the upper-side data of the to-be-coded segment may be determined according to data of at least one pixel included in the to-be-coded segment and upper-side data of the segment to be encoded. The specific implementation of the present invention may be similar to the foregoing method for processing the data on the left side, but the embodiment of the present application does not limit this.

In the embodiment of the present application, optionally, the data on the left side of the fragment to be encoded and the data in the upper side data having a greater degree of relevance to the fragment to be encoded may be determined as the reference data of the fragment to be encoded, but The application embodiment is not limited to this.

As another optional embodiment, if the to-be-coded segment has only available left-side data and no available upper-side data, the left-side data of the to-be-coded segment may be determined as reference data of the to-be-coded segment. Optionally, if the to-be-coded segment has only available upper-side data and no available left-side data, the upper-side data of the to-be-coded segment may be determined as reference data of the to-be-coded segment, but the present application is implemented. The example is not limited to this.

In the embodiment of the present application, optionally, a segment can use any data in the image as reference data, that is, the segment can use any data in an image of the same rectangular region or a different rectangular region as the segment as reference data. For example, in order to improve the encoding quality, a segment may use the upper side data of the segment (for example, data of adjacent pixel points located above the segment) as reference data, regardless of whether the pixel corresponding to the upper side data and the segment Belongs to the same rectangular area. Alternatively, a segment can only use data in a rectangular region to which the segment belongs as reference data, and cannot use data other than the rectangular region to which the segment belongs as reference data, so that codecs between different rectangular regions in the image can be made. They can be independent of each other. Alternatively, the image may be divided into at least one sub-image, each sub-image may include at least one rectangular region, for example, one rectangular region may include one row of pixel points, one sub-image may include H rows of pixel points, and H is greater than or equal to 1. An integer, such that a sub-image may include at least H rectangular regions, but this embodiment of the present application does not limit this. At this point, a clip can only use the slice The data in the sub-image to which the segment belongs is used as the reference data. For example, the data of the sub-image to which the segment belongs may be the same rectangular area as the segment, or the data of the sub-image to which the segment belongs may belong to a different rectangular area. The data other than the sub-image to which the segment belongs may not be used as the reference data, but the embodiment of the present application is not limited thereto.

Optionally, if the segment to be encoded is not adjacent to or spaced apart from the upper boundary of the rectangular region to which the segment to be encoded belongs, it may be determined that the segment to be encoded has available upper side data, and accordingly, if the segment to be encoded and the to-be-coded segment If the upper boundary of the rectangular region to which the encoded segment belongs is adjacent, it can be determined that the segment to be encoded does not have available upper side data. Alternatively, if the segment to be encoded is not adjacent to or spaced apart from the upper boundary of the image, it may be determined that the segment to be encoded has available upper side data, and accordingly, if the segment to be encoded is adjacent to the upper boundary of the image, It is determined that the segment to be encoded does not have available upper side data. Alternatively, if the segment to be encoded is not adjacent to or spaced apart from the upper boundary of the sub-image to which the segment to be encoded belongs, it may be determined that the segment to be encoded has available upper side data, and correspondingly, if the segment to be encoded and the segment to be encoded are If the upper boundary of the sub-image is adjacent, it can be determined that the segment to be encoded does not have the available upper-side data, but the embodiment of the present application does not limit this.

If the segment to be encoded is not adjacent to or spaced apart from the left boundary of the rectangular region to which the segment to be encoded belongs, it may be determined that the segment to be encoded has available left data, and correspondingly, if the segment to be encoded and the segment to which the segment to be encoded belongs If the left border of the region is adjacent, it can be determined that the segment to be encoded does not have available left side data. Alternatively, if the segment to be encoded is not adjacent to or spaced apart from the left boundary of the image, it may be determined that the segment to be encoded has available left side data, and correspondingly, if the segment to be encoded is adjacent to the left boundary of the image, It is determined that the segment to be encoded does not have available left side data. Alternatively, if the segment to be encoded is not adjacent to or spaced apart from the left boundary of the sub-image to which the segment to be encoded belongs, it may be determined that the segment to be encoded has available left-side data, and correspondingly, if the segment to be encoded and the segment to be encoded are If the left edge of the sub-image is adjacent to the sub-image, it can be determined that the segment to be encoded does not have the available left-side data, but the embodiment of the present application does not limit this.

As an alternative embodiment, in the embodiment of the present application, whether the segment has available upper side data and whether the segment has available left side data may have the same criterion.

Determining the reference data of the to-be-coded segment from the left-side data and the upper-side data of the to-be-coded segment, including: if the to-be-coded segment has available left-side data and available upper-side data, from the to-be-coded segment The available left side data and the available upper side data determine the reference data of the fragment to be encoded.

At this point, it is determined that the segment to be encoded has available left side data and has available In the case of side data, the reference data of the segment to be encoded is determined from the left side data available for the segment to be encoded and the available upper side data.

Specifically, if the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded is spaced apart from the left boundary of the image, the segment to be encoded may have available left side data and does not have available upper side data. . At this time, the left side data of the to-be-encoded segment may be determined as reference data of the to-be-encoded segment, where the left-side data of the to-be-coded segment may specifically refer to at least one pixel located in the image to the left of the segment to be encoded. The data.

Specifically, if the to-be-coded segment is adjacent to an upper boundary of the first rectangular region and the to-be-coded segment is spaced apart from a left boundary of the first rectangular region, the fragment to be encoded may have available left-side data and not Has available upper side data. In this case, the data of the left side of the to-be-coded segment may be determined as the reference data of the to-be-coded segment, where the left-hand data of the segment to be encoded may specifically belong to the same rectangular region as the segment to be encoded (ie, located at the first Data in at least one pixel of a rectangular area and located to the left of the segment to be encoded.

Optionally, if the segment to be encoded is opposite to the upper boundary of the sub-image to which the segment to be encoded belongs The neighboring segment and the to-be-coded segment are spaced apart from the left boundary of the sub-image to which the segment to be encoded belongs, and the pixel in the segment to be encoded is encoded according to the left-side data of the segment to be encoded.

Specifically, if the segment to be encoded is adjacent to the upper boundary of the sub-image to which it belongs and the segment to be encoded is spaced apart from the left boundary of the sub-image to which it belongs, the segment to be encoded may have available left-side data and is not available. Side data. At this time, the left side data of the to-be-coded fragment may be determined as the reference data of the to-be-coded fragment, where the left-hand data of the to-be-coded fragment may specifically belong to the same sub-image as the to-be-coded fragment and is located in the to-be-coded The data of at least one pixel on the left side of the segment.

As another alternative embodiment, it may also be determined according to different criteria whether the segment to be encoded has available upper side data and left side data. For example, the segment to be encoded may use the upper side data in the same sub-image as the available upper side data and only the left side data in the same rectangular area as the available left side data. For another example, the segment to be encoded may use the left side data in the same sub image as the available left side data and only the left side data in the same rectangular area as the available left side data, and the like.

Optionally, if the fragment to be encoded is adjacent to a left boundary of the sub-image to which the sub-image is to be located and the segment to be encoded is spaced apart from an upper boundary of the image, at this time, whether the segment to be encoded is at an upper boundary of the sub-image to which the sub-image belongs , can be considered to have available upper side data. At this time, the upper side data of the to-be-encoded fragment may be determined as reference data of the to-be-encoded fragment, where the upper side data of the to-be-coded fragment may specifically refer to at least one pixel located in the image above the to-be-coded fragment. data.

As another optional embodiment, the to-be-encoded segment may not have available upper-side data and does not have available left-side data, for example, the to-be-encoded segment and the upper boundary of the image, and the sub-image to which the segment to be encoded belongs The boundary or the upper boundary of the rectangular region to which the code segment belongs is adjacent, and the segment to be encoded is adjacent to the left boundary of the image, the left boundary of the sub-image to which the slice to be encoded belongs, or the left boundary of the rectangular region to which the code segment belongs. If the length of the segment to be encoded is greater than a certain threshold, that is, the number of pixels in the same row included in the segment to be encoded is greater than a certain threshold, the data of at least one pixel in the segment to be encoded may be As reference data of at least one pixel in the latter to be encoded.

For example, if the number of pixels T in the same row included in the segment to be encoded is greater than N, the predicted value of the first N pixel points in the to-be-coded segment may be determined as a preset value. For example, 1<<(BitDepth-1) may be determined as the predicted value of the first N pixel points, where , << is the left shift operator, BitDepth is the pixel bit depth, indicating the number of coded bits used by each uncoded pixel. When encoding the remaining (TN) pixel points in the slice to be encoded, the pixel point j located on the left side of the pixel point i and spaced apart from the pixel point i by L pixels may be used as the reference pixel of the pixel point i. However, embodiments of the present application are not limited thereto. The value of the pixel point j as the reference pixel may be the value of the original pixel point of the pixel point j or the value of the coded reconstructed pixel point of the pixel point j.

Optionally, in the embodiment of the present application, the pixel points in the segment may be encoded/decoded by the degree of parallelism M, that is, the M pixels may be encoded/decoded at the same time, where M is greater than or equal to 1 The integer. For example, each of the M adjacent pixel points in the to-be-coded segment may correspond to the same reference pixel, where the M adjacent pixels may be located in the same row, but the embodiment of the present application does not limit this.

Optionally, in the embodiment of the present application, N may be determined by M and a timing logic delay L, where the delay of the sequential logic is determined by the structure of the hardware design, such as the number of stages designed by the chip pipeline, wherein L may be The pixel coding delay value of the encoding end and the maximum value of the pixel decoding delay value of the decoding end, but the embodiment of the present application is not limited thereto.

S120. Perform encoding processing on the to-be-coded segment according to the reference data to obtain an encoded bitstream of the to-be-coded segment.

As an example, the segment to be encoded may be subjected to prediction processing according to the reference data to obtain a prediction residual of the segment to be encoded. Then, the prediction residual of the to-be-coded segment may be quantized by using the quantization parameter of the to-be-coded segment to obtain a quantized result of the segment to be encoded. Then, the quantization result of the segment to be encoded may be subjected to entropy coding processing to obtain a coding result of the segment to be encoded.

Specifically, the prediction residual of the fragment to be encoded may include an absolute value of the residual value of each pixel in the to-be-coded segment, wherein, as an example, the absolute value of the residual value of the pixel may be the pixel The absolute value of the difference between the original data and the original data of the reference pixel of the pixel, but this embodiment of the present application does not limit this.

Optionally, the quantization result of the to-be-coded segment may be obtained by performing quantization processing on a residual of each pixel in the to-be-coded segment. In the embodiment of the present application, the quantization process may be quantization in the H.264/AVC standard, quantization in the H.265/HEVC standard, and the AVS1-P2 standard. The quantization, the quantization in the AVS2-P2 standard, or the self-designed quantization table, and the like, are not limited in this embodiment of the present application.

In the embodiment of the present application, the entropy coding process may be a lossless coding process, and specifically, an Nth order Golomb code and a context-based adaptive variable length coding (CAVLC) may be adopted. The content-based adaptive binary arithmetic coding (CABAC) and the like are not limited in this embodiment of the present application.

As another optional embodiment, the quantization parameter of the fragment to be encoded may also be determined according to the reference data. For example, the original quantization parameter may be updated according to the reference data to obtain a quantization parameter of the fragment to be encoded. The original quantization parameter may be an initial quantization parameter of the to-be-coded segment. For example, the original quantization parameter may be an initial quantization parameter of the image, or a quantization parameter of a previous segment of the to-be-coded segment, and the like. The embodiment does not limit this.

Optionally, in the embodiment of the present application, the quantization parameter may include a quantization step, a quantization step size, or a value (for example, QP) indicating a quantization step size, a quantization matrix, or a quantization matrix index, etc. The embodiment of the present application does not limit this.

Optionally, the complexity of the segment to be encoded may be determined according to the reference data, and the quantization parameter of the segment to be encoded is determined according to the complexity of the segment to be encoded.

As an example, the quantization parameter of the segment to be encoded may be determined according to the complexity of the segment to be encoded and the total complexity of the rectangular region to which the segment to be encoded belongs.

In the embodiment of the present application, optionally, the residual of each pixel point may be determined according to the reference data of the to-be-coded segment and the data of each pixel in the to-be-coded segment, and according to the to-be-coded segment. The residual of each pixel determines the complexity of the segment to be encoded. Optionally, the residual of each pixel may be determined according to data of each pixel in the to-be-coded segment and data of a reference pixel of each pixel, where the reference of the segment to be encoded is The data may include the data of the reference pixel of each pixel in the segment to be encoded, but the embodiment of the present application does not limit this.

Optionally, the total complexity of the rectangular area to which the fragment to be encoded belongs may be determined according to the complexity of each fragment included in the rectangular area to which the fragment to be encoded belongs. For example, the total complexity of a rectangular area may be the rectangle. The average of the complexity of the plurality of segments included in the region, but the embodiment of the present application is not limited thereto.

As an optional embodiment, the quantization parameter of the segment to be encoded may be determined by comparing the complexity of the segment to be encoded and the total complexity of the rectangular region to which the segment to be encoded belongs. For example, if the complexity of the segment to be encoded is greater than the total complexity of the rectangular region to which the segment to be encoded belongs, the original quantization parameter may be reduced to obtain a quantization parameter of the segment to be encoded. For another example, if the complexity of the segment to be encoded is smaller than the total complexity of the rectangular region to which the segment to be encoded belongs, the original quantization parameter may be added to obtain a quantization parameter of the segment to be encoded. For example, if the complexity of the to-be-coded segment is equal to the total complexity of the rectangular region to which the segment to be encoded belongs, the original quantization parameter may be kept unchanged, that is, the quantization parameter of the segment to be encoded is equal to the original quantization parameter. There is no limit to this.

After the quantization parameter of the to-be-coded segment is determined, the to-be-coded segment may be encoded by using the quantization parameter of the to-be-encoded segment, but the embodiment of the present application does not limit this.

In this way, under the condition that the number of coded bits corresponding to the rectangular region is fixed, the quantization parameter of each segment and the corresponding number of coded bits are determined according to the data included in each segment in the rectangular region, which is advantageous for improving the coding quality.

In the embodiment of the present application, optionally, after determining the reference data of the to-be-coded segment, a first identifier may be added to the encoded bitstream of the to-be-coded segment, where the reference data of the to-be-coded segment is located. position. For example, the first identifier may be used to indicate whether the reference data point of the fragment to be encoded is located on the left side or the upper side of the fragment to be encoded, or the first identifier may further indicate the coordinates of the reference data point of the fragment to be encoded. For example, the pixel is separated from the to-be-coded segment by a few pixels, and the like.

As an example, the first identifier corresponding to each segment may be added to the header information of the encoded bit stream of the image to identify the location of the reference data of the segment, but the embodiment of the present application does not limit this.

Optionally, in the embodiment of the present application, if the number of coded bits allowed to be used in the rectangular area is exhausted in the process of encoding the rectangular area, but there are still uncoded pixel points in the rectangular area, An end code is added to the encoded bitstream corresponding to the rectangular region, wherein the end code can be used to identify the end of encoding of the rectangular region and the rectangular region further has at least one uncoded pixel. Optionally, the end code needs to be different from the coded bit in the coded bitstream corresponding to the rectangular area, that is, the uniqueness of the end code in the coded bit stream corresponding to the rectangular area needs to be guaranteed. For example, when a 0th-order Columbus code is used and the bit depth of the coded pixel is 12, the pattern of the end code can be set to consecutive 14 '0's, but this embodiment of the present application Not limited.

As another optional embodiment, after encoding the rectangular area, the stuffing bits may be added to the encoded bit stream corresponding to the rectangular area, so that the number of bits included in the encoded bit stream corresponding to the rectangular area is Strictly equal to the number of bits corresponding to the fixed compression ratio. Optionally, the padding bit may be a plurality of consecutive '1's or a plurality of consecutive '0's, which is not limited by the embodiment of the present application.

Therefore, the coding method provided by the embodiment of the present application can have lower implementation complexity while ensuring the coding quality. In addition, parallel coding processing on pixel points can be implemented, thereby improving data processing capability.

FIG. 2 shows a decoding method 200 provided by an embodiment of the present application.

S210. Acquire a first identifier corresponding to the segment to be decoded in the encoded bitstream of the image.

The image may include at least one rectangular region, each rectangular region including at least one segment, each segment including at least one pixel.

Optionally, in the embodiment of the present application, rectangular areas of the same length may correspond to the same number of coded/decoded bits.

Optionally, the encoded bitstream of the image may include a first identifier corresponding to each of the at least one segment included in the image, wherein the first identifier corresponding to each segment may be used to identify each segment The location of the reference data.

In the embodiment of the present application, the different segments may correspond to different first identifiers. Correspondingly, the location of the reference data of each segment may be determined according to the first identifier corresponding to each segment, but the embodiment of the present application Not limited to this.

S220. Determine, according to the first identifier corresponding to the to-be-decoded segment, the reference data of the to-be-decoded segment as the upper side data or the left side data of the to-be-decoded segment.

Specifically, the first identifier corresponding to the to-be-coded segment may be used to identify that the location of the reference data of the to-be-decoded segment is the left side or the upper side of the to-be-coded segment.

Optionally, the left side data of the to-be-decoded segment may include data of at least one first pixel point located to the left of the to-be-decoded segment, where the at least one first pixel point may be adjacent to or spaced from the to-be-decoded segment. The data of each of the first pixel points may include the original data or the decoded data of the first pixel, which is not limited by the embodiment of the present application.

Optionally, the upper side data of the to-be-decoded data may include data of at least one second pixel point located above the to-be-decoded segment, where the at least one second pixel point may be The decoded segments are adjacent or spaced apart, and the data of each second pixel may include the original data or the decoded data of the second pixel, which is not limited in this embodiment of the present application.

S230. Perform decoding processing on the to-be-decoded segment according to the reference data of the to-be-decoded segment.

Optionally, the to-be-decoded segment may be subjected to an entropy decoding process to obtain a quantization parameter of the to-be-decoded segment. Then, the to-be-decoded segment may be inverse quantized according to the quantization parameter of the to-be-decoded segment to obtain the to-be-decoded The residual data of the segment may be inversely predicted or compensated according to the reference data to obtain a decoding result of the segment to be decoded.

As an example, the reference data of the segment to be decoded may include data of pixels in the image that are adjacent to the segment to be decoded.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of the image and the to-be-decoded segment is adjacent to a left boundary of the image, determining a residual value of the first N pixel points in the to-be-decoded segment as a pre- Setting a value, and performing decoding processing on the remaining (TN) pixel points in the to-be-decoded segment according to the data of the first N pixel points, where T is the number of pixel points included in the to-be-decoded segment, 1 ≤ N ≤ T.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of the image and the to-be-decoded segment is spaced apart from a left boundary of the image, according to the left-side data of the to-be-decoded segment, the pixel in the to-be-decoded segment Perform decoding processing.

Optionally, if the to-be-decoded segment is spaced apart from an upper boundary of the image and the to-be-decoded segment is adjacent to a left boundary of the image, according to the upper side data of the to-be-decoded segment, the pixel in the to-be-decoded segment Perform decoding processing.

As another example, the reference data of the segment to be decoded may be data adjacent to the segment to be decoded in the rectangular region to which the segment to be decoded belongs.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of a rectangular region to which the to-be-decoded segment belongs and the to-be-decoded segment is adjacent to a left boundary of the rectangular region to which the to-be-decoded segment belongs, the first N in the to-be-decoded segment The residual value of the pixel points is determined as a preset value, and according to the data of the first N pixel points, the remaining (TN) pixel points in the to-be-decoded segment are decoded, where T is the to-be-decoded The number of pixels included in the segment, 1 ≤ N ≤ T.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of a rectangular region to which the to-be-decoded segment belongs, and the to-be-decoded segment is spaced apart from a left boundary of the rectangular region to which the to-be-decoded segment belongs, the root According to the left side data of the to-be-decoded segment, the pixel points in the to-be-decoded segment are subjected to decoding processing.

Optionally, if the to-be-decoded segment is spaced apart from the upper boundary of the rectangular region to which the segment to be decoded belongs, and the to-be-decoded segment is adjacent to the left boundary of the rectangular region to which the segment to be decoded belongs, according to the upper data of the segment to be decoded. Decoding processing of the pixel points in the segment to be decoded.

As another example, the image includes at least one sub-image, each sub-image including at least one rectangular region. At this time, the reference data of the segment to be decoded may be data adjacent to the segment to be decoded in the sub-image to which the segment to be decoded belongs.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of the sub-image to which the to-be-decoded segment belongs and the to-be-decoded segment is adjacent to a left boundary of the sub-image to which the to-be-decoded segment belongs, the first N in the to-be-decoded segment The residual value of the pixel points is determined as a preset value, and according to the data of the first N pixel points, the remaining (TN) pixel points in the to-be-decoded segment are decoded, where T is the to-be-decoded The number of pixels included in the segment, 1 ≤ N ≤ T.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary of the sub-image to which the to-be-decoded segment belongs and the to-be-decoded segment is spaced apart from a left boundary of the sub-image to which the to-be-decoded segment belongs, according to the left-side data of the to-be-decoded segment Decoding processing of the pixel points in the segment to be decoded.

Optionally, if the to-be-decoded segment is spaced apart from an upper boundary of the sub-image to which the to-be-decoded segment belongs and the to-be-decoded segment is adjacent to a left boundary of the sub-image to which the to-be-decoded segment belongs, according to the upper side data of the to-be-decoded segment Decoding processing of the pixel points in the segment to be decoded.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the to-be-decoded segment belongs, and the to-be-decoded segment is spaced apart from an upper boundary of the image, according to the upper side data of the to-be-decoded segment, The pixel in the segment to be decoded is subjected to decoding processing.

Optionally, if the to-be-decoded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the to-be-decoded segment belongs, and the to-be-decoded segment is spaced apart from a left boundary of the image, according to the left side data of the to-be-decoded segment, The pixel in the segment to be decoded is subjected to decoding processing.

As another example, M adjacent pixels can be decoded at the same time. Optionally, each M adjacent pixel points in the to-be-decoded segment corresponds to the same reference pixel point, where the reference data of the to-be-decoded segment includes data of the reference pixel point, and M≥1.

It should be understood that, in the embodiment of the present application, the decoding method 200 may correspond to the foregoing encoding method, and may specifically be an inverse process of the encoding method. For specific implementation, refer to the description of the encoding method. For brevity, here is not Let me repeat.

FIG. 3 shows an encoding apparatus 300 provided by an embodiment of the present application, including:

The pre-analysis module 310 is configured to determine, according to data in the segment to be encoded of the image, reference data of the segment to be encoded from the left side data and the upper side data of the to-be-coded segment;

The encoding module 320 is configured to perform encoding processing on the fragment to be encoded according to the reference data determined by the pre-analysis module 310 to obtain an encoded bit stream of the fragment to be encoded.

In an embodiment of the present application, the image may include at least one rectangular area, each rectangular area including at least one segment, and each segment may include at least one pixel.

In the embodiment of the present application, optionally, the number of coded bits corresponding to the rectangular area having the same length is less than or equal to the preset number of bits.

In the embodiment of the present application, the data of the left side of the fragment to be encoded may include data of at least one first pixel located to the left of the fragment to be encoded, and the data of the upper side of the data to be encoded may be located above the fragment to be encoded. At least one second pixel point of data.

The reference data of the segment to be encoded may refer to the data of the reference data point of the segment to be encoded. Correspondingly, the process of determining the reference data of the segment to be encoded may include determining a reference data point of the segment to be encoded, where the location of the reference data point of the segment to be encoded may be the left side or the upper side of the segment to be encoded, specifically The embodiment of the present application does not limit the data and/or the location of the fragment to be encoded.

Optionally, the at least one first pixel may be adjacent to the segment to be encoded or adjacent to the segment to be encoded but spaced apart.

Optionally, the data of the at least one first pixel may include original data of the at least one first pixel or encoded data of the at least one first pixel.

Optionally, the at least one second pixel may be adjacent to the segment to be encoded or adjacent to the segment to be encoded but spaced apart.

Optionally, the data of the at least one second pixel may include original data of the at least one second pixel or encoded data of the at least one second pixel.

As an example, the pre-analysis module 310 can be specifically configured to:

Determining, according to the data in the to-be-coded segment and the data of the at least one first pixel, a correlation between the segment to be encoded and the left-side data of the segment to be encoded;

Determining, according to the data in the to-be-coded segment and the data of the at least one second pixel, a correlation between the segment to be encoded and the upper data of the segment to be encoded;

And according to the correlation between the to-be-coded segment and the left-side data of the to-be-coded segment, and the correlation between the segment to be encoded and the upper-side data of the segment to be encoded, from the left side data of the segment to be encoded and In the side data, the reference data of the segment to be encoded is determined.

Optionally, the pre-analysis module 310 is configured to determine, as the reference data of the to-be-coded segment, the data on the left side of the to-be-coded segment and the data in the upper-side data that is highly correlated with the to-be-coded segment. .

Optionally, the encoding module 320 is further configured to: add a first identifier to the encoded bitstream of the to-be-encoded segment, where the first identifier is used to indicate a location of the reference data of the to-be-coded segment.

As another alternative embodiment, as shown in FIG. 3, the apparatus 300 further includes: a boundary processing module 330, configured to: if the number of coded bits Bi currently used by the rectangular area to which the fragment to be encoded belongs is less than or equal to the fragment to be encoded The number of coded bits B to be used in the rectangular area to be used, and the sum of the number of coded bits bi+1 and Bi to be used in the current to-be-coded pixel to be encoded is greater than B, and the end of the coded bit stream to be added to the segment to be encoded is added. And the end code is used to identify that the encoding of the rectangular region to which the segment to be encoded belongs is ended and the rectangular region to which the segment to be encoded belongs has at least one uncoded pixel.

As an example, as shown in FIG. 4, the encoding module 320 can include:

The prediction unit 321 is configured to perform prediction processing on the to-be-coded segment according to the reference data, to obtain a prediction residual of the to-be-coded segment;

The quantization unit 322 is configured to perform quantization processing on the prediction residual of the to-be-coded segment obtained by the prediction unit 321 by using the quantization parameter of the to-be-coded segment, to obtain a quantization result of the to-be-coded segment;

The entropy encoding unit 323 is configured to perform entropy encoding processing on the quantized result of the to-be-encoded segment obtained by the quantization unit 322 to obtain an encoding result of the to-be-encoded segment.

As another example, the encoding module 320 may further include: a rate control unit 324, configured to: before the quantization unit 322 quantizes the prediction result of the to-be-coded segment by using the quantization parameter of the to-be-coded segment, according to the pre- Determining the quantization parameter of the segment to be encoded by the reference data determined by the analysis module 310;

Correspondingly, the quantization unit 322 can be specifically configured to perform quantization processing on the prediction result of the segment to be encoded by using the quantization parameter determined by the rate control unit 324.

Optionally, the rate control unit 324 is specifically configured to:

Determining the complexity of the segment to be encoded according to the reference data determined by the pre-analysis module 310 and the data in the segment to be encoded;

The quantization parameter of the segment to be encoded is determined according to the complexity of the segment to be encoded.

Optionally, the rate control unit 324 is specifically configured to:

Determining a residual of each pixel in the segment to be encoded according to the reference data and the data in the segment to be encoded;

The complexity of the segment to be encoded is determined according to the residual of each pixel in the segment to be encoded.

Optionally, the rate control unit 324 is specifically configured to:

Determining, according to the complexity of each segment in the rectangular region to which the segment to be encoded belongs, the complexity of the rectangular region to which the segment to be encoded belongs;

The quantization parameter of the segment to be encoded is determined by comparing the complexity of the segment to be encoded and the complexity of the rectangular region to which the segment to be encoded belongs.

As an example, the pre-analysis module 310 may be specifically configured to: if the to-be-coded segment has available left-side data and available upper-side data, from available left-side data and available upper-side data of the to-be-coded segment Determining the reference data of the segment to be encoded.

At this time, if the to-be-coded segment has only available left-side data or upper-side data, the pre-analysis module 310 may determine available left-side data or upper-side data of the to-be-coded segment as the to-be-coded segment. Reference data.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the image and the to-be-coded segment is adjacent to a left boundary of the image, the encoding module 320 may be further configured to use the first N pixels in the to-be-coded segment. The predicted value of the point is determined as a preset value, and according to the data of the first N pixel points, the remaining (TN) pixel points in the to-be-coded segment are encoded, where T is included in the to-be-coded segment. The number of pixels, 1 ≤ N ≤ T.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the image and the to-be-coded segment is spaced apart from a left boundary of the image, the encoding module 320 may further be configured to: according to the left side data of the to-be-coded segment, The pixel points in the segment to be encoded are subjected to encoding processing.

Optionally, if the to-be-coded segment is spaced apart from an upper boundary of the image and the to-be-coded segment is adjacent to a left boundary of the image, the encoding module 320 may be further configured to use, according to the upper-side data of the to-be-coded segment, The pixel points in the segment to be encoded are subjected to encoding processing.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of a rectangular region to which the to-be-coded segment belongs and the to-be-coded segment is adjacent to a left boundary of the rectangular region to which the segment to be encoded belongs, the encoding module 320 may be further configured to: The predicted values of the first N pixels in the to-be-coded segment are determined as preset values, and the remaining (TN) pixels in the to-be-coded segment are encoded according to the data of the first N pixels. Where T is the number of pixel points included in the segment to be encoded, 1≤N≤T.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of a rectangular area to which the to-be-coded segment belongs, and the to-be-coded segment is spaced apart from a left boundary of the rectangular region to which the to-be-coded segment belongs, the encoding module 320 may be further configured to The left side data of the fragment to be encoded is encoded by the pixel in the fragment to be encoded;

Optionally, if the to-be-coded segment is spaced apart from the upper boundary of the rectangular region to which the fragment to be encoded belongs, and the to-be-coded segment is adjacent to the left boundary of the rectangular region to which the fragment to be encoded belongs, the encoding module 320 may be further configured to The upper side data of the fragment to be encoded is subjected to encoding processing on the pixel points in the fragment to be encoded.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the to-be-coded segment belongs and the to-be-coded segment is adjacent to a left boundary of the sub-image to which the to-be-coded segment belongs, the encoding module 320 may be further configured to: The predicted values of the first N pixels in the to-be-coded segment are determined as preset values, and the remaining (TN) pixels in the to-be-coded segment are encoded according to the data of the first N pixels. Where T is the number of pixel points included in the segment to be encoded, 1≤N≤T.

Optionally, if the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the to-be-coded segment belongs and the to-be-coded segment is spaced apart from a left boundary of the sub-image to which the to-be-coded segment belongs, the encoding module 320 may be further configured to The left side data of the to-be-coded segment is subjected to encoding processing on the pixel points in the to-be-coded segment.

Optionally, if the segment to be encoded and the upper boundary of the sub-image to which the segment to be encoded belongs An interval is distributed and the segment to be encoded is adjacent to a left boundary of the sub-image to which the segment to be encoded belongs, and the pixel in the segment to be encoded is encoded according to the upper side data of the segment to be encoded.

Optionally, if the to-be-coded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the to-be-coded segment belongs, and the to-be-coded segment is spaced apart from an upper boundary of the image, the encoding module 320 may be further configured to be used according to the to-be-coded segment. Encoding the upper side data of the segment, and encoding the pixel points in the segment to be encoded.

Optionally, if the to-be-coded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the to-be-coded segment belongs, and the to-be-coded segment is spaced apart from the left boundary of the image, the encoding module 320 may further be configured to be used according to the to-be-coded segment. Encoding the left side data of the segment, and encoding the pixel points in the segment to be encoded.

Optionally, each M adjacent pixel points in the to-be-coded segment may correspond to the same reference pixel point, where the reference data of the to-be-coded segment includes data of the reference pixel point, and M≥1.

It should be understood that the above description of the encoding device 300 is merely exemplary. In some cases, the encoding device 300 may not include the one or more modules described above. For example, the encoding device 300 may not include the boundary processing module 330. However, the embodiment of the present application does not limit this.

It should also be understood that the apparatus 300 herein is embodied in the form of a functional module. In an optional example, those skilled in the art may understand that the apparatus 300 may be specifically the execution body of the coding method in the foregoing embodiment, and the apparatus 300 may be used to perform various processes and/or steps in the foregoing method embodiments. Avoid repetition and we will not repeat them here.

FIG. 5 shows a decoding apparatus 400 provided by an embodiment of the present application, including:

The obtaining module 410 is configured to acquire a first identifier corresponding to the segment to be decoded in the encoded bit stream of the image, where the image includes at least one rectangular region, each rectangular region includes at least one segment, and each segment includes at least one pixel a point, wherein the number of coded bits corresponding to the rectangular area having the same length is less than or equal to a preset number of bits, and the coded bit stream of the image includes a first identifier corresponding to each of the at least one segment included in the image, The first identifier corresponding to each segment is used to identify the location of the reference data of each segment;

The determining module 420 is configured to determine, according to the first identifier corresponding to the to-be-coded segment that is obtained by the acquiring module 410, that the reference data of the to-be-decoded segment is the upper-side data or the left-side data of the to-be-decoded segment, where the The left side data of the decoded segment includes data of at least one first pixel located to the left of the segment to be decoded, and the upper side data of the to-be-decoded data includes the segment to be decoded Data of at least one second pixel above;

The decoding module 430 is configured to perform decoding processing on the to-be-decoded segment according to the reference data of the to-be-decoded segment determined by the determining module 420.

Optionally, the decoding module 430 can include:

An entropy decoding unit, configured to perform entropy decoding processing on the to-be-decoded segment, to obtain a quantization parameter of the to-be-decoded segment;

An inverse quantization unit, configured to perform inverse quantization processing on the to-be-decoded segment according to the quantization parameter of the to-be-decoded segment obtained by the entropy decoding unit, to obtain residual data of the to-be-decoded segment;

The anti-prediction unit is configured to perform inverse prediction processing on the residual data of the to-be-decoded segment obtained by the inverse quantization unit according to the reference data determined by the determining module 420, to obtain a decoding result of the to-be-decoded segment.

It should be understood that the apparatus 400 herein is embodied in the form of a functional module. In an alternative example, those skilled in the art may understand that the apparatus 400 may be specifically the execution body of the decoding method in the foregoing embodiment, and the apparatus 400 may be used to perform various processes and/or steps in the foregoing method embodiments. Avoid repetition and we will not repeat them here.

It should also be understood that in the embodiments of the present application, the term "module" may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor for executing one or more software or firmware programs (eg, sharing). Processors, proprietary processors or group processors, etc.) and memory, merge logic, and/or other suitable components that support the described functionality.

FIG. 6 illustrates another encoding apparatus 500 provided by an embodiment of the present application, including: a processor 510 and a memory 520, wherein the memory 520 is configured to store an instruction, and the processor 510 is configured to execute the memory stored instruction, where Execution of the instruction stored in the memory 520 causes the processor 510 to perform an operation of determining the fragment to be encoded from the left side data and the upper side data of the fragment to be encoded according to data in the fragment to be encoded of the image. According to the reference data, the segment to be encoded is encoded to obtain an encoded bit stream of the segment to be encoded.

Optionally, the processor 510 is specifically configured to: perform prediction processing on the to-be-coded segment according to the reference data, to obtain a prediction residual of the to-be-coded segment, and use the quantization parameter of the to-be-coded segment to be encoded. The prediction residual of the segment is quantized to obtain a quantization result of the segment to be encoded; and the quantization result of the segment to be encoded is subjected to entropy coding processing to obtain a coding result of the segment to be encoded.

Optionally, the processor 510 is further configured to: determine, according to the reference data, the to-be-determined The quantization parameter of the encoded fragment.

In an alternative example, those skilled in the art may understand that the apparatus 500 may be specifically the encoding apparatus in the foregoing embodiment, and the apparatus 500 may be used to perform various processes and/or steps in the foregoing method embodiments, in order to avoid duplication. I will not repeat them here.

FIG. 7 illustrates another decoding apparatus 600 provided by an embodiment of the present application, including: a processor 610 and a memory 620, wherein the memory 620 is configured to store an instruction, and the processor 610 is configured to execute the memory stored instruction, where Execution of the instruction stored in memory 620 causes the processor 610 to perform the following operations:

Obtaining a first identifier corresponding to the segment to be decoded in the encoded bitstream of the image;

Determining, according to the first identifier corresponding to the to-be-coded segment, reference data of the to-be-decoded segment as upper-side data or left-side data of the to-be-decoded segment;

Decoding the to-be-decoded segment according to the reference data of the segment to be decoded.

Optionally, the processor 610 is specifically configured to:

Performing an entropy decoding process on the to-be-decoded segment to obtain a quantization parameter of the to-be-decoded segment;

Performing inverse quantization processing on the to-be-decoded segment according to the quantization parameter of the to-be-decoded segment, to obtain residual data of the to-be-decoded segment;

According to the reference data, the residual data of the to-be-decoded segment is subjected to inverse prediction processing to obtain a decoding result of the to-be-decoded segment.

In an alternative example, those skilled in the art may understand that the apparatus 600 may be specifically the decoding apparatus in the foregoing embodiment, and the apparatus 600 may be used to perform various processes and/or steps in the foregoing method embodiments, to avoid repetition. I will not repeat them here.

It should be understood that, in the embodiment of the present application, the processor may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like.

The memory can include read only memory and random access memory and provides instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory can also store information of the device type. The processor can be used to execute instructions stored in the memory, and when the processor executes the instructions, the processor can perform the steps corresponding to the terminal device in the above method embodiments.

In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software. The steps of the method disclosed in the embodiments of the present application may be directly implemented by the hardware processor, or may be performed by a combination of hardware and software modules in the processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in a memory, and the processor executes instructions in the memory, in combination with hardware to perform the steps of the above method. To avoid repetition, it will not be described in detail here.

It should also be understood that, in the embodiment of the present application, the pixels in the image may be located in different rows and/or columns, wherein the length of A may correspond to the number of pixels included in the same row of A, and the height of A may be Corresponds to the number of pixels in the same column that A includes. In addition, the length and height of A may also be referred to as the width and depth of A, respectively, which is not limited by the embodiment of the present application.

It should also be understood that, in the embodiment of the present application, “the boundary distribution with A” may mean that at least one pixel is spaced apart from the boundary of A, and may also be referred to as “not adjacent to the boundary of A” or “not located at A”. The boundary is not limited in this embodiment, and A may be an image, a rectangular area or a sub-image, and the like.

It should be understood that the above description of the embodiments of the present application is emphasized to emphasize the differences between the various embodiments, and the same or similar points that are not mentioned may be referred to each other, and are not described herein again for brevity.

Moreover, the terms "system" and "network" are used interchangeably herein. The term "and/or" in this context is merely an association describing the associated object, indicating that there may be three relationships, for example, A and/or B, which may indicate that A exists separately, and both A and B exist, respectively. B these three situations. In addition, the character "/" in this article generally indicates that the contextual object is an "or" relationship.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.

A person skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present application are generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL), or wireless (eg, infrared, wireless, microwave, etc.). The computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media. The usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state disk (SSD)) or the like.

The foregoing is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application. It should be covered by the scope of protection of this application. Therefore, this application The scope of protection shall be determined by the scope of protection of the claims.

Claims

An encoding method, comprising:

Determining, according to data in the segment to be encoded of the image, reference data of the segment to be encoded from the left side data and the upper side data of the to-be-coded segment;

Encoding the to-be-encoded segment according to the reference data to obtain an encoded bitstream of the to-be-coded segment;

The image includes at least one rectangular area, each rectangular area includes at least one segment, each segment includes at least one pixel, and the number of encoded bits corresponding to the rectangular area of the same length is less than or equal to a preset number of encoded bits,

The data on the left side of the fragment to be encoded includes data of at least one first pixel located on the left side of the fragment to be encoded, and the upper side data of the data to be encoded includes at least one second located above the fragment to be encoded. Pixel data.
The method of claim 1 wherein at least one of the following is true:

The at least one first pixel is adjacent to the segment to be encoded or adjacent to the segment to be encoded but spaced apart;

The data of the at least one first pixel includes the original data of the at least one first pixel or the encoded data of the at least one first pixel;

The at least one second pixel is adjacent to the fragment to be encoded or adjacent to the fragment to be encoded but spaced apart;

The data of the at least one second pixel includes raw data of the at least one second pixel or encoded data of the at least one second pixel.
The method according to claim 1 or 2, wherein the determining the reference data of the fragment to be encoded from the left side data and the upper side data of the fragment to be encoded according to data in the fragment to be encoded ,include:

Determining, according to the data in the to-be-coded segment and the data of the at least one first pixel, a correlation between the segment to be encoded and the left-side data of the segment to be encoded;

Determining, according to the data in the to-be-coded segment and the data of the at least one second pixel, a correlation between the to-be-coded segment and the upper-side data of the segment to be encoded;

And according to the correlation between the to-be-coded segment and the left-side data of the to-be-coded segment, and the correlation between the to-be-coded segment and the upper-side data of the to-be-coded segment, from the segment to be encoded In the left side data and the upper side data, reference data of the fragment to be encoded is determined.
The method according to claim 3, wherein the correlation between the segment to be encoded and the left side data of the segment to be encoded, and the segment to be encoded and the segment to be encoded are Correlation between the side data, determining the reference data of the fragment to be encoded from the left side data and the upper side data of the fragment to be encoded, including:

And determining, by the left side data of the to-be-coded segment and the data of the upper side data that is highly correlated with the to-be-coded segment, as the reference data of the to-be-coded segment.
The method according to any one of claims 1 to 4, further comprising:

Adding a first identifier to the encoded bitstream of the fragment to be encoded, the first identifier being used to indicate a location of reference data of the fragment to be encoded.
The method according to any one of claims 1 to 5, wherein the encoding processing the fragment to be encoded according to the reference data comprises:

And performing prediction processing on the to-be-coded segment according to the reference data, to obtain a prediction residual of the to-be-coded segment;

Using the quantization parameter of the fragment to be encoded, performing quantization processing on the prediction residual of the fragment to be encoded, to obtain a quantization result of the fragment to be encoded;

Encoding the quantized result of the to-be-coded segment to obtain an encoding result of the segment to be encoded.
The method according to claim 6, wherein the method further comprises: before the quantizing the prediction result of the segment to be encoded by using the quantization parameter of the segment to be encoded, the method further comprises:

Determining, according to the reference data, a quantization parameter of the segment to be encoded.
The method according to claim 7, wherein the determining the quantization parameter of the fragment to be encoded according to the reference data comprises:

Determining a complexity of the fragment to be encoded according to the reference data and data in the fragment to be encoded;

Determining a quantization parameter of the segment to be encoded according to the complexity of the segment to be encoded.
The method according to claim 8, wherein the determining the complexity of the fragment to be encoded according to the reference data and the data in the fragment to be encoded comprises:

Determining a residual of each pixel in the segment to be encoded according to the reference data and data in the segment to be encoded;

Determining the complexity of the segment to be encoded according to the residual of each pixel in the segment to be encoded.
The method according to claim 8 or 9, wherein the determining the quantization parameter of the fragment to be encoded according to the complexity of the fragment to be encoded comprises:

Determining, according to the complexity of each segment in the rectangular area to which the fragment to be encoded belongs, the complexity of the rectangular area to which the fragment to be encoded belongs;

The quantization parameter of the segment to be encoded is determined by comparing the complexity of the segment to be encoded and the complexity of the rectangular region to which the segment to be encoded belongs.
The method according to any one of claims 1 to 10, wherein the determining the reference data of the fragment to be encoded from the left side data and the upper side data of the fragment to be encoded comprises:

If the to-be-coded segment has available left-side data and available upper-side data, the reference data of the segment to be encoded is determined from available left-side data of the segment to be encoded and available upper-side data.
The method of claim 11 wherein said method further comprises at least one of the following:

If the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded is adjacent to a left boundary of the image, determining a predicted value of the first N pixels in the segment to be encoded is determined as a pre- Setting a value, and performing encoding processing on the remaining (TN) pixel points in the to-be-coded segment according to data of the first N pixel points, where T is a pixel point included in the to-be-coded segment Quantity, 1 ≤ N ≤ T;

If the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded is spaced apart from a left boundary of the image, according to the left side data of the segment to be encoded, in the segment to be encoded Pixel points are encoded;

If the segment to be encoded is spaced apart from the upper boundary of the image and the segment to be encoded is adjacent to the left boundary of the image, according to the upper data of the segment to be encoded, in the segment to be encoded The pixel is encoded.
The method of claim 11 wherein said method further comprises at least one of the following:

If the to-be-coded segment is adjacent to an upper boundary of a rectangular region to which the fragment to be encoded belongs, and the to-be-coded segment is adjacent to a left boundary of a rectangular region to which the fragment to be encoded belongs, the to-be-written The predicted values of the first N pixels in the code segment are determined as preset values, and the remaining (TN) pixels in the to-be-coded segment are encoded according to the data of the first N pixels. Where T is the number of pixel points included in the segment to be encoded, 1≤N≤T;

If the to-be-coded segment is adjacent to an upper boundary of a rectangular region to which the fragment to be encoded belongs, and the to-be-coded segment is spaced apart from a left boundary of the rectangular region to which the fragment to be encoded belongs, according to the left side of the to-be-coded segment Data, encoding a pixel in the segment to be encoded;

If the segment to be encoded is spaced apart from the upper boundary of the rectangular region to which the segment to be encoded belongs, and the segment to be encoded is adjacent to the left boundary of the rectangular region to which the segment to be encoded belongs, according to the upper side of the segment to be encoded Data, encoding the pixel points in the segment to be encoded.
The method of claim 11 wherein said image comprises at least one sub-image, each sub-image comprising at least one rectangular region;

The method also includes one of the following:

If the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the slice to be encoded belongs and the to-be-coded segment is adjacent to a left boundary of the sub-image to which the segment to be encoded belongs, the former in the segment to be encoded The predicted value of the N pixel points is determined as a preset value, and the remaining (TN) pixel points in the to-be-coded segment are encoded according to the data of the first N pixel points, where T is Describe the number of pixel points included in the encoded segment, 1≤N≤T;

If the segment to be encoded is adjacent to an upper boundary of the sub-image to which the segment to be encoded belongs, and the segment to be encoded is spaced apart from the left boundary of the sub-image to which the segment to be encoded belongs, according to the left side of the segment to be encoded Data, encoding a pixel in the segment to be encoded;

If the segment to be encoded is spaced apart from the upper boundary of the sub-image to which the segment to be encoded belongs and the segment to be encoded is adjacent to the left boundary of the sub-image to which the segment to be encoded belongs, according to the upper side of the segment to be encoded Data, encoding a pixel in the segment to be encoded;

And if the to-be-coded segment is adjacent to a left boundary of the sub-image to which the segment to be encoded belongs and the segment to be encoded is spaced apart from an upper boundary of the image, according to the upper data of the segment to be encoded, Pixel points in the segment to be encoded are encoded;

And if the to-be-coded segment is adjacent to an upper boundary of a sub-image to which the to-be-coded segment belongs and the to-be-coded segment is spaced apart from a left boundary of the image, according to the left side data of the to-be-coded segment, The pixel points in the segment to be encoded are subjected to encoding processing.
The method according to any one of claims 1 to 14, wherein each M adjacent pixel points in the segment to be encoded corresponds to the same reference pixel point, wherein the waiting The reference data of the encoded segment includes data of the reference pixel, M≥1.
The method according to any one of claims 1 to 15, wherein the method further comprises:

If the number of coded bits B i currently used by the rectangular area to which the slice to be encoded belongs is less than or equal to the number of coded bits B allowed for the rectangular area to which the slice to be encoded belongs, and the current pixel to be coded in the to-be-coded slice The sum of the number of coded bits b i+1 and B i to be used is greater than B, and an end code is added to the coded bit stream of the fragment to be encoded, the end code is used to identify the coding of the rectangular area to which the fragment to be encoded belongs Ending and the rectangular area to which the fragment to be encoded belongs has at least one uncoded pixel point.
A decoding method, comprising:

Acquiring a first identifier in the encoded bitstream of the image corresponding to the segment to be decoded, wherein the image comprises at least one rectangular region, each rectangular region comprising at least one segment, each segment comprising at least one pixel, wherein the length The number of coded bits corresponding to the same rectangular area is less than or equal to a preset number of coded bits, and the coded bit stream of the image includes a first identifier corresponding to each of the at least one segment included in the image, each The first identifier corresponding to the segment is used to identify the location of the reference data of each segment;

Determining, according to the first identifier corresponding to the to-be-coded segment, the reference data of the to-be-decoded segment is the upper-side data or the left-side data of the to-be-decoded segment, where the left-side data of the to-be-decoded segment is included Data of at least one first pixel on the left side of the segment to be decoded, and data on the upper side of the data to be decoded includes data of at least one second pixel located above the segment to be decoded;

Decoding the to-be-decoded segment according to the reference data of the to-be-decoded segment.
The method of claim 17 wherein at least one of the following is satisfied:

The at least one first pixel is adjacent to the segment to be decoded or adjacent to the segment to be decoded but spaced apart;

The data of the at least one first pixel includes the original data of the at least one first pixel or the decoded data of the at least one first pixel;

The at least one second pixel is adjacent to the segment to be decoded or adjacent to the segment to be decoded but spaced apart;

The data of the at least one second pixel includes the original of the at least one second pixel Data or decoded data of the at least one second pixel.
The method according to claim 17 or 18, wherein the decoding the segment to be decoded according to the reference data comprises:

Performing an entropy decoding process on the to-be-decoded segment to obtain a quantization parameter of the to-be-decoded segment;

And performing inverse quantization processing on the to-be-decoded segment according to the quantization parameter of the to-be-decoded segment, to obtain residual data of the to-be-decoded segment;

And performing, according to the reference data, performing residual prediction processing on the residual data of the to-be-decoded segment to obtain a decoding result of the to-be-decoded segment.
The method according to any one of claims 17 to 19, wherein the method further comprises at least one of the following:

If the segment to be decoded is adjacent to an upper boundary of the image and the segment to be decoded is adjacent to a left boundary of the image, determining a residual value of the first N pixels in the segment to be decoded is determined as Determining a numerical value, and performing decoding processing on the remaining (TN) pixel points in the to-be-decoded segment according to data of the first N pixel points, where T is a pixel point included in the to-be-decoded segment The number, 1 ≤ N ≤ T;

If the segment to be decoded is adjacent to an upper boundary of the image and the segment to be decoded is spaced apart from a left boundary of the image, according to the left side data of the segment to be decoded, in the segment to be decoded The pixel is subjected to decoding processing;

And if the to-be-decoded segment is spaced apart from an upper boundary of the image and the to-be-decoded segment is adjacent to a left boundary of the image, according to an upper side data of the to-be-decoded segment, in the to-be-decoded segment The pixel is subjected to decoding processing.
The method according to any one of claims 17 to 19, wherein the method further comprises at least one of the following:

If the to-be-decoded segment is adjacent to an upper boundary of a rectangular region to which the segment to be decoded belongs and the to-be-decoded segment is adjacent to a left boundary of the rectangular region to which the segment to be decoded belongs, the former in the segment to be decoded The residual value of the N pixel points is determined as a preset value, and the remaining (TN) pixel points in the to-be-decoded segment are decoded according to the data of the first N pixel points, where T is The number of pixel points included in the segment to be decoded, 1≤N≤T;

If the to-be-decoded segment is adjacent to an upper boundary of a rectangular region to which the segment to be decoded belongs, and the segment to be decoded is spaced apart from a left boundary of the rectangular region to which the segment to be decoded belongs, according to the left side of the segment to be decoded Data, performing decoding processing on the pixels in the segment to be decoded;

If the segment to be decoded is spaced apart from the upper boundary of the rectangular region to which the segment to be decoded belongs, and the segment to be decoded is adjacent to the left boundary of the rectangular region to which the segment to be decoded belongs, according to the upper side of the segment to be decoded Data, performing decoding processing on the pixels in the segment to be decoded.
The method according to any one of claims 17 to 19, wherein the image comprises at least one sub-image, each sub-image comprising at least one rectangular area;

The method also includes one of the following:

If the to-be-decoded segment is adjacent to an upper boundary of the sub-image to which the segment to be decoded belongs and the to-be-decoded segment is adjacent to a left boundary of the sub-image to which the segment to be decoded belongs, the former in the segment to be decoded The residual value of the N pixel points is determined as a preset value, and the remaining (TN) pixel points in the to-be-decoded segment are decoded according to the data of the first N pixel points, where T is The number of pixel points included in the segment to be decoded, 1≤N≤T;

If the to-be-decoded segment is adjacent to an upper boundary of the sub-image to which the segment to be decoded belongs, and the to-be-decoded segment is spaced apart from a left boundary of the sub-image to which the segment to be decoded belongs, according to the left side of the segment to be decoded Data, performing decoding processing on the pixels in the segment to be decoded;

If the segment to be decoded is spaced apart from the upper boundary of the sub-image to which the segment to be decoded belongs and the segment to be decoded is adjacent to the left boundary of the sub-image to which the segment to be decoded belongs, according to the upper side of the segment to be decoded Data, performing decoding processing on the pixels in the segment to be decoded;

If the to-be-decoded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the segment to be decoded belongs, and the segment to be decoded is spaced apart from an upper boundary of the image, according to the upper side data of the segment to be decoded, Decoding processing on pixel points in the to-be-decoded segment;

If the to-be-decoded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the segment to be decoded belongs, and the segment to be decoded is spaced apart from the left boundary of the image, according to the left-side data of the segment to be decoded, Decoding processing is performed on the pixel points in the segment to be decoded.
The method according to any one of claims 17 to 22, wherein each M adjacent pixel points in the to-be-decoded segment corresponds to the same reference pixel point, wherein the reference to the decoded segment The data includes data of the reference pixel, M ≥ 1.
An encoding device, comprising:

a pre-analysis module, configured to determine, according to data in a segment to be encoded of the image, reference data of the segment to be encoded from the left side data and the upper side data of the to-be-coded segment;

An encoding module, configured to perform encoding processing on the to-be-coded segment according to the reference data determined by the pre-analysis module, to obtain an encoded bitstream of the to-be-coded segment;

The image includes at least one rectangular area, each rectangular area includes at least one segment, each segment includes at least one pixel, and the number of encoded bits corresponding to the rectangular area of the same length is less than or equal to a preset number of bits,

The data on the left side of the fragment to be encoded includes data of at least one first pixel located on the left side of the fragment to be encoded, and the upper side data of the data to be encoded includes at least one second located above the fragment to be encoded. Pixel data.
The apparatus of claim 24 wherein at least one of the following is true:

The at least one first pixel is adjacent to the segment to be encoded or adjacent to the segment to be encoded but spaced apart;

The data of the at least one first pixel includes the original data of the at least one first pixel or the encoded data of the at least one first pixel;

The at least one second pixel is adjacent to the fragment to be encoded or adjacent to the fragment to be encoded but spaced apart;

The data of the at least one second pixel includes raw data of the at least one second pixel or encoded data of the at least one second pixel.
The device according to claim 24 or 25, wherein the pre-analysis module is specifically configured to:

Determining, according to the data in the to-be-coded segment and the data of the at least one first pixel, a correlation between the segment to be encoded and the left-side data of the segment to be encoded;

Determining, according to the data in the to-be-coded segment and the data of the at least one second pixel, a correlation between the to-be-coded segment and the upper-side data of the segment to be encoded;

And according to the correlation between the to-be-coded segment and the left-side data of the to-be-coded segment, and the correlation between the to-be-coded segment and the upper-side data of the to-be-coded segment, from the segment to be encoded In the left side data and the upper side data, reference data of the fragment to be encoded is determined.
The device according to claim 26, wherein the pre-analysis module is specifically configured to:

And determining, by the left side data of the to-be-coded segment and the data of the upper side data that is highly correlated with the to-be-coded segment, as the reference data of the to-be-coded segment.
The apparatus according to any one of claims 24 to 27, wherein the encoding module is further configured to:

Adding a first identifier to the encoded bitstream of the fragment to be encoded, the first identifier being used to indicate a location of reference data of the fragment to be encoded.
The apparatus according to any one of claims 24 to 28, wherein the encoding module comprises:

a prediction unit, configured to perform prediction processing on the to-be-coded segment according to the reference data, to obtain a prediction residual of the to-be-coded segment;

And a quantization unit, configured to perform quantization processing on the prediction residual of the to-be-coded segment obtained by the prediction unit by using a quantization parameter of the to-be-coded segment, to obtain a quantization result of the to-be-coded segment;

And an entropy coding unit, configured to perform entropy coding processing on the quantization result of the to-be-encoded segment obtained by the quantization unit, to obtain an encoding result of the to-be-encoded segment.
The apparatus according to claim 29, wherein the encoding module further comprises:

a rate control unit, configured to determine, according to the reference data determined by the pre-analysis module, before the quantization unit uses the quantization parameter of the to-be-encoded segment to perform quantization processing on the prediction result of the to-be-coded segment Determining the quantization parameter of the encoded segment;

The quantization unit is specifically configured to perform quantization processing on the prediction result of the to-be-coded segment by using the quantization parameter determined by the rate control unit.
The device according to claim 30, wherein the rate control unit is specifically configured to:

Determining, according to the reference data determined by the pre-analysis module and the data in the to-be-coded segment, the complexity of the segment to be encoded;

Determining a quantization parameter of the segment to be encoded according to the complexity of the segment to be encoded.
The device according to claim 31, wherein the rate control unit is specifically configured to:

Determining a residual of each pixel in the segment to be encoded according to the reference data and data in the segment to be encoded;

Determining the complexity of the segment to be encoded according to the residual of each pixel in the segment to be encoded.
The device according to claim 31 or 32, wherein the rate control unit is specifically configured to:

Determining the waiting according to the complexity of each segment in the rectangular area to which the fragment to be encoded belongs The complexity of the rectangular region to which the encoded segment belongs;

The quantization parameter of the segment to be encoded is determined by comparing the complexity of the segment to be encoded and the complexity of the rectangular region to which the segment to be encoded belongs.
The apparatus according to any one of claims 24 to 33, wherein the pre-analysis module is specifically configured to:

If the to-be-coded segment has available left-side data and available upper-side data, the reference data of the segment to be encoded is determined from available left-side data of the segment to be encoded and available upper-side data.
The apparatus of claim 34 wherein at least one of the following satisfies:

If the segment to be encoded is adjacent to an upper boundary of the image and the segment to be encoded is adjacent to a left boundary of the image, the encoding module is further configured to use the first N pixels in the segment to be encoded The predicted value of the point is determined as a preset value, and the remaining (TN) pixel points in the to-be-coded segment are encoded according to the data of the first N pixel points, where T is the to-be-coded The number of pixels included in the segment, 1 ≤ N ≤ T;

And if the to-be-coded segment is adjacent to an upper boundary of the image, and the to-be-coded segment is spaced apart from a left boundary of the image, the coding module is further configured to: according to the left-side data of the to-be-coded segment, Pixel points in the to-be-coded segment are subjected to encoding processing;

And if the to-be-coded segment is spaced apart from an upper boundary of the image and the to-be-coded segment is adjacent to a left boundary of the image, the coding module is further configured to: according to the upper side data of the to-be-coded segment, The pixel points in the segment to be encoded are subjected to an encoding process.
The apparatus of claim 34 wherein at least one of the following satisfies:

If the to-be-coded segment is adjacent to an upper boundary of a rectangular region to which the fragment to be encoded belongs, and the to-be-coded segment is adjacent to a left boundary of the rectangular region to which the fragment to be encoded belongs, the coding module is further used to Determining a predicted value of the first N pixel points in the encoded segment as a preset value, and according to the data of the first N pixel points, the encoding module is further configured to use the remaining one of the to-be-coded segments ( TN) pixel processing is performed, where T is the number of pixel points included in the segment to be encoded, 1≤N≤T;

If the to-be-coded segment is adjacent to an upper boundary of a rectangular region to which the fragment to be encoded belongs, and the to-be-coded segment is spaced apart from a left boundary of the rectangular region to which the fragment to be encoded belongs, the The code module is further configured to perform coding processing on the pixel points in the to-be-coded segment according to the left side data of the to-be-coded segment;

If the segment to be encoded is spaced apart from the upper boundary of the rectangular region to which the segment to be encoded belongs, and the segment to be encoded is adjacent to the left boundary of the rectangular region to which the segment to be encoded belongs, the encoding module is further configured to The upper side data of the encoded fragment is described, and the pixel points in the to-be-coded fragment are encoded.
The apparatus according to claim 34, wherein said image comprises at least one sub-image, each sub-image comprising at least one rectangular area;

One of the following is satisfied:

And if the to-be-coded segment is adjacent to an upper boundary of a sub-image to which the to-be-coded segment belongs and the to-be-coded segment is adjacent to a left boundary of the sub-image to which the to-be-coded segment belongs, the coding module is further configured to: Determining the predicted values of the first N pixels in the encoded segment as a preset value, and encoding the remaining (TN) pixels in the to-be-coded segment according to the data of the first N pixels Processing, wherein T is the number of pixel points included in the segment to be encoded, 1≤N≤T;

If the to-be-coded segment is adjacent to an upper boundary of the sub-image to which the fragment to be encoded belongs, and the to-be-coded segment is spaced apart from the left boundary of the sub-image to which the fragment to be encoded belongs, the encoding module is further configured to Decoding the left side data of the encoded segment, and performing encoding processing on the pixel points in the to-be-coded segment;

If the segment to be encoded is spaced apart from the upper boundary of the sub-image to which the segment to be encoded belongs and the segment to be encoded is adjacent to the left boundary of the sub-image to which the segment to be encoded belongs, the encoding module is further configured to Determining the upper side data of the encoded segment, and performing encoding processing on the pixel points in the to-be-coded segment;

And if the to-be-coded segment is adjacent to a left boundary of the sub-image to which the to-be-coded segment belongs, and the to-be-coded segment is spaced apart from an upper boundary of the image, the coding module is further configured to be used according to the to-be-coded segment. Upper side data, performing coding processing on the pixel points in the to-be-coded segment;

And if the to-be-coded segment is adjacent to an upper boundary of a sub-image to which the to-be-coded segment belongs and the to-be-coded segment is spaced apart from a left boundary of the image, the coding module is further configured to: according to the to-be-coded segment The data on the left side performs encoding processing on the pixel points in the segment to be encoded.
The apparatus according to any one of claims 24 to 37, wherein each of the M adjacent pixel points in the segment to be encoded corresponds to the same reference pixel point, wherein the waiting The reference data of the encoded segment includes data of the reference pixel, M≥1.
The device according to any one of claims 24 to 38, wherein the device further comprises:

a boundary processing module, configured to: if the number of coded bits B i currently used by the rectangular area to which the fragment to be encoded belongs is less than or equal to the number of coded bits B allowed for the rectangular area to which the fragment to be encoded belongs, and in the fragment to be encoded The sum of the number of coded bits b i+1 and B i to be used by the current pixel to be coded is greater than B, and an end code is added to the coded bit stream of the segment to be encoded, the end code is used to identify the to-be-coded The encoding of the rectangular region to which the segment belongs ends and the rectangular region to which the segment to be encoded belongs has at least one uncoded pixel.
A decoding device, comprising:

And an obtaining module, configured to acquire a first identifier corresponding to the to-be-decoded segment in the encoded bitstream of the image, where the image includes at least one rectangular region, each rectangular region includes at least one segment, and each segment includes at least one pixel a point, wherein the number of coded bits corresponding to the rectangular area having the same length is less than or equal to a preset number of bits, and the coded bit stream of the image includes a first identifier corresponding to each of the at least one segment included in the image a first identifier corresponding to each segment for identifying a location of the reference data of each segment;

a determining module, configured to determine, according to the first identifier corresponding to the to-be-coded segment that is obtained by the acquiring module, that the reference data of the to-be-decoded segment is the upper-side data or the left-side data of the to-be-decoded segment, where The left side data of the to-be-decoded segment includes data of at least one first pixel point located to the left of the fragment to be decoded, and the upper side data of the to-be-decoded data includes at least one second located above the to-be-decoded segment. Pixel point data;

And a decoding module, configured to perform decoding processing on the to-be-decoded segment according to the reference data of the to-be-decoded segment determined by the determining module.
The apparatus according to claim 40, wherein at least one of the following satisfies:

The at least one first pixel is adjacent to the segment to be decoded or adjacent to the segment to be decoded but spaced apart;

The data of the at least one first pixel includes the original data of the at least one first pixel or the decoded data of the at least one first pixel;

The at least one second pixel is adjacent to the segment to be decoded or adjacent to the segment to be decoded but spaced apart;

The data of the at least one second pixel includes raw data of the at least one second pixel or decoded data of the at least one second pixel.
The apparatus according to claim 40 or 41, wherein the decoding module comprises:

An entropy decoding unit, configured to perform entropy decoding processing on the to-be-decoded segment, to obtain a quantization parameter of the to-be-decoded segment;

An inverse quantization unit, configured to perform inverse quantization processing on the to-be-decoded segment according to the quantization parameter of the to-be-decoded segment obtained by the entropy decoding unit, to obtain residual data of the to-be-decoded segment;

The anti-prediction unit is configured to perform inverse prediction processing on the residual data of the to-be-decoded segment obtained by the inverse quantization unit according to the reference data determined by the determining module, to obtain a decoding result of the to-be-decoded segment.
A device according to any one of claims 40 to 42, wherein at least one of the following satisfies:

And if the to-be-decoded segment is adjacent to an upper boundary of the image and the to-be-decoded segment is adjacent to a left boundary of the image, the decoding module is further configured to use the first N pixels in the to-be-decoded segment The residual value of the point is determined as a preset value, and according to the data of the first N pixel points, the remaining (TN) pixel points in the to-be-decoded segment are subjected to decoding processing, where T is the to-be-decoded The number of pixels included in the decoded segment, 1 ≤ N ≤ T;

And if the to-be-decoded segment is adjacent to an upper boundary of the image, and the to-be-decoded segment is spaced apart from a left boundary of the image, the decoding module is further configured to: according to the left-side data of the to-be-decoded segment, Decoding a pixel in the segment to be decoded;

And if the to-be-decoded segment is spaced apart from an upper boundary of the image and the to-be-decoded segment is adjacent to a left boundary of the image, the decoding module is further configured to: according to the upper side data of the to-be-decoded segment, The pixel points in the segment to be decoded are subjected to decoding processing.
A device according to any one of claims 40 to 42, wherein at least one of the following satisfies:

And if the to-be-decoded segment is adjacent to an upper boundary of a rectangular area to which the to-be-decoded segment belongs and the to-be-decoded segment is adjacent to a left boundary of a rectangular area to which the to-be-decoded segment belongs, the decoding module is further configured to: Determining a residual value of the first N pixel points in the decoded segment as a preset value, and performing, on the basis of the data of the first N pixel points, the remaining (TN) pixel points in the to-be-decoded segment Decoding processing, where T is the number of pixel points included in the segment to be decoded, 1≤N≤T;

And if the to-be-decoded segment is adjacent to an upper boundary of a rectangular region to which the fragment to be decoded belongs, and the to-be-decoded segment is spaced apart from a left boundary of the rectangular region to which the segment to be decoded belongs, the decoding module is further configured to Decoding the left side data of the decoded segment, and performing decoding processing on the pixel points in the to-be-decoded segment;

And if the to-be-decoded segment is spaced apart from an upper boundary of a rectangular region to which the segment to be decoded belongs, and the to-be-decoded segment is adjacent to a left boundary of the rectangular region to which the segment to be decoded belongs, the decoding module is further configured to perform The upper side data of the decoded segment is referred to, and the pixel points in the to-be-decoded segment are subjected to decoding processing.
The apparatus according to any one of claims 40 to 42, wherein the image comprises at least one sub-image, each sub-image comprising at least one rectangular area;

One of the following is satisfied:

And if the to-be-decoded segment is adjacent to an upper boundary of a sub-image to which the to-be-decoded segment belongs and the to-be-decoded segment is adjacent to a left boundary of the sub-image to which the to-be-decoded segment belongs, the decoding module is further configured to: Determining a residual value of the first N pixel points in the decoded segment as a preset value, and performing, on the basis of the data of the first N pixel points, the remaining (TN) pixel points in the to-be-decoded segment Decoding processing, where T is the number of pixel points included in the segment to be decoded, 1 ≤ N ≤ T;

And if the to-be-decoded segment is adjacent to an upper boundary of the sub-image to which the segment to be decoded belongs, and the to-be-decoded segment is spaced apart from a left boundary of the sub-image to which the segment to be decoded belongs, the decoding module is further configured to Decoding the left side data of the decoded segment, and performing decoding processing on the pixel points in the to-be-decoded segment;

And if the to-be-decoded segment is spaced apart from an upper boundary of the sub-image to which the segment to be decoded belongs, and the to-be-decoded segment is adjacent to a left boundary of the sub-image to which the segment to be decoded belongs, the decoding module is further configured to perform Determining the upper side data of the decoded segment, and performing decoding processing on the pixel points in the to-be-decoded segment;

And if the to-be-decoded segment is adjacent to an upper boundary and a left boundary of the sub-image to which the to-be-decoded segment belongs, and the to-be-decoded segment is spaced apart from an upper boundary of the image, the decoding module is further configured to: Decoding the upper side data of the segment, and performing decoding processing on the pixel points in the to-be-decoded segment;

If the segment to be decoded and the upper boundary and the left boundary of the sub-image to which the segment to be decoded belongs The neighboring and the to-be-decoded segments are spaced apart from the left boundary of the image, and the decoding module is further configured to perform decoding processing on the pixel points in the to-be-decoded segment according to the left-side data of the to-be-decoded segment.
The apparatus according to any one of claims 40 to 45, wherein each M adjacent pixel points in the to-be-decoded segment correspond to the same reference pixel point, wherein the reference of the fragment to be decoded The data includes data of the reference pixel, M ≥ 1.