基于HOG与多实例在线学习的目标跟踪算法

为实现在局部遮挡、光线变化等复杂背景下的目标跟踪,提出一种基于梯度方向直方图(HOG)与多实例在线学习的目标跟踪算法.利用已标定目标图像的HOG特征空间,结合局部二值模式(LBP)描述方法获取特征向量,构建初始随机蕨检测算子,采用随机多尺度采样方法跟踪每一帧的目标位置和尺寸,并基于多实例在线学习框架,通过检测到的目标样本以及附近的背景样本在线更新检测算子.将该算法与OnlineB oostingTracker,MILTracker等在线学习目标跟踪算法在多个标准视频序列中进行比较,实验结果表明,该算法在局部遮挡和光照变化的环境下具有较好的跟踪稳定性,但在抗目标旋转方面有待优化.     

基于粒子滤波和多示例学习的目标跟踪

目标跟踪是计算机视觉领域中研究的热点问题。当前,基于多示例学习的目标跟踪算法引起了较多的关注。在研究多示例学习算法的基础上,针对原始的多示例学习目标跟踪算法中使用运动模型的不足,提出一种改进的基于在线学习的目标跟踪方法。该方法首先根据方向直方图局部特征(HOG特征)来描述目标,然后通过粒子滤波方法对目标位置进行预测,再用基于Boosting的在线多示例学习方法来建立描述目标的模型和分类器,最后在下一帧的图像中利用该分类器来跟踪目标,同时在线更新分类器。通过实验表明,改进的方法可以有效地提高目标跟踪精度和算法的鲁棒性。     

基于能量衰减的增量式声源跟踪算法研究

声源定位属于典型的被动定位,基于声源定位与跟踪在实际中具有广泛的应用。文中利用声音随距离的能量衰减模型,提出了最小二乘的增量式声源跟踪算法形式,并在二维空间分别给出了声源的定位,位置式及增量式声源跟踪算法的实验结果。位置式及增量式声源跟踪算法是跟踪算法的两种表现形式,实际中可根据跟踪算法的复杂度和具体的控制对象进行选择。由于只需计算声源移动增量,与传统的位置式算法相比,增量式声源位置跟踪算法具有控制器调整方便、容错性强等特点。     

基于三圆交集的二值传感器网络目标跟踪快速算法

目标跟踪是无线传感器网络的一种典型应用.跟踪移动目标由于具有侦查意义得到越来越多的关注.传感器网络目标跟踪定位的精度和计算复杂度通常难以均衡优化,基于三圆交集判别法提出一种二值传感器网络目标跟踪的快速算法,将目标发现队列中传感器探测圆的公共交叉弧段的中间点取作目标估算位置,计算简捷.还修正了跟踪算法评价指标的平均误差与...     

基于层次匹配和背景补偿的红外目标跟踪

在红外图像跟踪过程中,由于种种原因红外序列图像中的感兴趣目标往往存在不规则运动,很难用某种模型来描述目标的运动状态变迁.本文提出一种基于层次匹配和背景补偿的方法来对此类红外目标进行精确跟踪.背景补偿算法去除前后帧图像由于数据采集工具的不规则抖动而造成的图像差异,在背景补偿算法的基础上运用层次匹配策略大大提高跟踪精度.实验结果表明,此算法可以实现复杂场景下的红外目标的高精度稳定跟踪.     

无特定身份背景下的目标跟踪算法仿真

研究追踪对象特征不明显,无特定身份特征的目标准确跟踪问题.无特定身份背景会导致跟踪目标出现时无明显各种特征,需要为其选定特征的跟踪特征.传统的目标跟踪算法在这种环境下采集的跟踪目标灰度特征信息单一,并且缺乏描述目标的信息,直接导致目标跟踪的失败或者带来较大的误差.提出一种改进的无特定身份背景下的目标跟踪方法.对图像进行边缘梯度融合,计算目标图像区域中基于局部二值模式(LBP)的纹理特征模型,通过Mean shift算法来建立目标直方图并实现目标的跟踪.实验结果表明,改进的算法能有效地克服无特定身份背景下的光照变化、多目标干扰的影响,改进的算法取得了较好的目标跟踪精度.     

基于2DPCA与稀疏表示的目标跟踪

为了提高目标跟踪的准确性,针对目标跟踪过程中光照变化、遮挡、姿势变化等问题,提出了基于二维主成分分析(2DPCA)与稀疏表示的目标跟踪算法.在贝叶斯框架中使用了2DPCA与L2规范化呈现快速与鲁棒的目标跟踪算法.提出了新的似然函数表示方法,同时采用增量子空间学习的方法对冗余字典进行更新,有效抑制了跟踪漂移并能处理目标遮挡问题.通过对具有挑战性的跟踪视频进行定性和定量分析,实验结果证明:跟踪方法在跟踪精度上优于传统方法.     

一种基于Mean Shift和Kalman预测的带宽自适应跟踪算法

