Systems and methods for model-free compression and model-based decompression
AssigneeMassachusettes Institute of Technology
InventorsYing-Zong Huang, Gregory W. Wornell
Life of this patent
Estimating the term…
Abstract
An encoder generates a compressed data sequence from an original data sequence using many-to-one mapping independently of a source model associated with the original data sequence and without extracting the source model. A decoder uses both the source model associated with the original data sequence and the mapping applied during compression that is devoid of, in substance, the source model, to regenerate, at least in part, the original uncompressed data sequence from the compressed data sequence that does not include a significant portion of the source model.
Claims27
A computer implemented method of decompressing a compressed data sequence comprising a set of k symbols and being devoid of a significant portion of a source model associated with a data sequence from which the compressed data sequence was derived, the method comprising:
- generating by a processor an uncompressed data sequence comprising n symbols, wherein n is greater than k, by applying by the processor to the set of k symbols of the compressed data sequence:
- a plurality of constraints devoid of a significant portion of the source model;
- and
- at least one rule derived from the source model.
A computer implemented method of compressing a data sequence comprising a set of n symbols, the method comprising:
- receiving by a processor a data sequence comprising a set of n symbols and corresponding to a source model;
- and
- mapping by the processor the set of n symbols into a set of k symbols, wherein k is less than n, the mapping being independent of the source model and being performed without extracting the source model from the data sequence.
A system for decompressing a compressed data sequence comprising a set of k symbols and being devoid of a significant portion of a source model associated with a data sequence from which the compressed data sequence was derived, the system comprising:
- a first processor;
- and
- a first memory in electrical communication with the first processor, the first memory comprising instructions which, when executed by a processing unit comprising at least one of the first processor and a second processor, program the processing unit to:
- generate, from the compressed data sequence, an uncompressed data sequence comprising n symbols, where n is greater than k, by applying to the set of k symbols of the compressed data sequence:
- a plurality of constraints devoid of a significant portion of the source model;
- and
- at least one rule derived from the source model.
A system for compressing a data sequence comprising a set of n symbols, the system comprising:
- a first processor;
- and
- a first memory in electrical communication with the first processor, the first memory comprising instructions which, when executed by a processing unit comprising at least one of the first processor and a second processor, program the processing unit to:
- map the set of n symbols into a set of k symbols, where k is less than n, the mapping being independent of a source model corresponding to the data sequence and being performed without extracting the source model from the data sequence.
Dependencies are inferred from the claim text.