The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed...
Bitmap indexing is a promising approach for indexing. However the huge space consumption hinders the wide adoption of bitmap indexing, especially in memory-critical area such as packet classification. To this end, a variety of compression scheme are proposed to reduce the space consumption and simultaneously maintain the fast calculation which is a focused feature of bitmap indexing. In this paper,...
Image resolution in modern video processing and display systems are rocketing up in recent years. With the main stream video quality evolving from standard definition to high-definition, and further towards the emerging super high-definition, the bandwidth and power consumption of external memory are becoming serious bottlenecks. In this paper, frequency domain analysis is made on image down-sampling,...
Recently, detecting abnormal events in surveillance videos has become one of the most important tasks of video analysis. There is a huge demand in developing fast and accurate abnormal event detection approach. However, traditional pixel-domain approaches are time-consuming and require fully decoding of the bit streams. On the other hand, the compression format may provide useful information to solve...
SSD Technology is used to read/write data to the external device with high speed and low power. A lossless LZ77 data compression technique is used here in order to retain the information content by removing data redundancy and also employs a text window in congestion with look-ahead buffer to serve as a dictionary. In the proposed technique the unmatched string present in the dictionary are encoded...
The application of lossless data compression methods may significantly decrease the required storage space or throughput. The quality of the compression ratio is influenced by several factors, like the available space and processing resources and the statistical characteristic of the data to be compressed. In this contribution we will perform the boundary analysis of Virtual Dictionary Extension(-VDE),...
In order to familiarize and comprehend the learning of Huffman algorithm in a simpler way, we have implemented Huffman algorithm in Julia language which can be visualized in an interactive platform called IJulia supported by Jupyter and it creates a learning platform that increases the understanding of the coding technique for students. It involves a set of commands that are understandable and familiar...
Code compression technique is used for the reduction of codes to allow transportation of digital data from the transmitter (source) to the receiver (destination). These fixed length codes are converted into variable length codes having varied number of bits. The Huffman coding technique is found to be an optimal solution of transportation of data. It generally follows the Lossless Compression technique...
We study the interactive compression of an arbitrary function of two discrete sources with zero-error. The information on the joint distribution of the sources available at the two sides is asymmetric, in that one user knows the true distribution, whereas the other user observes a different distribution. This paper considers the minimum worst-case zero-error codeword length under such asymmetric prior...
We aim to use a data compression strategy to improve the seismic data transfer between CPU and FPGA through the PCIe bus. In order to improve the transfer speed, it is necessary that the compressed data transfer time (t1) plus the decompression time (t2) has to be less than the traditional transfer time (tt), that is t1 + t2
In this paper, we explore different techniques for lossless compression of sensor data on a wireless sensor network. In this work, we applied modify Differential Pulse Code Modulation (DPCM) scheme for our baseline lossless compression. These techniques were applied on sensor types with reasonably predictable data pattern (e.g., temperature sensor, pressure sensor, etc.) allowing about 50% data compression...
Differential Code Shift Keying (DCSK) scheme developed in MATLAB environment require longer execution time at decoding end particularly with longer strings. The problem can be avoided by using suitable data compression technique. In this paper, Huffman Coding based data compression technique is implemented for improving the performance of DCSK Communication scheme developed for integer strings which...
The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encodings present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In prior work, we have proposed an arbitrary-precision technique to adapt bit recycling to arithmetic code instead of Huffman code. We have shown that...
In order to improve the radiometric precision of Synthetic Aperture Radar (SAR) image, this paper analyses the power-loss of SAR raw data which is caused by block adaptive quantization (BAQ) and then proposed a compensation method. Firstly, the saturation factor γclip is defined and then a unified model of BAQ compression is proposed by using the concept of normalized quantizer. Secondly, the signal...
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step allowing for fast encoding and decoding. However, HC typically provides suboptimal data rates due to its inherent approximation of symbol probabilities to powers of 1 over 2. In contrast,...
A new perspective family of universal variable length prefix codes with a set of delimiters is introduced. The main seed of these codes is the binary representation of natural numbers in the two-base numeration system with the main radix 2 and the auxiliary radix 3. We construct extensions and generalizations of these (2,3)-codes, which we call (Δ, k)-codes. We prove that all (Δ, k)-codes are complete...
Current compression systems incorporate a data model, however formed, deeply into the coding process, leading to difficulties of an architectural nature. This work contributes an alternative "Model-Code Separation" architecture for general compression, based on model-free coding and iterative message-passing algorithms over graphical models representing the modeling and coding aspects of...
Given a file T, and the Huffman encoding of its elements, we present a data structure that enables direct access to the i-th element of T by reordering the bits of the compressed file and using some additional space. When compared to a Wavelet tree for Huffman Codes, our different reordering of the bits requires less additional storage overhead by reducing the need for auxiliary rank structures, while...
Data compression can help in relieving congestion by only reducing the effective data size without much effect on throughput. This paper proposes a joint data compression technique in congested networks. The proposed framework combines Lempel Ziv Welch (LZW) and Lightweight Dictionary-based Compression (LDC), the joint LZW and LDC is added on top of the TCP layer. When congestion is detected, the...
Lossless compression technique compresses the data file or image file without any changes in the original file. This method is generally applicable for the text data and the medical images. This paper proposes a new methodology to compress online data using an adaptive Huffman tree for encoding and decoding data with lesser height. This technique saves the transmitting power and decreases the communication...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.