When a mass of individual targets move closely, it is unpractical or unnecessary to localize and track every specific target in wireless sensor networks (WSN). However, they can be tracked as a whole by view of group ...When a mass of individual targets move closely, it is unpractical or unnecessary to localize and track every specific target in wireless sensor networks (WSN). However, they can be tracked as a whole by view of group target. In order to decrease the amount of energy spent on active sensing and communications, a flexible boundary detecting model for group target tracking in WSN is proposed, in which, the number of sensors involved in target tracking is adjustable. Unlike traditional one or multiple individual targets, the group target usually occupies a large area. To obtain global estimated position of group target, a divide-merge algorithm using convex hull is designed. In this algorithm, group target’s boundary is divided into several small pieces, and each one is enclosed by a convex hull which is constructed by a cluster of boundary sensors. Then, the information of these small convex hulls is sent back to a sink. Finally, big convex hull merged from these small ones is considered as the group target’s contour. According to our metric of precision evaluation, the simulation experiments confirm the efficiency and accuracy of this algorithm.展开更多
In this paper, we explore the technology of tracking a group of targets with correlated motions in a wireless sensor network. Since a group of targets moves collectively and is restricted within a limited region, it i...In this paper, we explore the technology of tracking a group of targets with correlated motions in a wireless sensor network. Since a group of targets moves collectively and is restricted within a limited region, it is not worth consuming scarce resources of sensors in computing the trajectory of each single target. Hence, in this paper, the problem is modeled as tracking a geographical continuous region covered by all targets. A tracking algorithm is proposed to estimate the region covered by the target group in each sampling period. Based on the locations of sensors and the azimuthal angle of arrival (AOA) information, the estimated region covering all the group members is obtained. Algorithm analysis provides the fundamental limits to the accuracy of localizing a target group. Simulation results show that the proposed algorithm is superior to the existing hull algorithm due to the reduction in estimation error, which is between 10% and 40% of the hull algorithm, with a similar density of sensors. And when the density of sensors increases, the localization accuracy of the proposed algorithm improves dramatically.展开更多
Traditional tracking algorithms based on static sensors have several problems. First, the targets only occur in a part of the interested area; however, a large number of static sensors are distributed in the area to g...Traditional tracking algorithms based on static sensors have several problems. First, the targets only occur in a part of the interested area; however, a large number of static sensors are distributed in the area to guarantee entire coverage, which leads to wastage of sensor resources. Second, many static sensors have to remain in active mode to track the targets, which causes an increase of energy consumption. To solve these problems, a target group tracking algorithm based on a hybrid sensor network is proposed in this paper, which includes static sensors and mobile sensors. First, an estimation algorithm is proposed to estimate the objective region by static sensors, which work in low-power sensing mode. Second, a movement algorithm based on sliding windows is proposed for mobile sensors to obtain the destinations. Simulation results show that this algorithm can reduce the number of mobile sensors participating in the tracking task and prolong the network lifetime.展开更多
A group tracking algorithm for split maneuvering based on complex domain topological descriptions is proposed for the tracking of members in a maneuvering group. According to the split characteristics of a group targe...A group tracking algorithm for split maneuvering based on complex domain topological descriptions is proposed for the tracking of members in a maneuvering group. According to the split characteristics of a group target, split models of group targets are established based on a sliding window feedback mechanism to determine the occurrence and classification of split maneuvering, which makes the tracked objects focus by group members effectively. The track of an outlier single target is reconstructed by the sequential least square method. At the same time, the relationship between the group members is expressed by the complex domain topological description method, which solves the problem of point-track association between the members. The Singer method is then used to update the tracks. Compared with classical multi-target tracking algorithms based on Multiple Hypothesis Tracking (MHT) and the Different Structure Joint Probabilistic Data Association (DS-JPDA) algorithm, the proposed algorithm has better tracking accuracy and stability, is robust against environmental clutter and has stable time-consumption under both classical radar conditions and partly resolvable conditions.展开更多
提出一种基于粒子概率假设密度滤波器(Sequential Monte Carlo probability hypothesis density filter,SMC-PHDF)的部分可分辨的群目标跟踪算法.该算法可直接获得群而非个体的个数和状态估计.这里群的状态包括群的质心状态和形状.为了...提出一种基于粒子概率假设密度滤波器(Sequential Monte Carlo probability hypothesis density filter,SMC-PHDF)的部分可分辨的群目标跟踪算法.该算法可直接获得群而非个体的个数和状态估计.这里群的状态包括群的质心状态和形状.为了估计群的个数和状态,该算法利用高斯混合模型(Gaussian mixture models,GMM)拟合SMC-PHDF中经重采样后的粒子分布,这里混合模型的元素个数和参数分别对应于群的个数和状态.期望最大化(Expectation maximum,EM)算法和马尔科夫链蒙特卡洛(Markov chain Monte Carlo,MCMC)算法分别被用于估计混合模型的参数.混合模型的元素个数可通过删除、合并及分裂算法得到.100次蒙特卡洛(Monte Carlo,MC)仿真实验表明该算法可有效跟踪部分可分辨的群目标.相比EM算法,MCMC算法能够更好地提取群的个数和状态,但它的计算量要大于EM算法.展开更多
文摘When a mass of individual targets move closely, it is unpractical or unnecessary to localize and track every specific target in wireless sensor networks (WSN). However, they can be tracked as a whole by view of group target. In order to decrease the amount of energy spent on active sensing and communications, a flexible boundary detecting model for group target tracking in WSN is proposed, in which, the number of sensors involved in target tracking is adjustable. Unlike traditional one or multiple individual targets, the group target usually occupies a large area. To obtain global estimated position of group target, a divide-merge algorithm using convex hull is designed. In this algorithm, group target’s boundary is divided into several small pieces, and each one is enclosed by a convex hull which is constructed by a cluster of boundary sensors. Then, the information of these small convex hulls is sent back to a sink. Finally, big convex hull merged from these small ones is considered as the group target’s contour. According to our metric of precision evaluation, the simulation experiments confirm the efficiency and accuracy of this algorithm.
基金Project supported by the State Key Program of the National Natural Science Foundation of China(Grant No.60835001)the National Natural Science Foundation of China(Grant No.61104068)the Natural Science Foundation of Jiangsu Province China(Grant No.BK2010200)
文摘In this paper, we explore the technology of tracking a group of targets with correlated motions in a wireless sensor network. Since a group of targets moves collectively and is restricted within a limited region, it is not worth consuming scarce resources of sensors in computing the trajectory of each single target. Hence, in this paper, the problem is modeled as tracking a geographical continuous region covered by all targets. A tracking algorithm is proposed to estimate the region covered by the target group in each sampling period. Based on the locations of sensors and the azimuthal angle of arrival (AOA) information, the estimated region covering all the group members is obtained. Algorithm analysis provides the fundamental limits to the accuracy of localizing a target group. Simulation results show that the proposed algorithm is superior to the existing hull algorithm due to the reduction in estimation error, which is between 10% and 40% of the hull algorithm, with a similar density of sensors. And when the density of sensors increases, the localization accuracy of the proposed algorithm improves dramatically.
基金Project supported by the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20140875)the Scientific Research Foundation of Nanjing University of Posts and Telecommunications,China(Grant No.NY213084)the National Natural Science Foundation of China(Grant No.61502243)
文摘Traditional tracking algorithms based on static sensors have several problems. First, the targets only occur in a part of the interested area; however, a large number of static sensors are distributed in the area to guarantee entire coverage, which leads to wastage of sensor resources. Second, many static sensors have to remain in active mode to track the targets, which causes an increase of energy consumption. To solve these problems, a target group tracking algorithm based on a hybrid sensor network is proposed in this paper, which includes static sensors and mobile sensors. First, an estimation algorithm is proposed to estimate the objective region by static sensors, which work in low-power sensing mode. Second, a movement algorithm based on sliding windows is proposed for mobile sensors to obtain the destinations. Simulation results show that this algorithm can reduce the number of mobile sensors participating in the tracking task and prolong the network lifetime.
基金co-supported by the National Natural Science Foundation of China(Nos.61471383,61531020,61471379 and 61102166)
文摘A group tracking algorithm for split maneuvering based on complex domain topological descriptions is proposed for the tracking of members in a maneuvering group. According to the split characteristics of a group target, split models of group targets are established based on a sliding window feedback mechanism to determine the occurrence and classification of split maneuvering, which makes the tracked objects focus by group members effectively. The track of an outlier single target is reconstructed by the sequential least square method. At the same time, the relationship between the group members is expressed by the complex domain topological description method, which solves the problem of point-track association between the members. The Singer method is then used to update the tracks. Compared with classical multi-target tracking algorithms based on Multiple Hypothesis Tracking (MHT) and the Different Structure Joint Probabilistic Data Association (DS-JPDA) algorithm, the proposed algorithm has better tracking accuracy and stability, is robust against environmental clutter and has stable time-consumption under both classical radar conditions and partly resolvable conditions.
文摘提出一种基于粒子概率假设密度滤波器(Sequential Monte Carlo probability hypothesis density filter,SMC-PHDF)的部分可分辨的群目标跟踪算法.该算法可直接获得群而非个体的个数和状态估计.这里群的状态包括群的质心状态和形状.为了估计群的个数和状态,该算法利用高斯混合模型(Gaussian mixture models,GMM)拟合SMC-PHDF中经重采样后的粒子分布,这里混合模型的元素个数和参数分别对应于群的个数和状态.期望最大化(Expectation maximum,EM)算法和马尔科夫链蒙特卡洛(Markov chain Monte Carlo,MCMC)算法分别被用于估计混合模型的参数.混合模型的元素个数可通过删除、合并及分裂算法得到.100次蒙特卡洛(Monte Carlo,MC)仿真实验表明该算法可有效跟踪部分可分辨的群目标.相比EM算法,MCMC算法能够更好地提取群的个数和状态,但它的计算量要大于EM算法.