Emergent Mind
Bounding Lossy Compression using Lossless Codes at Reduced Precision
(1301.0026)
Published Dec 31, 2012
in
cs.MM
,
cs.IT
,
and
math.IT
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.