The week's pick
Random Articles
Reseach Article
RIDBE: A Lossless, Reversible Text Transformation Scheme for Better Compression
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 51 - Number 12 |
| Year of Publication: 2012 |
| Authors: S. Senthil, S. J. Rexiline, L. Robert |
10.5120/8098-1685
|
S. Senthil, S. J. Rexiline, L. Robert . RIDBE: A Lossless, Reversible Text Transformation Scheme for Better Compression. International Journal of Computer Applications. 51, 12 ( August 2012), 35-40. DOI=10.5120/8098-1685
Abstract
In this paper, we propose RIDBE (Reinforced Intelligent Dictionary Based Encoding), a Dictionary-based reversible lossless text transformation algorithm. The basic philosophy of our secure compression is to preprocess the text and transform it into some intermediate form which can be compressed with better efficiency and which exploits the natural redundancy of the language in making the transformation. In RIDBE, the length of the input word is denoted by the ASCII characters 232 – 253 and the offset of the words in the dictionary is denoted with the alphabets A-Z. The existing or backend algorithm's ability to compress is seen to improve considerably when this approach is applied to source text and it is used in conjunction with BWT. A sufficient level of security of the transmitted information is also maintained. RIDBE achieves better compression at the preprocessing stage and enough redundancy is retained for the compression algorithms to get better results. The experimental results of this compression method are analysed. RIDBE gives 19. 08% improvement over Simple BWT, 9. 40% improvement over BWT with *-encode, 3. 20% improvement over BWT with IDBE, 1. 85% over BWT with EIDBE and about 1% over IIDBE.
References
- Arnavut. Z, "Move-to-Front and Inversion Coding", Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird, Utah, March 2000, pp. 193- 202.
- Awan S, Mukherjee A, "LIPT: A Lossless Text Transform to improve Compression", IEEE, 2001, pp. 452-460.
- Balkenhol. B, Kurtz. S, and Shtarkov Y. M, "Modifications of the Burrows Wheeler Data Compression Algorithm", Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, March 1999,pp. 188-197.
- Balkenhol B and Shtarkov Y, "One attempt of a compression algorithm using the BWT", SFB343: Discrete Structures in Mathematics, Faculty of Mathematics, University of Bielefeld, Germany, 1999.
- Burrows M and Wheeler D. J, "A Block – sorting Lossless Data compression Algorithm", SRC Research report 124, Digital Research Systems Research Centre, 1994.
- Chapin B. , and Tate S, "Preprocessing Text to Improve Compression Ratios", Proceedings of the IEEE Data Compression Conference 1998, Snowbird, p. 532.
- Chapin B, "Higher Compression from the Burrows–Wheeler Transform with new Algorithms for the List Update Problem", Ph. D. dissertation, Department of Computer Science, University of North Texas, 2001.
- Cleary J G. , Teahan W J. , and Ian H. Witten, "Unbounded Length Contexts for PPM', Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, March 1995, pp. 52-61.
- Effros M, "PPM Performance with BWT Complexity: A New Method for Lossless Data Compression", Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, March 2000, pp. 203-212.
- Franceschini R, Mukherjee A, "Data Compression using Encrypted Text", IEEE Proceedings of ADL, 1996, pp. 130-138.
- Horspool N and Cormack G, "Constructing Word–Based Text Compression Algorithms", Proceedings of the IEEE Data Compression Conference 1992, Snowbird, pp. 62–71.
- Kruse H and Mukherjee A, "Improving Text Compression Ratios with the Burrows–Wheeler Transform", Proceedings of the IEEE Data Compression Conference 1999, Snowbird, p. 536.
- Kruse H, Mukherjee A, "Preprocessing Text to improve Compression Ratios", Proc. Data Compression Conference, 1998, IEEE Computer Society Press, 1997, p. 556.
- Moffat A, "Implementing the PPM Data compression scheme", IEEE Transaction on Communications, Vol. 38, No. 11, 1917-1921, 1990.
- Radu Radescu, "Transform methods used in Lossless compression of text files", Romanian Journal of Information Science and Technology", Volume 12, Number 1, 2009, 101 – 115.
- Robert L and Nadarajan R, "Simple lossless preprocessing algorithms for better compression", The Institution of Engineering and Technology, IET Software 2009, vol 3, pp. 37-45
- Sadakane K, Okazaki T, and Imai H, "Implementing the Context Tree Weighting Method for Text Compression", Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, March 2000, pp. 123-132
- Senthil S, Robert L, "Text Preprocessing using Enhanced Intelligent Dictionary Based Encoding (EIDBE)", Proceedings of Third International Conference on Electronics Computer Technology, April 2011,pp. 451-455.
- Senthil S, Robert L, "IIDBE: A lossless text transform for better compression", International Journal of Wisdom based computing, August 2011, Volume1(2),pp. 1-6.
- Seward J, "On the Performance of BWT Sorting Algorithms", Proceedings of Data Compression Conference, IEEE Computer Society, Snowbird Utah, March 2000, pp. 173-182.
- Shajeemohan B. S, Govindan V. K, 'Compression scheme for faster and secure data transmission over networks', IEEE Proceedings of the International conference on Mobile business, 2005.
- Sun W. , Zhang N. , Mukherjee A. "Dictionary-based fast transform for better compression", proc. IEEE Int. Conf. Information Technology: Coding and Computing, Las vegas, 2003.
- Witten I H. , Moffat A, Bell T, "Managing Gigabyte, Compressing and Indexing Documents and Images", 2nd Edition, Morgan Kaufmann Publishers, 1999.
- Ziv J and Lempel A, "A Universal Algorithm for Sequential Data Compression," IEEE Transactions on Information Theory, pp. 3, 1977.
Index Terms
Keywords