WO2021008524A1 - Procédé et dispositif de codage d'images, procédé et dispositif de décodage d'images et support d'informations - Google Patents

Procédé et dispositif de codage d'images, procédé et dispositif de décodage d'images et support d'informations Download PDF

Info

Publication number
WO2021008524A1
WO2021008524A1 PCT/CN2020/101886 CN2020101886W WO2021008524A1 WO 2021008524 A1 WO2021008524 A1 WO 2021008524A1 CN 2020101886 W CN2020101886 W CN 2020101886W WO 2021008524 A1 WO2021008524 A1 WO 2021008524A1
Authority
WO
WIPO (PCT)
Prior art keywords
image
grid
bits
bit
pixel value
Prior art date
Application number
PCT/CN2020/101886
Other languages
English (en)
Chinese (zh)
Inventor
林永兵
马莎
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2021008524A1 publication Critical patent/WO2021008524A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock

Definitions

  • This application relates to the technical field of image coding and decoding, and more specifically, to an image coding method, decoding method, device, and storage medium.
  • the laser detection and ranging system is a radar system that uses a laser as a radiation source, and can be referred to as LiDAR for short.
  • Lidar is a product of the combination of laser technology and radar technology. Lidar has the characteristics of high detection accuracy, large measurement range, non-contact, 3D and 360-degree measurement. Lidar is often used for high-precision map construction, high-precision positioning, target detection, 3D scene rendering, etc.
  • 3D point cloud data generated by lidar measurement is huge, which brings huge challenges to point cloud data storage and transmission.
  • 3D point cloud data is generally converted into 2D point cloud data as a positioning layer.
  • the bit layer still covers a large geographic area, and the amount of data is still large.
  • the bitstream obtained by image encoding in the point cloud data still consumes a lot of storage overhead.
  • This application provides an image encoding method, decoding method, device, and storage medium to reduce the storage space occupied by the code stream.
  • an image decoding method which includes: obtaining a code stream; obtaining a residual image of a grid image in an image sequence according to the code stream; performing inter-frame prediction on the grid image in the image sequence, Obtain the predicted image of the grid image in the image sequence; obtain the grid image in the image sequence according to the residual image of the grid image in the image sequence and the predicted image of the grid image in the image sequence.
  • the above-mentioned image sequence includes a plurality of grid images, and the geographical locations corresponding to the plurality of grid images are similar or the image contents of the plurality of grid images are similar.
  • that the geographic locations corresponding to the multiple grid images are similar or the image content of the multiple grid images is similar may mean that the multiple grid images satisfy the first condition.
  • inter-prediction of the grid image in the image sequence may be to first predict the grid image to obtain the residual image of the grid image, and then compare the residual image of the grid image and the grid image The image is subtracted to obtain the residual image of the grid image.
  • the grid images in the image sequence may be divided into image blocks first, and then the prediction block of each image block is determined by means of inter-frame prediction. Then determine the residual block of each image block.
  • the predicted image of the aforementioned grid image may be composed of prediction blocks of each image block in the grid image
  • the residual image of the grid image may be composed of residual blocks of each image block in the grid image.
  • the image sequence contains grid images with similar geographic locations or similar image content
  • the amount of residual image data obtained can be made smaller, so that the final The code stream corresponding to the image sequence occupies a small storage space, which is convenient for storage or transmission.
  • the foregoing first condition is that the distance between geographic locations corresponding to at least two grid images in the plurality of grid images is less than a preset distance.
  • the aforementioned preset distance may also become a distance threshold, and the size of the preset distance can be flexibly set according to actual needs.
  • the aforementioned preset distance may be set to 3m (3m).
  • the preset distance can also be set to 5m, 6m, etc. In short, any suitable size preset distance can be set as needed.
  • the foregoing first condition may also be that the distance between the geographic locations corresponding to at least two of the plurality of grid images is less than or equal to a preset distance.
  • the above-mentioned first condition is that the similarity of the image content of at least two grid images in the plurality of grid images is greater than or equal to the preset similarity.
  • the aforementioned preset similarity may also be referred to as a similarity threshold, and the size of the preset similarity can be flexibly set according to actual needs.
  • the aforementioned preset similarity may be set to 50%.
  • the preset similarity can also be set to 55%, 60%, 65%, etc. In short, any suitable size of the preset similarity can be set as needed.
  • the above-mentioned first condition may also be that the similarity of the image content of at least two of the plurality of grid images is greater than the preset similarity.
  • the image sequence contains at least two grid images with similar image content
  • the data amount of the residual image obtained subsequently can be made smaller.
  • the above-mentioned first condition is that the image content of at least two grid images in the plurality of grid images corresponds to the same geographic area.
  • the inter-frame prediction of the image sequence can make the residual image The data amount of the difference image is small.
  • the size of the aforementioned geographic area may be a preset size, and the size of the geographic area may be set according to actual needs.
  • the size of the aforementioned geographic area may be an area of 2m ⁇ 2m. It should be understood that the size of the geographic area of the 2m ⁇ 2m area here is only an example.
  • the size of the geographic area may also be set to an area of 1m ⁇ 1m, an area of 3m ⁇ 32m, etc., in short, any suitable size of geographic area can be set as needed. area.
  • the size of the aforementioned geographic area is an area of 2m ⁇ 2m.
  • the two grid images satisfy the first condition.
  • At least two of the above-mentioned multiple grid images are grid images of adjacent frames between each other.
  • At least two grid images satisfying the first condition are adjacent frames between each other.
  • grid image 1, grid image 2, and grid image 3 in the aforementioned image sequence satisfy the aforementioned first condition.
  • the grid image 1, the grid image 2 and the grid image 3 may be the i-th frame, the i+1-th frame and the i+2-th frame in the image sequence, respectively.
  • i is a positive integer.
  • the pixel value of the grid image in the above image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the above method further includes: processing the grid image in the image sequence to obtain the processed grid image.
  • the value of the i-th bit among the N bits of the pixel value of the grid image in the image sequence is equal to the value of the i-th bit among the N bits of the pixel value of the grid image in the processed image sequence
  • the position of the N bits of the pixel value of the grid image in the image sequence is the same as the position of the N bits of the pixel value of the grid image in the processed image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is the value of the grid image in the image sequence.
  • i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoder end by inverting the pixel value of the grid image can reduce the data volume of the grid image when the pixel value of the grid image contains continuous placeholders, thereby making the encoding generation
  • the code stream occupies less storage space, and the decoding end performs (inversion) processing on the decoded grid image, so as to restore the grid image processed (inversion processing) on the encoding end to obtain the final Grid image.
  • the pixel value of the grid image in the above image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the above method further includes: processing the grid image in the image sequence to obtain the processed grid image.
  • the value of the first bit of the N bits of the grid image in the processed image sequence is opposite to the value of the first bit of the N bits of the grid image in the image sequence.
  • the value of the i+1th bit among the N bits of the grid image in the image sequence is the value of the i+1th bit among the N bits of the grid image in the image sequence and the processed value The result of XORing the i-th bit among the N bits of the grid image in the image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is the value of the grid image in the image sequence.
  • the pixel value has a value of 1 and the highest number of bits, or the N bits of the pixel value of the grid image in the image sequence are located after the highest bit of the pixel value of the grid image in the image sequence and are the same as the image
  • the highest bits of the pixel values of the grid images in the sequence are adjacent.
  • the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence, and the number of bits of the i-th bit is higher than that of the i+th bit
  • the number of bits of 1 bit, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs exclusive OR processing on the pixel values of the grid image, so that when the pixel values of the grid image contain continuous placeholders, the data volume of the grid image can be reduced, thereby making the code generated
  • the code stream occupies less storage space
  • the decoder performs (exclusive OR) processing on the decoded grid image, so as to restore the grid image processed (exclusive or processed) on the encoder side to obtain the final Grid image.
  • the pixel value of the above residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the residual image of the grid image in the sequence and the predicted image of the grid image in the image sequence to obtain the grid image in the image sequence specifically includes: processing the residual image to obtain the processed residual image; After the processed residual image and the predicted image of the grid image in the image sequence, the grid image in the image sequence is obtained.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is opposite to the value of the i-th bit among the N bits of the pixel value of the residual image after processing.
  • the N bits of the pixel value of the image are at the same positions as the N bits of the pixel value of the processed residual image.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • Bit position, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end by inverting the pixel value of the residual image can reduce the amount of data of the residual image when the pixel value of the residual image contains continuous placeholders, thereby making the code generated
  • the code stream occupies less storage space, and the decoder can restore the residual image processed (inverted) by the encoding end by (inverting) the decoded residual image, and then according to the processing After the residual image gets the final image block.
  • the pixel value of the above residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the residual image of the grid image in the sequence and the predicted image of the grid image in the image sequence to obtain the grid image in the image sequence includes: processing the residual image to obtain the processed residual image; After the residual image and the predicted image of the grid image in the image sequence, the grid image in the image sequence is obtained.
  • the value of the first bit of the N bits of the residual image after the above processing is opposite to the value of the first bit of the N bits of the residual image, and the N bits of the processed residual image
  • the value of the i+1th bit in the bits is that the value of the i+1th bit in the N bits of the residual image is different from the i-th bit in the N bits of the processed residual image. Or the result of processing.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • the bit position, or, the N bits of the pixel value of the residual image are located after the highest bit of the pixel value of the residual image and adjacent to the highest bit of the pixel value of the residual image.
  • the N bits of the pixel value of the residual image are at the same position as the N bits of the pixel value of the processed residual image.
  • the number of bits of the i-th bit is higher than that of the i+1th bit, i And N are both positive integers, i ⁇ N, N ⁇ M;
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data volume of the residual image can be reduced, so that the encoded
  • the code stream occupies less storage space
  • the decoding end performs (exclusive OR) processing on the decoded residual image, so as to restore the residual image processed (exclusive or processed) by the encoding end, and then according to the processing After the residual image gets the final image block.
  • the above-mentioned obtaining the residual image of the grid image in the image sequence according to the code stream includes: performing inverse transformation, inverse quantization and entropy decoding processing on the code stream, Get the residual image.
  • the above-mentioned decoding processing corresponds to the lossy encoding of the image, which can make the code stream obtained by encoding occupy as little storage space as possible.
  • the foregoing obtaining the residual image of the grid image in the image sequence according to the code stream includes: performing entropy decoding processing on the code stream to obtain the residual image.
  • the foregoing decoding method that only performs entropy decoding processing corresponds to lossless encoding.
  • This encoding method can avoid image distortion as much as possible and ensure the final display effect of the image.
  • the above code stream is obtained by encoding the positioning layer.
  • the pixel value of the positioning layer includes rasterized elevation data.
  • the pixel value of the above positioning layer contains M bits, and each bit represents the occupied position of each grid. Since the pixel value of the positioning layer contains the rasterized elevation data, and the character "11" in the high position of the elevation data has a higher probability, the pixel value of the positioning layer containing the elevation data can be processed. Reduce the data volume of the pixel value of the positioning layer, thereby reducing the storage space occupied by the finally obtained code stream.
  • the value of M above is any one of 8, 10, and 12.
  • an image encoding method which includes: acquiring an image sequence; performing inter-frame prediction on grid images in the image sequence to obtain a residual image; and encoding the residual image to obtain an encoded bitstream.
  • the above-mentioned image sequence includes a plurality of grid images, and the geographical locations corresponding to the plurality of grid images are similar or the image contents of the plurality of grid images are similar.
  • that the geographic locations corresponding to the multiple grid images are similar or the image content of the multiple grid images is similar may mean that the multiple grid images satisfy the first condition.
  • inter-prediction of the grid image in the image sequence may be to first predict the grid image to obtain the residual image of the grid image, and then compare the residual image of the grid image and the grid image The image is subtracted to obtain the residual image of the grid image.
  • the predicted image of the grid image may be composed of prediction blocks of each image block in the grid image
  • the residual image of the grid image may be composed of residual blocks of each image block in the grid image.
  • the residual image can be divided into image blocks, and then the prediction block of each image block is obtained, and the residual block of each image block is obtained according to each image block and the residual block of each image block. Difference block, and then obtain the residual image of the grid image.
  • the image sequence contains grid images with similar geographic locations or similar image content
  • the amount of residual image data obtained can be made smaller, so that the final The code stream obtained by encoding the image sequence occupies a small storage space, which is convenient for storage or transmission.
  • the foregoing first condition is that the distance between the geographic locations corresponding to at least two of the plurality of grid images is less than a preset distance.
  • the aforementioned preset distance may also become a distance threshold, and the size of the preset distance can be flexibly set according to actual needs.
  • the aforementioned preset distance may be set to 3m (3m).
  • the preset distance can also be set to 5m, 6m, etc. In short, any suitable size preset distance can be set as needed.
  • the foregoing first condition may also be that the distance between the geographic locations corresponding to at least two of the plurality of grid images is less than or equal to a preset distance.
  • the above-mentioned first condition is that the similarity of the image content of at least two grid images in the plurality of grid images is greater than or equal to a preset similarity.
  • the image sequence contains at least two grid images with similar image content
  • the data amount of the residual image obtained subsequently can be made smaller.
  • the aforementioned preset similarity may also be referred to as a similarity threshold, and the size of the preset similarity can be flexibly set according to actual needs.
  • the aforementioned preset similarity may be set to 50%.
  • the similarity of the image content of the two grid images is greater than or equal to 50%, the two grid images satisfy the first condition.
  • the 50% here is just an example, the preset similarity can also be set to 55%, 60%, 65%, etc. In short, any suitable size of the preset similarity can be set as needed.
  • the above-mentioned first condition may also be that the similarity of the image content of at least two of the plurality of grid images is greater than the preset similarity.
  • the image sequence contains at least two grid images with similar image content
  • the data amount of the residual image obtained subsequently can be made smaller.
  • the above-mentioned first condition is that the image content of at least two grid images in the image sequence corresponds to the same geographic area.
  • the inter-frame prediction of the image sequence can make the residual image The data amount of the difference image is small.
  • the size of the aforementioned geographic area may be a preset size, and the size of the geographic area may be set according to actual needs.
  • the size of the aforementioned geographic area may be an area of 2m ⁇ 2m. It should be understood that the size of the geographic area of the 2m ⁇ 2m area here is only an example.
  • the size of the geographic area may also be set to an area of 1m ⁇ 1m, an area of 3m ⁇ 32m, etc., in short, any suitable size of geographic area can be set as needed. area.
  • the size of the aforementioned geographic area is an area of 2m ⁇ 2m.
  • the two grid images satisfy the first condition.
  • At least two grid images in the plurality of grid images are grid images of adjacent frames with each other.
  • the at least two grid images satisfying the first condition may be adjacent frames to each other.
  • grid image 1, grid image 2, and grid image 3 in the aforementioned image sequence satisfy the aforementioned first condition.
  • the grid image 1, the grid image 2 and the grid image 3 may be the i-th frame, the i+1-th frame and the i+2-th frame in the image sequence, respectively.
  • i is a positive integer.
  • the pixel value of the grid image in the image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1,
  • the above method further includes: processing the grid images in the image sequence to obtain a processed grid image; performing inter-frame on the grid images in the image sequence Prediction includes: performing inter-frame prediction on the processed grid image to obtain a residual image.
  • the value of the i-th bit among the N bits of the pixel value of the grid image in the image sequence is equal to the value of the i-th bit among the N bits of the pixel value of the grid image in the processed image sequence
  • the position of the N bits of the pixel value of the grid image in the image sequence is the same as the position of the N bits of the pixel value of the grid image in the processed image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is the value of the grid image in the image sequence.
  • i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end uses the inverse processing of the pixel values of the grid image to reduce the data volume of the grid image when the pixel value of the grid image contains continuous placeholders, thereby making the code generated
  • the code stream takes up less storage space.
  • the pixel value of the grid image in the image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1,
  • the above method further includes: processing the grid images in the image sequence to obtain a processed grid image; performing inter-frame on the grid images in the image sequence Prediction includes: performing inter-frame prediction on the processed grid image to obtain a residual image.
  • the value of the first bit of the N bits of the grid image in the processed image sequence is opposite to the value of the first bit of the N bits of the grid image in the image sequence.
  • the value of the i+1th bit among the N bits of the grid image in the image sequence is the value of the i+1th bit among the N bits of the grid image in the image sequence and the processed value The result of XORing the i-th bit among the N bits of the grid image in the image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is the value of the grid image in the image sequence.
  • the pixel value has a value of 1 and the highest number of bits, or the N bits of the pixel value of the grid image in the image sequence are located after the highest bit of the pixel value of the grid image in the image sequence and are the same as the image
  • the highest bits of the pixel values of the grid images in the sequence are adjacent.
  • the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence, and the number of bits of the i-th bit is higher than that of the i+th bit
  • the number of bits of 1 bit, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs exclusive OR processing on the pixel values of the grid image, so that when the pixel values of the grid image contain continuous placeholders, the data volume of the grid image can be reduced, thereby making the code generated
  • the code stream takes up less storage space.
  • the pixel value of the residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1, characterized in that:
  • the foregoing encoding the residual image to obtain an encoded bitstream includes: processing the residual image to obtain a processed residual image; and encoding the processed residual image to obtain an encoded bitstream.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is opposite to the value of the i-th bit among the N bits of the pixel value of the residual image after processing.
  • the residual image The N bits of the pixel value of, and the N bits of the pixel value of the processed residual image are at the same position,
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • Bit position, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data amount of the residual image can be reduced, thereby enabling the encoding
  • the generated code stream takes up less storage space.
  • the pixel value of the residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1, characterized in that:
  • the foregoing encoding the residual image to obtain an encoded bitstream includes: processing the residual image to obtain a processed residual image; and encoding the processed residual image to obtain an encoded bitstream.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is opposite to the value of the i-th bit among the N bits of the pixel value of the residual image after processing.
  • the value of the i+1th bit among the N bits of the difference image is the value of the i+1th bit among the N bits of the residual image and the value of the N bits of the processed residual image.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • the bit position, or, the N bits of the pixel value of the residual image are located after the highest bit of the pixel value of the residual image and adjacent to the highest bit of the pixel value of the residual image.
  • the N bits of the pixel value of the residual image are at the same position as the N bits of the pixel value of the processed residual image.
  • the number of bits of the i-th bit is higher than that of the i+1th bit, i And N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data amount of the residual image can be reduced, thereby enabling the encoding
  • the generated code stream takes up less storage space.
  • encoding the residual image to obtain an encoded bitstream includes: performing transformation, quantization, and entropy encoding processing on the residual image to obtain an encoded bitstream.
  • the code stream obtained by encoding can occupy as little storage space as possible.
  • encoding the residual image to obtain an encoded bitstream includes: performing entropy encoding processing on the residual image to obtain an encoded bitstream.
  • the grid pictures in the above-mentioned image sequence come from a positioning layer.
  • the pixel values of the positioning layer include rasterized elevation data.
  • the pixel value of the above positioning layer contains M bits, and each bit represents the occupied position of each grid. Since the pixel value of the positioning layer contains the rasterized elevation data, and the character "11" in the high position of the elevation data has a higher probability, the pixel value of the positioning layer containing the elevation data can be processed. Reduce the data volume of the pixel value of the positioning layer, thereby reducing the storage space occupied by the finally obtained code stream.
  • the value of M is any one of 8, 10, and 12.
  • an image decoding device which includes a module corresponding to the method of the first aspect described above, and the corresponding module can implement each step of the method of the first aspect described above.
  • an image encoding device which includes a module corresponding to the method of the second aspect described above, and the corresponding module can implement each step of the method of the second aspect described above.
  • the image decoding device in the foregoing third aspect or the image encoding device in the foregoing fourth aspect may include one or more modules, and any one of the one or more modules may be composed of a circuit, a field programmable gate array FPGA, and a special Any one of the application integrated circuit ASIC and general processor.
  • an image decoding device including a memory and a processor, and the processor calls the program code stored in the memory to execute the method of the first aspect.
  • an image encoding device including a memory and a processor, and the processor calls the program code stored in the memory to execute the method of the second aspect.
  • the aforementioned memory is a non-volatile memory.
  • the foregoing memory and the processor are coupled with each other.
  • the image decoding device described above may also be referred to as an image decoder, and the image encoding device described above may also be referred to as an image encoder.
  • embodiments of the present application provide a computer-readable storage medium that stores instructions that cause one or more processors to execute the method in the first aspect or the second aspect.
  • Any one of the above one or more processors may be composed of any one of a circuit, a field programmable gate array FPGA, a special application integrated circuit ASIC, and a general-purpose processor.
  • the embodiments of the present application provide a computer program product that, when the computer program product runs on a computer, causes the computer to execute part or all of the steps of the method in the first aspect or the second aspect.
  • FIG. 1 is a schematic block diagram of an example of a video encoding system used to implement an embodiment of the present application
  • Fig. 2 is a schematic structural block diagram of an example of a video encoder used to implement an embodiment of the present application
  • Fig. 3 is a schematic structural block diagram of an example of a video decoder used to implement an embodiment of the present application
  • FIG. 4 is a schematic structural block diagram of an example of a video decoding system used to implement an embodiment of the present application
  • FIG. 5 is a schematic structural block diagram of an example of a video decoding device used to implement an embodiment of the present application
  • FIG. 6 is a schematic block diagram of an example of an encoding device or a decoding device used to implement an embodiment of the present application
  • FIG. 7 is a schematic diagram of candidate motion information of the current coding unit in spatial and temporal domains
  • FIG. 8 is a schematic diagram of a process of an image coding method according to an embodiment of the present application.
  • FIG. 9 is a schematic diagram of a process of an image coding method according to an embodiment of the present application.
  • FIG. 10 is a schematic diagram of a process of an image coding method according to an embodiment of the present application.
  • FIG. 11 is a schematic flowchart of an image decoding method according to an embodiment of the present application.
  • FIG. 12 is a schematic flowchart of an image decoding method according to an embodiment of the present application.
  • FIG. 13 is a schematic flowchart of an image decoding method according to an embodiment of the present application.
  • FIG. 14 is a schematic flowchart of an image coding method according to an embodiment of the present application.
  • FIG. 15 is a schematic flowchart of an image coding method according to an embodiment of the present application.
  • FIG. 16 is a schematic diagram of the encoding performance corresponding to the inversion operation
  • FIG. 17 is a schematic diagram of encoding performance corresponding to an exclusive OR operation
  • FIG. 18 is a schematic flowchart of an image coding method according to an embodiment of the present application.
  • Figure 19 is a schematic diagram of an image sequence including I frames and P frames
  • FIG. 20 is a schematic diagram of converting 3D point cloud data into 2D plane data
  • FIG. 21 is a schematic block diagram of an image decoding device according to an embodiment of the present application.
  • FIG. 22 is a schematic block diagram of an image encoding device according to an embodiment of the present application.
  • FIG. 23 is a schematic block diagram of an image decoding device according to an embodiment of the present application.
  • FIG. 24 is a schematic block diagram of an image encoding device according to an embodiment of the present application.
  • the corresponding device may include one or more units such as functional units to perform the described one or more method steps (for example, one unit performs one or more Steps, or multiple units, each of which performs one or more of the multiple steps), even if such one or more units are not explicitly described or illustrated in the drawings.
  • the corresponding method may include one step to perform the functions of one or more units (for example, one step performs the functions of one or more units, or more Steps, each of which performs the function of one or more of the multiple units), even if such one or more steps are not explicitly described or illustrated in the drawings.
  • one step performs the functions of one or more units, or more Steps, each of which performs the function of one or more of the multiple units
  • the features of the exemplary embodiments and/or aspects described herein can be combined with each other.
  • the image encoding and decoding in this application are the same as the encoding and decoding of video images. Some basic processes and related content of the encoding and decoding of video images are described in detail below.
  • Video coding generally refers to processing a sequence of pictures that form a video or video sequence.
  • the terms "picture”, "frame” or “image” can be used as synonyms.
  • Video encoding used in this article means video encoding or video decoding.
  • Video encoding is performed on the source side and usually includes processing (for example, by compressing) the original video picture to reduce the amount of data required to represent the video picture, so as to store and/or transmit more efficiently.
  • Video decoding is performed on the destination side and usually involves inverse processing relative to the encoder to reconstruct the video picture.
  • the “encoding” of video pictures involved in the embodiments should be understood as involving “encoding” or “decoding” of a video sequence.
  • the combination of the encoding part and the decoding part is also called codec (encoding and decoding).
  • a video sequence includes a series of pictures, the pictures are further divided into slices, and the slices are divided into blocks.
  • Video coding is performed in units of blocks.
  • the concept of blocks is further expanded.
  • MB macroblock
  • the macroblock can be further divided into multiple prediction blocks (partitions) that can be used for predictive coding.
  • HEVC high efficiency video coding
  • basic concepts such as coding unit (CU), prediction unit (PU), and transform unit (TU) are adopted.
  • CU coding unit
  • PU prediction unit
  • TU transform unit
  • a variety of block units are divided, and a new tree-based structure is used for description.
  • the CU can be divided into smaller CUs according to the quadtree, and the smaller CUs can be further divided to form a quadtree structure.
  • the CU is a basic unit for dividing and encoding the coded image.
  • PU can correspond to prediction block and is the basic unit of prediction coding.
  • the CU is further divided into multiple PUs according to the division mode.
  • the TU can correspond to the transform block and is the basic unit for transforming the prediction residual.
  • no matter CU, PU or TU they all belong to the concept of block (or image block) in nature.
  • a CTU is split into multiple CUs by using a quadtree structure represented as a coding tree.
  • a decision is made at the CU level whether to use inter-picture (temporal) or intra-picture (spatial) prediction to encode picture regions.
  • Each CU can be further split into one, two or four PUs according to the PU split type.
  • the same prediction process is applied in a PU, and relevant information is transmitted to the decoder on the basis of the PU.
  • the CU may be divided into transform units (TU) according to other quadtree structures similar to the coding tree used for the CU.
  • quad-tree and binary tree quad-tree and binary tree (quad-tree and binary tree, QTBT) are used to divide frames to divide coding blocks.
  • the CU may have a square or rectangular shape.
  • the image block to be encoded in the currently encoded image may be referred to as the current image block.
  • a reference block is a block that provides a reference signal for the current image block, where the reference signal represents the pixel value in the image block.
  • the block in the reference image that provides the prediction signal for the current image block may be the prediction block, where the prediction signal represents the pixel value or sample value or sample signal in the prediction block. For example, after traversing multiple reference blocks, the best reference block is found. This best reference block will provide prediction for the current image block, and this block is called a prediction block.
  • the original video picture can be reconstructed, that is, the reconstructed video picture has the same quality as the original video picture (assuming no transmission loss or other data loss during storage or transmission).
  • quantization is performed to perform further compression to reduce the amount of data required to represent the video picture, and the decoder side cannot completely reconstruct the video picture, that is, the quality of the reconstructed video picture is compared with the original video picture The quality is low or poor.
  • Video coding standards of H.261 belong to "lossy hybrid video coding and decoding” (that is, combining spatial and temporal prediction in the sample domain with 2D transform coding for applying quantization in the transform domain).
  • Each picture of a video sequence is usually divided into a set of non-overlapping blocks, and is usually coded at the block level.
  • the encoder side usually processes at the block (video block) level, that is, encodes the video.
  • the prediction block is generated by spatial (intra-picture) prediction and temporal (inter-picture) prediction, from the current image block (current processing or The block to be processed) is subtracted from the prediction block to obtain the residual block, the residual block is transformed in the transform domain and the residual block is quantized to reduce the amount of data to be transmitted (compressed), and the decoder side will be inverse to the encoder
  • the processing part is applied to the coded or compressed block to reconstruct the current image block for representation.
  • the encoder duplicates the decoder processing loop, so that the encoder and the decoder generate the same prediction (for example, intra prediction and inter prediction) and/or reconstruction for processing, that is, to encode subsequent blocks.
  • FIG. 1 exemplarily shows a schematic block diagram of a video encoding and decoding system 10 applied in an embodiment of the present application.
  • the video encoding and decoding system 10 may include a source device 12 and a destination device 14.
  • the source device 12 generates encoded video data. Therefore, the source device 12 may be referred to as a video encoding device.
  • the destination device 14 can decode the encoded video data generated by the source device 12, and therefore, the destination device 14 can be referred to as a video decoding device.
  • Various implementations of source device 12, destination device 14, or both may include one or more processors and memory coupled to the one or more processors.
  • the memory may include, but is not limited to, read-only memory (ROM), random access memory (RAM), erasable programmable read-only memory (EPROM) , Flash memory, or any other medium that can be used to store the desired program code in the form of instructions or data structures that can be accessed by a computer, as described herein.
  • the source device 12 and the destination device 14 may include various devices, including desktop computers, mobile computing devices, notebook (for example, laptop) computers, tablet computers, set-top boxes, telephone handsets such as so-called "smart" phones. Computers, televisions, cameras, display devices, digital media players, video game consoles, on-board computers, wireless communication equipment, or the like.
  • FIG. 1 shows the source device 12 and the destination device 14 as separate devices
  • the device embodiment may also include the source device 12 and the destination device 14 or the functions of both, that is, the source device 12 or the corresponding Function and destination device 14 or corresponding function.
  • the same hardware and/or software may be used, or separate hardware and/or software, or any combination thereof may be used to implement the source device 12 or the corresponding functionality and the destination device 14 or the corresponding functionality .
  • the source device 12 and the destination device 14 may communicate with each other via a link 13, and the destination device 14 may receive encoded video data from the source device 12 via the link 13.
  • Link 13 may include one or more media or devices capable of moving encoded video data from source device 12 to destination device 14.
  • link 13 may include one or more communication media that enable source device 12 to transmit encoded video data directly to destination device 14 in real time.
  • the source device 12 may modulate the encoded video data according to a communication standard, such as a wireless communication protocol, and may transmit the modulated video data to the destination device 14.
  • the one or more communication media may include wireless and/or wired communication media, such as a radio frequency (RF) spectrum or one or more physical transmission lines.
  • RF radio frequency
  • the one or more communication media may form part of a packet-based network, such as a local area network, a wide area network, or a global network (e.g., the Internet).
  • the one or more communication media may include routers, switches, base stations, or other devices that facilitate communication from source device 12 to destination device 14.
  • the source device 12 includes an encoder 20, and optionally, the source device 12 may also include a picture source 16, a picture preprocessor 18, and a communication interface 22.
  • the encoder 20, the picture source 16, the picture preprocessor 18, and the communication interface 22 may be hardware components in the source device 12, or may be software programs in the source device 12. They are described as follows:
  • the picture source 16 which can include or can be any type of picture capture device, for example to capture real-world pictures, and/or any type of pictures or comments (for screen content encoding, some text on the screen is also considered to be encoded Picture or part of an image) generating equipment, for example, a computer graphics processor for generating computer animation pictures, or for obtaining and/or providing real world pictures, computer animation pictures (for example, screen content, virtual reality, VR) pictures), and/or any combination thereof (for example, augmented reality (AR) pictures).
  • the picture source 16 may be a camera for capturing pictures or a memory for storing pictures.
  • the picture source 16 may also include any type of (internal or external) interface for storing previously captured or generated pictures and/or acquiring or receiving pictures.
  • the picture source 16 When the picture source 16 is a camera, the picture source 16 may be, for example, a local or an integrated camera integrated in the source device; when the picture source 16 is a memory, the picture source 16 may be local or, for example, an integrated camera integrated in the source device. Memory.
  • the interface When the picture source 16 includes an interface, the interface may be, for example, an external interface for receiving pictures from an external video source.
  • the external video source is, for example, an external picture capturing device, such as a camera, an external memory, or an external picture generating device, such as It is an external computer graphics processor, computer or server.
  • the interface can be any type of interface according to any proprietary or standardized interface protocol, such as a wired or wireless interface, and an optical interface.
  • a picture can be regarded as a two-dimensional array or matrix of picture elements.
  • the pixel points in the array can also be called sampling points.
  • the number of sampling points of the array or picture in the horizontal and vertical directions (or axis) defines the size and/or resolution of the picture.
  • three color components are usually used, that is, pictures can be represented as or contain three sample arrays.
  • a picture includes corresponding red, green, and blue sample arrays.
  • each pixel is usually expressed in a luminance/chrominance format or color space.
  • a picture in the YUV format includes the luminance component indicated by Y (sometimes indicated by L) and the two indicated by U and V. Chrominance components.
  • the luma component Y represents brightness or gray level intensity (for example, the two are the same in a grayscale picture), and the two chroma components U and V represent chroma or color information components.
  • a picture in the YUV format includes a luminance sample array of luminance sample values (Y), and two chrominance sample arrays of chrominance values (U and V).
  • Pictures in RGB format can be converted or converted to YUV format, and vice versa. This process is also called color conversion or conversion. If the picture is black and white, the picture may only include the luminance sample array.
  • the picture transmitted from the picture source 16 to the picture processor may also be referred to as original picture data 17.
  • the picture preprocessor 18 is configured to receive the original picture data 17 and perform preprocessing on the original picture data 17 to obtain the preprocessed picture 19 or the preprocessed picture data 19.
  • the pre-processing performed by the picture pre-processor 18 may include trimming, color format conversion (for example, conversion from RGB format to YUV format), toning, or denoising.
  • the encoder 20 (or video encoder 20) is configured to receive the pre-processed picture data 19, and process the pre-processed picture data 19 using a relevant prediction mode (such as the prediction mode in the various embodiments herein), thereby
  • the encoded picture data 21 is provided (the structure details of the encoder 20 will be described further based on FIG. 2 or FIG. 4 or FIG. 5).
  • the encoder 20 may be used to implement the various embodiments described below to realize the application of the encoding method described in this application on the encoding side.
  • the communication interface 22 can be used to receive the encoded picture data 21, and can transmit the encoded picture data 21 to the destination device 14 or any other device (such as a memory) via the link 13 for storage or direct reconstruction, so The other device can be any device used for decoding or storage.
  • the communication interface 22 can be used, for example, to encapsulate the encoded picture data 21 into a suitable format, such as a data packet, for transmission on the link 13.
  • the destination device 14 includes a decoder 30, and optionally, the destination device 14 may also include a communication interface 28, a picture post processor 32, and a display device 34. They are described as follows:
  • the communication interface 28 may be used to receive the encoded picture data 21 from the source device 12 or any other source, for example, a storage device, and the storage device is, for example, an encoded picture data storage device.
  • the communication interface 28 can be used to transmit or receive the encoded picture data 21 through the link 13 between the source device 12 and the destination device 14 or via any type of network.
  • the link 13 is, for example, a direct wired or wireless connection, of any type.
  • the network of is, for example, a wired or wireless network or any combination thereof, or any type of private network and public network, or any combination thereof.
  • the communication interface 28 may be used, for example, to decapsulate the data packet transmitted by the communication interface 22 to obtain the encoded picture data 21.
  • Both the communication interface 28 and the communication interface 22 can be configured as a one-way communication interface or a two-way communication interface, and can be used, for example, to send and receive messages to establish connections, confirm and exchange any other communication links and/or, for example, encoded picture data Information about the transmission of the transmitted data.
  • the decoder 30 (or referred to as the decoder 30) is used to receive the encoded picture data 21 and provide the decoded picture data 31 or the decoded picture 31 (below will further describe the decoder 30 based on Figure 3 or Figure 4 or Figure 5 Structural details).
  • the decoder 30 may be used to implement the various embodiments described below to implement the application of the decoding method described in this application on the decoding side.
  • the picture post processor 32 is configured to perform post-processing on the decoded picture data 31 (also referred to as reconstructed picture data) to obtain post-processed picture data 33.
  • the post-processing performed by the picture post-processor 32 may include: color format conversion (for example, conversion from YUV format to RGB format), toning, trimming or resampling, or any other processing, and can also be used to convert post-processed picture data 33 is transmitted to the display device 34.
  • the display device 34 is configured to receive the post-processed image data 33 to display the image to, for example, users or viewers.
  • the display device 34 may be or may include any type of display for presenting reconstructed pictures, for example, an integrated or external display or monitor.
  • the display may include a liquid crystal display (LCD), an organic light emitting diode (OLED) display, a plasma display, a projector, a micro LED display, a liquid crystal on silicon (LCoS), Digital light processor (digital light processor, DLP) or any other type of display.
  • the device embodiment may also include the source device 12 and the destination device 14 or the functionality of both, that is, the source device 12 Or the corresponding functionality and the destination device 14 or the corresponding functionality.
  • the same hardware and/or software may be used, or separate hardware and/or software, or any combination thereof may be used to implement the source device 12 or the corresponding functionality and the destination device 14 or the corresponding functionality .
  • the source device 12 and the destination device 14 may include any of a variety of devices, including any type of handheld or stationary device, for example, a notebook or laptop computer, mobile phone, smart phone, tablet or tablet computer, video camera, desktop Computers, set-top boxes, televisions, cameras, in-vehicle devices, display devices, digital media players, video game consoles, video streaming devices (such as content service servers or content distribution servers), broadcast receiver devices, broadcast transmitter devices And so on, and can not use or use any type of operating system.
  • a notebook or laptop computer mobile phone, smart phone, tablet or tablet computer
  • video camera desktop Computers
  • set-top boxes televisions, cameras, in-vehicle devices, display devices, digital media players, video game consoles, video streaming devices (such as content service servers or content distribution servers), broadcast receiver devices, broadcast transmitter devices And so on, and can not use or use any type of operating system.
  • Both the encoder 20 and the decoder 30 can be implemented as any of various suitable circuits, for example, one or more microprocessors, digital signal processors (digital signal processors, DSP), and application-specific integrated circuits (application-specific integrated circuits). circuit, ASIC), field-programmable gate array (FPGA), discrete logic, hardware, or any combination thereof.
  • the device can store the instructions of the software in a suitable non-transitory computer-readable storage medium, and can use one or more processors to execute the instructions in hardware to execute the technology of the present application . Any of the foregoing (including hardware, software, a combination of hardware and software, etc.) can be regarded as one or more processors.
  • the video encoding and decoding system 10 shown in FIG. 1 is only an example, and the technology of this application can be applied to video encoding settings that do not necessarily include any data communication between encoding and decoding devices (for example, video encoding or video encoding). decoding).
  • the data can be retrieved from local storage, streamed on the network, etc.
  • the video encoding device can encode data and store the data to the memory, and/or the video decoding device can retrieve the data from the memory and decode the data.
  • encoding and decoding are performed by devices that do not communicate with each other but only encode data to the memory and/or retrieve data from the memory and decode the data.
  • Fig. 2 shows a schematic/conceptual block diagram of an example of an encoder 20 for implementing an embodiment of the present application.
  • the encoder 20 includes a residual calculation unit 204, a transformation processing unit 206, a quantization unit 208, an inverse quantization unit 210, an inverse transformation processing unit 212, a reconstruction unit 214, a buffer 216, and a loop filter.
  • Unit 220 a decoded picture buffer (DPB) 230, a prediction processing unit 260, and an entropy coding unit 270.
  • the prediction processing unit 260 may include an inter prediction unit 244, an intra prediction unit 254, and a mode selection unit 262.
  • the inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown in the figure).
  • the encoder 20 shown in FIG. 2 may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.
  • the residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the prediction processing unit 260, and the entropy encoding unit 270 form the forward signal path of the encoder 20, and for example, the inverse quantization unit 210, the inverse transform processing unit 212, and the The structure unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, and the prediction processing unit 260 form the backward signal path of the encoder, wherein the backward signal path of the encoder corresponds to The signal path of the decoder (see decoder 30 in FIG. 3).
  • the encoder 20 receives the picture 201 or the image block 203 of the picture 201 through, for example, an input 202, for example, a picture in a picture sequence that forms a video or a video sequence.
  • the image block 203 may also be called the current picture block or the picture block to be encoded
  • the picture 201 may be called the current picture or the picture to be encoded (especially when the current picture is distinguished from other pictures in video encoding, the other pictures are for example the same video sequence). That is, the previous coded and/or decoded picture in the video sequence that also includes the current picture).
  • the embodiment of the encoder 20 may include a segmentation unit (not shown in FIG. 2) for segmenting the picture 201 into a plurality of blocks such as the image block 203, usually into a plurality of non-overlapping blocks.
  • the segmentation unit can be used to use the same block size and the corresponding grid defining the block size for all pictures in the video sequence, or to change the block size between pictures or subsets or groups of pictures, and divide each picture into The corresponding block.
  • the prediction processing unit 260 of the encoder 20 may be used to perform any combination of the aforementioned segmentation techniques.
  • the image block 203 is also or can be regarded as a two-dimensional array or matrix of sampling points with sample values, although its size is smaller than that of the picture 201.
  • the image block 203 may include, for example, one sampling array (for example, a luminance array in the case of a black-and-white picture 201) or three sampling arrays (for example, one luminance array and two chrominance arrays in the case of a color picture) or Any other number and/or type of array depending on the color format applied.
  • the number of sampling points in the horizontal and vertical directions (or axes) of the image block 203 defines the size of the image block 203.
  • the encoder 20 shown in FIG. 2 is used to encode the picture 201 block by block, for example, to perform encoding and prediction on each image block 203.
  • the residual calculation unit 204 is configured to calculate the residual block 205 based on the picture image block 203 and the prediction block 265 (other details of the prediction block 265 are provided below), for example, by subtracting the sample value of the picture image block 203 sample by sample (pixel by pixel). The sample value of the block 265 is de-predicted to obtain the residual block 205 in the sample domain.
  • the transform processing unit 206 is configured to apply a transform such as discrete cosine transform (DCT) or discrete sine transform (DST) on the sample values of the residual block 205 to obtain transform coefficients 207 in the transform domain.
  • a transform such as discrete cosine transform (DCT) or discrete sine transform (DST)
  • DCT discrete cosine transform
  • DST discrete sine transform
  • the transform coefficient 207 may also be referred to as a transform residual coefficient, and represents the residual block 205 in the transform domain.
  • the transform processing unit 206 may be used to apply an integer approximation of DCT/DST, such as the transform specified for HEVC/H.265. Compared with the orthogonal DCT transform, this integer approximation is usually scaled by a factor. In order to maintain the norm of the residual block processed by the forward and inverse transformation, an additional scaling factor is applied as part of the transformation process.
  • the scaling factor is usually selected based on certain constraints. For example, the scaling factor is a trade-off between the power of 2 used for the shift operation, the bit depth of the transform coefficient, accuracy, and implementation cost.
  • the inverse transformation processing unit 212 for the inverse transformation designate a specific scaling factor, and accordingly, the encoder The 20 side uses the transformation processing unit 206 to specify a corresponding scaling factor for the positive transformation.
  • the quantization unit 208 is used to quantize the transform coefficient 207 by applying scalar quantization or vector quantization, for example, to obtain the quantized transform coefficient 209.
  • the quantized transform coefficient 209 may also be referred to as a quantized residual coefficient 209.
  • the quantization process can reduce the bit depth associated with some or all of the transform coefficients 207. For example, n-bit transform coefficients can be rounded down to m-bit transform coefficients during quantization, where n is greater than m.
  • the degree of quantization can be modified by adjusting the quantization parameter (QP). For example, for scalar quantization, different scales can be applied to achieve finer or coarser quantization.
  • QP quantization parameter
  • a smaller quantization step size corresponds to a finer quantization
  • a larger quantization step size corresponds to a coarser quantization.
  • the appropriate quantization step size can be indicated by a quantization parameter (QP).
  • the quantization parameter may be an index of a predefined set of suitable quantization steps.
  • a smaller quantization parameter can correspond to fine quantization (smaller quantization step size)
  • a larger quantization parameter can correspond to coarse quantization (larger quantization step size)
  • Quantization may include division by a quantization step size and corresponding quantization or inverse quantization performed by, for example, inverse quantization 210, or may include multiplication by a quantization step size.
  • Embodiments according to some standards such as HEVC may use quantization parameters to determine the quantization step size.
  • the quantization step size can be calculated based on the quantization parameter using a fixed-point approximation of an equation including division. Additional scaling factors can be introduced for quantization and inverse quantization to restore the norm of the residual block that may be modified due to the scale used in the fixed-point approximation of the equations for the quantization step size and the quantization parameter.
  • the scales of inverse transform and inverse quantization may be combined.
  • a custom quantization table can be used and signaled from the encoder to the decoder in, for example, a bitstream. Quantization is a lossy operation, where the larger the quantization step, the greater the loss.
  • the inverse quantization unit 210 is configured to apply the inverse quantization of the quantization unit 208 on the quantized coefficients to obtain the inverse quantized coefficients 211, for example, based on or use the same quantization step size as the quantization unit 208, and apply the quantization scheme applied by the quantization unit 208 The inverse quantification scheme.
  • the inversely quantized coefficient 211 may also be referred to as the inversely quantized residual coefficient 211, which corresponds to the transform coefficient 207, although the loss due to quantization is usually different from the transform coefficient.
  • the inverse transform processing unit 212 is used to apply the inverse transform of the transform applied by the transform processing unit 206, for example, an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST), so as to be in the sample domain Obtain the inverse transform block 213.
  • the inverse transformation block 213 may also be referred to as an inverse transformation and inverse quantization block 213 or an inverse transformation residual block 213.
  • the reconstruction unit 214 (for example, the summer 214) is used to add the inverse transform block 213 (that is, the reconstructed residual block 213) to the prediction block 265 to obtain the reconstructed block 215 in the sample domain, for example, The sample value of the reconstructed residual block 213 and the sample value of the prediction block 265 are added.
  • the buffer unit 216 (or "buffer" 216 for short) of the line buffer 216 may be used to buffer or store the reconstructed block 215 and corresponding sample values, for example, for intra prediction.
  • the encoder can be used to use the unfiltered reconstructed block and/or the corresponding sample value stored in the buffer unit 216 to perform any type of estimation and/or prediction, such as intra-frame prediction.
  • the embodiment of the encoder 20 may be configured such that the buffer unit 216 is used not only for storing the reconstructed block 215 for intra prediction 254, but also for the loop filter unit 220 (not shown in FIG. 2 Out), and/or, for example, the buffer unit 216 and the decoded picture buffer unit 230 form one buffer.
  • Other embodiments may be used to use the filtered block 221 and/or blocks or samples from the decoded picture buffer 230 (neither shown in FIG. 2) as the input or basis for the intra prediction 254.
  • the loop filter unit 220 (or the loop filter 220 for short) is used to filter the reconstructed block 215 to obtain the filtered block 221, so as to smoothly perform pixel transformation or improve video quality.
  • the loop filter unit 220 is intended to represent one or more loop filters, such as deblocking filters, sample-adaptive offset (SAO) filters or other filters, such as bilateral filters, auto Adaptive loop filter (ALF), or sharpening or smoothing filter, or collaborative filter.
  • the loop filter unit 220 is shown as an in-loop filter in FIG. 2, in other configurations, the loop filter unit 220 may be implemented as a post-loop filter.
  • the filtered block 221 may also be referred to as a filtered reconstructed block 221.
  • the decoded picture buffer 230 may store the reconstructed coded block after the loop filter unit 220 performs a filtering operation on the reconstructed coded block.
  • the embodiment of the encoder 20 may be used to output loop filter parameters (e.g., sample adaptive offset information), for example, directly output or by the entropy encoding unit 270 or any other
  • the entropy coding unit outputs after entropy coding, for example, so that the decoder 30 can receive and apply the same loop filter parameters for decoding.
  • the decoded picture buffer (DPB) 230 may be a reference picture memory that stores reference picture data for the encoder 20 to encode video data.
  • DPB 230 can be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM) (including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM) (resistive RAM, RRAM)) or other types of memory devices.
  • DRAM dynamic random access memory
  • SDRAM synchronous DRAM
  • MRAM magnetoresistive RAM
  • RRAM resistive RAM
  • the DPB 230 and the buffer 216 may be provided by the same memory device or by separate memory devices.
  • a decoded picture buffer (DPB) 230 is used to store the filtered block 221.
  • the decoded picture buffer 230 may be further used to store other previous filtered blocks of the same current picture or different pictures such as the previously reconstructed picture, such as the previously reconstructed and filtered block 221, and may provide a complete previous Reconstruction is a decoded picture (and corresponding reference blocks and samples) and/or a partially reconstructed current picture (and corresponding reference blocks and samples), for example, for inter prediction.
  • a decoded picture buffer (DPB) 230 is used to store the reconstructed block 215.
  • the prediction processing unit 260 also called the block prediction processing unit 260, is used to receive or obtain the image block 203 (the current image block 203 of the current picture 201) and reconstructed picture data, such as the same (current) picture from the buffer 216
  • the reference samples and/or the reference picture data 231 of one or more previously decoded pictures from the decoded picture buffer 230, and used to process such data for prediction, that is, the provision can be an inter-predicted block 245 or a The prediction block 265 of the intra prediction block 255.
  • the mode selection unit 262 may be used to select a prediction mode (for example, intra or inter prediction mode) and/or the corresponding prediction block 245 or 255 used as the prediction block 265 to calculate the residual block 205 and reconstruct the reconstructed block 215.
  • a prediction mode for example, intra or inter prediction mode
  • the corresponding prediction block 245 or 255 used as the prediction block 265 to calculate the residual block 205 and reconstruct the reconstructed block 215.
  • the embodiment of the mode selection unit 262 can be used to select a prediction mode (for example, from those supported by the prediction processing unit 260) that provides the best match or minimum residual (the minimum residual means Better compression in transmission or storage), or provide minimal signaling overhead (minimum signaling overhead means better compression in transmission or storage), or consider or balance both.
  • the mode selection unit 262 may be configured to determine a prediction mode based on rate distortion optimization (RDO), that is, select a prediction mode that provides the smallest rate-distortion optimization, or select a prediction mode whose related rate-distortion at least meets the prediction mode selection criteria .
  • RDO rate distortion optimization
  • the encoder 20 is used to determine or select the best or optimal prediction mode from a set of (predetermined) prediction modes.
  • the prediction mode set may include, for example, an intra prediction mode and/or an inter prediction mode.
  • the set of intra prediction modes may include 35 different intra prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in H.265, or may include 67 Different intra-frame prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in H.266 under development.
  • the set of inter-frame prediction modes depends on the available reference pictures (ie, for example, the aforementioned at least part of the decoded pictures stored in the DBP230) and other inter-frame prediction parameters, such as whether to use the entire reference picture or only use A part of the reference picture, such as the search window area surrounding the area of the current image block, to search for the best matching reference block, and/or for example depending on whether pixel interpolation such as half-pixel and/or quarter-pixel interpolation is applied
  • the set of inter prediction modes may include, for example, an advanced motion vector prediction (AMVP) mode and a merge mode.
  • AMVP advanced motion vector prediction
  • the set of inter-frame prediction modes may include the improved AMVP mode based on control points in the embodiments of the present application, and the improved merge mode based on control points.
  • the intra prediction unit 254 may be used to perform any combination of inter prediction techniques described below.
  • the embodiments of the present application may also apply skip mode and/or direct mode.
  • the prediction processing unit 260 may be further used to divide the image block 203 into smaller block partitions or sub-blocks, for example, by iteratively using quad-tree (QT) segmentation and binary-tree (BT) segmentation. Or triple-tree (TT) segmentation, or any combination thereof, and used to perform prediction, for example, for each of the block partitions or sub-blocks, where the mode selection includes selecting the tree structure of the segmented image block 203 and selecting the application The prediction mode for each of the block partitions or sub-blocks.
  • QT quad-tree
  • BT binary-tree
  • TT triple-tree
  • the inter prediction unit 244 may include a motion estimation (ME) unit (not shown in FIG. 2) and a motion compensation (MC) unit (not shown in FIG. 2).
  • the motion estimation unit is used to receive or obtain the picture image block 203 (the current picture image block 203 of the current picture 201) and the decoded picture 231, or at least one or more previously reconstructed blocks, for example, one or more other/different
  • the reconstructed block of the previously decoded picture 231 is used for motion estimation.
  • the video sequence may include the current picture and the previously decoded picture 31, or in other words, the current picture and the previously decoded picture 31 may be part of the picture sequence forming the video sequence, or form the picture sequence.
  • the encoder 20 may be used to select a reference block from multiple reference blocks of the same or different pictures among multiple other pictures, and provide the reference picture and/or provide a reference to the motion estimation unit (not shown in FIG. 2)
  • the offset (spatial offset) between the position of the block (X, Y coordinates) and the position of the current image block is used as an inter prediction parameter.
  • This offset is also called a motion vector (MV).
  • the motion compensation unit is used to obtain inter prediction parameters, and perform inter prediction based on or using the inter prediction parameters to obtain the inter prediction block 245.
  • the motion compensation performed by the motion compensation unit may include fetching or generating a prediction block based on a motion/block vector determined by motion estimation (interpolation of sub-pixel accuracy may be performed). Interpolation filtering can generate additional pixel samples from known pixel samples, thereby potentially increasing the number of candidate prediction blocks that can be used to encode picture blocks.
  • the motion compensation unit 246 can locate the prediction block pointed to by the motion vector in a reference picture list.
  • the motion compensation unit 246 may also generate syntax elements associated with the blocks and video slices for use by the decoder 30 when decoding picture blocks of the video slices.
  • the aforementioned inter-prediction unit 244 may transmit syntax elements to the entropy encoding unit 270, and the syntax elements include inter-prediction parameters (for example, after traversing multiple inter-prediction modes, select the inter-prediction mode used for prediction of the current image block). Instructions).
  • the inter-frame prediction parameter may not be carried in the syntax element.
  • the decoder 30 can directly use the default prediction mode for decoding. It can be understood that the inter prediction unit 244 may be used to perform any combination of inter prediction techniques.
  • the intra prediction unit 254 is used to obtain, for example, receive a picture block 203 (current picture block) of the same picture and one or more previously reconstructed blocks, for example reconstructed adjacent blocks, for intra estimation.
  • the encoder 20 may be used to select an intra prediction mode from a plurality of (predetermined) intra prediction modes.
  • the embodiment of the encoder 20 may be used to select an intra prediction mode based on optimization criteria, for example, based on a minimum residual (for example, an intra prediction mode that provides a prediction block 255 most similar to the current picture block 203) or a minimum rate distortion.
  • a minimum residual for example, an intra prediction mode that provides a prediction block 255 most similar to the current picture block 203
  • a minimum rate distortion for example, an intra prediction mode that provides a prediction block 255 most similar to the current picture block 203
  • the intra prediction unit 254 is further configured to determine the intra prediction block 255 based on the intra prediction parameters of the selected intra prediction mode. In any case, after selecting the intra prediction mode for the block, the intra prediction unit 254 is also used to provide intra prediction parameters to the entropy encoding unit 270, that is, to provide an indication of the selected intra prediction mode for the block Information. In one example, the intra prediction unit 254 may be used to perform any combination of intra prediction techniques.
  • the aforementioned intra prediction unit 254 may transmit syntax elements to the entropy encoding unit 270, where the syntax elements include intra prediction parameters (for example, after traversing multiple intra prediction modes, select the intra prediction mode used for prediction of the current image block). Instructions).
  • the intra prediction parameter may not be carried in the syntax element.
  • the decoder 30 can directly use the default prediction mode for decoding.
  • the entropy coding unit 270 is used to apply entropy coding algorithms or schemes (for example, variable length coding (VLC) scheme, context adaptive VLC (context adaptive VLC, CAVLC) scheme, arithmetic coding scheme, context adaptive binary arithmetic) Coding (context adaptive binary arithmetic coding, CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or other entropy Encoding method or technique) applied to quantized residual coefficients 209, inter-frame prediction parameters, intra-frame prediction parameters and/or loop filter parameters, one or all (or not applied), to obtain the output 272
  • VLC variable length coding
  • CAVLC context adaptive VLC
  • CABAC context adaptive binary arithmetic
  • SBAC syntax-based context-adaptive binary arithmetic coding
  • PIPE probability interval partitioning entropy
  • encoded picture data 21 output in the form of encoded bitstream
  • the encoded bitstream can be transmitted to the video decoder 30, or archived for later transmission or retrieval by the video decoder 30.
  • the entropy encoding unit 270 may also be used for entropy encoding other syntax elements of the current video slice being encoded.
  • the non-transform-based encoder 20 may directly quantize the residual signal without the transform processing unit 206 for certain blocks or frames.
  • the encoder 20 may have a quantization unit 208 and an inverse quantization unit 210 combined into a single unit.
  • the encoder 20 may be used to implement the video encoding process described in the following embodiments.
  • the video encoder in this application may only include part of the modules in the video encoder 20.
  • the video encoder in this application may include an image decoding unit and a division unit.
  • the image decoding unit may be composed of one or more of an entropy decoding unit, a prediction unit, an inverse transform unit, and an inverse quantization unit.
  • the video encoder 20 may directly quantize the residual signal without being processed by the transform processing unit 206, and accordingly does not need to be processed by the inverse transform processing unit 212; or, for some For image blocks or image frames, the video encoder 20 does not generate residual data, and accordingly does not need to be processed by the transform processing unit 206, quantization unit 208, inverse quantization unit 210, and inverse transform processing unit 212; or, the video encoder 20 may The reconstructed image block is directly stored as a reference block without being processed by the filter 220; or, the quantization unit 208 and the inverse quantization unit 210 in the video encoder 20 may be combined together.
  • the loop filter 220 is optional, and for lossless compression coding, the transform processing unit 206, the quantization unit 208, the inverse quantization unit 210, and the inverse transform processing unit 212 are optional. It should be understood that, according to different application scenarios, the inter prediction unit 244 and the intra prediction unit 254 may be selectively activated.
  • FIG. 3 shows a schematic/conceptual block diagram of an example of a decoder 30 for implementing an embodiment of the present application.
  • the video decoder 30 is used to receive, for example, encoded picture data (for example, an encoded bit stream) 21 encoded by the encoder 20 to obtain a decoded picture 231.
  • video decoder 30 receives video data from video encoder 20, such as an encoded video bitstream and associated syntax elements that represent picture blocks of an encoded video slice.
  • the decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (such as a summer 314), a buffer 316, a loop filter 320, and The decoded picture buffer 330 and the prediction processing unit 360.
  • the prediction processing unit 360 may include an inter prediction unit 344, an intra prediction unit 354, and a mode selection unit 362.
  • video decoder 30 may perform decoding passes that are substantially reciprocal of the encoding passes described with video encoder 20 of FIG. 2.
  • the entropy decoding unit 304 is configured to perform entropy decoding on the encoded picture data 21 to obtain, for example, quantized coefficients 309 and/or decoded encoding parameters (not shown in FIG. 3), for example, inter prediction, intra prediction parameters , Loop filter parameters and/or any one or all of other syntax elements (decoded).
  • the entropy decoding unit 304 is further configured to forward the inter prediction parameters, intra prediction parameters and/or other syntax elements to the prediction processing unit 360.
  • the video decoder 30 may receive syntax elements at the video slice level and/or the video block level.
  • the inverse quantization unit 310 can be functionally the same as the inverse quantization unit 110
  • the inverse transformation processing unit 312 can be functionally the same as the inverse transformation processing unit 212
  • the reconstruction unit 314 can be functionally the same as the reconstruction unit 214
  • the buffer 316 can be functionally identical.
  • the loop filter 320 may be functionally the same as the loop filter 220
  • the decoded picture buffer 330 may be functionally the same as the decoded picture buffer 230.
  • the prediction processing unit 360 may include an inter prediction unit 344 and an intra prediction unit 354.
  • the inter prediction unit 344 may be functionally similar to the inter prediction unit 244, and the intra prediction unit 354 may be functionally similar to the intra prediction unit 254.
  • the prediction processing unit 360 is generally used to perform block prediction and/or obtain a prediction block 365 from the encoded data 21, and to receive or obtain (explicitly or implicitly) prediction-related parameters and/or information about the prediction from the entropy decoding unit 304, for example. Information about the selected prediction mode.
  • the intra-prediction unit 354 of the prediction processing unit 360 is used for the intra-prediction mode based on the signal and the previous decoded block from the current frame or picture. Data to generate a prediction block 365 for the picture block of the current video slice.
  • the inter-frame prediction unit 344 eg, motion compensation unit
  • the prediction processing unit 360 is used for the motion vector and the received from the entropy decoding unit 304
  • the other syntax elements generate a prediction block 365 for the video block of the current video slice.
  • a prediction block can be generated from a reference picture in a reference picture list.
  • the video decoder 30 may use the default construction technique to construct a list of reference frames based on the reference pictures stored in the DPB 330: list 0 and list 1.
  • the prediction processing unit 360 is used to determine prediction information for the video block of the current video slice by parsing the motion vector and other syntax elements, and use the prediction information to generate the prediction block for the current video block being decoded.
  • the prediction processing unit 360 uses some syntax elements received to determine the prediction mode (for example, intra or inter prediction) and the inter prediction slice type ( For example, B slice, P slice or GPB slice), construction information for one or more of the reference picture list for the slice, motion vector for each inter-coded video block of the slice, The inter prediction status and other information of each inter-encoded video block of the slice to decode the video block of the current video slice.
  • the syntax elements received by the video decoder 30 from the bitstream include receiving adaptive parameter set (APS), sequence parameter set (sequence parameter set, SPS), and picture parameter set (picture parameter set).
  • APS adaptive parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • the inverse quantization unit 310 may be used to inverse quantize (ie, inverse quantize) the quantized transform coefficients provided in the bitstream and decoded by the entropy decoding unit 304.
  • the inverse quantization process may include using the quantization parameter calculated by the video encoder 20 for each video block in the video slice to determine the degree of quantization that should be applied and also determine the degree of inverse quantization that should be applied.
  • the inverse transform processing unit 312 is used to apply an inverse transform (for example, an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process) to transform coefficients so as to generate a residual block in the pixel domain.
  • an inverse transform for example, an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process
  • the reconstruction unit 314 (for example, the summer 314) is used to add the inverse transform block 313 (that is, the reconstructed residual block 313) to the prediction block 365 to obtain the reconstructed block 315 in the sample domain, for example by adding The sample value of the reconstructed residual block 313 and the sample value of the prediction block 365 are added.
  • the loop filter unit 320 (during the encoding cycle or after the encoding cycle) is used to filter the reconstructed block 315 to obtain the filtered block 321, thereby smoothly performing pixel transformation or improving video quality.
  • the loop filter unit 320 may be used to perform any combination of the filtering techniques described below.
  • the loop filter unit 320 is intended to represent one or more loop filters, such as deblocking filters, sample-adaptive offset (SAO) filters or other filters, such as bilateral filters, auto Adaptive loop filter (ALF), or sharpening or smoothing filter, or collaborative filter.
  • the loop filter unit 320 is shown as an in-loop filter in FIG. 3, in other configurations, the loop filter unit 320 may be implemented as a post-loop filter.
  • the decoded video block 321 in a given frame or picture is then stored in a decoded picture buffer 330 that stores reference pictures for subsequent motion compensation.
  • the decoder 30 is used, for example, to output the decoded picture 31 through the output 332 for presentation or viewing by the user.
  • the decoder 30 may generate an output video stream without the loop filter unit 320.
  • the non-transform-based decoder 30 may directly inversely quantize the residual signal without the inverse transform processing unit 312 for certain blocks or frames.
  • the video decoder 30 may have an inverse quantization unit 310 and an inverse transform processing unit 312 combined into a single unit.
  • the decoder 30 is used to implement the video decoding method described in the following embodiments.
  • the video encoder in this application may only include part of the modules in the video encoder 30.
  • the video encoder in this application may include a division unit and an image encoding unit.
  • the image coding unit may be composed of one or more of a prediction unit, a transformation unit, a quantization unit, and an entropy coding unit.
  • the video decoder 30 may generate an output video stream without processing by the filter 320; or, for some image blocks or image frames, the entropy decoding unit 304 of the video decoder 30 does not decode the quantized coefficients, and accordingly does not It needs to be processed by the inverse quantization unit 310 and the inverse transform processing unit 312.
  • the loop filter 320 is optional; and for lossless compression, the inverse quantization unit 310 and the inverse transform processing unit 312 are optional. It should be understood that, according to different application scenarios, the inter prediction unit and the intra prediction unit may be selectively activated.
  • the processing result for a certain link can be further processed and output to the next link, for example, in interpolation filtering, motion vector derivation or loop filtering, etc.
  • the processing result of the corresponding link is further subjected to operations such as clamping (clip) or shifting (shift).
  • the motion vector of the control point of the current image block is derived from the motion vector of the adjacent affine coding block (the coding block predicted by the affine motion model can be called the affine coding block), or the current image is derived
  • the motion vector of the sub-block of the block can be further processed, which is not limited in this application. For example, restrict the value range of the motion vector so that it is within a certain bit width. Assuming that the bit width of the allowed motion vector is bitDepth, the range of the motion vector is -2 ⁇ (bitDepth-1) ⁇ 2 ⁇ (bitDepth-1)-1, where the " ⁇ " symbol represents the power. If bitDepth is 16, the value range is -32768 ⁇ 32767. If bitDepth is 18, the value range is -131072 ⁇ 131071.
  • the value of the motion vector (for example, the motion vector MV of the four 4x4 sub-blocks in an 8x8 image block) can be restricted, so that the maximum difference between the integer parts of the four 4x4 sub-blocks MV No more than N (for example, N can take 1) pixels.
  • FIG. 4 is an explanatory diagram of an example of a video coding system 40 including the encoder 20 of FIG. 2 and/or the decoder 30 of FIG. 3 according to an exemplary embodiment.
  • the video decoding system 40 can implement a combination of various technologies in the embodiments of the present application.
  • the video coding system 40 may include an imaging device 41, an encoder 20, a decoder 30 (and/or a video encoder/decoder implemented by the logic circuit 47 of the processing unit 46), and an antenna 42 , One or more processors 43, one or more memories 44 and/or display devices 45.
  • the imaging device 41, the antenna 42, the processing unit 46, the logic circuit 47, the encoder 20, the decoder 30, the processor 43, the memory 44, and/or the display device 45 can communicate with each other.
  • the encoder 20 and the decoder 30 are used to illustrate the video coding system 40, in different examples, the video coding system 40 may include only the encoder 20 or only the decoder 30.
  • antenna 42 may be used to transmit or receive an encoded bitstream of video data.
  • the display device 45 may be used to present video data.
  • the logic circuit 47 may be implemented by the processing unit 46.
  • the processing unit 46 may include application-specific integrated circuit (ASIC) logic, a graphics processor, a general-purpose processor, and so on.
  • the video decoding system 40 may also include an optional processor 43, and the optional processor 43 may similarly include application-specific integrated circuit (ASIC) logic, a graphics processor, a general-purpose processor, and the like.
  • the logic circuit 47 may be implemented by hardware, such as dedicated hardware for video encoding, and the processor 43 may be implemented by general software, an operating system, and the like.
  • the memory 44 may be any type of memory, such as volatile memory (for example, static random access memory (SRAM), dynamic random access memory (DRAM), etc.) or non-volatile memory. Memory (for example, flash memory, etc.), etc.
  • the memory 44 may be implemented by cache memory.
  • the logic circuit 47 may access the memory 44 (e.g., to implement an image buffer).
  • the logic circuit 47 and/or the processing unit 46 may include a memory (for example, a cache, etc.) for implementing an image buffer and the like.
  • the encoder 20 implemented by logic circuits may include an image buffer (e.g., implemented by the processing unit 46 or the memory 44) and a graphics processing unit (e.g., implemented by the processing unit 46).
  • the graphics processing unit may be communicatively coupled to the image buffer.
  • the graphics processing unit may include an encoder 20 implemented by a logic circuit 47 to implement the various modules discussed with reference to Figure 2 and/or any other encoder systems or subsystems described herein.
  • Logic circuits can be used to perform the various operations discussed herein.
  • decoder 30 may be implemented by logic circuit 47 in a similar manner to implement the various modules discussed with reference to decoder 30 of FIG. 3 and/or any other decoder systems or subsystems described herein.
  • the decoder 30 implemented by logic circuits may include an image buffer (implemented by the processing unit 2820 or the memory 44) and a graphics processing unit (implemented by the processing unit 46, for example).
  • the graphics processing unit may be communicatively coupled to the image buffer.
  • the graphics processing unit may include a decoder 30 implemented by a logic circuit 47 to implement the various modules discussed with reference to FIG. 3 and/or any other decoder systems or subsystems described herein.
  • antenna 42 may be used to receive an encoded bitstream of video data.
  • the encoded bitstream may include data, indicators, index values, mode selection data, etc., related to the encoded video frame discussed herein, such as data related to coded partitions (e.g., transform coefficients or quantized transform coefficients). , (As discussed) optional indicators, and/or data defining code partitions).
  • the video coding system 40 may also include a decoder 30 coupled to the antenna 42 and used to decode the encoded bitstream.
  • the display device 45 is used to present video frames.
  • the decoder 30 may be used to perform the reverse process.
  • the decoder 30 can be used to receive and parse such syntax elements, and decode related video data accordingly.
  • the encoder 20 may entropy encode the syntax elements into an encoded video bitstream. In such instances, the decoder 30 can parse such syntax elements and decode related video data accordingly.
  • FIG. 5 is a schematic structural diagram of a video decoding device 400 (for example, a video encoding device 400 or a video decoding device 400) provided by an embodiment of the present application.
  • the video coding device 400 is suitable for implementing the embodiments described herein.
  • the video coding device 400 may be a video decoder (for example, the decoder 30 of FIG. 3) or a video encoder (for example, the encoder 20 of FIG. 2).
  • the video coding device 400 may be one or more components of the decoder 30 of FIG. 3 or the encoder 20 of FIG. 2 described above.
  • the video decoding device 400 includes: an entry port 410 for receiving data and a receiving unit (Rx) 420, a processor, logic unit or central processing unit (CPU) 430 for processing data, and a transmitter unit for transmitting data (Tx) 440 and outlet port 450, and a memory 460 for storing data.
  • the video decoding device 400 may further include a photoelectric conversion component and an electro-optical (EO) component coupled with the inlet port 410, the receiver unit 420, the transmitter unit 440, and the outlet port 450 for the outlet or inlet of optical signals or electrical signals.
  • EO electro-optical
  • the processor 430 is implemented by hardware and software.
  • the processor 430 may be implemented as one or more CPU chips, cores (for example, multi-core processors), FPGA, ASIC, and DSP.
  • the processor 430 communicates with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460.
  • the processor 430 includes a decoding module 470 (for example, an encoding module 470 or a decoding module 470).
  • the encoding/decoding module 470 implements the embodiments disclosed herein to implement the encoding method/decoding method of the embodiments of the present application. For example, the encoding/decoding module 470 implements, processes, or provides various encoding operations.
  • the encoding/decoding module 470 provides a substantial improvement to the function of the video decoding device 400 and affects the conversion of the video decoding device 400 to different states.
  • the encoding/decoding module 470 is implemented by instructions stored in the memory 460 and executed by the processor 430.
  • the memory 460 includes one or more magnetic disks, tape drives, and solid-state hard disks, and can be used as an overflow data storage device for storing programs when these programs are selectively executed, and storing instructions and data read during program execution.
  • the memory 460 may be volatile and/or non-volatile, and may be read-only memory (ROM), random access memory (RAM), random access memory (ternary content-addressable memory, TCAM), and/or static Random Access Memory (SRAM).
  • FIG. 6 is a simplified block diagram of an apparatus 500 that can be used as either or both of the source device 12 and the destination device 14 in FIG. 1, according to an exemplary embodiment.
  • the apparatus 500 may implement the encoding method or the decoding method in the embodiments of the present application.
  • FIG. 6 is a schematic block diagram of an implementation manner of an encoding device or a decoding device (referred to as a decoding device 500 for short) according to an embodiment of the application.
  • the decoding device 500 may include a processor 510, a memory 530, and a bus system 550.
  • the processor and the memory are connected through a bus system, the memory is used to store instructions, and the processor is used to execute instructions stored in the memory.
  • the memory of the decoding device stores program codes, and the processor can call the program codes stored in the memory to execute various video encoding or decoding methods described in this application, especially various new image block division methods. In order to avoid repetition, it will not be described in detail here.
  • the processor 510 may be a central processing unit (CPU), and the processor 510 may also be other general-purpose processors, digital signal processors (DSP), or application-specific integrated circuits (ASIC). , Ready-made programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the memory 530 may include a read only memory (ROM) device or a random access memory (RAM) device. Any other suitable type of storage device can also be used as the memory 530.
  • the memory 530 may include code and data 531 accessed by the processor 510 using the bus 550.
  • the memory 530 may further include an operating system 533 and an application program 535.
  • the application program 535 includes at least one program that allows the processor 510 to execute the video encoding or decoding method described in this application.
  • the application program 535 may include applications 1 to N, which further include a video encoding or decoding application (referred to as a video coding application) that executes the video encoding or decoding method described in this application.
  • the bus system 550 may also include a power bus, a control bus, and a status signal bus. However, for clear description, various buses are marked as the bus system 550 in the figure.
  • the decoding device 500 may further include one or more output devices, such as a display 570.
  • the display 570 may be a touch-sensitive display that merges the display with a touch-sensitive unit operable to sense touch input.
  • the display 570 may be connected to the processor 510 via the bus 550.
  • Inter prediction refers to finding a matching reference block for the current image block in the current image in the reconstructed image, and use the pixel value of the pixel in the reference block as the predicted value of the pixel value of the pixel in the current image block , (This process is called Motion estimation (ME)).
  • ME Motion estimation
  • Motion estimation is to try multiple reference blocks in the reference image for the current image block, and then use rate-distortion optimization (RDO) or other methods to finally determine one or two reference blocks from the multiple reference blocks ( Two reference blocks are required for bidirectional prediction), and the reference block is used to perform inter-frame prediction on the current image block.
  • RDO rate-distortion optimization
  • the motion information of the current image block includes the indication information of the prediction direction (usually forward prediction, backward prediction or bidirectional prediction), one or two motion vectors (motion vectors, MV) pointing to the reference block, and the reference block
  • the indication information of the image in which it is located usually recorded as a reference frame index (reference index)).
  • Forward prediction means that the current image block selects a reference image from the forward reference image set to obtain a reference block.
  • Backward prediction means that the current image block selects a reference image from the backward reference image set to obtain a reference block.
  • Bidirectional prediction refers to selecting one reference image from the forward reference image set and the backward reference image set to obtain the reference block. When the bidirectional prediction method is used, there will be two reference blocks in the current coding block, and each reference block needs a motion vector and a reference frame index to indicate, and then the pixels in the current image block are determined according to the pixel values of the pixels in the two reference blocks The predicted value of the point pixel value.
  • AMVP mode In HEVC, there are two inter prediction modes, namely AMVP mode and merge mode.
  • the AMVP mode it first traverses the current coded block's spatial or temporal adjacent coded blocks (denoted as neighboring blocks), constructs a candidate motion vector list based on the motion information of each neighboring block, and then obtains the candidate motion information from the candidate motion information through the rate distortion cost
  • the optimal motion vector is determined in the list, and the candidate motion information with the smallest rate-distortion cost is used as the motion vector predictor (MVP) of the current coding block.
  • MVP motion vector predictor
  • the rate-distortion cost can be calculated according to formula (1), where J is the rate-distortion cost, and SAD is the difference between the pixel prediction value obtained after motion estimation using the candidate motion vector prediction value and the original pixel value
  • the sum of absolute differences (SAD) R is the code rate
  • ⁇ is the Lagrangian multiplier
  • the encoder transmits the index value of the selected motion vector predictor in the candidate motion vector list and the reference frame index value To the decoding end.
  • the encoding end may perform a motion search in the neighborhood centered on the MVP to obtain the actual motion vector of the current encoding block, and then transmit the difference between the MVP and the actual motion vector (motion vector difference) to the decoding end.
  • AMVP modes can be divided into AMVP modes based on translational models and AMVP modes based on non-translational models.
  • the candidate motion information list is constructed by using the motion information of the current coding unit adjacent to the coding unit in the spatial or temporal domain, and then the optimal motion information is determined from the candidate motion information list by the rate distortion cost as the current The motion information of the coding unit, and finally the index value (denoted as merge index, the same below) of the position of the optimal motion information in the candidate motion information list is passed to the decoding end.
  • the spatial and temporal candidate motion information of the current coding unit can be as shown in Figure 7, where the spatial candidate motion information comes from 5 adjacent blocks (A0, A1, B0, B1 and B2) in space. If the neighboring block is not available or the prediction mode is intra prediction, the neighboring block is not added to the candidate motion information list.
  • the temporal candidate motion information of the current coding unit can be obtained after scaling the MV of the corresponding block in the reference frame according to the picture order count (POC) of the reference frame and the current frame.
  • POC picture order count
  • Non-translational motion model prediction refers to the use of the same motion model on the codec side to derive the motion information of each sub-motion compensation unit in the current coding block, and then perform motion compensation according to the motion information of the sub-motion compensation unit to obtain each sub-block The prediction sub-block, thereby improving the prediction efficiency.
  • Commonly used non-translational motion models include 4-parameter affine motion model or 6-parameter affine motion model.
  • the Doford grid pictures near the same geographic location in the positioning layer are combined into an image sequence, and then inter-frame prediction coding is performed on the image sequence, which can be obtained according to the inter-frame prediction process.
  • the data amount of the residual picture of the grid picture is small, so that the data amount of the code stream generated by the final encoding is also relatively small, thereby reducing the storage overhead occupied by the code stream generated by the encoding.
  • Fig. 8 is a schematic diagram of a process of an image coding method according to an embodiment of the present application.
  • the method shown in FIG. 8 may be executed by an encoding device or an encoder.
  • Fig. 8 shows the main process of the image coding method according to the embodiment of the present application.
  • images with similar geographical locations can be combined into an image sequence (images with similar image content can also be combined into an image sequence).
  • the coding method based on inter-frame prediction is used for coding to obtain the code stream.
  • the encoding based on inter-frame prediction here refers to an encoding method that uses inter-frame prediction when predicting an image.
  • the predicted image is obtained by performing inter-frame prediction on the images in the image sequence, and the residual image of the image is obtained according to the obtained predicted image.
  • the data amount of the residual image finally obtained is small, and the data amount of the code stream generated by the final encoding is also small, so that the storage space occupied by the code stream can be reduced.
  • the pixel values of the image can be XORed or inverted after the image is obtained, or the geographically adjacent images can be formed into an image sequence after the image is obtained, and then the pictures in the image sequence can be processed XOR processing or negation processing.
  • the image is first XORed or inverted.
  • the images with similar geographic locations are selected from the processed images to form an image sequence, and then based on inter-frame prediction Encoding encodes the image sequence to obtain a bitstream.
  • the images with similar geographic locations are first formed into an image sequence, and then the images in the image sequence are XORed or inverted, and then based on the inter-frame prediction encoding method.
  • the processed image sequence is coded to obtain a code stream.
  • FIG. 11 is a schematic flowchart of an image decoding method according to an embodiment of the present application.
  • the method shown in FIG. 11 may be executed by a decoding device or a decoder.
  • the method shown in FIG. 11 includes steps 1001 to 1004, and steps 1001 to 1004 are described in detail below.
  • the code stream obtained in step 1001 may be a code stream obtained by encoding in the encoding method shown in FIG. 14 below.
  • step 1002 the residual block of the current image block can be obtained by parsing the code stream.
  • parsing process refer to the relevant decoding process shown in FIG. 3.
  • the aforementioned image sequence includes a plurality of grid images, and the geographical locations corresponding to the multiple grid images are similar or the image content of the multiple grid images is similar. Specifically, that the geographic locations corresponding to the multiple grid images are similar or the image content of the multiple grid images is similar may mean that the multiple grid images satisfy the first condition.
  • the above-mentioned first condition has many different specific manifestations.
  • the foregoing first condition may be that the distance between geographic locations corresponding to at least two of the multiple grid images in the foregoing image sequence is less than a preset distance.
  • the aforementioned preset distance may also become a distance threshold, and the size of the preset distance can be flexibly set according to actual needs.
  • the aforementioned preset distance may be set to 3m (3m).
  • the preset distance can also be set to 5m, 6m, etc. In short, any suitable size preset distance can be set as needed.
  • the foregoing first condition may also be that the distance between the geographic locations corresponding to at least two of the plurality of grid images is less than or equal to a preset distance.
  • the foregoing first condition may be that the similarity of the image content of the at least two grid images in the image sequence is greater than or equal to a preset similarity.
  • the aforementioned preset similarity may also be referred to as a similarity threshold, and the size of the preset similarity can be flexibly set according to actual needs.
  • the aforementioned preset similarity may be set to 50%.
  • the preset similarity can also be set to 55%, 60%, 65%, etc. In short, any suitable size of the preset similarity can be set as needed.
  • the above-mentioned first condition may also be that the similarity of the image content of at least two of the plurality of grid images is greater than the preset similarity.
  • the image sequence contains at least two grid images with similar image content
  • the data amount of the residual image obtained subsequently can be made smaller.
  • the foregoing first condition may be that the image content of at least two grid images in the plurality of grid images corresponds to the same geographic area.
  • the inter-frame prediction of the image sequence can make the residual image The data amount of the difference image is small.
  • the size of the aforementioned geographic area may be a preset size, and the size of the geographic area may be set according to actual needs.
  • the size of the aforementioned geographic area may be an area of 2m ⁇ 2m. It should be understood that the size of the geographic area of the 2m ⁇ 2m area here is only an example.
  • the size of the geographic area may also be set to an area of 1m ⁇ 1m, an area of 3m ⁇ 32m, etc., in short, any suitable size of geographic area can be set as needed. area.
  • the size of the aforementioned geographic area is an area of 2m ⁇ 2m.
  • the two grid images satisfy the first condition.
  • At least two grid images in the plurality of grid images may be grid images with adjacent frames between each other.
  • At least two grid images satisfying the first condition are adjacent frames between each other.
  • the grid image 1, the grid image 2, and the grid image 3 in the aforementioned image sequence satisfy the aforementioned first condition.
  • the grid image 1, the grid image 2 and the grid image 3 may be the i-th frame, the i+1-th frame and the i+2-th frame in the image sequence, respectively.
  • i is a positive integer.
  • step 1003 For the process of obtaining the predicted image of the grid image in the image sequence through inter-frame prediction in step 1003, refer to the relevant decoding process shown in FIG. 3.
  • the grid image in the image sequence can be obtained by superimposing the residual image of the grid image in the image sequence and the predicted image of the grid image in the image sequence.
  • the predicted image of the grid image may be composed of prediction blocks of each image block in the grid image
  • the residual image of the grid image may be composed of each image in the grid image.
  • the residual block composition of the block Therefore, in the method of FIG. 11, in the process of parsing the code stream to finally obtain the grid image in the image sequence, the decoding operation may be performed with the image block as the basic unit.
  • the decoding operation may be performed according to the code Obtain the residual block of the image block of the grid image in the image sequence, and then perform inter-frame prediction on the image block in step 1003 to obtain the prediction block of the image block.
  • step 1004 according to the residual Block and prediction block, and finally get the corresponding image block.
  • the image blocks can be spliced into a grid image. In this way, at the decoding end, it is equivalent to obtaining the grid image based on the residual image of the grid image and the predicted image of the grid image.
  • step 1004 For the specific implementation of the foregoing step 1004, reference may be made to the relevant decoding process shown in FIG. 3.
  • the image sequence contains grid images with similar geographic locations or similar image content
  • the amount of residual image data obtained can be made smaller, so that the final The code stream corresponding to the image sequence occupies a small storage space, which is convenient for storage or transmission.
  • the encoding end may also perform inversion processing or XOR processing on the pixel values of the grid image in the image sequence to To further reduce the storage space occupied by the code stream generated by encoding, correspondingly, the decoding end can also perform inversion processing or exclusive OR processing on the corresponding image during or after decoding, so as to obtain the final image.
  • This processing method is described in detail below.
  • the grid image in the image sequence can be processed to obtain the final grid image.
  • the method shown in FIG. 11 further includes:
  • the pixel value of the grid image in the above image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the processed grid image and grid image obtained in step 1005 above may satisfy the first relationship.
  • the first relationship the pixel value of the processed grid image is opposite to the pixel value of the grid image.
  • the value of the i-th bit among the N bits of the pixel value of the grid image in the image sequence is the same as the N bits of the pixel value of the grid image in the processed image sequence
  • the value of the i-th bit in is the opposite, and the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence;
  • the N bits of the pixel value of the grid image in the sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is the pixel of the grid image in the image sequence.
  • i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoder end by inverting the pixel value of the grid image can reduce the data volume of the grid image when the pixel value of the grid image contains continuous placeholders, thereby making the encoding generation
  • the code stream occupies less storage space, and the decoding end performs (inversion) processing on the decoded grid image, so as to restore the grid image processed (inversion processing) on the encoding end to obtain the final Grid image.
  • the pixel value of the grid image of the image sequence can also be XORed.
  • the processed grid image and grid image obtained in step 1005 can also satisfy the second relationship.
  • the second relationship the pixel value of the processed grid image is the XOR result of the pixel value.
  • the value of the first bit among the N bits of the grid image in the processed image sequence is the same as the value of the first bit among the N bits of the grid image in the image sequence
  • the value of the i+1th bit among the N bits of the grid image in the processed image sequence is the i+1th bit among the N bits of the grid image in the image sequence
  • the value of is the result of XOR processing the i-th bit of the N bits of the grid image in the processed image sequence
  • the N bits of the pixel value of the grid image in the image sequence are located in the image sequence
  • the first bit is the bit with the highest value of 1 in the pixel value of the grid image in the image sequence, or the image sequence
  • the N bits of the pixel value of the grid image in the image sequence are located after the highest bit of the pixel value of the grid image in the image sequence and adjacent to the highest bit of the pixel value of the grid image in the image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence, and the i-th bit The number of bits of is higher than the number of bits of the i+1th bit, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs exclusive OR processing on the pixel values of the grid image, so that when the pixel values of the grid image contain continuous placeholders, the data volume of the grid image can be reduced, thereby making the code generated
  • the code stream occupies less storage space
  • the decoder performs (exclusive OR) processing on the decoded grid image, so as to restore the grid image processed (exclusive or processed) on the encoder side to obtain the final Grid image.
  • step 1003a may be performed.
  • step 1004 is to obtain the grid image in the image sequence according to the processed residual image and the predicted image of the grid image in the image sequence.
  • the pixel value of the above residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the processed residual image and residual image obtained in the above step 1003a may satisfy the third relationship.
  • the third relationship the value of the pixel value of the processed residual image is opposite to the value of the pixel value of the residual image.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is equal to the value of the i-th bit among the N bits of the pixel value of the processed residual image
  • the values of the bits are opposite, and the positions of the N bits of the pixel value of the residual image are the same as the positions of the N bits of the pixel value of the processed residual image.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • Bit position, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end by inverting the pixel value of the residual image can reduce the amount of data of the residual image when the pixel value of the residual image contains continuous placeholders, thereby making the code generated
  • the code stream occupies less storage space, and the decoder can restore the residual image processed (inverted) by the encoding end by (inverting) the decoded residual image, and then according to the processing After the residual image gets the final image block.
  • the pixel value of the residual image may also be XORed.
  • the processed residual image and residual image obtained in step 1003a may also satisfy the fourth relationship.
  • the fourth relationship the pixel value of the processed residual image is the result of the exclusive OR of the pixel value.
  • the value of the first bit of the N bits of the processed residual image is opposite to the value of the first bit of the N bits of the residual image, and the processed The value of the i+1th bit among the N bits of the residual image is the value of the i+1th bit among the N bits of the residual image and the value of the N bits of the processed residual image The result of XORing the i-th bit.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • the bit position, or, the N bits of the pixel value of the residual image are located after the highest bit of the pixel value of the residual image and adjacent to the highest bit of the pixel value of the residual image.
  • the N bits of the pixel value of the residual image are at the same position as the N bits of the pixel value of the processed residual image, and the number of bits of the i-th bit is higher than that of the i+th bit.
  • the number of bits in 1 bit, i and N are both positive integers, i ⁇ N, N ⁇ M;
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data volume of the residual image can be reduced, so that the encoded
  • the code stream occupies less storage space
  • the decoding end performs (exclusive OR) processing on the decoded residual image, so as to restore the residual image processed (exclusive or processed) by the encoding end, and then according to the processing After the residual image gets the final image block.
  • the encoding end may use lossless encoding or lossy encoding when encoding the grid images in the image sequence. Accordingly, the decoding end shall use a matching method with the encoding end for decoding.
  • obtaining the residual image of the grid image in the image sequence includes: performing inverse transformation, inverse quantization and entropy decoding processing on the code stream to obtain the residual image .
  • the above-mentioned decoding processing corresponds to the lossy encoding of the image, which can make the code stream obtained by encoding occupy as little storage space as possible.
  • obtaining the residual image of the grid image in the image sequence according to the code stream in step 1002 includes: performing entropy decoding processing on the code stream to obtain the residual image.
  • the foregoing decoding method that only performs entropy decoding processing corresponds to lossless encoding.
  • This encoding method can avoid image distortion as much as possible and ensure the final display effect of the image.
  • the above code stream is obtained by encoding the positioning layer.
  • the pixel values of the above positioning layer include rasterized elevation data.
  • the pixel value of the above positioning layer contains M bits, and each bit represents the occupied position of each grid. Since the pixel value of the positioning layer contains the rasterized elevation data, and the character "11" in the high position of the elevation data has a higher probability, the pixel value of the positioning layer containing the elevation data can be processed. Reduce the data volume of the pixel value of the positioning layer, thereby reducing the storage space occupied by the finally obtained code stream.
  • the value of M may be any one of 8, 10, and 12.
  • FIG. 14 is a schematic flowchart of an image coding method according to an embodiment of the present application.
  • the method shown in FIG. 14 may be executed by an encoding device or an encoder.
  • the method shown in FIG. 14 includes steps 2001 to 2003, and steps 2001 to 2003 will be described in detail below.
  • performing inter-frame prediction on the grid images in the image sequence to obtain the residual image includes: performing inter-frame prediction on the grid images in the image sequence to obtain a predicted image; and according to the grid images in the image sequence Image and predicted image, get the residual image of the grid image.
  • the grid image and the residual image of the grid image may be subtracted to obtain the residual image of the grid image.
  • the aforementioned image sequence includes a plurality of grid images, and the geographical locations corresponding to the multiple grid images are similar or the image contents of the multiple grid images are similar.
  • that the geographic locations corresponding to the multiple grid images are similar or the image content of the multiple grid images is similar may mean that the multiple grid images satisfy the first condition.
  • the above-mentioned first condition has many different specific manifestations.
  • the foregoing first condition may be that the distance between geographic locations corresponding to at least two of the multiple grid images in the foregoing image sequence is less than a preset distance.
  • the aforementioned preset distance may also become a distance threshold, and the size of the preset distance can be flexibly set according to actual needs.
  • the aforementioned preset distance may be set to 3m.
  • the preset distance can also be set to 5m, 6m, etc. In short, any suitable size preset distance can be set as needed.
  • the foregoing first condition may also be that the distance between the geographic locations corresponding to at least two of the plurality of grid images is less than or equal to a preset distance.
  • the foregoing first condition may be that the similarity of the image content of the at least two grid images in the image sequence is greater than or equal to a preset similarity.
  • the aforementioned preset similarity may also be referred to as a similarity threshold, and the size of the preset similarity can be flexibly set according to actual needs.
  • the aforementioned preset similarity may be set to 50%.
  • the preset similarity can also be set to 55%, 60%, 65%, etc. In short, any suitable size of the preset similarity can be set as needed.
  • the above-mentioned first condition may also be that the similarity of the image content of at least two of the plurality of grid images is greater than the preset similarity.
  • the image sequence contains at least two grid images with similar image content
  • the data amount of the residual image obtained subsequently can be made smaller.
  • the foregoing first condition may be that the image content of at least two grid images in the plurality of grid images corresponds to the same geographic area.
  • the inter-frame prediction of the image sequence can make the residual image The data amount of the difference image is small.
  • the size of the aforementioned geographic area may be a preset size, and the size of the geographic area may be set according to actual needs.
  • the size of the aforementioned geographic area may be an area of 2m ⁇ 2m. It should be understood that the size of the geographic area of the 2m ⁇ 2m area here is only an example.
  • the size of the geographic area may also be set to an area of 1m ⁇ 1m, an area of 3m ⁇ 32m, etc., in short, any suitable size of geographic area can be set as needed. area.
  • the size of the aforementioned geographic area is an area of 2m ⁇ 2m.
  • the two grid images satisfy the first condition.
  • the aforementioned at least two grid images may be grid images with adjacent frames between each other.
  • At least two grid images satisfying the first condition are adjacent frames between each other.
  • grid image 1, grid image 2, and grid image 3 in the aforementioned image sequence satisfy the aforementioned first condition.
  • the grid image 1, the grid image 2 and the grid image 3 may be the i-th frame, the i+1-th frame and the i+2-th frame in the image sequence, respectively.
  • i is a positive integer.
  • the image sequence contains grid images with similar geographic locations or similar image content
  • the amount of residual image data obtained can be made smaller, so that the final The code stream obtained by encoding the image sequence occupies a small storage space, which is convenient for storage or transmission.
  • the predicted image of the grid image can be composed of the predicted blocks of each image block in the grid image
  • the residual image of the grid image can be composed of the prediction blocks of each image block in the grid image. Residual block composition.
  • the residual image can be divided into image blocks, and then the prediction block of each image block is obtained, and the residual block of each image block is obtained according to each image block and the residual block of each image block. Difference block, and then obtain the residual image of the grid image.
  • the encoding end may also perform inversion processing or XOR processing on the pixel values of the grid image in the image sequence to Further reduce the storage space occupied by the code stream generated by the encoding.
  • the grid image in the image sequence may be processed first, and then the processed grid image may be encoded. .
  • step 2002a is performed first.
  • step 2002 is to perform inter-frame prediction based on the processed grid image to obtain a residual image.
  • the pixel value of the grid image in the above image sequence is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the processed grid image and grid image obtained in the foregoing step 2002a may satisfy the fifth relationship.
  • the fifth relationship the pixel value of the processed grid image is opposite to the pixel value of the grid image.
  • the value of the i-th bit among the N bits of the pixel value of the grid image in the image sequence is equal to the N bits of the pixel value of the grid image in the processed image sequence
  • the value of the i-th bit in is the opposite, and the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is The pixel value of the grid image in the image sequence is 1 and the bit with the highest number of bits, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end uses the inverse processing of the pixel values of the grid image to reduce the data volume of the grid image when the pixel value of the grid image contains continuous placeholders, thereby making the code generated
  • the code stream takes up less storage space.
  • N the corresponding coding performance is different.
  • N takes a certain value
  • the corresponding coding performance is the best, and the number of bits reduced is the most.
  • the pixel values of the grid images in the image sequence can also be XORed.
  • the processed grid image and grid image obtained in the above step 2002a can also satisfy the sixth relationship.
  • the sixth relationship the pixel value of the processed grid image is the XOR result of the pixel value.
  • the value of the first bit among the N bits of the grid image in the processed image sequence is the same as the value of the first bit among the N bits of the grid image in the image sequence
  • the value of the i+1th bit among the N bits of the grid image in the processed image sequence is the i+1th bit among the N bits of the grid image in the image sequence
  • the value of is the result of XORing the i-th bit among the N bits of the grid image in the processed image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are located after and adjacent to the first bit of the pixel value of the grid image in the image sequence.
  • the first bit is The pixel value of the grid image in the image sequence is 1 and the bit with the highest digit, or the N bits of the pixel value of the grid image in the image sequence are located in the pixel value of the grid image in the image sequence After the highest bit of and adjacent to the highest bit of the pixel value of the grid image in the image sequence.
  • the N bits of the pixel value of the grid image in the image sequence are at the same position as the N bits of the pixel value of the grid image in the processed image sequence, and the number of bits of the i-th bit is higher than that of the i+th bit
  • the number of bits in 1 bit, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs exclusive OR processing on the pixel values of the grid image, so that when the pixel values of the grid image contain continuous placeholders, the data volume of the grid image can be reduced, thereby making the code generated
  • the code stream takes up less storage space.
  • the corresponding coding performance is different.
  • the corresponding coding performance is better and the number of bits reduced is also greater.
  • the value of N can be set according to the test results or experience. For example, when the pixel value of the grid image corresponds to a total of 8 bits, you can set a larger value for N, for example, set N Set to 5 or 6, which can achieve better coding performance and reduce the amount of grid image data as much as possible.
  • the grid images of the image sequence can also be obtained. After the residual image of the grid image, the residual image is inverted or XOR processed. The details are described below.
  • step 2003 may specifically include step 2003a and step 2003b.
  • the pixel value of the above residual image is represented by M bits, and the value of each bit is 0 or 1, and M is an integer greater than 1.
  • the processed residual image and residual image obtained in step 1003a above may satisfy the seventh relationship.
  • the seventh relationship the value of the pixel value of the processed residual image is opposite to the value of the pixel value of the residual image.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is equal to the value of the i-th bit among the N bits of the pixel value of the residual image after processing.
  • the values are opposite, and the N bits of the pixel value of the residual image are at the same position as the N bits of the pixel value of the processed residual image.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image.
  • the first bit is the pixel value of the residual image with the value 1 and the highest number of bits.
  • Bit position, i and N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data amount of the residual image can be reduced, thereby enabling the encoding
  • the generated code stream takes up less storage space.
  • the pixel value of the residual image in addition to inverting the pixel value of the residual image, the pixel value of the residual image can also be XORed.
  • the processed residual image and residual image obtained in step 2003a may also satisfy the eighth relationship.
  • the eighth relationship the pixel value of the processed residual image is the result of the exclusive OR of the pixel value.
  • the value of the i-th bit among the N bits of the pixel value of the residual image is equal to the value of the i-th bit among the N bits of the pixel value of the residual image after processing.
  • the value is opposite, the value of the i+1th bit among the N bits of the processed residual image is the value of the i+1th bit among the N bits of the residual image and the processed residual image.
  • the N bits of the pixel value of the residual image are located after and adjacent to the first bit of the pixel value of the residual image, and the first bit is the pixel value of the residual image.
  • the bit with a value of 1 and the highest number of bits, or the N bits of the pixel value of the residual image are located after the highest bit of the pixel value of the residual image and adjacent to the highest bit of the pixel value of the residual image.
  • the N bits of the pixel value of the residual image are at the same position as the N bits of the pixel value of the processed residual image.
  • the number of bits of the i-th bit is higher than that of the i+1th bit, i And N are both positive integers, i ⁇ N, N ⁇ M.
  • the encoding end performs XOR processing on the pixel values of the residual image, so that when the pixel values of the residual image contain continuous placeholders, the data amount of the residual image can be reduced, thereby enabling the encoding
  • the generated code stream takes up less storage space.
  • lossless coding or lossy coding may be used.
  • encoding the residual image in step 2003 to obtain an encoded bitstream includes: performing transformation, quantization, and entropy encoding processing on the residual image to obtain an encoded bitstream.
  • the encoded code stream can occupy as little storage space as possible.
  • encoding the residual image in step 2003 to obtain an encoded bitstream includes: performing entropy encoding processing on the residual image to obtain an encoded bitstream.
  • the grid pictures in the aforementioned image sequence come from a positioning layer.
  • the pixel values of the above positioning layer include rasterized elevation data.
  • the pixel value of the above positioning layer contains M bits, and each bit represents the occupied position of each grid. Since the pixel value of the positioning layer contains the rasterized elevation data, and the character "11" in the high position of the elevation data has a higher probability, the pixel value of the positioning layer containing the elevation data can be processed. Reduce the data volume of the pixel value of the positioning layer, thereby reducing the storage space occupied by the finally obtained code stream.
  • the value of M can be any one of 8, 10, and 12.
  • the grid images in the image sequence may include I frame images and P frame images. As shown in FIG. 19, the image sequence contains 1 I frame and 3 P frames. For the P frames, the inter-frame prediction method can be used for prediction. It should be understood that the image sequence shown in FIG. 19 is only for illustration, and the number of grid images included in the image sequence is not limited in the embodiment of the present application.
  • image sequence in the embodiment of the present application may also include B frames.
  • the grid image in the image sequence may come from a positioning layer, and the positioning layer may be 2D plane data obtained by mapping 3D point cloud data.
  • the 3D point cloud data contains data such as three-dimensional coordinates (x, y, z) and reflectance (r).
  • the (x, y) of the 3D point cloud data can be directly As the (x, y) coordinates of the 2D plane data (x and y are equivalent to the position of the pixel in the picture), the height z in the 3D point cloud data is mapped to the R channel of the 2D plane data, and the reflectivity r is mapped to On the G channel, the conversion of 3D point cloud data to 2D plane data is thus realized.
  • Sequence 1 and Sequence 2 are two image sequences respectively. Both image sequences contain pictures in portable network graphics (PNG) format. Sequence 1 contains 4 grids. Pictures (1a.png, 1b.png, 1c.png, 1d.png), sequence 2 also includes 4 grid pictures (2a.png, 2b.png, 2c.png, 2d.png).
  • HEVC-SCC high efficiency video coding-screen content coding
  • HEVC-SCC combined compression (Equivalent to the coding method in the embodiment of the present application) when the image sequence is coded, the data volume of the obtained code stream is smaller.
  • the data volume after HEVC-SCC combined compression is reduced by 9.9% relative to the data volume of the original image sequence, and the data volume after HEVC-SCC alone compression is reduced by 9.5 relative to the data volume of the original image sequence. %.
  • the code stream obtained by using the HEVC-SCC combined compression + data preprocessing method is compared with that of using HEVC-SCC alone. Compared with the SCC combined compression method, the data volume of the obtained code stream is smaller.
  • the data volume of the code stream obtained by using the HEVC-SCC combined compression method alone is reduced by 9.9% relative to the data volume of the original image sequence, while the HEVC-SCC combined compression + data preprocessing method is used
  • the data volume of the obtained code stream is reduced by 10.3% relative to the data volume of the original image sequence.
  • FIGS. 21 to 24 The image decoding method and encoding method of the embodiments of the present application are described in detail above with reference to the drawings, and the image decoding apparatus and image encoding apparatus of the embodiments of the present application will be introduced below with reference to FIGS. 21 to 24. It should be understood that the image decoding device in FIG. 21 to FIG. 24 can execute the image decoding method in the embodiment of the present application, and the image encoding device in FIG. 21 to FIG. 24 can execute the image encoding method in the embodiment of the present application. In order to avoid unnecessary repetition, repetitive descriptions are appropriately omitted when introducing the image decoding device and the image encoding device of the embodiments of the present application.
  • FIG. 21 is a schematic block diagram of an image decoding device according to an embodiment of the present application.
  • the image decoding device 10000 shown in FIG. 21 includes an acquisition unit 10001 and a processing unit 10002.
  • the image decoding device 10000 may execute the image decoding method according to the embodiment of the present application. Specifically, the image decoding device 10000 may execute the image decoding method shown in FIG. 11 to FIG. 13.
  • Fig. 22 is a schematic block diagram of an image encoding device according to an embodiment of the present application.
  • the image encoding device 11000 shown in FIG. 22 includes an acquisition unit 11001 and a processing unit 11002.
  • the image encoding device 11000 can execute the image encoding method of the embodiment of the present application. Specifically, the image encoding device 11000 can execute the image encoding methods shown in FIG. 14, FIG. 15, and FIG. 18.
  • FIG. 23 is a schematic diagram of the hardware structure of an image decoding device provided by an embodiment of the present application.
  • the image decoding apparatus 12000 shown in FIG. 23 (the image decoding apparatus 12000 may specifically be a computer device) includes a memory 1201, a memory 1202, a communication interface 12003, and a bus 12004. Among them, the memory 1201, the memory 1202, and the communication interface 12003 realize the communication connection between each other through the bus 12004.
  • the memory 1201 may be a read only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM).
  • the memory 12001 may store a program. When the program stored in the memory 12001 is executed by the memory 1202, the memory 1202 is used to execute each step of the image decoding method in the embodiment of the present application.
  • the memory 1202 may adopt a general central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), a graphics processing unit (GPU), or one or more integrated circuits.
  • the circuit is used to execute related programs to implement the image decoding method in the method embodiment of the present application.
  • the memory 12002 may also be an integrated circuit chip with signal processing capability.
  • each step of the image decoding method of the present application can be completed by an integrated logic circuit of hardware in the memory 1202 or instructions in the form of software.
  • the above-mentioned memory 1202 may also be a general-purpose processor, a digital signal processing (digital signal processing, DSP), an application specific integrated circuit (ASIC), a ready-made programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices , Discrete hardware components.
  • DSP digital signal processing
  • ASIC application specific integrated circuit
  • FPGA ready-made programmable gate array
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application can be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
  • the storage medium is located in the memory 12001, and the processor 12002 reads the information in the memory 12001, and combines its hardware to complete the functions required by the units included in the image decoding device, or execute the image decoding method in the method embodiment of the present application.
  • the communication interface 12003 uses a transceiving device such as but not limited to a transceiver to implement communication between the image decoding device 12000 and other devices or communication networks. For example, the information of the neural network to be constructed and the training data needed in the process of constructing the neural network can be obtained through the communication interface 12003.
  • a transceiving device such as but not limited to a transceiver to implement communication between the image decoding device 12000 and other devices or communication networks. For example, the information of the neural network to be constructed and the training data needed in the process of constructing the neural network can be obtained through the communication interface 12003.
  • the bus 12004 may include a path for transferring information between various components of the image decoding device 12000 (for example, the memory 1201, the memory 1202, and the communication interface 12003).
  • the acquisition unit 10001 and the processing unit 10002 in the image decoding device 10000 described above are equivalent to the processor 12002 in the image decoding device 12000.
  • FIG. 24 is a schematic diagram of the hardware structure of an image encoding device provided by an embodiment of the present application.
  • the image encoding apparatus 13000 shown in FIG. 24 (the image decoding apparatus 13000 may specifically be a computer device) includes a memory 13001, a processor 13002, a communication interface 13003, and a bus 13004. Among them, the memory 13001, the processor 13302, and the communication interface 13003 implement communication connections between each other through the bus 13004.
  • each module in the image decoding device 12000 is also applicable to the image encoding device 13000, and will not be described in detail here.
  • the above-mentioned memory 13001 may be used to store a program.
  • the processor 13002 is used to execute the program stored in the memory 13001.
  • the processor 13002 is used to execute each step of the image encoding method in the embodiment of the present application.
  • the image encoding device 13000 when it encodes an image, it can acquire the image through a communication interface, and then encode the acquired image to obtain encoded data.
  • the encoded data can be transmitted to the video decoding device through the communication interface 13003 .
  • the image encoding device 13000 When the image encoding device 13000 decodes an image, it can obtain a video image through a communication interface, and then decode the obtained image to obtain an image to be displayed.
  • the acquisition unit 11001 and the processing unit 11002 in the image encoding device 11000 described above are equivalent to the processor 13002 in the image encoding device 13000.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • 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, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • each unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • the technical solution of this application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program code .

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de codage d'images, un procédé et un dispositif de décodage d'images et un support d'informations. Le procédé de décodage d'images consiste : à obtenir un train de bits et à obtenir une image résiduelle d'une image de grille dans une séquence d'images selon le train de bits, la séquence d'images comprenant de multiples images de grille et des emplacements géographiques correspondant aux multiples images de grille étant proches ou le contenu d'image des multiples images de grille étant similaire ; à réaliser une prédiction inter-trame sur l'image de grille dans la séquence d'images, afin d'obtenir une image prédite de l'image de grille dans la séquence d'images ; et à obtenir l'image de grille dans la séquence d'images, selon l'image résiduelle de l'image de grille dans la séquence d'images et l'image prédite de l'image de grille dans la séquence d'images. Les modes de réalisation de la présente invention permettent de réduire le surdébit de stockage de train de bits.
PCT/CN2020/101886 2019-07-15 2020-07-14 Procédé et dispositif de codage d'images, procédé et dispositif de décodage d'images et support d'informations WO2021008524A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910636152.3 2019-07-15
CN201910636152.3A CN112235580A (zh) 2019-07-15 2019-07-15 图像编码方法、解码方法、装置和存储介质

