检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈佩[1] 许晓鸣[1] 张卫东[1] 徐润生[1]
出 处:《电子学报》2000年第10期45-48,共4页Acta Electronica Sinica
摘 要:本文首先分析Sluzek方法的思想即 :减小方差而同时尽可能不减小不同类之间的均值差 ;然后分析了该方法的不足之处 ,证明了存在改进的可能性 ;并且提出了改进方法 ,即把目标分割为n个矩等分圆环 ,分别计算其矩不变量 ,从中选取某几个量作为识别指标 ;最后通过例子证实了本文方法的改进效果 .In this paper,Sluzek′s method is investigated.Its advantage lies in decreasing moments′ variance and in making full use of discriminating difference between two classes as possible.Its disadvantage is its inability of discriminating two similar classes whose differences lie in the middle.In this paper we will prove in a general form that there is much chance of improving this method,and present a new method.The prototype object is partitioned into n rings of equal moment,and the moment invariants corresponding to these circles are computed,from which some are selected as the descriptors of the objects.Finally,the improving effect of our method is verified by some examples.
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117