节点文献

视觉传感器网络中基于RANSAC的顽健定位算法

RANSAC based robust localization algorithm for visual sensor network

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 张波罗海勇刘冀伟赵方

【Author】 ZHANG Bo1,2,3,LUO Hai-yong1,4,LIU Ji-wei3,ZHAO Fang5(1.Institute of Computing Technology,Chinese Academy of Sciences,Pervasive Computing Research Center,Beijing 100190;2.China Electric Power Research Institute,Beijing 100192;3.School of Automation & Electrical,University of Science and Technology Beijing,Beijing 100083;4.Beijing Key Laboratory of Mobile Computing and Pervasive Device,Institute of Computing Technology Chinese Academy of Sciences,Beijing 100190,China;5.School of Software Engineering,Beijing University of Posts and Telecommunications,Beijing 100876)

【机构】 中国科学院计算技术研究所普适计算中心中国电力科学研究院北京科技大学自动化学院中国科学院计算技术研究所移动计算与新型终端北京市重点实验室北京邮电大学软件学院

【摘要】 视觉传感器网络由于节点故障或环境变化将导致节点对目标的观测数据出现错误,而基于最小二乘的多视觉信息融合定位方法将因此造成较大的定位误差。针对此问题提出一种基于集中式RANSAC的顽健定位算法,将错误数据进行筛选剔除,从而提高定位精度,进一步针对集中式RANSAC将会导致单个节点的计算复杂度过高而导致网络节点能耗不平衡问题,提出基于分布式RANSAC的顽健定位算法,从而将大量的迭代计算平均分布在各个节点中并行处理,在保证定位过程顽健性的同时保证了网络的计算能耗平衡性。最后通过实验对no-RANSAC、cen-RANSAC和dis-RANSAC算法的定位性能进行了比较,验证了该算法能够依照预定的概率获得良好的定位结果,并对算法的时间复杂度进行了分析。

【Abstract】 Due to node failures or environmental changes,observed data on the target will be error in visual sensor network,so the least squares based multi-vision localization algorithm won’t be accurate.A centralized RANSAC based robust localization method was proposed,which can remove the error data and improve the positioning accuracy.Furthermore,to address this issue,energy imbalance of network nodes in centralized RANSAC where all computing load is executed in one single node,a robust localization algorithm based on distributed RANSAC was also proposed,which can distribute a large number of iterative calculations into each node averagely to ensure the network balance on calculation and energy without affecting the robustness.Finally,through comparing experiments on no-RANSAC,cen-RANSAC and dis-RANSAC,it’s verified that this algorithm can obtain robust and good positioning results in a predetermined probability,and the time complexity was analyzed via experiment.

【基金】 国家高技术研究发展计划(“863”计划)基金资助项目(2013AA12A201);“新一代宽带无线移动通信网”国家科技重大专项基金资助项目(2011ZX03005-005);电子信息产业发展基金资助项目(2012-380);天津市滨海新区科技小巨人成长计划基金资助项目(2011-XJR12009)~~
  • 【文献出处】 通信学报 ,Journal on Communications , 编辑部邮箱 ,2013年08期
  • 【分类号】TP212.9;TN929.5
  • 【被引频次】8
  • 【下载频次】127
节点文献中: 

本文链接的文献网络图示:

本文的引文网络