一种基于拓扑约束的多核跟踪算法

针对视觉跟踪中常见的目标部分遮挡和尺度变化问题,提出了一种基于拓扑约束的多核跟踪算法.首先,提取满足空间分布的位于目标与背景所在边界的Harris角点作为多核跟踪器的中心,然后,采用拓扑约束对多个跟踪结果进行优化,选取跟踪性能好的核跟踪器,构造仿射变换模型,进而得到最终跟踪结果和目标尺度变化信息.实验结果表明,本文算法能对目标进行准确跟踪,并能有效地处理目标的部分遮挡和尺度变化问题.     

一种新的机动目标模型及其自适应跟踪算法

在当前统计模型的基础上,结合实时输入估计算法(Feng xinxi等,1996)的思想,提出了一种新的机动目标模型,并利用其方差调整关系建立了自适应跟踪算法。大量仿真结果表明该模型能够准确描述目标的各种机动情况,跟踪算法具有良好的跟踪性能,具有实际应用价值。     

一种基于相互作用多模型的目标跟踪方法及应用

首先，对传统的KLM滤波器及在跟踪机动目标的缺点和不足作了介绍，然后介绍强跟踪滤波及相互作用的多模型滤波器，采用相互作用的多模型滤波器对机动性很大的目标进行跟踪，分析IMM算法在机动目标跟踪中的优势。最后，采用部队的实际数据进行仿真，对它们的跟踪效果做了比较。     

改进质心跟踪算法在实时空中目标跟踪中的应用研究

针对光电探测跟踪系统的应用,分析低空运动目标在空天背景中电视成像的特点以及常见背景成像特点。提出该场景下检测区域中点的表示方式,并以此为权重,在TMS320DM8168Davinci平台中实现实时加权质心跟踪算法。实验证明,该方法能够在嵌入式平台实现低空运动目标实时跟踪。     

一种跳频信号实时跟踪与参数估计方法

现有的跳频信号处理方法往往需要积累足够长的样本数据,缺乏实时快速运算的能力,无法处理高速跳频信号。在小样本条件下提出一种跳频信号实时跟踪和参数估计方法。根据跳频信号的频域稀疏性建立信号模型,引入稀疏贝叶斯学习(SBL)算法解决多观测向量(MMV)信号重构问题。在构建新的判决统计量基础上,推导一种保持恒虚警概率的跳变时刻检测方法,设计滑动策略实现跳频信号的实时跟踪。分别利用几何重心法和最小二乘法估计每跳(hop)的载波频率和来波方向(DOA)。实验证明,新方法在低信噪比(SNR)下具有更低的虚警概率,参数估计精确度得到明显提升。     

一种解决遮挡问题的跟踪方法

针对图像跟踪领域中因遮挡产生的漂移问题,提出一种基于直方图比的背景加权的Mean Shift算法和Kalman预测滤波器融合的方法。本文方法通过改进目标模型来优化Bhattacharyya系数值,增大目标正常跟踪状态下和遮挡状态下Bhattacharyya系数的差值,提高遮挡判定的有效性,进而提高遮挡时的跟踪性能。通过实验证明,基于直方图比的背景加权的Mean Shift算法和Kalman预测滤波器融合的方法可有效解决遮挡跟踪问题。     

一种新的步进自动跟踪方法

本文首先介绍了步进自动跟踪的两种常用方式及其所面临的问题,在此基础上建立了基于梯度步进的最佳路径搜索方法.仿真表明这种基于梯度步进的算法,在不影响精度的条件下,运算简单,减少了步进次数.     

一种基于异步传感器网络的空间目标分布式跟踪方法

为解决传感器网络在空间目标分布式跟踪过程中的异步采样及通信延迟问题,该文提出一种异步分布式信息滤波算法(ADIF)。首先,局部传感器与相邻节点之间以一定的拓扑结构传递带采样时标的局部状态信息和量测信息,然后将收到的异步信息按时间排序,使用ADIF算法进行计算,分别对目标状态进行估计。该方法实现简单,传感器间通信的次数少,支持网络拓扑的实时变化,适用于空间目标监测中的多目标跟踪问题。该文分别对空间单目标、多目标跟踪进行了仿真,结果表明算法可以有效解决异步传感器滤波问题,分布式滤波精度一致逼近于集中式结果。

     

一种门限实时自适应的小目标跟踪处理方法

分析了跟踪雷达在对小目标检测和跟踪时采用中心门限固定方法存在的缺陷,提出了一种中心门限实时自适应变化的小目标跟踪处理方法,该方法能够有效地消除目标背景杂波强度起伏较大时对小目标捕获和跟踪的影响,提高了复杂的杂波背景下对掠海小目标的快速捕获和稳定跟踪能力.     

An efficient fault-tolerant distributed channel allocation algorithm for cellular networks

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.     

AN EFFICIENT DISTRIBUTED ALGORITHM FOR CONNECTED DOMINATING SET CONSTRUCTION IN WIRELESS SENSOR NETWORKS

Efficient broadcasting protocols based on Connected Dominating Set （CDS） are frequently used; hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together. Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.     

An algorithm for optimal assignment of a wavelength in a tree topology and its application in WDM networks

