By Topic

Fractal image compression using competitive neural network in frequency domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Takruri, M.S. ; Dept. of Electr. Eng., Jordan Univ., Amman, Jordan ; Abu-Al-Nadi, D.I.

A new method for fractal image compression is presented. A combination between the idea of nearest neighbor search in the frequency domain and the clustering property of the competitive neural networks is used in this method. In this paper we use two methods for fractal image compression. In the first method (which is the goal of this paper), the DCT transformed range blocks are classified into clusters using a competitive neural network and the centers of clusters are used instead of domains to evaluate the coefficients vectors. In the second method, we implement the two dimensional discrete cosine transform (DCT) of the projected codebook blocks, ±F(D), and ranges, F(R), in order to search for nearest neighbor in the frequency domain as suggested by Barthel et al (IEEE Image Proc. Conf., pp. 112-116, 1994). Comparison of the techniques is conducted.

Published in:

Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003 10th IEEE International Conference on  (Volume:1 )

Date of Conference:

14-17 Dec. 2003