By Topic

Deferring range/domain comparisons in fractal image compression

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
$33 $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)
D. Riccio ; Dipt. di Matematica e Informatica, Universita di Salerno, Baronissi, Italy ; M. Nappi

Fractals are a promising framework for several applications other than image coding and transmission, such as database indexing, texture mapping and pattern recognition problems such as writer authentication. However, fractal based algorithms are strongly asymmetric because, in spite of the linearity of the decoding phase, the coding process is very time consuming. Many different solutions have been proposed for this problem, but there is not yet a standard for fractal coding. In this paper we analyze the problem of complexity reduction of the image coding phase and providing a new classification technique based on an approximation error measure. We show formally that postponing range/domain comparisons with respect to a preset block, it is possible to reduce the amount of operations needed to encode each range and therefore whole the image. The proposed strategy allows a drastic complexity reduction of the coding phase. The proposed method has been compared with another fractal coding method, showing in which circumstances the proposed algorithm performs better in terms of both bit rate and/or computing time.

Published in:

Image Analysis and Processing, 2003.Proceedings. 12th International Conference on

Date of Conference:

17-19 Sept. 2003