Results 1 to 10 of about 931,367 (201)
l bnl compress: Lossy but not lossy compression, a python script to compress MX data [PDF]
Structural Dynamicsl_bnl_compress.py is a python script implementing the lossy compressions described in [1] for macromolecular crystallographic diffraction data. The lossy compressions use pixel-by-pixel binning, image-by-image summing, JPEG-2000 Daubechies (DB) wavelet ...
Herbert J Bernstein, Jean Jakoncic
doaj +3 more sources
Belief Propagation Optimization for Lossy Compression Based on Gaussian Source [PDF]
Sensors, 2023 In the Internet of Things, sensor nodes collect environmental information and utilize lossy compression for saving storage space. To achieve this objective, high-efficiency compression of the continuous source should be studied.
Huan Deng +4 more
doaj +2 more sources
Universality of Logarithmic Loss in Fixed-Length Lossy Compression [PDF]
Entropy, 2019 We established a universality of logarithmic loss over a finite alphabet as a distortion criterion in fixed-length lossy compression. For any fixed-length lossy-compression problem under an arbitrary distortion criterion, we show that there is an ...
Albert No
doaj +2 more sources
Fast digital lossy compression for X-ray ptychographic data. [PDF]
J Synchrotron Radiat, 2021 A lossy adaptive encoding scheme that can be implemented on a per-pixel basis in hybrid pixel array detectors is described. It is shown that this lossy compression scheme has no effect on X-ray ptychographic images even at low signal levels.
Huang P +4 more
europepmc +2 more sources
Lossy data compression with random gates [PDF]
Physical Review Letters, 2005 We introduce a new protocol for a lossy data compression algorithm which is based on constraint satisfaction gates. We show that the theoretical capacity of algorithms built from standard parity-check gates converges exponentially fast to the Shannon's ...
C. E. Shannon +9 more
core +5 more sources
Lossy Compression With Universal Distortion [PDF]
IEEE Transactions on Information Theory, 2021 We consider a novel variant of $d$ -semifaithful lossy coding in which the distortion measure is revealed only to the encoder and only at run-time, as well as an extension of it in which the distortion constraint $d$ is also revealed at run-time.
A. Mahmood, Aaron B. Wagner
semanticscholar +3 more sources
The evolution of lossy compression. [PDF]
J R Soc Interface, 2017 In complex environments, there are costs to both ignorance and perception. An organism needs to track fitness-relevant information about its world, but the more information it tracks, the more resources it must devote to perception. As a first step towards a general understanding of this trade-off, we use a tool from information theory, rate–distortion
Marzen SE, DeDeo S.
europepmc +5 more sources
Rateless Lossy Compression via the Extremes. [PDF]
IEEE Trans Inf Theory, 2016 We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components based on this information. This scheme turns out to be near-optimal for the memoryless Gaussian source in the sense
No A, Weissman T.
europepmc +6 more sources
Toward Extreme Lossy Compression Data to Enable Higher Data Rates MX [PDF]
Structural DynamicsAt last, a useful lossy compression method is available for MX crystallographic data. One could achieve a compression ratio as high as 3000 to 1, but with data loss so high that structural data can’t be interpreted faithfully.
Jean Jakoncic, Herbert J Bernstein
doaj +2 more sources
One-shot lossy quantum data compression [PDF]
IEEE Transactions on Information Theory, 2013 We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression ...
Datta, Nilanjana +3 more
core +5 more sources