Abstract
Adaptive version of loss-less Region Based Huffman compression techniques are proposed where a proposed region formation algorithm is used to divide the input file into a number of regions that adapts region size depending on the ASCII value difference of symbols. Huffman codes are obtained for entire file after formation of regions. Code interchanging between the maximum frequency element of a region and maximum frequency element of entire file is done before symbols of that region are compressed. Another variation of the technique where region wise interchanging of code is done based on an additional condition. Comparisons are made among these two compression techniques with Region Based Huffman compression technique, Size Adaptive Region Based Huffman compression technique and classical Huffman technique. The proposed techniques offer better results for most of the files.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nandi, U., Mandal, J.K.: Size Adaptive Region based Huffman Compression. In: National Symposium on Emerging Trends in Computer Science (ETCS), Barrackpore, India (2012)
Nandi, U., Mandal, J.K.: Region based Huffman(RB H) Compression Technique with Code Interchange. Malayasian Journal of Computer Science(MJCS), Malayasia 23(2), 111–120 (2010)
Mandal, J.K., Kumar, A.: A Compression Technique Based on Optimality of Huffman Tree (OHT). In: 12th International Conference of IEEE on Advanced Computing and Communications, Ahmedabad, India, pp. 589–595 (2004)
Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530–536 (1978)
Mandal, J.K., Gangopadhayay, R.: Implementation of Two Data Compression Schemes. In: First International Workshop on Telematics, pp. 154–162. NERIST, India (1995)
Reglebati, H.K.: An Overview of Data Compression Techniques. IEEE Computer, 71–75 (1981)
Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530–536 (1978)
Welch, T.: A Technique for High-Performance Data Compression. IEEE Computer 17(6), 8–19 (1984)
Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic Coding for Data Compression. Communications of the ACM 30(6), 520–540 (1987)
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)
Nelson, M.: The Data Compression Book, 2nd edn. BPB Publications, India (2008)
Kanitkar, Y.: C project, 2nd edn. BPB Publications, India (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nandi, U., Mandal, J.K. (2012). Adaptive Region Based Huffman Compression Technique with Selective Code Interchanging. In: Meghanathan, N., Nagamalai, D., Chaki, N. (eds) Advances in Computing and Information Technology. Advances in Intelligent Systems and Computing, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31513-8_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-31513-8_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31512-1
Online ISBN: 978-3-642-31513-8
eBook Packages: EngineeringEngineering (R0)