Non-search Fractal Image Compression Algorithm Research
In order to solve the problem of long time of fractal image compression,a kind of adaptive non-search fractal image compression coding is put forward.This algorithm assigns specific domain block as matching block,thus search is required and coding is accelerated.Besides,this algorithm adopts the method of range block adaptive decomposition and combination,and can solve problems like part of range blocks incapable of matching and low compression ratio of non-search method.Experiments indicate that this algorithm is better than search fractal image compression algorithm and JPEG algorithm.
Fractal Image Compression Coding Non-search Range Block Adaptive Decomposition Range Block Adaptive Combination
Shiping LI Lei Xia
College of information science and Engineering,Northeastern University,Shenyang,110004,China Air Force Communications Officer School in Dalian,116600,China
国际会议
长沙
英文
4387-4391
2014-05-31(万方平台首次上网日期,不代表论文的发表时间)