基于值域块邻域匹配的分形近似编码  

Fractal Approximation Coding Based on Matching in Range Block's Neighbourhood

作　　者：皮明红[1,2] 李德仁[1,2] 龚建雅[1,2] 

机构地区：[1]武汉测绘科技大学 [2]湖北师范学院数学系

出　　处：《通信学报》1998年第9期84-86,共3页Journal on Communications

摘　　要：本文提出了基于值域块邻域匹配的分形近似编码。它比Ｊａｃｑｕｉｎ的分形块编码的压缩比高，编码速度快，信噪比相近。对５１２×５１２“Ｌｅｎｎａ”图像实验结果表明：该分形编码压缩比可达到０．３６ｂｐｐ，峰值信噪比可达３１．２５ｄＢ，在ＰＣ４８６上，编码时间为２２７秒，解码时间为３８秒。Fractal Approximation Coding Based on Matching in Range Block's Neighbourhood is presented, Compared with Jacquin's fractal block coding, its compression ratio is higher, its speed is faster, their PSNR is almost same. Our conclusion turns out that this fractal coding for 512×512 'lenna' image encodes to a compression ratio of 0.36 bpp and 31.25 dB in PSNR, its encoding time is 227 seconds and its decoding time is 38 seconds.

关 键 词：邻域 分形块编码 分形近似 值域块 图像处理 

分 类 号：TN919.8[电子电信—通信与信息系统] TN919.31[电子电信—信息与通信工程]