Data compression by hamming distance categorization
US9935652B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 2, 2017 |
| Grant date | Apr 3, 2018 |
| Priority date | — |
| Expiry date | Oct 2, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/14
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
Data is compressed based on non-identical similarity between a first data set and a second data set. A representation of the differences is used to represent one of the data sets. For example, a probabilistically unique value may be generated as a new block label. Probabilistic comparison of the new block label with a plurality of training labels associated with training blocks produces a plurality of training labels that are potentially similar to the new block label. The Hamming distance between each potentially similar training label and the new block label is determined to select the training label with the smallest calculated Hamming distance from the new block label. A bitmap of differences between the new block and the training block associated with the selected training label is compressed and stored as a compressed representation of the new block.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.