A successful algorithm for detecting target groups is presented. Firstly, A global Constant False Alarm Rate (CFAR) detector is utilized to locate the potential target regions, and then the features are com- puted for...A successful algorithm for detecting target groups is presented. Firstly, A global Constant False Alarm Rate (CFAR) detector is utilized to locate the potential target regions, and then the features are com- puted for target discrimination based on voting mechanism. Finally, Target groups are extracted. The results of experiments show the validity 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.展开更多
When range high-resolution radar is applied to target recognition,it is quite possible for the high-resolution range profiles(HRRPs)of group targets in a beam to overlap,which reduces the target recognition performanc...When range high-resolution radar is applied to target recognition,it is quite possible for the high-resolution range profiles(HRRPs)of group targets in a beam to overlap,which reduces the target recognition performance of the radar.In this paper,we propose a group target recognition method based on a weighted mean shift(weighted-MS)clustering method.During the training phase,subtarget features are extracted based on the template database,which is established through simulation or data acquisition,and the features are fed to the support vector machine(SVM)classifier to obtain the classifier parameters.In the test phase,the weighted-MS algorithm is exploited to extract the HRRP of each subtarget.Then,the features of the subtarget HRRP are extracted and used as input in the SVM classifier to be recognized.Compared to the traditional group target recognition method,the proposed method has the advantages of requiring only a small amount of computation,setting parameters automatically,and having no requirement for target motion.The experimental results based on the measured data show that the method proposed in this paper has better recognition performance and is more robust against noise than other recognition methods.展开更多
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.展开更多
The Jiangsu Hubao Group, now very active in the garment sector, used to be a small shirt factory with a loaned capital of only a few hundred thousand yuan(RMB). Since its founding in 1989, the group has been aiming at...The Jiangsu Hubao Group, now very active in the garment sector, used to be a small shirt factory with a loaned capital of only a few hundred thousand yuan(RMB). Since its founding in 1989, the group has been aiming at the international first-class level, and has formulated and implemented international famous brand strategy, with quality products occupying the market. After展开更多
针对捷变频信号的相参积累处理进行研究,提出了一种基于频率分组编码信号的相参积累算法。以线性调频(Linear frequency modulation,LFM)信号为基础,构建了频率分组编码信号,使得发射信号的脉冲载频序列具有一定随机性,保证了波形的抗...针对捷变频信号的相参积累处理进行研究,提出了一种基于频率分组编码信号的相参积累算法。以线性调频(Linear frequency modulation,LFM)信号为基础,构建了频率分组编码信号,使得发射信号的脉冲载频序列具有一定随机性,保证了波形的抗干扰能力。同时针对频率捷变信号相位非相参带来的主瓣展宽和旁瓣抬高问题,设计了对应编码信号的相参处理方法。首先对回波脉压后的信号进行高分辨距离补偿,然后通过速度遍历插值和距离一致性校正实现脉组内相参处理,最后利用编码信号载频序列的优势实现脉组间相参处理。在仿真实验中,对构建的编码信号相较于LFM信号在抗干扰方面的优越性进行了验证,同时验证了所提相参处理方法相较于基于压缩感知的稀疏重构算法的有效性。展开更多
为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站...为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站接收到的信号进行频段划分,通过基于多相滤波的数字信道化方法把信号输出到多个信道中;然后通过直接定位(direct position determination,DPD)算法计算得出各时隙辐射源的位置;最后先通过不同参数的基于密度的噪声应用空间聚类(density-based spatial clustering of applications with noise,DBSCAN)算法选择出最佳的辐射源定位结果,再根据提出的基于先验信息的改进K-means聚类算法进行网群划分。所提方法实现了采样率和信号处理速率的降低,且无需站间严格的时间同步。结果表明,所提方法有效估计出了辐射源的数量、位置,以及网群划分情况。展开更多
文摘A successful algorithm for detecting target groups is presented. Firstly, A global Constant False Alarm Rate (CFAR) detector is utilized to locate the potential target regions, and then the features are com- puted for target discrimination based on voting mechanism. Finally, Target groups are extracted. The results of experiments show the validity 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.
文摘When range high-resolution radar is applied to target recognition,it is quite possible for the high-resolution range profiles(HRRPs)of group targets in a beam to overlap,which reduces the target recognition performance of the radar.In this paper,we propose a group target recognition method based on a weighted mean shift(weighted-MS)clustering method.During the training phase,subtarget features are extracted based on the template database,which is established through simulation or data acquisition,and the features are fed to the support vector machine(SVM)classifier to obtain the classifier parameters.In the test phase,the weighted-MS algorithm is exploited to extract the HRRP of each subtarget.Then,the features of the subtarget HRRP are extracted and used as input in the SVM classifier to be recognized.Compared to the traditional group target recognition method,the proposed method has the advantages of requiring only a small amount of computation,setting parameters automatically,and having no requirement for target motion.The experimental results based on the measured data show that the method proposed in this paper has better recognition performance and is more robust against noise than other recognition methods.
文摘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.
文摘The Jiangsu Hubao Group, now very active in the garment sector, used to be a small shirt factory with a loaned capital of only a few hundred thousand yuan(RMB). Since its founding in 1989, the group has been aiming at the international first-class level, and has formulated and implemented international famous brand strategy, with quality products occupying the market. After
文摘针对捷变频信号的相参积累处理进行研究,提出了一种基于频率分组编码信号的相参积累算法。以线性调频(Linear frequency modulation,LFM)信号为基础,构建了频率分组编码信号,使得发射信号的脉冲载频序列具有一定随机性,保证了波形的抗干扰能力。同时针对频率捷变信号相位非相参带来的主瓣展宽和旁瓣抬高问题,设计了对应编码信号的相参处理方法。首先对回波脉压后的信号进行高分辨距离补偿,然后通过速度遍历插值和距离一致性校正实现脉组内相参处理,最后利用编码信号载频序列的优势实现脉组间相参处理。在仿真实验中,对构建的编码信号相较于LFM信号在抗干扰方面的优越性进行了验证,同时验证了所提相参处理方法相较于基于压缩感知的稀疏重构算法的有效性。
文摘为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站接收到的信号进行频段划分,通过基于多相滤波的数字信道化方法把信号输出到多个信道中;然后通过直接定位(direct position determination,DPD)算法计算得出各时隙辐射源的位置;最后先通过不同参数的基于密度的噪声应用空间聚类(density-based spatial clustering of applications with noise,DBSCAN)算法选择出最佳的辐射源定位结果,再根据提出的基于先验信息的改进K-means聚类算法进行网群划分。所提方法实现了采样率和信号处理速率的降低,且无需站间严格的时间同步。结果表明,所提方法有效估计出了辐射源的数量、位置,以及网群划分情况。