arrow
Return

Fractal image compression using visual-based particle swarm optimization

delete2008-08-01
delete44
PRE
AI
C
Chun‐Chieh Tseng *
J
Jer‐Guang Hsieh
J
Jyh-Horng Jeng
DOI:10.1016/j.imavis.2008.01.003delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Fractal image compression is promising both theoretically and practically. The encoding speed of the traditional full search method is a key factor rendering the fractal image compression unsuitable for real-time applications. In this papey, particle swarm optimization (PSO) method by utilizing the visual information of the edge property is proposed, which can speedup the encoder and preserve the image quality. Instead of the full search, a direction map is built according to the edge-type of image blocks, which directs the particles in the swarm to regions consisting of candidates of higher similarity. Therefore, the searching space is reduced and the speedup can be achieved. Also, since the strategy is performed according to the edge property, better visual effect can be preserved. Experimental results show that the visual-based particle swarm optimization speeds up the encoder 125 times faster with only 0.89 dB decay of image quality in comparison to the full search method. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
fractal image compression
particle swarm optimization
edge-type classification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Image and Vision Computing cover
Image and Vision Computing
IF:
4.2
Papers:
4.0K
Citations:
6.7K

Organization

N
national sun yat sen university
Scholars:
7.6K
Papers: 7.7K
Citations: 3
I
I Shou University
Scholars:
2.7K
Papers: 2.9K
Citations: 17