In this paper, we present a polynomial time algorithm that gives an optimal solution to the routing and wavelength assignment (RWA) problem in a tree topology. One of the major design issues in wavelength-division multiplexed networks is the assignment of the limited number of wavelengths among network stations so that greater capacity can be achieved. The problem of RWA is known to be NP-hard problem. Many researchers have tackled the problem of RWA with a number of efficient heuristic algorithms. This paper presents an algorithm that optimally assigns a single wavelength to maximize one-hop traffic in a tree topology. The algorithm uses dynamic programming and is shown to be optimal with a time complexity of O(N/sup 4/). We also propose a heuristic scheme to use our optimal algorithm for wavelength assignment in a general graph. The heuristic works on the tree subgraphs of a given graph and the remaining spare wavelengths can be assigned with an existing RWA policy.     

An energy‐efficient localized topology control algorithm for wireless ad hoc and sensor networks

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy‐draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose a localized energy‐efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy‐efficient routing. Through theoretical analysis and simulation results, we prove that the proposed topology control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi‐hop wireless network as compared with existing topology control algorithms with little additional protocol overhead. Copyright © 2008 John Wiley & Sons, Ltd.     

An efficient multitarget tracking algorithm for car applications

A new and efficient tracking algorithm for vehicle collision warning and collision avoidance systems using car radar is proposed. The target-to-measurement data association is accomplished using the decision logic algorithm based on order statistics. The simulation and experimental results are presented to demonstrate its performance.     

A distributed battery recovery aware topology control algorithm for wireless sensor networks

Battery recovery effect is a phenomenon that the available capacity of a battery could increase if the battery can sleep for a certain period of time since its last discharging. Accordingly, the battery can work for a longer time when it takes some rests between consecutive discharging processes than when it works all the time. However, this effect has not been considered in the design of energy‐efficient topology control algorithms for wireless sensor networks. In this paper, we propose a distributed battery recovery effect aware connected dominating set constructing algorithm (BRE‐CDS) for wireless sensor networks. In BRE‐CDS, each network node periodically decides to join the connected dominating set or not. Nodes that have slept in the preceding round have priority to join the connected dominating set in the current round while nodes that have worked in the preceding round are encouraged to take sleep in the current round for battery recovery. Detailed algorithm design is presented. The computational complexity of BRE‐CDS is deduced to be O(D²), where D is node degree. Simulation results show that BRE‐CDS can significantly prolong the network lifetime as compared with existing work. Copyright © 2016 John Wiley & Sons, Ltd.     

基于最优刚性图的能量有效分布式拓扑控制算法

针对现有无线传感器网络拓扑控制算法无法平衡各节点能量消耗的问题,基于最优刚性图提出了一种具有平衡负载特性的能量有效分布式拓扑控制算法。算法引入综合反映能量消耗及剩余能量两方面因素的链路权值函数,能够根据当前节点剩余能量实时地动态优化拓扑结构,从而有效地平衡网络节点的能量消耗。从理论上证明了优化后的拓扑是2?连通的而且具有稀疏性;同时优化后拓扑中各节点的平均度趋于4。仿真结果表明,与其他算法相比,该算法能够有效地平衡各节点的能量消耗,进而延长网络生命期。     

An efficient topology reconfiguration algorithm for high speed connection-oriented LANs

This paper deals with the design and performance issues of a protocol, proposed for dynamic topology reconfiguration in high-speed connection-oriented local area networks (LANs). A distributed reconfiguration algorithm is introduced where each network node maintains the minimum-hop-tree connectivity information, corresponding to all the physically reachable network interfaces within the local subnetwork. An incremental and adaptive tree-maintenance strategy is designed for keeping a reconfiguration process isolated from the unaffected parts of the network. A call-by-call routing algorithm, working on top of this reconfiguration protocol, is also proposed with multiple heuristics for optimizing the end-to-end connection hop-count and network load distribution. Simulation results illustrating the correctness and performance of these protocols are included in this paper. Issues regarding a prototype implementation of the presented protocols are also discussed. © 1997 John Wiley & Sons, Ltd.     

分布式传感器多目标跟踪改进算法

利用分布式传感器网络进行目标跟踪,能够有效增加传感器的覆盖范围,提高对运动目标的检测和跟踪能力,但如何充分利用相邻传感器之间的信息进行有效的融合,仍然是一个难点问题。本文在多伯努利滤波(Multi-Bernoulli,MB)框架下,提出了一种改进的分布式融合跟踪算法用于目标数未知且变化的多目标跟踪。提出算法包含三种精度提升策略,即特征级融合反馈、决策级融合输出及交互反馈;其中,决策级融合输出策略可以提取更加准确的估计状态,特征级融合反馈策略可以降低错误融合结果对后续滤波过程的不良影响,交互反馈策略可以避免单传感器因漏检而导致的滤波失败。实验结果表明,提出算法的跟踪精度明显要优于传统的基于广义协方差交集(Generalized Covariance Intersection,GCI)的分布式融合算法以及粒子多伯努利跟踪算法,具有较好的跟踪性能。     

面向LEO卫星网络的高效路由算法

由于卫星星上处理以及存储能力有限,随着卫星网络的规模越来越庞大,迫切需要一种简单高效的路由算法.为此,提出了一种基于网络拥塞程度感知的路由策略(Network Congestion-Aware Routing Algorithm,NCARA).NCARA路由策略在网络处于非拥塞状态时采用Dijkstra算法寻路,网络拥...