Method for image encoding

Patent metadata

Field	Value
Publication number	US-2025386052-A1
Application number	US-202318875651-A
Country	US
Kind code	A1
Filing date	Jun 16, 2023
Priority date	Jun 16, 2022
Publication date	Dec 18, 2025
Grant date	—

Abstract

A method for encoding data defining an image is disclosed. The method comprises segmenting the image into image blocks having a uniform size; and applying a frequency-based transform to each resulting in transformed image data in which the image data is represented as coefficients defining a linear combination of predetermined basis functions having different spatial frequencies, with each block of transformed image data having one coefficient for a zero frequency basis function, and a plurality of coefficients for higher frequency basis functions, which are grouped into one or more sub-bands. The blocks of transformed image data are grouped into slices, and the coefficients are converted into binary code using an allocation method to allocate bits associated with coefficients in each sub-band in a slice amongst-substantially same length bins. Bits associated with each sub-band in each slice are assigned to a bin and transferred, if needed, to achieve the substantially same length.

First claim

1 . A method for encoding data defining an image, the method comprising the steps of:
(a) segmenting the image into image blocks, the image blocks having a uniform block size; (b) applying a frequency-based transform to each of the image blocks, thereby providing transformed image data in which the image data is represented as coefficients defining a linear combination of predetermined basis functions having different spatial frequencies; such that each block of transformed image data comprises one zero-frequency coefficient for a zero frequency basis function, and one or more sub-bands of higher-frequency coefficients, each of the one or more sub-bands comprising a number of coefficients for a predetermined set of the higher frequency basis functions; (c) grouping the blocks of transformed image data into slices, each slice comprising a plurality of blocks of transformed image data; (d) converting the coefficients into bits of binary code, the zero-frequency coefficients being converted to binary code using a fixed length coding scheme, and the higher frequency coefficients being converted to binary code using a variable length coding scheme; and, for each slice, allocating the bits representing said each slice to a position in a bitstream using an allocation method, the allocation method comprising:
(i) defining a number of bins in the bitstream, the bins each having a uniform size, and each of the bins having an associated one of the plurality of blocks;
(ii) allocating bits representing a selected one of the one or more sub-bands of each of the plurality of blocks to the bin associated with said each of the plurality of blocks;
(iii) if the number of bits in a first of the bins is greater than the uniform size, transferring excess bits to a second of the bins, the second of the bins being selected according to a predetermined order;
the allocation method being such that each bin starts with bits representing its associated block; and repeating the allocation method for all of the one or more sub-bands.

2 . The method of claim 1 , wherein the allocation method is repeated iteratively, and the allocation method is terminated after a predetermined number of iterations have been completed.

3 . The method of claim 1 , wherein the number of bins is equal to the number of blocks in the slice.

4 . The method of claim 1 , further comprising the step of grouping the blocks into two or more sets of blocks, prior to grouping the blocks into slices.

5 . The method of claim 4 , wherein the step of grouping the blocks into two or more sets of blocks is performed such that the blocks in any one of the sets do not share any boundaries.

6 . The method of claim 5 , wherein there are two sets of blocks, and the two sets interlock.

7 . The method of claim 4 , wherein each slice comprises a number of consecutive blocks in one of the sets of blocks.

8 . The method of claim 1 , wherein each slice comprises a reference block, and the method further comprising the step of replacing the each of the coefficients in subsequent blocks in said each slice with a prediction, the prediction being based on a corresponding coefficient in the reference block.

9 . The method of claim 1 , wherein the step of converting the higher frequency coefficients into binary code comprises applying binary arithmetic coding using a probability model.

10 . The method of claim 9 , wherein the probability model is tailored based on a sample set of representative images.

11 . The method of claim 1 , wherein the coefficients for each of the one or more sub-bands are arranged in a predetermined order so as to form a vector, which vector has a gain and a unit length direction, and wherein the unit length direction is quantised by constraining its component terms to be integers, and constraining a sum of those component terms to be equal to a predetermined value K.

12 . The method of claim 1 , further comprises inserting, at the end of the bits representing a selected one of the one or more sub-bands of each of the plurality of blocks, an end of slice code word.

13 . A method of decoding a bit stream to reconstruct an image, which image has been encoded according to the method of claim 1 , the method of decoding comprising inverting the steps performed in encoding the image.

14 . The method of claim 13 , wherein the image has been encoded where the coefficients for each of the one or more sub-bands are arranged in a predetermined order so as to form a vector, which vector has a gain and a unit length direction, and wherein the unit length direction is quantised by constraining its component terms to be integers, and constraining a sum of those component terms to be equal to a predetermined value K; and wherein the method of decoding comprises inverting the steps performed in encoding the image; and the method further comprising the step of checking that the component terms sum to the predetermined value K.

15 . The method of claim 14 , wherein, if the component terms do not sum to the predetermined value K, an error is identified.

16 . The method of claim 14 , wherein, if the component terms do not sum to the predetermined value K, the largest component term is adjusted such that the component terms sum to the predetermined value K.

17 . The method of claim 13 , wherein the image has been encoded where each slice comprises a reference block, and the encoding further comprising the step of replacing the each of the coefficients in subsequent blocks in said each slice with a prediction, the prediction being based on a corresponding coefficient in the reference block; and wherein the method of decoding comprises inverting the steps performed in encoding the image;
and the method further comprises imposing a cap on a magnitude of predicted coefficients.

18 . (canceled)

19 . (canceled)

20 . (canceled)

21 . A method of encoding a series of image frames including at least a current frame and a preceding frame, each of the frames being encoded according to the method of claim 1 .

22 . A One or more non-transitory computer-readable medium having stored thereon data defining an image, which data has been encoded according to the method of claim 1 .

23 . One or more non-transitory computer-readable medium comprising instructions which. when the instructions are executed by a computer, cause the computer to carry out the method of claim 1 .

24 . (canceled)

Assignees

• Mbda Uk Ltd

Inventors

• Mackin Alex

Classifications

• H04N19/91 Primary

  Entropy coding, e.g. variable length coding [VLC] or arithmetic coding · CPC title

• H04N19/61

  in combination with predictive coding · CPC title

• H04N19/625 Primary

  using discrete cosine transform [DCT] · CPC title

• H04N19/60

  using transform coding · CPC title

• H04N19/94

  Vector quantisation · CPC title