Random accessible image data compression

Patent metadata

Field	Value
Publication number	US-12367614-B2
Application number	US-202418586746-A
Country	US
Kind code	B2
Filing date	Feb 26, 2024
Priority date	Aug 23, 2019
Publication date	Jul 22, 2025
Grant date	Jul 22, 2025

Abstract

Methods and compression units for compressing a block of image data, the block of image data comprising a plurality of image element values, the image element values being divisible into at least a first value and a second value such that the block of image data comprises a two-dimensional block of first values, the method comprising: compressing a first data set comprising all or a portion of the two-dimensional block of first values in accordance with a first fixed-length compression algorithm to generate a first compressed block by: identifying common base information for the first data set; and identifying a fixed-length parameter for each first value in the first data set, the fixed-length parameter being zero, one or more than one bits in length; and forming a compressed block for the block of image data based on the first compressed block.

First claim

What is claimed is:

1. A lossless method of compressing a block of image data, the block of image data comprising a plurality of image element values that are divided into a plurality of sub-blocks of image element values, each image element value being divisible into at least a first value and a second value, the method comprising:
generating a compressed block for the block of image data that comprises a data unit for each image element value, each data unit comprising (i) first data representing the first value of the corresponding image element value, and (ii) second data, different to the first data, representing the second value of the corresponding image element value;
wherein the first data for each image element value in a same sub-block is a same size and is generated by a same fixed-length compression algorithm of one or more fixed-length compression algorithms and the second data for each image element value in a same sub-block is a same size and is generated by a same fixed-length compression algorithm of the one or more fixed-length compression algorithms; and
wherein the first value of each image element value in a same sub-block is obtainable from the first data representing that first value and common base information in the compressed block that is common to first values in the sub-block and the second value of each image element value in a same sub-block is obtainable from the second data representing that second value and common base information in the compressed block that is common to second values in the sub-block.

2. The method of claim 1 , wherein the first data for each image element value in a first set of one or more sub-blocks is generated by a same fixed-length compression algorithm of the one or more fixed-length compression algorithms and the compressed block comprises common base information that is common to the first values in the first set of one or more sub-blocks.

3. The method of claim 2 , wherein the second data for each image element value in a second set of one or more sub-blocks is generated by a same fixed-length compression algorithm of the one or more fixed-length compression algorithms and the compressed block comprises common base information that is common to the second values in the second set of one or more sub-blocks.

4. The method of claim 3 , wherein the first set of one or more sub-blocks comprises a different number of sub-blocks than the second set of one or more sub-blocks.

5. The method of claim 3 , further comprising:
dynamically selecting the second set of one or more sub-blocks;
determining whether the second values in the plurality of sub-blocks can be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms;
in response to determining that the second values in the plurality of sub-blocks can be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms, selecting the plurality of sub-blocks as the second set of one or more sub-blocks; and
in response to determining that the second values in the plurality of sub-blocks cannot be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms, selecting a subset of the plurality of sub-blocks as the second set of one or more sub-blocks.

6. The method of claim 3 , wherein the first set of one or more sub-blocks comprises a different number of sub-blocks from the second set of one or more sub-blocks.

7. The method of claim 1 , further comprising, dynamically selecting the first set of one or more sub-blocks by:
determining whether the first values in the plurality sub-blocks can be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms;
in response to determining that the first values in the plurality of sub-blocks can be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms, selecting the plurality of sub-blocks as the first set of one or more sub-blocks; and
in response to determining that the first values in the plurality of sub-blocks cannot be suitably compressed as a unit using a fixed-length compression algorithm of the one or more fixed-length compression algorithms, selecting a subset of the plurality of sub-blocks as the first set of one or more sub-blocks.

8. The method of claim 1 , wherein the fixed-length compression algorithm used to generate the first data for the first values in a sub-block is different to the fixed-length compression algorithm used to generate the second data for the second values in the sub-block.

9. The method of claim 1 , wherein the one or more fixed-length compression algorithms comprises a plurality of fixed-length compression algorithms, the method further comprising:
analysing the first values in a set of one or more sub-blocks to generate one or more diversity statistics, the one or more diversity statistics include one or more of: a range of first values in the set of one or more sub-blocks, a minimum first value in the set of one or more sub-blocks, a maximum first value in the set of one or more sub-blocks, and a number of unique first values in the set of one or more sub-blocks; and
selecting one of the plurality of fixed-length compression algorithms to be used to generate the first data for the first values in the set of one or more sub-blocks based on the one or more diversity statistics.

10. The method of claim 1 , wherein the one or more fixed-length compression algorithms comprises a fixed length compression algorithm in which if each first value in a set of one or more sub-blocks is the same and matches one of one or more predetermined values, the common base information for the first values of the set of one or more sub-blocks contains information identifying said one of the one or more predetermined values, and the first data for each first value in the set of one or more sub-blocks has zero bits.

11. The method of claim 1 , wherein each sub-block has a same size.

12. The method of claim 1 , wherein the one or more fixed-length compression algorithms comprises a fixed-length compression algorithm in which the common base information for the first values in a set of one or more sub-blocks comprises an origin based on the first values in the set of one or more sub-blocks and the first data for each first value in the set of one or more sub-blocks comprises a difference between the first value and the origin.

13. The method of claim 1 , wherein the one or more fixed-length compression algorithms comprises a fixed-length compression algorithm in which the common base information for the first values in a set of one or more sub-blocks comprises a plurality of origins based on the first values in the set of one or more sub-blocks and the first data for each first value in the set of one or more sub-blocks comprises an index identifying one of the plurality of origins and a difference between the value and that origin.

14. The method of claim 1 , wherein the one or more fixed-length compression algorithms comprises a fixed-length compression algorithm in which the common base information for the first values in a set of one or more sub-blocks comprises a look-up table of unique first values in the set of one or more sub-blocks and the first data for a first value in the set of one or more sub-blocks comprises an index to the look-up table.

15. The method of claim 1 , wherein the one or more fixed-length compression al

Assignees

• Imagination Tech Ltd

Inventors

• Yang Xile

Classifications

• G06T3/40

  Scaling of whole images or parts thereof, e.g. expanding or contracting · CPC title

• G06F7/727

  Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1, e.g. mod 3, mod 4 or mod 5 (G06F7/728 takes precedence) · CPC title

• G06F7/50

  Adding; Subtracting (G06F7/483 - G06F7/491, G06F7/544 - G06F7/556 take precedence) · CPC title

• H04N19/192

  the adaptation method, adaptation tool or adaptation type being iterative or recursive · CPC title

• H04N19/136

  Incoming video signal characteristics or properties · CPC title