Fourier transform bounded Kolmogorov complexity

被引：2

作者：

Terry-Jack, Mohammed ^{[1
]}

O'Keefe, Simon ^{[1
]}

机构：

[1] Univ York, York YO10 5DD, England

来源：

PHYSICA D-NONLINEAR PHENOMENA | 2023年 / 453卷

关键词：

Discrete Fourier transform; Lossless compression; Quantisation; Binarisation; Kolmogorov complexity; Algorithmic information theory;

D O I：

10.1016/j.physd.2023.133824

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The Discrete Fourier Transform (DFT) has been extended to lossless compression for binary images. Binarisation is key for DFT to compress losslessly because there exist lossy reconstructions (within a specific range of loss values) which are error-corrected during the binarisation step, effectively making the image lossless. In an ironic twist, the quantisation effect which usually introduces errors, has been utilised to remove noise from lossy reconstructions.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

引用

页数：7

共 19 条

[1]

Chowdhury MMH., 2012, Int. J. Comput. Sci. Issues, V9, P327

[2] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].