摘要
文章就分形图象压缩中搜索与匹配过程的相似性提出了一个经过不同对比度实现快速分形编码算法。基于序列块和主块之间当前最小象差的方差信息,该算法排除不必搜索的主块,这样大大减少了每个序列块进行搜索和匹配的主块数与相应的编码时间。该算法在减少的时间内生成了与常规满搜索近乎一致的分形编码。
A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper.The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by eliminating domain blocks not searching using the current minimum distortion and variance difference between the range block and domain block.The algorithm produces a completely identical fractal code to that of the conventional full search in reduced time.
出处
《微电子学与计算机》
CSCD
北大核心
2002年第11期65-67,共3页
Microelectronics & Computer
