HIERARCHICAL LOSSLESS COMPRESSION
First Claim
1. A hierarchical data compression method comprising a computer performing the steps of:
- compressing a plurality of primary subarrays into compressed subarrays such that a plurality of compressed subarrays are formed, wherein the plurality of primary subarrays form a primary array;
arranging the compressed subarrays into a secondary array; and
repeating the compressing and arranging until a single subarray remains, wherein the secondary array becomes the primary array for the repetition of said compressing and arranging.
1 Assignment
0 Petitions
Accused Products
Abstract
A method is provided for data compression. The data compression method transforms a square of data into a tile of data. The tile of data is then divided into quads of data that are converted into a representative element, a first delta element, a second delta element, a third delta element, and a control word. A new tile of data is then formed with the representative elements, and the process is repeated until a single representative element remains. The single representative element is then embedded into an output stream with the control words and corresponding delta elements. Decompression of the data is symmetrical to the encoding once the bit stream has been parsed.
-
Citations
24 Claims
-
1. A hierarchical data compression method comprising a computer performing the steps of:
-
compressing a plurality of primary subarrays into compressed subarrays such that a plurality of compressed subarrays are formed, wherein the plurality of primary subarrays form a primary array; arranging the compressed subarrays into a secondary array; and repeating the compressing and arranging until a single subarray remains, wherein the secondary array becomes the primary array for the repetition of said compressing and arranging. - View Dependent Claims (2)
-
-
3. A data compression method comprising a computer performing the steps of:
-
providing a square of data; transforming the square of data into a tile of data; dividing the tile of data into quads of data, each quad having an upper left pixel, an upper right pixel, a lower left pixel, and a lower right pixel; converting each quad into a representative element, a first delta element, a second delta element, a third delta element, and a control word; forming a new tile of data with the representative elements; repeating the dividing, the converting, and the forming until a single representative element remains, wherein the new tile of data becomes the tile of data for the repetition of the dividing, converting and forming steps; and embedding the single representative element, the control words and the delta elements into an output stream. - View Dependent Claims (4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A program storage device readable by a machine, tangibly embodying a program of instructions executable to perform a data compression method comprising:
-
providing a square of data; transforming the square of data into a tile of data; dividing the tile of data into quads of data, each quad having an upper left pixel, an upper right pixel, a lower left pixel, and a lower right pixel; converting each quad into a representative element, a first delta element, a second delta element, a third delta element, and a control word; forming a new tile of data with the representative elements; repeating the dividing, the converting, and the forming until a single representative element remains, wherein the new tile of data becomes the tile of data for the repetition of the dividing, converting and forming steps; and embedding the single representative element, the control words and the delta elements into an output stream. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
Specification