Mean Shift算法是视觉监控领域广泛应用的经典目标跟踪方法,但对于速度过快或尺度变化大的目标的跟踪存在较大的缺陷。针对这一问题,提出了一种基于Mean Shift和Kalman方法预测的带宽自适应跟踪算法。该算法提出以Kalman预测目标在下帧中的位置作为Mean Shift迭代初始位置,以高效锁定各类运动目标;同时采用增量试探法自动调节带宽以适应目标的尺度变化。通过对行人和车辆等不同监控对象的实验表明,该跟踪算法具有良好的鲁棒性。     

基于集成多示例学习的Mean Shift跟踪算法

为了实现长时间稳定的对特定目标的跟踪,结合匹配型跟踪方法和决策型跟踪方法的优势,同时利用集成学习的思想构建多个强分类器,提出一种基于集成多示例学习的mean shift跟踪算法.首先在上一帧中对示例进行随机采样,构建分类器的集体,通过集成学习合成最终的分类器以确定当前帧中目标的初始位置;然后对初始位置和上一帧目标最终位置的距离与设定的阈值进行判断,决定是否采用mean shift跟踪算法对初始位置进行修订,以确定目标的最终位置.实验结果表明,该算法不但可以应对目标的形变、旋转、遮挡以及光照变化等各种复杂的情况,而且可以做到长时间的跟踪,具有较强的鲁棒性.     

基于高斯过程模型的指节图像识别方法

在基于图像的人机交互智能装配的手势识别与动作跟踪中,手部关节的图像定位是基础,并且关节信息的准确性对手势描述和行为识别与理解有直接影响.针对指节图像特征分布具有较强随机性,利用同态滤波进行图像预处理,以增强图像特征.基于高斯过程模型对手部指节图像二类特征进行学习,用样本对象的聚类测度,学习数据分布的特征模型,将学习获得的两类特征模型作为图像特征的检测器,检测结果即为图像的两个似然值.将经过正负类样本标记过的两种模型似然值作为输入,直接依据估计结果对手部关节图像进行检测识别.通过对不同位置处的手部关节识别分析和测试库检测,结果表明,本文所述方法可以直接得到后验概率的分布,提高了目标识别的准确性和效率.     

Robust object tracking with occlusion handle

Occlusion is a major problem for object tracking algorithms, especially for subspace-based learning algorithms like PCA. In this paper, we introduce a novel incremental subspace (robust PCA)-based object tracking algorithm to deal with the occlusion problem. The three major contributions of our works are the introduction of robust PCA to object tracking literature, a robust PCA-based occlusion handling scheme and the revised incremental PCA algorithm. In order to handle the occlusion problem in the subspace learning algorithm framework, robust PCA algorithm is employed to select part of image pixels to compute coefficients rather than the whole image pixels as in traditional PCA algorithm, which can successfully avoid the occluded pixels and therefore obtain accurate tracking results. The occlusion handling scheme fully makes use of the merits of robust PCA and can avoid false updates in occlusion, clutter, noisy and other complex situations. Besides, the introduction of incremental PCA facilitates the subspace updating process and possesses several benefits compared with traditional R-SVD-based updating methods. The experiments show that our proposed algorithm is efficient and effective to cope with common object tracking tasks, especially with strong robustness due to the introduction of robust PCA.     

Incremental Tensor Subspace Learning and Its Applications to Foreground Segmentation and Tracking

Appearance modeling is very important for background modeling and object tracking. Subspace learning-based algorithms have been used to model the appearances of objects or scenes. Current vector subspace-based algorithms cannot effectively represent spatial correlations between pixel values. Current tensor subspace-based algorithms construct an offline representation of image ensembles, and current online tensor subspace learning algorithms cannot be applied to background modeling and object tracking. In this paper, we propose an online tensor subspace learning algorithm which models appearance changes by incrementally learning a tensor subspace representation through adaptively updating the sample mean and an eigenbasis for each unfolding matrix of the tensor. The proposed incremental tensor subspace learning algorithm is applied to foreground segmentation and object tracking for grayscale and color image sequences. The new background models capture the intrinsic spatiotemporal characteristics of scenes. The new tracking algorithm captures the appearance characteristics of an object during tracking and uses a particle filter to estimate the optimal object state. Experimental evaluations against state-of-the-art algorithms demonstrate the promise and effectiveness of the proposed incremental tensor subspace learning algorithm, and its applications to foreground segmentation and object tracking.     

基于双向二维主成分分析的运动目标跟踪

为克服二维主成分分析（2DPCA）跟踪效率低的缺点,提出一种基于双向二维主成分分析（Bi-2DPCA）的运动目标跟踪算法。采用双向二维主成分分析作为目标表示的方法建立目标图像子空间,同时在图像均值与协方差矩阵的更新中引入基于目标图像匹配程度的自适应增量因子的增量学习的方法进一步提高算法效率。在多个包含动态背景的图像序列上的对比实验结果表明算法能在目标处于部分遮挡的情况下准确跟踪目标,同时算法在效率上高于基于二维主成分分析的目标跟踪算法。     

基于多视角距离图象的三维物体建模及其在识别中的应用

