scholarly journals On the Randomness of Compressed Data

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 196
Author(s):  
Shmuel T. Klein ◽  
Dana Shapira
Keyword(s):  
Lossless Compression ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Compression Method ◽  
Random Data ◽  
Present Evidence ◽  
Compressed Data ◽  
Good Compression

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.

scholarly journals CRUSH: A New Lossless Compression Algorithm

2018 ◽  
Vol 12 (11) ◽  
pp. 387
Author(s):  
Evon Abu-Taieh ◽  
Issam AlHadid
Keyword(s):  
Data Structures ◽  
Time Complexity ◽  
Lossless Compression ◽  
Haar Wavelet ◽  
Compression Algorithm ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Compression Algorithms ◽  
Run Length

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon–Fano code, Huffman coding, Run Length Encoding, Arithmetic Coding, Lempel-Ziv-Welch (LZW), Run Length Encoding (RLE), Burrows-Wheeler Transform.Move-to-Front (MTF) Transform, Haar, wavelet tree, Delta Encoding, Rice &Golomb Coding, Tunstall coding, DEFLATE algorithm, Run-Length Golomb-Rice (RLGR).

scholarly journals New Lossless Compression Method using Cyclic Reversible Low Contrast Mapping (CRLCM)

2016 ◽  
Vol 6 (6) ◽  
pp. 2836
Author(s):  
Hendra Mesra ◽  
Handayani Tjandrasa ◽  
Chastine Fatichah
Keyword(s):  
Compression Ratio ◽  
Image Data ◽  
Lossless Compression ◽  
Huffman Coding ◽  
Compression Method ◽  
Low Contrast ◽  
Coding Method

<p>In general, the compression method is developed to reduce the redundancy of data. This study uses a different approach to embed some bits of datum in image data into other datum using a Reversible Low Contrast Mapping (RLCM) transformation. Besides using the RLCM for embedding, this method also applies the properties of RLCM to compress the datum before it is embedded. In its algorithm, the proposed method engages Queue and Recursive Indexing. The algorithm encodes the data in a cyclic manner. In contrast to RLCM, the proposed method is a coding method as Huffman coding. This research uses publicly available image data to examine the proposed method. For all testing images, the proposed method has higher compression ratio than the Huffman coding.</p>

scholarly journals CRUSH: A New Lossless Compression Algorithm

2018 ◽  
Vol 12 (11) ◽  
pp. 406
Author(s):  
Evon Abu-Taieh ◽  
Issam AlHadid
Keyword(s):  
Data Structures ◽  
Time Complexity ◽  
Lossless Compression ◽  
Haar Wavelet ◽  
Compression Algorithm ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Compression Algorithms ◽  
Run Length

Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon&ndash;Fano code, Huffman coding, Run Length Encoding, Arithmetic Coding, Lempel-Ziv-Welch (LZW), Run Length Encoding (RLE), Burrows-Wheeler Transform.Move-to-Front (MTF) Transform, Haar, wavelet tree, Delta Encoding, Rice &amp;Golomb Coding, Tunstall coding, DEFLATE algorithm, Run-Length Golomb-Rice (RLGR).

New Lossless Compression Method using Cyclic Reversible Low Contrast Mapping (CRLCM)

2016 ◽  
Vol 6 (6) ◽  
pp. 2836
Author(s):  
Hendra Mesra ◽  
Handayani Tjandrasa ◽  
Chastine Fatichah
Keyword(s):  
Compression Ratio ◽  
Image Data ◽  
Lossless Compression ◽  
Huffman Coding ◽  
Compression Method ◽  
Low Contrast ◽  
Coding Method

<p>In general, the compression method is developed to reduce the redundancy of data. This study uses a different approach to embed some bits of datum in image data into other datum using a Reversible Low Contrast Mapping (RLCM) transformation. Besides using the RLCM for embedding, this method also applies the properties of RLCM to compress the datum before it is embedded. In its algorithm, the proposed method engages Queue and Recursive Indexing. The algorithm encodes the data in a cyclic manner. In contrast to RLCM, the proposed method is a coding method as Huffman coding. This research uses publicly available image data to examine the proposed method. For all testing images, the proposed method has higher compression ratio than the Huffman coding.</p>

scholarly journals Analysis of DICOM Image Compression Alternative Using Huffman Coding

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Romi Fadillah Rahmat ◽  
T. S. M. Andreas ◽  
Fahmi Fahmi ◽  
Muhammad Fermi Pasha ◽  
Mohammed Yahya Alzahrani ◽  
...  
Keyword(s):  
Medical Imaging ◽  
Lossless Compression ◽  
Huffman Coding ◽  
Imaging Procedures ◽  
Compression Method ◽  
File Size ◽  
Dicom Image ◽  
Dicom File ◽  
Original File

Compression, in general, aims to reduce file size, with or without decreasing data quality of the original file. Digital Imaging and Communication in Medicine (DICOM) is a medical imaging file standard used to store multiple information such as patient data, imaging procedures, and the image itself. With the rising usage of medical imaging in clinical diagnosis, there is a need for a fast and secure method to share large number of medical images between healthcare practitioners, and compression has always been an option. This work analyses the Huffman coding compression method, one of the lossless compression techniques, as an alternative method to compress a DICOM file in open PACS settings. The idea of the Huffman coding compression method is to provide codeword with less number of bits for the symbol that has a higher value of byte frequency distribution. Experiments using different type of DICOM images are conducted, and the analysis on the performances in terms of compression ratio and compression/decompression time, as well as security, is provided. The experimental results showed that the Huffman coding technique has the capability to compress the DICOM file up to 1 : 3.7010 ratio and up to 72.98% space savings.

scholarly journals A Multi–Alphabet Arithmetic Coding Hardware Implementation for Small FPGA Devices

2013 ◽  
Vol 64 (1) ◽  
pp. 44-49 ◽  
Author(s):  
Anton Biasizzo ◽  
Franc Novak ◽  
Peter Korošec
Keyword(s):  
Statistical Model ◽  
Hardware Implementation ◽  
Source Coding ◽  
Lossless Compression ◽  
Arithmetic Coding ◽  
Huffman Coding ◽  
Context Switching ◽  
Data Source ◽  
Character Set ◽  
Xilinx Fpga

Arithmetic coding is a lossless compression algorithm with variable-length source coding. It is more flexible and efficient than the well-known Huffman coding. In this paper we present a non-adaptive FPGA implementation of a multi-alphabet arithmetic coding with separated statistical model of the data source. The alphabet of the data source is a 256-symbol ASCII character set and does not include the special end-of-file symbol. No context switching is used in the proposed design which gives maximal throughput without pipelining. We have synthesized the design for Xilinx FPGA devices and used their built-in hardware resources.

A new lossless compression method using Direction Adaptive-Discrete wavelet transform and Modified SPIHT coding

2021 ◽  
Author(s):  
N. Karthika Devi ◽  
G. Mahendran ◽  
S. Murugeswari ◽  
S. Praveen Samuel Washburn ◽  
D. Archana Devi ◽  
...  
Keyword(s):  
Wavelet Transform ◽  
Discrete Wavelet Transform ◽  
Lossless Compression ◽  
Discrete Wavelet ◽  
Compression Method ◽  
Spiht Coding
Sign in / Sign up

Export Citation Format

Share Document