.png){kind=icon}
返回
Fractal image compression: a randomized approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2004.02.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The fractal image compression is inherently time intensive and thus there is a growing need to increase its speedup. This paper presents a fast encoding scheme where the domain blocks are searched randomly for every range block. An analysis of the basic fractal image compression method has been carried out and on the basis of the analysis a method for image characterization has been proposed. Then a detailed theoretical analysis of this randomized fractal compression scheme has been presented and the results are validated with the experimental ones. The random approach has been found to be quite efficient giving considerable increase in speed-up compared to several other approaches. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
image compression
iterated function system (IFS)
fractal image compression (FIC)
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容