检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]三峡大学机械与动力学院,湖北宜昌443002 [2]三峡库区生态环境教育部工程研究中心,湖北宜昌443002
出 处:《计算机应用与软件》2016年第11期139-143,共5页Computer Applications and Software
基 金:国家自然科学基金项目(51475266);三峡库区生态环境教育部工程研究中心开放基金项目(KF2015-11);湖北省三峡大学培优基金项目(2015PY022)
摘 要:针对传统的Meanshift算法在连续的同色调背景干扰下无法准确、持续跟踪目标的问题,提出一种基于Kalman-optical flow(KOF)的改进Meanshift目标跟踪算法。首先,通过基于色调空间的光流检测对Meanshift窗口区域内的特征点进行建模,获得其图像坐标;然后,利用Kalman滤波的速度预估排除背景特征点,得到基于目标模型特征点的空间约束条件;最后,将得到的空间约束条件结合传统Meanshift算法中的色调约束条件,构建新的反投影直方图,并将新的反投影图作为Meanshift的概率密度图进行迭代,从而完成目标跟踪。实验表明,在连续的同色调背景区域的干扰下,该算法仍可以准确、持续地跟踪目标。Aiming at the problem that traditional Meanshift algorithm cannot track the target accurately and constantly under the interference of incessant same hue background,we proposed an improved Meanshift target tracking algorithm which is based on Kalman-optical flow( KOF).First,it models the feature points within the area of Meanshift window by hue space-based optical flow detection algorithm,and gets the coordinates of their images. Secondly,it uses the speed prediction of Kalman filter to exclude background feature points and obtains the space constraint condition which is based on the target model feature points. Finally,it combines the derived space constraint condition with the hue constraint condition of traditional Meanshift algorithm to construct new back projection histogram,and uses the new back projection graph as the probability density map of Meanshift for iteration,so as to complete the target tracking. Experimental results demonstrated that under the interference of incessant same hue background area this algorithm could still track targets accurately and constantly.
关 键 词:MEANSHIFT 目标跟踪 光流 KALMAN滤波 同色调区域
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.48.95