Run-length Coding Research Articles

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application.JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently.

A Comprehensive Test Compression Scheme Based on Precomputed Test Sets

To cope with increasingly rigorous challenges that large scale digital integrated circuit testing is confronted with, a comprehensive compression scheme consisting of test-bit rearrangement algorithm, run-length assignment strategy and symmetrical code is proposed. The presented test-bit rearrangement algorithm can fasten dont-care bits, 0s or 1s in every test pattern on one of its end to the greatest extent so as to lengthen end-run blocks and decrease number of short run-lengths. A dynamical dont-care assignment strategy based on run-lengths can be used to specify the remaining dont-care bits after the test-bit rearrangement, which can decrease run-length splitting and maximize length of run-lengths. The symmetrical code benefits from long run-lengths and only uses 2 4-bit short code words to identify end-run blocks almost as long as a test pattern, and hence the utilization ratio of code words can be heightened. The presented experiment results show that the proposed comprehensive scheme can obtain very higher data compression ratios than other compression ones published up to now, especially for large scale digital integrated circuits, and considerably decrease test power dissipations.

Fast Lossless Compression of Medical Images based on Polynomial

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance. General Terms Polynomial approximation within high synthetic coding architecture for lossless image compression.

Multicore-based 3D-DWT video encoder

Abstract Three-dimensional wavelet transform (3D-DWT) encoders are good candidates for applications like professional video editing, video surveillance, multi-spectral satellite imaging, etc. where a frame must be reconstructed as quickly as possible. In this paper, we present a new 3D-DWT video encoder based on a fast run-length coding engine. Furthermore, we present several multicore optimizations to speed-up the 3D-DWT computation. An exhaustive evaluation of the proposed encoder (3D-GOP-RL) has been performed, and we have compared the evaluation results with other video encoders in terms of rate/distortion (R/D), coding/decoding delay, and memory consumption. Results show that the proposed encoder obtains good R/D results for high-resolution video sequences with nearly in-place computation using only the memory needed to store a group of pictures. After applying the multicore optimization strategies over the 3D DWT, the proposed encoder is able to compress a full high-definition video sequence in real-time.

Power Efficient Adaptive Compression Technique for Wireless Sensor Networks

Wireless sensor network consists of many tiny disposable low power devices called nodes, which are spatially distributed in order to perform various application global tasks. These nodes form a network by communicating with each other either directly or through other nodes. Sensor networks are fundamentally constrained by the difficulty and energy expense of delivery information from sensor to sink. Power saving is a critical issue in wireless sensor networks since sensor nodes are powered by batteries which cannot generally change or recharged. In this paper we have focused on radio communication which is often considered as the main cause of energy consumption. One of the solutions to this problem would be generally achieved by reducing the size of the transmitted/received data through data compression. A new adaptive compression technique will be considered for lossless data compression which reduces the amount of data that must be passed through the network and to the sink and thus have energy benefits that are multiplicative with the number of hops the data travel through the network. Possible extensions of this paper, use RUN LENGTH CODING to compress decompress the data in WSN.

A Novel Pattern Run-Length Coding Method for Test Data Compression

This paper presents a novel data compression method for testing integrated circuits within the framework of pattern run-length coding. The test set is firstly divided into 2n-length patterns where n is a natural number. Then the compatibility of each pattern, which can be an external type, or an internal type, is analyzed. At last, the codeword of each pattern is generated according to its analysis result. Experimental results for large ISCAS89 benchmarks show that the proposed method can obtain a higher compression ratio than existing ones.

A NOVEL MULTIDICTIONARY BASED TEXT COMPRESSION

The amount of digital contents grows at a faster speed as a result does the demand for communicate them. On the other hand, the amount of storage and bandwidth increases at a slower rate. Thus powerful and efficient compression methods are required. The repetition of words and phrases cause the reordered text much more compressible than the original text. On the whole system is fast and achieves close to the best result on the test files. In this study a novel fast dictionary based text compression technique MBRH (Multidictionary with burrows wheeler transforms, Run length coding and Huffman coding) is proposed for the purpose of obtaining improved performance on various document sizes. MBRH algorithm comprises of two stages, the first stage is concerned with the conversion of input text into dictionary based compression .The second stage deals mainly with reduction of the redundancy in multidictionary based compression by using BWT, RLE and Huffman coding. Bib test files of input size of 111, 261 bytes achieves compression ratio of 0.192, bit rate of 1.538 and high speed using MBRH algorithm. The algorithm has attained a good compression ratio, reduction of bit rate and the increase in execution speed.

