Fault Tolerant Huffman Coding for JPEG Image Coding System
نویسنده
چکیده
−In this paper, the tolerance of Huffman Coding to memory faults is considered. Many pointer-based and array-based data structures are highly nonresilient to faults. A single fault in a memory array or atree node may result in loss of entire data or an incorrect code stream. In this paper, a fault tolerant designscheme is developed to protect the JPEG image compression system.
منابع مشابه
Fault Tolerance Technique in Huffman Coding applies to Baseline JPEG
Faults due to the incorrect functioning of the computation system, or the transmission errors of the internal data, could corrupt the output code stream of the Huffman encoder. In this paper, a fault detection method is proposed for the Huffman encoding system, which is implemented in the JPEG image compression standard [1]. The detection method based on the information input and the code strea...
متن کاملThe Design, Implementation, and Deployment of a System to Transparently Compress Hundreds of Petabytes of Image Files for a File-Storage Service
We report the design, implementation, and deployment of Lepton, a fault-tolerant system that losslessly compresses JPEG images to 77% of their original size on average. Lepton replaces the lowest layer of baseline JPEG compression—a Huffman code—with a parallelized arithmetic code, so that the exact bytes of the original JPEG file can be recovered quickly. Lepton matches the compression efficie...
متن کاملPosition Based Coding Scheme and Huffman Coding in JPEG2000: An Experimental analysis
The paper compares the novel method of position based coding scheme introduced recently by the authors with Huffman coding results. The results show that Position Based Coding Scheme (PBCS) is superior in terms of image compression ratio and PSNR. In PBCS, by identifying the unique elements and by reducing redundancies the coding has been performed. The results of JPEG2000 image compression wit...
متن کاملPerformance Analysis of Huffman Coding Algorithm
Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...
متن کاملEvaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards
Compression is a technique to reduce the quantity of data without excessively reducing the quality of the multimedia data.The transition and storing of compressed multimedia data is much faster and more efficient than original uncompressed multimedia data. There are various techniques and standards for multimedia data compression, especially for image compression such as the JPEG and JPEG2000 s...
متن کامل