Methods and apparatuses for hierarchically encoding and decoding a bytestream

Patent metadata

Field	Value
Publication number	US-12413754-B2
Application number	US-202418438234-A
Country	US
Kind code	B2
Filing date	Feb 9, 2024
Priority date	Dec 6, 2017
Publication date	Sep 9, 2025
Grant date	Sep 9, 2025

Abstract

There may be provided a method of decoding a received set of encoded data representing information that has been compressed, wherein the encoded data set is divided into a hierarchy of subsets, the method comprising: decoding at least one first subset to derive a respective set of attribute metadata elements; separately decoding a plurality of second subsets comprising data elements, wherein each second subset describes a region of the information that has been compressed; and, reconstructing the information that has been compressed from the data elements, wherein the region of the information that has been compressed is identified from the attribute metadata elements.

First claim

The invention claimed is:

1. A method of decoding a received set of encoded data representing information that has been compressed, the encoded data set comprising a plurality of subsets, each subset representing a region of the information that has been compressed, the method comprising:
receiving the encoded data set;
retrieving signalled size dimensions of the information that has been compressed;
based on the signalled size dimensions, identifying a maximum amount of subsets expected in the data set, the subsets comprising a predetermined maximum amount of encoded data elements, and identifying an expected amount of data elements to be represented by each subset;
decoding the encoded data set to derive a set of data elements based on the expected amount of data elements represented by each subset; and,
reconstructing the information that has been compressed using the derived set of data elements.

2. The method according to claim 1 , wherein the step of identifying an expected amount of data elements within each subset is based on an order the subsets are retrieved from the encoded data set.

3. The method according to claim 1 , wherein the step of identifying an expected amount of data elements within each subset is based on a defined mapping order of the subsets to the corresponding region of the information that has been compressed.

4. The method according to claim 3 , wherein the step of decoding the encoded dataset comprises masking any data or metadata in the encoded data set which corresponds to a location in the information that has been compressed outside of the signalled size dimensions based on the defined mapping order of the subsets.

5. The method according to any of claim 1 , wherein each subset is a data structure comprising metadata elements and data symbols.

6. The method according to claim 5 , further comprising:
based on the signalled size dimensions, identifying which metadata elements comprise relevant metadata and which contain dummy metadata.

7. The method according to claim 6 , ignoring dummy metadata.

8. The method according to any of claim 5 , further comprising:
based on the signalled dimensions, identifying a structure of the data structure.

9. The method according to any of claim 5 , wherein each data structure is associated with a square array of data elements and wherein each metadata element corresponds to a square sub-array of the square array.

10. The method according to any of claim 5 , wherein the data structure only comprises data symbols for information that has been compressed within the size dimensions, based on a defined mapping order of the data symbols to the information that has been compressed.

11. The method according to any of claim 5 , wherein the signalled dimensions indicate portions of the data structure do not contain data elements.

12. The method according to any of claim 1 , wherein the step of reconstructing comprises:
mapping each derived data element to a location in an array based on a defined order and the signalled size dimensions, such that derived data elements are placed only at locations within the signalled size dimensions.

13. An apparatus for decoding a received set of encoded data representing information that has been compressed, comprising a processor configured to:
receive the encoded data set;
retrieve signalled size dimensions of the information that has been compressed;
based on the signalled size dimensions, identify a maximum amount of subsets expected in the data set, the subsets comprising a predetermined maximum amount of encoded data elements, and identify an expected amount of data elements to be represented by each subset;
decode the encoded data set to derive a set of data elements based on the expected amount of data elements represented by each subset; and,
reconstruct the information that has been compressed using the derived set of data elements.

14. A method of encoding information to be compressed into a set of encoded data, the encoded data set comprising a plurality of subsets, each subset representing a region of the information that has been compressed, the method comprising:
identifying size dimensions of the information to be compressed;
signalling the size dimensions of the information that has been compressed; and
encoding data elements of the information to be compressed into the plurality of subsets, the subsets comprising a predetermined maximum amount of encoded data elements.

15. The method according to claim 14 , wherein the step of encoding the data elements comprises inserting data or metadata in the encoded data set which corresponds to a location in the information that has been compressed outside of the signalled size dimensions.

16. The method according to claim 14 , wherein each subset is a data structure comprising metadata elements and data symbols.

17. The method according to claim 16 , further comprising:
inserting dummy metadata elements in the data structure.

18. The method according to claim 16 , wherein each data structure is associated with a square array of data elements and wherein each metadata element corresponds to a square sub-array of the square array.

19. The method according to any of claim 16 , wherein the data structure only comprises data symbols for information that has been compressed within the size dimensions, based on a defined mapping order of the data symbols to the information that has been compressed.

20. The method according to claim 14 , wherein the step of encoding comprises:
mapping each location in an array to a subset based on a defined order and the signalled size dimensions, such that derived data elements from the encoded data set are placed only at locations within the signalled size dimensions.

Assignees

• V Nova Int Ltd

Inventors

• Makeev Ivan
• Keszthelyi Balázs
• Poularakis Stergios
• Sanna Michele
• Ettinger Robert

Classifications

• H04N19/91

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

• H04N19/182

  the unit being a pixel · CPC title

• H04N19/44

  Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder · CPC title

• H04N19/129

  Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO] · CPC title

• H04N19/96

  Tree coding, e.g. quad-tree coding · CPC title