摘要
将多尺度分析的思想引入到值域块与定义域块匹配过程中,预先剔除掉在粗尺度下与值域块不匹配的定义域块,相对减少了在细尺度下与值域块匹配的定义域块.该方法为缩短分形编码的搜索时间提供了一条新途径.与全局搜索匹配分形块编码相比。
In fractal coding, the matching procedure between the range block and domain block in a pool of domain blocks one by one is time consuming. To cut down the matching time, the multiscale matching idea is introduced with pre rejection of the domain blocks that are mismatched with the range block in coarse scale and with a relative decrease of the domain blocks that are matched with the range block in fine scale. A comparison with another coding method shows that the time is greatly shortened.
出处
《华中理工大学学报》
CSCD
北大核心
1997年第5期74-75,共2页
Journal of Huazhong University of Science and Technology
基金
北京大学视觉与听觉信息处理实验室资助
华中理工大学理学院基金
关键词
分形块编码
多尺度匹配
分形近似编码
编码时间
neighborhood
fractal block coding
fractal approximation
range block
domain block