基于自适应分块的快速分形图象压缩
DOI: 10.11834/jig.19980221
Keywords: 分形,图象压缩,分类,匹配,自适应分块
Abstract:
对Fisher的自适应分块分形压缩方法进行了改进,提出了基于相对矩的三级分类方法和多分辨率相似匹配方法,并以此为基础实现了一种新的基于四叉树分块的分形编码算法。实验表明,在压缩比大致相同、信噪比略高的情况下,新算法的编码速度有明显提高。
References
[1] | Barnsley M F, Sloan A. A better way to compress image. Byte,January 1988, 215~223.
|
[2] | Christopher Wein J,Ian Blake F. On the performance of fractal compression with clustering. IEEE Transactions on Image Processing, 1996,5(3)
|
[3] | Monro M, Wooley S J, Fractal image compression without searching. Proc. ICASSP\'94, 557~560.
|
[4] | Jacquin A E. Image coding based on a fractal theory of iterated contractive transformations. IEEE Transactions on Image Processiong. 1992, (1): 18~30.
|
[5] | Fisher Y. Fractal Image Compression. New York:Springer-Verlag, 1995.
|
[6] | Lester Thomas,Farzin Deravi. Region-based fractal image compression using heuristic search. IEEE Transactions on Image Processing. 1995,4(6).
|
[7] | Emmanuel Reusens. Overlapped adaptive partitioning for image coding based on the theory of iterated function systesms. Proc.ICASSP 1994, 569~572.
|
[8] | 操红武.基于自适应分块的分形图象压缩[硕士学位论文].北京:北京航空航天大学,1997.3.
|
Full-Text