作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 1998, Vol. 24 ›› Issue (07): 17-.

• 论文 • 上一篇    下一篇

基于IFS理论的快速图象编码和解码算法

蔡芳,孙隆和,徐乃平   

  1. 航空总公司六一三所 洛阳,471009,西北工业大学 904教研室,西安,710072,西北工业大学 904教研室 西安,710072,西北工业大学 904教研室 西安,710072
  • 发布日期:1998-07-25

Fast Image Encoding and Decoding Algorithm Based on IFS Theory

Cai Fang, Sun Longhe, Xu Naiping   

  1. (P.O.Box 017, Luoyang Luoyang 471009);(Department 904, Northwestern Polytechnical University Xian710072)
  • Published:1998-07-25

摘要: 分形图象编码法具有高压缩比、高图象品质等显著优点,但其编码时间太长。文中提出的快速编码算法,用偏差图导出距离度量,用二叉树和链表结构进行搜索匹配,可使编码速度提高几十倍乃至百倍。同时,用偏差图进行解码迭代,可使解码过程加速,而还原图象质量不变。

关键词: 分形块编码, 迭代函数系统, 图象压缩, 解码

Abstract: Fractal image compression is of outstanding advantages of high compression ratio and high image qualities,but its encoding process is time-consuming.It this paper, we proposed a fast encoding algorithm which arranges the domain blocks in the binary tree and chain structure and derives the distance metric from the error image.In fact, it can shorten the encoding time and speed up the coding process by dozens of or up to one hundred times.In decoding process, we also use error image for iteration instead of greyscale image and can speed up the decoding process.The fast decoding algorithm has the same attractor as the common decoding algorithm.

中图分类号: