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

一种健壮的超像素跟踪算法
引用本文:郭利,周盛宗,付璐斯,于志刚.一种健壮的超像素跟踪算法[J].计算机系统应用,2017,26(12):130-136.
作者姓名:郭利  周盛宗  付璐斯  于志刚
作者单位:中国科学院 福建物构所, 福州 350002;福建师范大学 数学与计算机科学学院, 福州 350117,中国科学院 福建物构所, 福州 350002;福建师范大学 数学与计算机科学学院, 福州 350117;中北大学 计算机与控制工程学院, 太原 030051,中国科学院 福建物构所, 福州 350002;中北大学 计算机与控制工程学院, 太原 030051,中国科学院 福建物构所, 福州 350002;中北大学 计算机与控制工程学院, 太原 030051
摘    要:在目标跟踪中,传统的超像素跟踪算法在发生遮挡等情况后,会将非目标超像素标记为目标加入到特征空间. 在对候选样本置信度计算中,利用特征空间中最近邻超像素来划定样本中超像素的簇归属会产生错误;而依据的近邻超像素数量过多时,又会造成分类误差的积累. 为解决上述问题,本文提出一种健壮的超像素跟踪算法. 本算法以贝叶斯算法为框架,首先,将前几帧进行超像素切割,提取特征并使用均值漂移聚类算法和基于超像素的外观表示模型进行分类和计算类置信度,放入特征空间中. 其次,根据接下来几帧的平均中心误差确定最佳近邻数目. 最后,在跟踪过程中,对获取帧的指定区域进行超像素切割,提取特征、进行软分类和计算置信度;根据上一帧目标位置进行高斯采样,累加样本内超像素置信度,获得样本置信度;在发生严重遮挡时,不进行滑动窗口更新和外观模型修改,使用当前模型继续跟踪. 与传统的最近邻超像素算法相比,本算法能够有效提升跟踪成功率和降低平均中心误差.

关 键 词:最佳近邻数目  软分类  目标跟踪  均值漂移算法  置信度  遮挡
收稿时间:2017/3/16 0:00:00
修稿时间:2017/4/5 0:00:00

Robust Superpixes Tracking Method
GUO Li,ZHOU Sheng-Zong,FU Lu-Si and YU Zhi-Gang.Robust Superpixes Tracking Method[J].Computer Systems& Applications,2017,26(12):130-136.
Authors:GUO Li  ZHOU Sheng-Zong  FU Lu-Si and YU Zhi-Gang
Affiliation:Fujian Institute of Research on the Structure of Matter, Chinese Academy of Sciences, Fuzhou 350002, China;College of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350117, China,Fujian Institute of Research on the Structure of Matter, Chinese Academy of Sciences, Fuzhou 350002, China;College of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350117, China;School of Computer and Control Engineering, North University of China, Taiyuan 030051, China,Fujian Institute of Research on the Structure of Matter, Chinese Academy of Sciences, Fuzhou 350002, China;School of Computer and Control Engineering, North University of China, Taiyuan 030051, China and Fujian Institute of Research on the Structure of Matter, Chinese Academy of Sciences, Fuzhou 350002, China;School of Computer and Control Engineering, North University of China, Taiyuan 030051, China
Abstract:During the object tracking, when occlusion occurs, the traditional superpixel tracking algorithm will add the superpixels of the non-target area into the feature space. In the calculation of the candidate sample confidence, the nearest neighbor superpixel in the feature space is used to delimit the cluster attribution of the superpixels in the sample, and the accumulation of the classification error is caused by the excessive number of neighboring superpixels. To solve the problems above, we propose a robust superpixels tracking method. This algorithm uses Bayesian algorithm as the framework. Firstly, we slice the first few frames into superpixels, extract the feature, use the mean shift clustering algorithm and representation model based on superpixel to classify and calculate the class confidence value, and put the feature into feature space. Secondly, the suitable numbers of neighbors can be found with the mean center error of next few frames. Last but not least, during the tracking process, the superpixel is segmented in the specified area of the acquired frame, to extract the feature. The cluster is confirmed with soft classification and the confidence value is calculated. According to the previous frame target position, the Gaussian sampling is collected. We can obtain the sample confidence value with the accumulation of the confidence value. In case of severe occlusion, the sliding window update and the appearance model modification are not carried out, and we continue to use the current model to track. Compared with the traditional tracking algorithm based on nearest superpixel, the algorithm can effectively improve the tracking success rate and reduce the average center errors.
Keywords:best number of nearest neighbors  soft classification  object tracking  meanshif  confidence  occlusion
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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