检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《纺织学报》2006年第11期10-13,共4页Journal of Textile Research
摘 要:花式纱线不规则的外形、复杂的材质结构以及丰富的色彩变化,使其边缘轮廓的提取困难。在泊松方程的基础上,提出一套对真实纱线边缘轮廓提取的算法。将花式纱线的数码采集位图划分为确定前景、确定后景和不确定区域,应用有限差分法和Gauss-Seidel迭代法对不确定区域中像素点的不透明系数α值进行计算,判断该像素点属于前景还是属于后景,逐步缩小不确定区域,从而得到细致的纱线边缘曲线。最后,以大肚纱和结子纱为例,得到了比较理想的实验提取效果。Fancy yam's irregular shape, complicated structure of texture, and abundant changes in colors make it difficult to realize the outlining of its figure. In this paper, an algorithm based on Poisson's equation is used to realize the edge outlining of fancy yams. The bitmap of a fancy yam is divided into three areas: the assured foreground, the assured background and the unsure area. The finite difference method and the Gauss- Seidel iteration method are applied to calculate the value of a the pixels in the unsure area, according to each pixel's value of α to judge whether the pixel belongs to the foreground or the background. By repeated calculations, the unsure area reduces gradually and the exact outline of the fancy yam can be obtained. Finally, the slubby yam and the knot yam are given for example, good outlining effects are obtained.
关 键 词:花式纱线 边缘轮廓 泊松方程 有限差分法 Gauss-Seidel迭代
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249