Terry-Jack, Mohammed and O'Keefe, Simon orcid.org/0000-0001-5957-2474 (2023) Fourier transform bounded Kolmogorov complexity. Physica D: Nonlinear Phenomena. ISSN 0167-2789
Abstract
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 04 Jul 2023 14:00 |
Last Modified: | 16 Oct 2024 19:17 |
Published Version: | https://doi.org/10.1016/j.physd.2023.133824 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1016/j.physd.2023.133824 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:201213 |
Download
Filename: 1_s2.0_S0167278923001781_main.pdf
Description: 1-s2.0-S0167278923001781-main
Licence: CC-BY 2.5