期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Color image segmentation using mean shift and improved ant clustering 被引量:3
1
作者 刘玲星 谭冠政 M.Sami Soliman 《Journal of Central South University》 SCIE EI CAS 2012年第4期1040-1048,共9页
To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can ... To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can preserve the discontinuity characteristics of an image are segmented by MS algorithm,and then they are represented by a graph in which every region is represented by a node.In order to solve the graph partition problem,an improved ant clustering algorithm,called similarity carrying ant model(SCAM-ant),is proposed,in which a new similarity calculation method is given.Using SCAM-ant,the maximum number of items that each ant can carry will increase,the clustering time will be effectively reduced,and globally optimized clustering can also be realized.Because the graph is not based on the pixels of original image but on the segmentation result of MS algorithm,the computational complexity is greatly reduced.Experiments show that the proposed method can realize color image segmentation efficiently,and compared with the conventional methods based on the image pixels,it improves the image segmentation quality and the anti-interference ability. 展开更多
关键词 color image segmentation improved ant clustering graph partition mean shift
在线阅读 下载PDF
似星树与路的乘积图的任意可分性 被引量:1
2
作者 张盼盼 刘凤霞 孟吉翔 《吉林大学学报(理学版)》 CAS 北大核心 2021年第3期525-530,共6页
设似星树S=S(a 1,a 2,…,a t,b 1,b 2,…,b s),其中a i(1≤i≤t)是奇数,bj(1≤j≤s)是偶数.首先,讨论似星树S与路Pl的乘积图S■P l在t和s不同取值下是否为任意可分图,并用图不含完美匹配的方法和反证法给出其不是任意可分图的充分条件;... 设似星树S=S(a 1,a 2,…,a t,b 1,b 2,…,b s),其中a i(1≤i≤t)是奇数,bj(1≤j≤s)是偶数.首先,讨论似星树S与路Pl的乘积图S■P l在t和s不同取值下是否为任意可分图,并用图不含完美匹配的方法和反证法给出其不是任意可分图的充分条件;其次,分析图S■P l的Hamilton性,并用似星树的任意可分性给出图为任意可分图的充分条件.结果表明,当t=1且s≤2时,图S■P l是任意可分图;当t≥2或t=0,或者t=1,s≥3,b 1=b 2=…=b s,t+s≥l+2时,图S■P l均不是任意可分图. 展开更多
关键词 任意可分图 乘积图 似星树 可迹图
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部