检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山大学电子系信息处理实验室,广州市510275
出 处:《中国图象图形学报(A辑)》2000年第11期920-924,共5页Journal of Image and Graphics
基 金:广东省自然科学基金资助项目(960033,963037)
摘 要:提出了一种基于小波系数零树结构的分形预测图象编码方法 ,首先按照零树结构在同方向不同分辨率的各个子带图象上确定要预测的图象块 (Range Block) ,也就是将这些图象块串起来构成一棵与零树相类似的图象树(Range Tree) ;然后 ,对每一图象块 ,在同方向低一级分辨率的子带图象上寻找与其最佳分形匹配的相似块(Dom ian Block) ,而这些相似块也按照零树结构上下延伸 ,以产生多棵相似树 (Dom ain Tree) ,其中与图象树最接近的相似树就是图象树的预测树 .理论分析和实验结果表明 ,该方法在峰值信噪比稍微下降的情况下 ,能够获得较高的压缩比 .A new fractal predictive image coding scheme based on zerotrees of wavelet coefficients is presented. We first pick out the range blocks to be predicted based on the zerotrees from subimages of the same orientation but different resolutions. These range blocks will form a range tree, something like zerotrees. For each range block, we then look for its optimum fractally matched domain block in the subimage of the same orientation but lower resolution than that of the range block. Each domain block obtained this way can extend through different resolutions along the same orientation to form a domain tree. Among all these domain trees, one closest to the range tree will be its predictive tree. Theoretical analysis and experimental results presented in the paper show that our scheme can obtain higher compression rate at the little cost of signal to noise ratio.
分 类 号:TN919.81[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195