Bounding Lossy Compression using Lossless Codes at Reduced Precision
classification
💻 cs.MM
cs.ITmath.IT
keywords
compressionlosslessprecisionreducedapproachcodedatalossy
read the original abstract
An alternative approach to two-part 'critical compression' is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar lossless code at reduced precision to establish absolute bounds which constrain an arbitrary lossy data compression algorithm applied to the original data.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.