A new technique for compression of data sets
Anatoli Torokhti

TL;DR
This paper introduces a novel data compression technique using a flexible transform composed of polynomial sub-transforms, significantly enhancing accuracy, compression ratio, and computational efficiency.
Contribution
It presents a new transform method with adjustable parameters that improves all key performance indices of data compression.
Findings
Enhanced compression ratio and accuracy
Reduced computational work
Increased flexibility in data variation handling
Abstract
Data compression techniques are characterized by four key performance indices which are (i) associated accuracy, (ii) compression ratio, (iii) computational work, and (iv) degree of freedom. The method of data compression developed in this paper allows us to substantially improve all the four issues above. The proposed transform is presented in the form of a sum with terms, , where each term is a particular sub-transform presented by a first degree polynomial. For , each sub-transform is determined from interpolation-like conditions. This device provides the transform flexibility to incorporate variation of observed data and leads to performance improvement. The transform has two degrees of freedom, the number of sub-transforms and associated compression ratio associated with each sub-transform .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Digital Filter Design and Implementation · Advanced Data Compression Techniques
