当前位置: X-MOL 学术Entropy › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Storage Space Allocation Strategy for Digital Data with Message Importance
Entropy ( IF 2.1 ) Pub Date : 2020-05-25 , DOI: 10.3390/e22050591
Shanyun Liu 1, 2 , Rui She 1, 2 , Zheqi Zhu 1, 2 , Pingyi Fan 1, 2
Affiliation  

This paper mainly focuses on the problem of lossy compression storage based on the data value that represents the subjective assessment of users when the storage size is still not enough after the conventional lossless data compression. To this end, we transform this problem to an optimization, which pursues the least importance-weighted reconstruction error in data reconstruction within limited total storage size, where the importance is adopted to characterize the data value from the viewpoint of users. Based on it, this paper puts forward an optimal allocation strategy in the storage of digital data by the exponential distortion measurement, which can make rational use of all the storage space. In fact, the theoretical results show that it is a kind of restrictive water-filling. It also characterizes the trade-off between the relative weighted reconstruction error and the available storage size. Consequently, if a relatively small part of total data value is allowed to lose, this strategy will improve the performance of data compression. Furthermore, this paper also presents that both the users’ preferences and the special characteristics of data distribution can trigger the small-probability event scenarios where only a fraction of data can cover the vast majority of users’ interests. Whether it is for one of the reasons above, the data with highly clustered message importance is beneficial to compression storage. In contrast, from the perspective of optimal storage space allocation based on data value, the data with a uniform information distribution is incompressible, which is consistent with that in the information theory.

中文翻译:


具有消息重要性的数字数据存储空间分配策略



本文主要针对传统无损数据压缩后存储规模仍不够用时,基于代表用户主观评价的数据值的有损压缩存储问题。为此,我们将这个问题转化为一种优化,在有限的总存储大小内追求数据重构中重要性加权重构误差最小,其中从用户的角度采用重要性来表征数据价值。在此基础上,通过指数失真测量提出了数字数据存储的优化分配策略,可以合理利用所有存储空间。事实上,理论结果表明,这是一种限制性充水。它还表征了相对加权重建误差和可用存储大小之间的权衡。因此,如果允许丢失总数据值中相对较小的一部分,则该策略将提高数据压缩的性能。此外,本文还提出,用户的偏好和数据分布的特殊性都可以触发小概率事件场景,即仅一小部分数据可以覆盖绝大多数用户的兴趣。无论是上述原因之一,消息重要性高度聚集的数据有利于压缩存储。相比之下,从基于数据价值优化存储空间分配的角度来看,信息分布均匀的数据是不可压缩的,这与信息论中的一致。
更新日期:2020-05-25
down
wechat
bug