Lossless Compression Method for Downhole Correlative Waveforms Data

Author(s):  
M. Cai ◽  
W. Qiao ◽  
X. Ju ◽  
X. Che ◽  
J. Lu
Author(s):  
N. Karthika Devi ◽  
G. Mahendran ◽  
S. Murugeswari ◽  
S. Praveen Samuel Washburn ◽  
D. Archana Devi ◽  
...  

Author(s):  
ShenChuan Tai ◽  
TseMing Kuo ◽  
ChengHan Ho ◽  
TzuWen Liao

Entropy ◽  
2019 ◽  
Vol 21 (11) ◽  
pp. 1062 ◽  
Author(s):  
Yuhang Dong ◽  
W. David Pan ◽  
Dongsheng Wu

Malaria is a severe public health problem worldwide, with some developing countries being most affected. Reliable remote diagnosis of malaria infection will benefit from efficient compression of high-resolution microscopic images. This paper addresses a lossless compression of malaria-infected red blood cell images using deep learning. Specifically, we investigate a practical approach where images are first classified before being compressed using stacked autoencoders. We provide probabilistic analysis on the impact of misclassification rates on compression performance in terms of the information-theoretic measure of entropy. We then use malaria infection image datasets to evaluate the relations between misclassification rates and actually obtainable compressed bit rates using Golomb–Rice codes. Simulation results show that the joint pattern classification/compression method provides more efficient compression than several mainstream lossless compression techniques, such as JPEG2000, JPEG-LS, CALIC, and WebP, by exploiting common features extracted by deep learning on large datasets. This study provides new insight into the interplay between classification accuracy and compression bitrates. The proposed compression method can find useful telemedicine applications where efficient storage and rapid transfer of large image datasets is desirable.


2009 ◽  
Author(s):  
Ruizhi Ren ◽  
Shuxu Guo ◽  
Lingjia Gu ◽  
Lang Wang ◽  
Xu Wang

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 196
Author(s):  
Shmuel T. Klein ◽  
Dana Shapira

It seems reasonable to expect from a good compression method that its output should not be further compressible, because it should behave essentially like random data. We investigate this premise for a variety of known lossless compression techniques, and find that, surprisingly, there is much variability in the randomness, depending on the chosen method. Arithmetic coding seems to produce perfectly random output, whereas that of Huffman or Ziv-Lempel coding still contains many dependencies. In particular, the output of Huffman coding has already been proven to be random under certain conditions, and we present evidence here that arithmetic coding may produce an output that is identical to that of Huffman.


Sign in / Sign up

Export Citation Format

Share Document