模型的表示和构建是基于距离图象三维物体识别技术中的关键模块之一.针对已有方法 存在的若干问题,提出一个新的综合多个视角距离图象的三维物体模型表示策略和增量式的 模型习得算法,并将该模型表示用于三维物体识别中.实验结果验证了算法的有效性.     

Robust visual tracking with structured sparse representation appearance model

In this paper, we present a structured sparse representation appearance model for tracking an object in a video system. The mechanism behind our method is to model the appearance of an object as a sparse linear combination of structured union of subspaces in a basis library, which consists of a learned Eigen template set and a partitioned occlusion template set. We address this structured sparse representation framework that preferably matches the practical visual tracking problem by taking the contiguous spatial distribution of occlusion into account. To achieve a sparse solution and reduce the computational cost, Block Orthogonal Matching Pursuit (BOMP) is adopted to solve the structured sparse representation problem. Furthermore, aiming to update the Eigen templates over time, the incremental Principal Component Analysis (PCA) based learning scheme is applied to adapt the varying appearance of the target online. Then we build a probabilistic observation model based on the approximation error between the recovered image and the observed sample. Finally, this observation model is integrated with a stochastic affine motion model to form a particle filter framework for visual tracking. Experiments on some publicly available benchmark video sequences demonstrate the advantages of the proposed algorithm over other state-of-the-art approaches.     

一种基于类支持度的增量贝叶斯学习算法

介绍增量贝叶斯分类器的原理,提出一种基于类支持度的优化增量贝叶斯分类器学习算法。在增量学习过程的样本选择问题上,算法引入一个类支持度因子λ,根据λ的大小逐次从测试样本集中选择样本加入分类器。实验表明,在训练数据集较小的情况下,该算法比原增量贝叶斯分类算法具有更高的精度,能大幅度减少增量学习样本优选的计算时间。     

Incremental deep forest for multi-label data streams learning

Multi-label learning has attracted many attentions. However, the continuous data generated in the fields of sensors, network access, etc., that is data streams, the scenario brings challenges such as real-time, limited memory, once pass. Several learning algorithms have been proposed for offline multi-label classification, but few researches develop it for dynamic multi-label incremental learning models based on cascading schemes. Deep forest can perform representation learning layer by layer, and does not rely on backpropagation, using this cascading scheme, this paper proposes a multi-label data stream deep forest (VDSDF) learning algorithm based on cascaded Very Fast Decision Tree (VFDT) forest, which can receive examples successively, perform incremental learning, and adapt to concept drift. Experimental results show that the proposed VDSDF algorithm, as an incremental classification algorithm, is more competitive than batch classification algorithms on multiple indicators. Moreover, in dynamic flow scenarios, the adaptability of VDSDF to concept drift is better than that of the contrast algorithm.

     

基于KKT条件与壳向量的增量学习算法研究

摘要针对经典支持向量机难以快速有效地进行增量学习的缺点,提出了基于KKT条件与壳向量的增量学习算法,该算法首先选择包含所有支持向量的壳向量,利用KKT条件淘汰新增样本中无用样本,减小参与训练的样本数目,然后在新的训练集中快速训练支持向量机进行增量学习。将该算法应用于UCI数据集和电路板故障分类识别,实验结果表明,该算法不仅能保证学习机器的精度和良好的推广能力,而且其学习速度比经典的SMO算法快,可以进行增量学习。     

一种基于联合表示的图像分类方法

在图像分类识别中,对于同一目标的不同图像,其训练样本和测试样本在同一位置的像素强度通常不同,这不利于提取目标图像的显著特征。这里给出一种基于稀疏表示的联合表示的图像分类方法,此方法首先利用相邻列之间的关系得到原始图像对应的虚拟图像,利用虚拟图像提高图像中中等强度像素的作用,降低过大或过小强度像素对图像分类的影响;然后用同一个目标的原始图像和虚拟图像一起表示目标,得到目标图像的联合表示;最后利用联合表示方法对目标分类。针对不同目标图像库的实验研究表明,给出的联合方法优于利用单一图像进行分类的方法,而且本方法能联合不同的表示方法来提高图像分类正确率。     

Robust visual tracking using information theoretical learning

This paper presents a novel online object tracking algorithm with sparse representation for learning effective appearance models under a particle filtering framework. Compared with the state-of-the-art ? ₁ sparse tracker, which simply assumes that the image pixels are corrupted by independent Gaussian noise, our proposed method is based on information theoretical Learning and is much less sensitive to corruptions; it achieves this by assigning small weights to occluded pixels and outliers. The most appealing aspect of this approach is that it can yield robust estimations without using the trivial templates adopted by the previous sparse tracker. By using a weighted linear least squares with non-negativity constraints at each iteration, a sparse representation of the target candidate is learned; to further improve the tracking performance, target templates are dynamically updated to capture appearance changes. In our template update mechanism, the similarity between the templates and the target candidates is measured by the earth movers’ distance(EMD). Using the largest open benchmark for visual tracking, we empirically compare two ensemble methods constructed from six state-of-the-art trackers, against the individual trackers. The proposed tracking algorithm runs in real-time, and using challenging sequences performs favorably in terms of efficiency, accuracy and robustness against state-of-the-art algorithms.