Fractal Image Compression Using Self-Organizing Mapping
- 1 Department of Mathematics, Faculty of Sciences and Arts, Najran University, KSA
- 2 Department of Mathematics and Computer Science, Faculty of Science, Ibb University, Ibb, Yemen
- 3 Department of Mathematics, Faculty of Ibn Alhaitham for Education, Baghdad University, Baghdad, Iraq
Abstract
One of the main disadvantages of fractal image data compression is a loss time in the process of image compression (encoding) and conversion into a system of iterated functions (IFS). In this paper, the idea of the inverse problem of fixed point is introduced. This inverse problem is based on collage theorem which is the cornerstone of the mathematical idea of fractal image compression. Then this idea is applied by iterated function system, iterative system functions and grayscale iterated function system down to general transformation. Mathematical formulation form is also provided on the digital image space, which deals with the computer. Next, this process has been revised to reduce the time required for image compression by excluding some parts of the image that have a specific milestone. The neural network algorithms have been applied on the process of compression (encryption). The experimental results are presented and the performance of the proposed algorithm is discussed. Finally, the comparison between filtered ranges method and self-organizing method is introduced.
- Rajeshri, R. and Yashwant, S.C. (2013) Escape Time Fractals of Inverse Tangent Function. International Journal of Computer and Organization Trends, 3, 16-21.
- Satyendra, K.P., Munshi, Y. and Arunima (2012) Fracint Formula for Overlaying Fractals. Journal of Information Systems and Communication, 3, 347-352.
- Barnsley, M.F. and Sloan, A.D. (1987) Chaostic Compression. Computer Graphics World, 10, 107-108.
- Barnsley, M. and Sloan, A. (1988) A Better Way to Compress Images. Byte, 13, 215-223.
- Barnsley, M.F. (1988) Fractals Everywhere. Academic Press, New York.
- Jacquin, A.E. (1992) Image Coding Based on a Fractal Theory of Iterated Contractive Image Transformations. IEEE Transaction on Image Processing, 1, 8-30. http://dx.doi.org/10.1109/83.128028
- Fisher, Y. (1994) Fractal Image Compression-Theory and Application. Springer-Verlag, New York.
- Sheridan, P. (1996) Spiral Architecture for Machine Vision. Ph.D. Thesis, University of Technology, Sydney.
- Bouboulis, P., Dalla, P.L. and Drakopoulos, V. (2006) Image Compression Using Recurrent Bivariate Fractal Interpolation Surfaces. International Journal of Bifurcation and Chaos, 16, 2063-2071. http://dx.doi.org/10.1142/S0218127406015908
- Kramm, M. (2007) Compression of Image Clusters Using Karhunen Loeve Transformations. Electronic Imaging, Human Vision, XII, 101-106.
- Koli, N. and Ali, M. (2008) A Survey on Fractal Image Compression Key Issues. Information Technology Journal, 7, 1085-1095.
- Bressloff, P.C. and Stark, J. (1991) Neural Networks, Learning Automata and Iterated Function Systems. In: Crilly A.J., Earnshaw, R.A. and Jones, H., Eds., Fractals and Chaos, Springer-Verlag, 145-164. http://dx.doi.org/10.1007/978-1-4612-3034-2_8
- Jacquin, A.E. (1992) Image Coding Based on a Fractal Theory of Iterated Contractive Image Transformations. IEEE Transaction on Image Processing, 1, 18-30. http://dx.doi.org/10.1109/83.128028
- Hamzaoui, R. (1995) Codebook Clustering by Self-Organizing Maps for Fractal Image Compression. NATO ASI Conference Fractal Image Encoding and Analysis, Trondheim, July 1995, 27-38.
- Kohonen, T. (1982) Self-Organized Formation of Topologically Correct Feature Maps. Biological Cybernetics, 43, 59-69. http://dx.doi.org/10.1007/BF00337288