Publications (1)

Publication Number Publication Date
WO2021008524A1 true WO2021008524A1 (fr) 2021-01-21

Family

ID=74111484

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/101886 WO2021008524A1 (fr) 2019-07-15 2020-07-14 Procédé et dispositif de codage d'images, procédé et dispositif de décodage d'images et support d'informations

Country Status (2)

Country Link
CN (1) CN112235580A (fr)
WO (1) WO2021008524A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117397239A (zh) * 2021-06-04 2024-01-12 华为技术有限公司 3d地图的编解码方法及装置
CN113765621B (zh) * 2021-08-24 2023-10-20 湖南遥昇通信技术有限公司 基于云字符概率表的数据编码系统以及方法
CN117579081B (zh) * 2023-11-23 2024-06-21 哈尔滨工程大学 一种二进制数据无损压缩方法、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006020217A (ja) * 2004-07-05 2006-01-19 Sharp Corp 画像符号化装置
CN102625126A (zh) * 2012-03-22 2012-08-01 北京工业大学 一种基于预测的三维网格编码方法
CN102684703A (zh) * 2012-04-26 2012-09-19 北京师范大学 一种高效的数字高程模型数据无损压缩的方法
CN103957341A (zh) * 2014-04-30 2014-07-30 华为软件技术有限公司 图片传输的方法及其相关设备

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2852773A1 (fr) * 2003-03-20 2004-09-24 France Telecom Procedes et dispositifs de codage et de decodage d'une sequence d'images par decomposition mouvement/texture et codage par ondelettes
US7804498B1 (en) * 2004-09-15 2010-09-28 Lewis N Graham Visualization and storage algorithms associated with processing point cloud data
US20080031325A1 (en) * 2006-08-03 2008-02-07 Yingyong Qi Mesh-based video compression with domain transformation
EP2356812B1 (fr) * 2008-11-12 2015-06-10 Cisco Technology, Inc. Traitement d'un programme vidéo ayant plusieurs représentations traitées d'un signal vidéo unique pour une reconstruction et une émission
EP2216750A1 (fr) * 2009-02-06 2010-08-11 Thomson Licensing Procédé et appareil de codage de modèles de maillage 3D, et procédé et appareil pour le décodage de modèles de maillage 3D
US20110002554A1 (en) * 2009-06-11 2011-01-06 Motorola, Inc. Digital image compression by residual decimation
CN101626509B (zh) * 2009-08-10 2011-02-02 北京工业大学 三维网格编码、解码方法及编码、解码装置
CN102595116B (zh) * 2011-01-14 2014-03-12 华为技术有限公司 多图像块划分的编解码方法和装置
US11514613B2 (en) * 2017-03-16 2022-11-29 Samsung Electronics Co., Ltd. Point cloud and mesh compression using image/video codecs
US10499054B2 (en) * 2017-10-12 2019-12-03 Mitsubishi Electric Research Laboratories, Inc. System and method for inter-frame predictive compression for point clouds

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006020217A (ja) * 2004-07-05 2006-01-19 Sharp Corp 画像符号化装置
CN102625126A (zh) * 2012-03-22 2012-08-01 北京工业大学 一种基于预测的三维网格编码方法
CN102684703A (zh) * 2012-04-26 2012-09-19 北京师范大学 一种高效的数字高程模型数据无损压缩的方法
CN103957341A (zh) * 2014-04-30 2014-07-30 华为软件技术有限公司 图片传输的方法及其相关设备

