A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method of compressing an encoded data stream having a plurality of data elements each element having a value, the method comprising the following operations performed for one or more subject video frames of the video stream: preprocessing element values of the subject video frame to yield corresponding error values of an error frame, each error value comprising a difference between the corresponding element value and a prediction of the element value based on values of surrounding element values by a predetermined predictive computation; computing a histogram of error values in the error frame; generating an entropy encoding map based upon the computed histogram; performing operations comprising: (a) applying the generated encoding map to compress a predetermined one of multiple subparts of the error frame in accordance with the computed histogram; (b) determining a compression ratio of the compressed subpart, and if said ratio fails to satisfy a predetermined threshold, regenerating the encoding map based upon a histogram of the predetermined subpart and applying the re-generated encoding map to re-compress the predetermined subpart; and for each remaining subpart of the error frame, repeating operations (a) and (b), where operation (a) utilizes one of the following: a most recently generated encoding map, an earlier generated encoding map; providing a compressed output comprising: each compressed subpart if the subgroup's compression ratio satisfied the predetermined threshold, otherwise the re-compressed subpart.
2. The method of claim 1 , all of the encoding maps comprising one of the following: Huffman code trees, range encoding maps, arithmetic encoding maps.
3. The method of claim 1 , wherein the predetermined subparts comprise one of the following: lines, rectangular areas, areas of other shapes.
4. At least one computer readable medium tangibly embodying a program of machine-readable instructions executable by a digital data processing machine to perform operations of compressing an encoded data stream having a plurality of data elements each element having a value, the method comprising the following operations performed for one or more subject video frames of the video stream: preprocessing element values of the subject video frame to yield corresponding error values of an error frame, each error value comprising a difference between the corresponding element value and a prediction of the element value based on values of surrounding element values by a predetermined predictive computation; computing a histogram of error values in the error frame; generating an entropy encoding map based upon the computed histogram; performing operations comprising: (a) applying the generated encoding map to compress a predetermined one of multiple subparts of the error frame in accordance with the computed histogram; (b) determining a compression ratio of the compressed subpart, and if said ratio fails to satisfy a predetermined threshold, regenerating the encoding map based upon a histogram of the predetermined subpart and applying the re-generated encoding map to re-compress the predetermined subpart; for each remaining subpart of the error frame, repeating operations (a) and (b), where operation (a) utilizes one of the following: a most recently generated encoding map, an earlier generated encoding map; and providing a compressed output comprising: each compressed subpart if the subgroup's compression ratio satisfied the predetermined threshold, otherwise the re-compressed subpart.
5. The medium of claim 4 , all of the encoding maps comprising one of the following: Huffman code trees, range encoding maps, arithmetic encoding maps.
6. The medium of claim 4 , wherein the predetermined subparts comprise one of the following: lines, rectangular areas, areas of other shapes.
7. Circuitry of multiple interconnected electrically conductive elements configured to perform operations of compressing an encoded data stream having a plurality of data elements each element having a value, the method comprising the following operations performed for one or more subject video frames of the video stream: preprocessing element values of the subject video frame to yield corresponding error values of an error frame, each error value comprising a difference between the corresponding element value and a prediction of the element value based on values of surrounding element values by a predetermined predictive computation; computing a histogram of error values in the error frame; generating an entropy encoding map based upon the computed histogram; performing operations comprising: (a) applying the generated encoding map to compress a predetermined one of multiple subparts of the error frame in accordance with the computed histogram; (b) determining a compression ratio of the compressed subpart, and if said ratio fails to satisfy a predetermined threshold, regenerating the encoding map based upon a histogram of the predetermined subpart and applying the re-generated encoding map to re-compress the predetermined subpart; for each remaining subpart of the error frame, repeating operations (a) and (b), where operation (a) utilizes one of the following: a most recently generated encoding map, an earlier generated encoding map; and providing a compressed output comprising: each compressed subpart if the subgroup's compression ratio satisfied the predetermined threshold, otherwise the re-compressed subpart.
8. The circuitry of claim 7 , all of the encoding maps comprising one of the following: Huffman code trees, range encoding maps, arithmetic encoding maps.
9. The circuitry of claim 7 , wherein the predetermined subparts comprise one of the following: lines, rectangular areas, areas of other shapes.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
March 24, 2005
September 23, 2008
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.