ABSTRACT
In recent research we proposed GP-zip, a system which uses evolution to find optimal ways to combine standard compression algorithms for the purpose of maximally losslessly compressing files and archives. The system divides files into blocks of predefined length. It then uses a linear, fixed-length representation where each primitive indicates what compression algorithm to use for a specific data block. GP-zip worked well with heterogonous data sets, providing significant improvements in compression ratio compared to some of the best standard compression algorithms. In this paper we propose a substantial improvement, called GP-zip*, which uses a new representation and intelligent crossover and mutation operators such that blocks of different sizes can be evolved. Like GP-zip, GP-zip* finds what the best compression technique to use for each block is. The compression algorithms available in the primitive set of GP-zip* are: Arithmetic coding (AC), Lempel-Ziv-Welch (LZW), Unbounded Prediction by Partial Matching (PPMD), Run Length Encoding (RLE), and Boolean Minimization. In addition, two transformation techniques are available: the Burrows-Wheeler Transformation (BWT) and Move to Front (MTF). Results show that GP-zip* provides improvements in compression ratio ranging from a fraction to several tens of percent over its predecessor.
- I. M. Pu, Fundamental Data Compression, HB, ISBN-13: 978-0-7506-6310-62006. Chapter 1.]] Google ScholarDigital Library
- Ahmad Kattan and Riccardo Poli, Evolutionary Lossless Compression with GP-ZIP, Proceedings of the IEEE World Congress on Computational Intelligence, IEEE 2008.]] Google ScholarDigital Library
- William H. Hsu and Emy E. Zwarico, Automatic Synthesis of Compression Techniques for Heterogeneous Files SOFTPREX: Software-Practice and Experience, Vol. 25, 1995.]] Google ScholarDigital Library
- John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.]] Google ScholarDigital Library
- Peter Nordin and Wolfgang Banzhaf. Programmatic compression of images and sound. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 345--350, Stanford University, CA, USA, 28-31 July 1996. MIT Press.]] Google ScholarDigital Library
- Evelyne Lutton, Jacques Levy-Vehel, Guillaume Cretin, Philippe Glevarec, and Cidric Roll. Mixed IFS: Resolution of the inverse problem using genetic programming. Complex Systems, 9:375--398, 1995.]]Google Scholar
- Evelyne Lutton, Jacques Levy-Vehel, Guillaume Cretin, Philippe Glevarec, and Cidric Roll. Mixed IFS: Resolution of the inverse problem using genetic programming. Research Report No 2631, Inria, 1995.]]Google Scholar
- Anargyros Sarafopoulos. Automatic generation of affine IFS and strongly typed genetic programming. In Riccardo Poli, Peter Nordin, William B. Langdon, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP'99, volume 1598 of LNCS, pages 149--160, Goteborg, Sweden, 26-27 May 1999. Springer-Verlag.]] Google ScholarDigital Library
- Andreas Klappenecker and Frank U. May. Evolving better wavelet compression schemes. In Andrew F. Laine, Michael A. Unser, and Mladen V. Wickerhauser, editors, Wavelet Applications in Signal and Image Processing III, volume 2569, San Diego, CA, USA, 9-14 July 1995. SPIE.]]Google ScholarCross Ref
- Alex Fukunaga and Andre Stechert. Evolving nonlinear predictive models for lossless image compression with genetic programming. In John R. Koza, Wolfgang Banzhaf, Kumar Chellapilla, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max H. Garzon, David E. Goldberg, Hitoshi Iba, and Rick Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 95--102, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.]]Google Scholar
- Johan Parent and Ann Nowe. Evolving compression preprocessors with genetic programming. In W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 861--867, New York, 9-13 July 2002. Morgan Kaufmann Publishers.]]Google Scholar
- Bell, R.A.a.T.C. A corpus for the evaluation of lossless compression algorithms. in IEEE Data Compression Conference (DCC'97). March 25 1997. Los Alamitos, California.: IEEE Computer Society.]] Google ScholarDigital Library
- Thomas Krantz, Oscar Lindberg, Gunnar Thorburn, and Peter Nordin. Programmatic compression of natural video. In Erick Cantú-Paz, editor, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 301--307, New York, NY, July 2002. AAAI.]]Google Scholar
- Jingsong He, Xufa Wang, Min Zhang, Jiying Wang, and Qiansheng Fang. New research on scalability of lossless image compression by GP engine. In Jason Lohn, David Gwaltney, Gregory Hornby, Ricardo Zebulum, Didier Keymeulen, and Adrian Stoica, editors, Proceedings of the 2005 NASA/DoD Conference on Evolvable Hardware, pages 160--164, Washington, DC, USA, 29 June-1 July 2005. IEEE Press.]] Google ScholarDigital Library
- I. Witten and R. Neal and J. Cleary, Arithmetic coding for data compression, Communications of the ACM, Vol. 30, pp. 520--541, 1987.]] Google ScholarDigital Library
- J. Ziv and A. Lempel, Compression of Individual Sequences via Variable--Rate Coding, IEEE Transactions on Information Theory, September 1978.]]Google Scholar
- J. G. Cleary and W. J. Teahan and Ian H. Witten, Unbounded Length Contexts for PPM, Data Compression Conference, pp. 52--61, 1995.]] Google ScholarDigital Library
- S. W. Golomb, Run-length encodings, IEEE Trans. Inform. Theory, Vol. IT-12, pp. 399--401, 1966.]]Google Scholar
- A. Kattan, Universal Lossless Data Compression with built in Encryption. Master Thesis, University of Essex 2006.]]Google Scholar
- M. Burrows and D. J. Wheeler, A block-sorting lossless data compression algorithm, SRC, Number 124, 1994.]]Google Scholar
- Z. Arnavut, Move-to-Front and Inversion Coding, DCC: Data Compression Conference, IEEE Computer Society TCC, 2000.]] Google ScholarDigital Library
- ACT Archive Compression Test {cited 2 December 2007} Available from: http://compression.ca/act/act-win.html]]Google Scholar
Recommendations
RETRACTED ARTICLE: Improved image compression using effective lossless compression technique
AbstractThe data or image transmission plays a very important role in current days. In general image can be transmitted in terms of data. The basic image can be converted or encoded into bits or chunks. This data can be transmitted in efficient form. ...
BWT-based Data Preprocessing for LZW
CMSP '11: Proceedings of the 2011 International Conference on Multimedia and Signal Processing - Volume 01In this paper we propose a BWT-based LZW algorithm for reducing the compressed size and the compression time. BWT and MTF can expose potential redundancies in a given input and then significantly improve the compression ratio ofLZW. In order to avoid ...
Comments