首页 | 官方网站   微博 | 高级检索  
     

基于分数盒维数的快速分形图像编码
引用本文:何传江,黄娟娟,李高平.基于分数盒维数的快速分形图像编码[J].中国图象图形学报,2007,12(2):277-282.
作者姓名:何传江  黄娟娟  李高平
作者单位:重庆大学数理学院 重庆400030
摘    要:分形图像编码是一种很有前途的压缩技术,但编码时间长阻碍了它的广泛应用。分形编码的时间主要花费于在一个海量码本中搜索每个输入子块的最佳匹配块。针对这个问题,提出了一种快速分形编码算法,它基于图像块的分数盒维数特征,能够在较小的搜索范围内完成输入子块的最佳匹配。实验结果显示,该算法能够大大缩短编码时间,同时实现和全搜索分形编码算法相同或更好的图像质量。

关 键 词:分形  分形图像编码  分形图像压缩  分数盒维数
文章编号:1006-8961(2007)02-0277-06
修稿时间:2005-08-10

Fast Fractal Image Coding Based on Fractional Box-counting Dimension
HE Chuan-jiang,HUANG Juan-juan,LI Gao-ping,HE Chuan-jiang,HUANG Juan-juan,LI Gao-ping and HE Chuan-jiang,HUANG Juan-juan,LI Gao-ping.Fast Fractal Image Coding Based on Fractional Box-counting Dimension[J].Journal of Image and Graphics,2007,12(2):277-282.
Authors:HE Chuan-jiang  HUANG Juan-juan  LI Gao-ping  HE Chuan-jiang  HUANG Juan-juan  LI Gao-ping and HE Chuan-jiang  HUANG Juan-juan  LI Gao-ping
Affiliation:College of Mathematics and Physics, Chongqing University, Chongqing 400030
Abstract:Fractal image coding is a very promising compression technique,but it suffers from long encoding time.The time to encode fractally an image is mostly spent on searching for the best-matched block for each of range blocks in a usually-large domain pool.This paper thus proposed a fast fractal encoding algorithm based on fractional box-counting dimension of an image block,which can find out the best-matched block for an input range block with a reduced search.Experimental results show that the proposed algorithm can significantly shorten the encoding time,while achieving the same or better decoded image quality as baseline fractal algorithm with full search.
Keywords:fractal  fractal image coding  fractal image compression  fractional box-counting dimension
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号