联系我们
Isaac Scientific Publishing
Frontiers in Signal Processing
FSP > Volume 3, Number 3, July 2019

A Study for Image Compression Using Re-Pair Text-based Algorithm

Download PDF  (4613.4 KB)PP. 37-42,  Pub. Date:June 27, 2019
DOI: 10.22606/fsp.2019.33001

Author(s)
Pasquale De Luca, Vincenzo Maria Russiello, Raffaele Ciro Sannino, Lorenzo Valente
Affiliation(s)
1Department of Science and Tecnhologies, University of Naples "Parthenope", Naples I-80143, Italy
2Department of Computer Science, University of Salerno, Fisciano I-84084, Italy
Department of Computer Science, University of Salerno, Fisciano I-84084, Italy
Department of Computer Science, University of Salerno, Fisciano I-84084, Italy
Department of Computer Science, University of Salerno, Fisciano I-84084, Italy
Abstract
Compression is an important topic in computer science which is allowing us to store a larger amount of data on our data storage. There are several techniques to compress files. In this essay, we will describe the most important algorithm to compress images, which is JPEG, and we will compare it to another method, in order to provide solid arguments as to why JPEG should not be used for images. The most known encoding technique to compress texts is the Human Encoding, which will be explained in detail. We will illustrate the way in which we are able to use a method of compressing texts for compressing images and explaining in detail the method and reasoning behind choosing a particular format for the images rather than any other formats.The Re-Pair algorithm is the method studied and analysed in this essay.This algorithm was used solely for compressing grammatical contents. At the end of this essay we shall prove that using this method will give the best results.
Keywords
Image compression, Re-Pair, compression, BMP
References
  • [1]  Liu, Xianjin and Wei, Zhuo and Zhang, Qin and Huang, Jiwu and Shi, Y.Q.. (2019). Downscaling Factor Estimation on Pre-JPEG Compressed Images. IEEE Transactions on Circuits and Systems for Video Technology. PP. 1-1. 10.1109/TCSVT.2019.2893353.
  • [2]  Xu, Juncai, et al. "SSE Lossless Compression Method for the Text of the Insignificance of the Lines Order." arXiv preprint arXiv:1709.04035 (2017). APA
  • [3]  Robinson, A. H., and Colin Cherry. "Results of a prototype television bandwidth compression scheme." Proceedings of the IEEE 55.3 (1967): 356-364.
  • [4]  Chang, Y-W., T-K. Truong, and Y. Chang. "Direct mapping architecture for JPEG Huffman decoder." IEEE Proceedings-Communications 153.3 (2006): 333-340.
  • [5]  Huffman, David A. "A method for the construction of minimum-redundancy codes." Proceedings of the IRE 40.9 (1952): 1098-1101.
  • [6]  Raj, Y. Arockia, and P. Alli. "Pattern-based Chain Code for Bi-level Shape Image Compression." (2018). APA
  • [7]  Ahmed, Nasir, T_ Natarajan, and Kamisetty R. Rao. "Discrete cosine transform." IEEE transactions on Computers 100.1 (1974): 90-93.
  • [8]  Raid, A. M., et al. "Jpeg image compression using discrete cosine transform-A survey." arXiv preprint arXiv:1405.6147 (2014).
  • [9]  Wahba, Walaa Z., and Ashraf YA Maghari. "Lossless Image Compression Techniques Comparative Study." International Research Journal of Engineering and Technology (IRJET), e-ISSN (2016): 2395-0056. APA
  • [10]  Yamashita, Yoshiyuki, and Ikuo Nakata. "Coupled context-free grammar as a programming paradigm." International Workshop on Programming Language Implementation and Logic Programming. Springer, Berlin, Heidelberg, 1988.
  • [11]  Larsson, N. Jesper, and Alistair Moffat. "Off-line dictionary-based compression." Proceedings of the IEEE 88.11 (2000): 1722-1732.
  • [12]  Anand, Anjali. "BMP To JPEG-the conversion process." Journal of Global Research in Computer Science 2.6 (2011): 145-150.
  • [13]  Joshi, Keshav. (2018). A New Approach of Text Steganography Using ASCII Values. International Journal of Engineering and Technical Research. 7. 490-493.
  • [14]  Cahn, Robert S. "ASCII protocol conversion revisited." IEEE Journal on Selected Areas in Communications 8.1 (1990): 93-98.
Copyright © 2019 Isaac Scientific Publishing Co. All rights reserved.