节点文献

图象块的分形近似和分块分形近似编码

Fractal Approximation of Image Blocks and Block Fractal Approximation Code

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 皮明红彭嘉雄刘华方

【Author】 Pi Minghong,Peng Jiaxiong,Liu huafang (Institute of Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology,Wuhan 430074)

【机构】 华中理工大学图象识别与人工智能研究所

【摘要】 提出了一种图象块的分形近似方法。该方法借助于SAS以达到对图象块的最小平方的分形近似,其运算量仅为2×M×N次乘法和4×M×N次加法,M×N为图象块大小。由图象块分形近似量化而成的编码,称之为分块分形近似编码。其压缩比依赖于所选取图象块大小和迭代变换系数的量化。对8×8图象块,在不失真情况下,其压缩比达到17.8倍。通过对大量图象的实验结果表明,只需进行8次迭代,就能得到满意的重构图象。和其它分形编码相比,此方法简洁,编码速度快,对220×220的"Lena"图象进行编码,在PC486/DX33上,仅需时30秒。

【Abstract】 A method for approximation of image block is presented,based on a least squares fractal approximation by a Self Affine System。The computational cost is only equal to 2× M×N products and 4× M×N additions。The code of image block consists of the quantized fractal cofficients。This block coding of images is called as block fractal approximation code(BFAC)。Its compression ratio depends on the size of image block and quantization of fractal cofficients。BFAC for "Lena" image by 8×8 blocks is quantized to six bits and encodes to a compression ratio of 17.8∶1,its encoding and decoding time is about 30 seconds in PC486/DX33。After eight iterations of decoding,the reconstructive image look like the origin。Its greater speed and simplicity compared to other fractal transforms suggest its immediate applicability。

【关键词】 IFSSAS不变函数吸引子分形近似分形编码
【Key words】 IFSSASInvariant functionAttractorFractal approximationFractal code
【基金】 图象信息处理与智能控制国家教委开放研究实验室资助
  • 【文献出处】 中国图象图形学报 ,JOURNAL OF IMAGE AND GRAPHICS , 编辑部邮箱 ,1997年11期
  • 【分类号】TN919.8
  • 【被引频次】4
  • 【下载频次】33
节点文献中: 

本文链接的文献网络图示:

本文的引文网络