一种基于邻域搜索的分形图象编码改进算法  

An Improved Algorithms of Fractal Image Coding Based on Neighbour-Searching

作　　者：娄莉[1] 

机构地区：[1]西安石油大学计算机学院,陕西西安710065

出　　处：《微电子学与计算机》2006年第5期66-68,共3页Microelectronics & Computer

基　　金：西安石油大学科技创新基金(2004-35)

摘　　要：文章提出了一种基于邻域搜索匹配的分形编码改进算法。在信噪比相近时,它比Jacqnin的分形块编码的压缩比高,编码速度快。实验结果表明,该分形编码压缩比可达到15.28,峰值信噪比可达30.35dB。在PC586上,编码时间为196秒,解码时间为36秒。An Improved Algorithms of Fractal Coding based on Matching in Range Block＇s Neighbourhood searching is presented, Compared with Jacquin＇s fractal block coding, their PSNR is almost same, its compression ratio is higher, its speed is faster. Experimental results show that this fractal coding for 512×512 ＂Lenna＂ image encodes to a compression ratio of 15.28 and 30.35 dB in PSNR, its encoding time is 196 seconds and its decoding time is 36 seconds.

关 键 词：分形编码 邻域 值域块 定义域块 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]