|
|
|
An effective fractal image compression algorithm based on plane fitting |
| Wang Xing-Yuan (王兴元), Guo Xing (国兴), Zhang Dan-Dan (张丹丹) |
| Faculty of Electronic Information & Electrical Engineering, Dalian University of Technology, Dalian 116024, China |
|
|
|
|
Abstract A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. Then, the best-matched one for every range block is obtained by analysing the relation between their coefficients. Experimental results show that the proposed method can shorten encoding time markedly, while the retrieved image quality is still acceptable. In the decoding step, a kind of simple line fitting on block boundaries is used to reduce blocking effects. At the same time, the proposed method can also achieve high compression ratio.
|
Received: 08 February 2012
Revised: 16 March 2012
Accepted manuscript online:
|
|
PACS:
|
05.45.Df
|
(Fractals)
|
| |
07.05.Pj
|
(Image processing)
|
| |
42.30.Wb
|
(Image reconstruction; tomography)
|
|
| Fund: Project supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172), the Special Scientific Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20070141014), and the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165). |
Corresponding Authors:
Wang Xing-Yuan
E-mail: wangxy@dlut.edu.cn
|
Cite this article:
Wang Xing-Yuan (王兴元), Guo Xing (国兴), Zhang Dan-Dan (张丹丹) An effective fractal image compression algorithm based on plane fitting 2012 Chin. Phys. B 21 090507
|
| [1] |
Barnsley M F 1988 Fractal Everywhere (New York: Academic) p. 34
|
| [2] |
Jacquin A E 1992 IEEE Trans. Image Process. 1 18
|
| [3] |
Fisher Y 1995 Fractal Image Compression: Theory and Application (New York: Springer-Verlag) p. 121
|
| [4] |
Duan L M, Shao C F, Yue H and Guan H Z 2010 Acta Phys. Sin. 59 4499 (in Chinese)
|
| [5] |
Sze C J, Liao H Y, Fan K C, Chern M Y and Tsao C K 1996 Image Vision Comput. 14 401
|
| [6] |
Zhang X, Ren W, Tang D N and Tang G N 2010 Acta Phys. Sin. 59 5281 (in Chinese)
|
| [7] |
Truong T K, Jeng J H, Reed I S, Lee P C and Li A Q 2000 IEEE Trans. Image Process. 9 529
|
| [8] |
Yue H, Shao C F and Yao Z S 2009 Acta Phys. Sin. 58 4523 (in Chinese)
|
| [9] |
Lai C M, Lam K M and Siu W C 2003 IEEE Trans. Image Process. 12 1398
|
| [10] |
Song Y R and Jiang G P 2009 Acta Phys. Sin. 58 5911 (in Chinese)
|
| [11] |
Duh D J, Jeng J H and Chen S Y 2005 Image Vision Comput. 23 1115
|
| [12] |
Distasi R, Nappi M and Riccio D 2006 IEEE Trans. Image Process. 15 89
|
| [13] |
Li X G, Gao Z Y, Zhao X M and Jia B 2008 Acta Phys. Sin. 57 4777 (in Chinese)
|
| [14] |
Wang X Y and Wang S G 2008 Comput. Graph. 32 445
|
| [15] |
Ameer S and Basir O 2009 Image Vision Comput. 27 385
|
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