Parallel design of JPEG-LS encoder on graphics processing units

With recent technical advances in graphic processing units (GPUs), GPUs have out- performed CPUs in terms of compute capability and memory bandwidth. Many successful GPU applications to high performance computing have been reported. JPEG-LS is an ISO/IEC stan- dard for lossless image compression which utilizes adaptive context modeling and run-length coding to improve compression ratio. However, adaptive context modeling causes data depen- dency among adjacent pixels and the run-length coding has to be performed in a sequential way. Hence, using JPEG-LS to compress large-volume hyperspectral image data is quite time- consuming. We implement an efficient parallel JPEG-LS encoder for lossless hyperspectral compression on a NVIDIA GPU using the computer unified device architecture (CUDA) pro- gramming technology. We use the block parallel strategy, as well as such CUDA techniques as coalesced global memory access, parallel prefix sum, and asynchronous data transfer. We also show the relation between GPU speedup and AVIRIS block size, as well as the relation between compression ratio and AVIRIS block size. When AVIRIS images are divided into blocks, each with 64 × 64 pixels, we gain the best GPU performance with 26.3x speedup over its original CPU code. © 2012 Society of Photo-Optical Instrumentation Engineers (SPIE). (DOI: 10.1117/1.JRS.6

Lossless Reconstruction of Secret Image Using Threshold Secret Sharing and Transformation

This paper is proposed to provide confidentiality of the secret image which can be used by multiple users or to store on multiple servers. A secret sharing is a technique to protect the secret information which will be used by multiple users. The threshold secret sharing is more efficient as it is possible to reconstruct the secret with the threshold number of shares. Along with Shamir’s secret sharing method we propose to use the radon transformation before dividing the image in to shares. This transformation is used so that the shares will not have the original pixel intensity. The run length code is used to compress the image after the transformation. Then apply secret sharing technique. The reconstruction of the image results in original image by applying the operations in the reverse order.

Coding of DWT Coefficients using Run-length Coding and Huffman Coding for the Purpose of Color Image Compression

Coding of DWT Coefficients using Run-length Coding and Huffman Coding for the Purpose of Color Image Compression

Rapid Extraction and Compression of DICOM Data for Medical Image Geometric Modeling

This paper presents a method of extracting and compressing required data from the DCM file for medical image geometric modeling. According to the characteristics of DICOM data, combining the idea of run-length coding with block coding, the rapid data compression and storage in RAM was realized finally. Compared with other coding methods, the encoding approach for DICOM data in this paper, not only saves the memory space and improves transmission efficiency, but also can read the required a single pixel, or part of pixel data from the compressed data conveniently.

DCT Image Compression by Run-Length and Shift Coding Techniques.

The mathematical concept of a DCT transform is a powerful tool in many areas; it is also, served as an approach in image processing discipline. In this work an image is processed as three color channel. The correlated pixels values of an image can be transformed to a representation where its coefficients are de-correlated. The term "decorrelated" means that the transformed values are independent of one another. As a result, they can be encoded independently, which make it simpler to construct a statistical model. Correlated values are coded with run-length coding techniques while shift coding used to decode the DC term and the other five lifting values. In this work, we suggest to save the first five values from every block to keep it back without any significant errors.The obtained bit rates was extended to be within range (11.4 , 2.6), compression ratio (2.76 , 13.34 )the values of the fiedility parameters (PSNR) was within the range (31.61 , 46.21) for the lena test image in both sizes (128×128 and 256×256), and PSNR was calculated as average for the three color channels, red, green , blue

New Approach in Image Compression: 3D Spiral JPEG

This paper presents a new JPEG-based lossy image compression method based on three-dimensional formation of the original image by spiral order scanning and 3D discrete cosine transformation (DCT). The proposed spiral scanning results in similar information blocks to be in the same 8x8x8 cube. The proposed quantization table and method for converting a 3D image cube into a ID array provide better coding efficiency in run length coding. Hence, a better performance in a wide range of images is obtained. The performance of the proposed compression method is measured over various images, and it is observed that the proposed method has better performance than that of conventional JPEG compression especially in low and in high bit rates. In addition, the proposed compression scheme has generally superior performance in images where there is substantial amount of background.

A New Digital Watermarking Algorithm Based on DWT-DCT-RLC

The paper presents an imperceptible and robust digital watermarking algorithm using a combination of the DWT-DCT , which improves the robustness via using new embedding strategy. Apply 4-level DWT to the host image. Then, DCT transform of each directional middle frequencies DWT subband is computed; A binary watermarked logo is coded by Run-Length Code(RLC);The watermark bits are embedded in the coefficients of the DCT block based on the energy of each corresponding to coefficient in the highest level selected using the value of RLC. Performance evaluation show that the proposed scheme is invisible and robust against common image manipulations like JPEG compression, noise adding, sharpening, filtering.

An Appearance based Method for Eye Gaze Tracking

Problem statement: Gaze estimation systems compute the direction of e ye gaze based on observed eye movements. The need for gaze-contingent applications is the basis of the current research work. The gaze pointing systems is a substitute for the existing input devices. Approach: The gaze tracking methods are either feature based or appear ance based. In this study, an appearance based approach for gaze tracking is proposed based on Run Length Coding (RLC). The experiment was conducted considering transitional changes and the class-intervals in iris pixels. The image acquisiti on begins from the center of the screen in anticlockwi se direction. The center of the screen was the pivo t point. Results: Using RLC, the recognition rate of 95% was achieved. The image analysis in different directions determines the gaze point. The direction s was determined with respect to the pivot point. Conclusion: The proposed system provides a robust, less computational gaze tracking method usi ng web camera.

Improved Moving Picture Compression Using H.264/AVC and Run-Level Coding

Based on theoretical analysis of the H.264 video coder and decoder patents, a fast, easy-to-implement and efficient compression scheme for moving picture is proposed, combining the well-known Run-level compression with the original H.264 compression standard. It is shown that the proposed scheme preserves the visual quality of the video captures, while improving the compression performance. Comparisons with other well-known video formats such as AVI, ASF and MPEG support that the proposed scheme is not only comparable in terms of quality but superior in terms of the achieved compression rate. As the proposed scheme employs a simple and quick lossless algorithmic addition to the existing H.264, which has pool of 1135 patents in 44 countries, the compression benefits can be widespread, without sacrificing quality nor incurring significant increase in compression time, making it a practical solution when additional compression is required during transmission. Keywords: Video compression, runlength coding, compression performance, H.264, transmission efficiency

An Efficient Text Compression for Massive Volume of Data

To propose a new text compression technique for ASCII texts for the purpose of obtaining good performance on various document sizes. This algorithm is composed of two stages. In the first stage, the input strings are converted into the dictionary based compression. In the second stage, the redundancy of the dictionary based compression is reduced by Burrows wheeler transforms and Run length coding. The algorithm has good compression ratio and reduces bit rate to execute the text with increase in the speed. General Terms Lossless text compression, Dictionary making algorithm

A Modified Run-Length Coding towards the Realization of a RRO-NRDPWT-Based ECG Data Compression System

The wavelet-based approach that combines a reversible round-off nonrecursive discrete periodized wavelet transform (RRO-NRDPWT) and the set partitioning in hierarchical trees (SPIHT) scheme is an efficient ECG data compression. However, this RRO-NRDPWT-based system suffers from the high complexity of the SPIHT scheme during realization. In this paper, a modified run-length coding (MRLC) algorithm is proposed towards the realization of a RRO-NRDPWT-based ECG data compression system. The MRLC with its regularity and low computational complexity is suitable for hardware implementation, but at a cost of compression performance. This sacrifice is compensated by an efficient quantization scheme. By using the MIT-BIH arrhythmia database, the experimental results show that the proposed scheme can compete with the SPIHT scheme for a compression ratio (CR) greater than 8. Hardware simulations are taken using both the Verilog logic simulator with Cadence design platform, and a Xilinx FPGA EP2C35F672C6.

Improvement of reversible binary image data hiding by run-length coding and histogram pair

Improvement of reversible binary image data hiding by run-length coding and histogram pair

Test data compression using alternating variable run-length code

This paper presents a unified test data compression approach, which simultaneously reduces test data volume, scan power consumption and test application time for a system-on-a-chip (SoC). The proposed approach is based on the use of alternating variable run-length (AVR) codes for test data compression. A formal analysis of scan power consumption and test application time is presented. The analysis showed that a careful mapping of the don’t-cares in pre-computed test sets to 1s and 0s led to significant savings in peak and average power consumption, without requiring slower scan clocks. The proposed technique also reduced testing time compared to a conventional scan-based scheme. The alternating variable run-length codes can efficiently compress the data streams that are composed of both runs 0s and 1s. The decompression architecture was also presented in this paper. Experimental results for ISCAS'89 benchmark circuits and a production circuit showed that the proposed approach greatly reduced test data volume and scan power consumption for all cases.