Also Published As

Publication number Publication date
CN112235580A (zh) 2021-01-15

Similar Documents

Publication Publication Date Title
CN115243039B (zh) 一种视频图像预测方法及装置
WO2020244579A1 (fr) Procédé de construction de liste mpm, procédé d'acquisition de mode de prédiction intra de bloc de chrominance et appareils
WO2020232845A1 (fr) Dispositif et procédé de prédiction intertrame
CN111277828B (zh) 视频编解码方法、视频编码器和视频解码器
WO2020228560A1 (fr) Procédé et dispositif d'obtention d'une liste de vecteurs de mouvement candidats, et codec
CN115243048B (zh) 视频图像解码、编码方法及装置
WO2021008524A1 (fr) Procédé et dispositif de codage d'images, procédé et dispositif de décodage d'images et support d'informations
CN112204962B (zh) 图像预测方法、装置和计算机可读存储介质
WO2020143589A1 (fr) Procédé et appareil de décodage vidéo, procédé et appareil de codage vidéo
WO2021008535A1 (fr) Procédé de codage d'image, procédé de décodage d'image, dispositif et support de stockage
US12010293B2 (en) Picture prediction method and apparatus, and computer-readable storage medium
WO2020135467A1 (fr) Procédé de prédiction inter-trames, dispositif et codeur et décodeur correspondants
WO2020088482A1 (fr) Procédé de prédiction inter-trame orienté mode de prédiction affine et appareil associé
WO2020253681A1 (fr) Procédé et dispositif pour construire une liste d'informations de mouvements candidats à la fusion et codec
WO2020182194A1 (fr) Procédé de prédiction inter-trames et dispositif associé
WO2020147514A1 (fr) Codeur vidéo, décodeur vidéo et procédé correspondant
WO2020155791A1 (fr) Procédé et dispositif de prédiction inter-trames
WO2020259353A1 (fr) Procédé de codage/décodage entropique d'élément syntaxique, dispositif et codec
CN111372086B (zh) 视频图像解码方法及装置
WO2020114393A1 (fr) Procédé de transformée, procédé de transformée inverse, codeur vidéo, et décodeur vidéo
CN113615191B (zh) 图像显示顺序的确定方法、装置和视频编解码设备
WO2020143292A1 (fr) Procédé et appareil de prédiction inter-trames
WO2020135368A1 (fr) Procédé et appareil de prédiction inter-trame
WO2020186882A1 (fr) Procédé et dispositif de traitement basé sur un mode d'unité de prédiction de triangle

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20841326

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20841326

Country of ref document: EP

Kind code of ref document: A1