首页 | 本学科首页   官方微博 | 高级检索  
     

基于Jaccard距离与概念聚类的多模型估计
引用本文:于永彦.基于Jaccard距离与概念聚类的多模型估计[J].计算机工程,2012,38(10):22-26.
作者姓名:于永彦
作者单位:淮阴工学院计算机工程学院,江苏 淮安 223003;河海大学计算机与信息工程学院,南京 210098
基金项目:国家“863”计划基金资助项目(2007AA01Z179)
摘    要:Multi-RANSAC、RHT等方法难以有效实现多模型估计。为此,提出一种基于模型聚类的多模型估计方法。将数据点描述为所属模型的倾向集,把倾向集间的Jaccard距离描述为数据点的一种属性,基于该属性使用改进的Cobweb算法进行聚类。该方法无需预知模型数目和参数变换,可有效克服漏检、交叉模型误检等情况。实验结果表明,该方法具有高效、高精度等优点,适用于消隐点检测、相机自标定等领域。

关 键 词:计算机视觉  外点  倾向集  Jaccard距离  Cobweb聚类  多模型估计
收稿时间:2011-09-19

Multi-model Estimation Based on Jaccard Distance and Conceptual Clustering
YU Yong-yan.Multi-model Estimation Based on Jaccard Distance and Conceptual Clustering[J].Computer Engineering,2012,38(10):22-26.
Authors:YU Yong-yan
Affiliation:YU Yong-yan1,2(1.School of Computer Engineering,Huaiyin Institute of Technology,Huaian 223003,China;2.School of Computer and Information Engineering,Hohai University,Nanjing 210098,China)
Abstract:Multi-RANSAC and RHT these methods are incapable to solve multi-models estimation effectually,and a multi-model estimation method with model-based clustering in conceptual space is proposed.Each data point is represented with a preference set of hypotheses models preferred by that point,and the Jaccard distance between two preference sets is described as a attribute of an data point,to perform a clustering operation using the improved Cobweb algorithm based on the attribute of the data points.Neither this method requires prior specification of the number of models,nor it necessitates parameters transformation,so that it can overcome missing detection and false detection of crossing models.Experimental results show the obvious effect and greater accuracy of the algorithm,thus can be used widely by vanishing point detection,self-calibration of camera,etc.
Keywords:computer view  outlier  preference set  Jaccard distance  Cobweb clustering  multi-model estimation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号