检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安工程科技学院计算机学院,陕西西安710048 [2]西安工业学院数理系,陕西西安710032
出 处:《计算机应用与软件》2005年第8期95-97,共3页Computer Applications and Software
基 金:陕西省教育厅专项科研基金项目(99JK196)资助。
摘 要:扫描路径是数字半色调技术的关键环节。针对行扫描误差扩散方法、HilbertPeano曲线半色调方法的不足,提出了基于图像极小相似度的填充曲线半色调方法。该方法首先定义了一个与待处理图像像素个数相等的非连通带权图及其相关的一个连通带权图;其次求出后者的最小生成树;再次根据最小生成树将非连通的原图连接成连通图,该连通图即为图像的极小相似度曲线;最后从该曲线的任意一点出发,沿此曲线深度优先处理图像的每一个像素。实验表明,用新的扫描路径处理后得到的半色调图像的整体效果较好;图像不存在与扫描路径相关的规律性纹理;图像边缘更加平滑,其边缘对比度指标比现有方法优一个数量级;图像的非边缘区域误差最小。Scanning path is the key of digital halftoning technology. For the defects of some digital halftoning methods based on HilbertPeano space filling curves and line scanning error diffusion, a new digital halftoning technique based on error diffusion along a MSDC ( Minimal Similarity Degree Curves)is proposed. In the new method, First, a rectangular weight non-connected grid graph over the image is defined, as well as a correlative weight connected grid graph. Second, a minimum-weight spanning tree of the latter graph is computed. Third, based on the minimum-weight spanning tree,the rectangular weight non-connected grid graph is constructed a weight connected grid graph,and the weight connected grid graph is MSDC. Finally,the weight connected grids graph is processed by depth first search. Lots of comparative experiments had improved that whole quality of resulting digital image with new method is better than other methods( Hilbert-Peano space filling curves and line scanning curves) ,that resulting digital image with new method is free from regular patterns, that edge of resulting digital image is smoother than other methods,which its edge contrast degree is superior one power level to others,that non-edge error of image is the least in the three methods.
关 键 词:计算机 图像处理 图像极小相似度 填充曲线半色调方法 数字半色调技术
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.149.165