Share Email Print

Proceedings Paper

Fast classification method for fractal image compression
Author(s): Trieu-Kien Truong; Jyh Horng Jeng
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper, a fast algorithm is developed which reduces the searching space for Fractal image coding. The basic idea is to classify the domain pool into three classes, non- edged class, horizontal/vertical class and the diagonal class. For each given range block, the property is computed first to determine which class it belongs. Then one only has to search from the corresponding class in the domain pool to find the best match. The classification operation is performed only according to the lowest frequency coefficients of the given block in the horizontal and vertical directions, in which the frequency data is computed from Discrete Cosine Transform (DCT). The main advantages for this classification scheme are that the classification mechanism is simple and the DCT algorithm is easy to implement. A simulation shows that, the proposed fast algorithm is about 2 times faster than the baseline method while the quality of the retrieved image is almost the same.

Paper Details

Date Published: 17 November 2000
PDF: 4 pages
Proc. SPIE 4122, Mathematics and Applications of Data/Image Coding, Compression, and Encryption III, (17 November 2000); doi: 10.1117/12.409247
Show Author Affiliations
Trieu-Kien Truong, I-Shou Univ. (Taiwan)
Jyh Horng Jeng, I-Shou Univ. (Taiwan)

Published in SPIE Proceedings Vol. 4122:
Mathematics and Applications of Data/Image Coding, Compression, and Encryption III
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?