1) over-segmentation
过分割
1.
Aimed at resolving the problems of sensitivity to noise and over-segmentation existing in traditional watershed algorithm,a watershed segmentation scheme based on double opening and closing reconstruction and non-linear processing was proposed.
针对传统分水岭分割算法对噪声敏感和易于产生过分割问题,提出了一种基于开闭二次重建和非线性处理的分水岭图像分割方案。
2.
There is over-segmentation phenomenon based on watershed segmentation algorithm,so this paper presents a new segmentation algorithm,which is followed with floating-point moving image based on morphological grad image,then watershed transformation is done,edge orientation will be more precise.
针对基于区域的分水岭分割算法通常存在过分割现象,提出了一种新的分割算法,其分割流程大致为:先求形态梯度图像的浮点活动图像,然后进行分水岭变换,这样边缘定位会更准确;接着使用区域生长法对图像作进一步分割,可以很好地抑制过分割现象,感兴趣的区域也得以保留。
2) over segmentation
过分割
1.
According to the over segmentation of watershed algorithm and the characters of infrared image,the gray means of the region and the region areas,have been presented,which were used t unify these over segmented regions into some significant object regions.
本文采用分水岭算法对红外图像进行分割 ,针对其存在的过分割问题以及红外图像的特点 ,提出了分割区域边界平均灰度及其面积对过分割区域进行合并 ,以得到有意义的分割结果。
2.
But the traditional watershed transformation has a serious problem of over segmentation,and noise of the image and fake textures may submerge the wanted edge information.
但传统分水岭变换过分割问题严重,图像的噪声和虚假纹理会淹没真正想得到的边缘信息。
3) over-segmentation
过度分割
4) Oversegmentation
过度分割
1.
Method of Overcoming the Oversegmentation by Wavelet Transform;
克服Watershed算法过度分割的方法
2.
But oversegmentation may be resulted from these methods.
但是直方图阈值分割技术会产生丢失目标信息的过度分割 (oversegmentation)现象 ,采用HSI彩色系统也会出现此种状况。
5) over-segmentation problem
过分割现象
1.
To deal with the extreme over-segmentation problem of region-based watershed methods, two approaches have been proposed.
针对基于区域的分水岭分割算法中通常存在的严重过分割现象,而采用2点措施来改进:一是以梯度图像的浮点活动图像取代梯度图像进行分水岭变换,使边缘定位更准确;其二是以基于面积和对比度控制的合并小区域准则,有效抑制过分割现象,同时满足感兴趣区的分割要求。
6) image over-segmentation
图像过分割
1.
Based on the improved image over-segmentation, a new virtual scene construction algorithm is proposed.
在分析了以往所采用的改进图像过分割方法的基础上,提出了一种新的虚拟场景构建算法。
补充资料：Dedekind分割
Dedekind分割
Dedekind cut
D日加脑目分割[D汕如目cut;皿e八eKou皿。即ee，e。。e]，分割(cut) 把实数集R(或有理数集Q)分割成两个非空集合A和B，其并为R(或Q)，并使得对任何a6A和be及都有a
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条