首页 | 本学科首页   官方微博 | 高级检索  
     检索      

近邻相关匹配图象快速分形压缩编码
引用本文:黄忠保.近邻相关匹配图象快速分形压缩编码[J].湖北师范学院学报(自然科学版),2000,20(2):44-46.
作者姓名:黄忠保
作者单位:湖北师范学院计算机科学系!湖北黄石435002
摘    要:为缩短分形编码中值域块与定义域块逐一匹配时间.将值域块与定义域块的全局匹配改为近邻匹配。并提出近邻相关匹配分形近似编码的方法,在子块搜索匹配之前将大量显著不相关的子块剔除掉,从而大大缩小搜索空间。通过实验,该方法比全局搜索匹配的分形编码快。

关 键 词:分形块编码  相关匹配  值域块  定义域块

A RAPID FRACTAL COMPR ESSION CODING FOR THE IMAGE NEIGHBORHOOD CORRELATION MATCHING
HUANG,Zhong-bao.A RAPID FRACTAL COMPR ESSION CODING FOR THE IMAGE NEIGHBORHOOD CORRELATION MATCHING[J].Journal of Hubei Normal University(Natural Science),2000,20(2):44-46.
Authors:HUANG  Zhong-bao
Abstract:I n order to shorten the one-by-one match time between the range block and the domain block in fractal coding,the global matching between that is changed into the neighbor matching and the neighbor fractal approximation coding based on correlation matching is proposed.Before the sub-block is searched and matched,a large number of obviously uncorrelative blocks are deleted.So the searching space is quretly narrowed.Viatesting,this mathod is faster than fractal coding based on the global searching matching.
Keywords:Fractal  block  co ding  Correlation  matching  Range  block  Do main  block
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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