Estimating the probability law of the codelength as a function of the approximation error in image compression
classification
🧮 math.OC
keywords
compressionapproximationerrorfunctionimageprobabilitycodedcodelength
read the original abstract
After a recollection on compression through a projection onto a polyhedral set (which generalizes the compression by coordinates quantization), we express, in this framework, the probability that an image is coded with $K$ coefficients as an explicit function of the approximation error.
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.