For some applications where the speed of decoding and the fault tolerance are important, like in video storing, one of the successful answers is Fix-Free Codes. These codes have been applied in some standards like H.263+ and MPEG-4. The cost of using fix-free codes is to increase the redundancy of the code which means the increase in the amount of bits we need to represent any peace of informat...

The scheme of motion estimation is introduced to exploit the redundancy between continuous frames of 3D medical image sets in this paper. The proposed scheme is based on inter-frame motion estimation of inverse diamond search algorithm. The residual images are encoded by the Huffman encoder. The test images include five sets of the heart and two sets of the brain MRI images. The average compres...

While standard compression methods available include complex source encoding schemes, the scanning of the image is often performed by a horizontal (row-by-row) or vertical scanning. In this work a new scanning method, called ridge scanning, for lossless compression of fingerprint images is presented. By using ridge scanning our goal is to increase the redundancy in data and thereby increase the...

A perfect sequence has the optimal periodic autocorrelation function where all out-of-phase values are zero, and an orthogonal set has orthogonality that the periodic correlation function for any pair of distinct sequences in the set takes zero at the zero shift. The real-valued perfect sequences of period N = 2 are derived from a real-valued Huffman sequence of length 2 + 1 with ν ≥ n whose ou...

Linear Predictive Coding (LPC) is used for analysis and compression of speech signals. Whereas Huffman coding is used forElectrocardiogram (ECG) signal compression. This paper presents a hybrid compression technique for ECG signal using modifiedHuffman encoding andLPC.The aim of this paper is to apply the linear prediction coding and modified Huffman coding for analysis, compression and predict...

Audio codec based on Frequency Domain Linear Prediction (FDLP) exploits auto-regressive modeling to approximate instantaneous energy in critical frequency sub-bands of relatively long input segments. Current version of the FDLP codec operating at 66 kbps has shown to provide comparable subjective listening quality results to the state-of-the-art codecs on similar bit-rates even without employin...

As is well known, Huffman’s algorithm is a remarkably simple, and wonderfully illustrative example of how to use the greedy method to design algorithms. However, the Huffman coding problem, which is to find an optimal binary character code (or an optimal binary tree with weighted leaves) is intrinsically technical, and its specification is ill-suited for students with modest mathematical sophis...

A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...