User Preference Aware Lossless Data Compression at the Edge

03/29/2019
by   Yawei Lu, et al.
0

Data compression is an efficient technique to save data storage and transmission costs. However, traditional data compression methods always ignore the impact of user preferences on the statistical distributions of symbols transmitted over the links. Notice that the development of big data technologies and popularization of smart devices enable analyses on user preferences based on data collected from personal handsets. This paper presents a user preference aware lossless data compression method, termed edge source coding, to compress data at the network edge. An optimization problem is formulated to minimize the expected number of bits needed to represent a requested content item in edge source coding. For edge source coding under discrete user preferences, DCA (difference of convex functions programming algorithm) based and k-means++ based algorithms are proposed to give codebook designs. For edge source coding under continuous user preferences, a sampling method is applied to give codebook designs. In addition, edge source coding is extended to the two-user case and codebooks are elaborately designed to utilize multicasting opportunities. Both theoretical analysis and simulations demonstrate the optimal codebook design should take into account user preferences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2022

Survey on Source-coding technique

Shannon separation theorem lays the foundation for traditional image com...
research
03/07/2022

Compression of user generated content using denoised references

Video shared over the internet is commonly referred to as user generated...
research
02/21/2023

Predicting Privacy Preferences for Smart Devices as Norms

Smart devices, such as smart speakers, are becoming ubiquitous, and user...
research
06/19/2023

Parallel Data Compression Techniques

With endless amounts of data and very limited bandwidth, fast data compr...
research
03/06/2020

Learning the Designer's Preferences to Drive Evolution

This paper presents the Designer Preference Model, a data-driven solutio...
research
01/30/2022

Fast Relative Entropy Coding with A* coding

Relative entropy coding (REC) algorithms encode a sample from a target d...
research
12/09/2022

Graph theoretical models and algorithms of portfolio compression

In portfolio compression, market participants (banks, organizations, com...

Please sign up or login with your details

Forgot password? Click here to reset