A survey of datasets for visual tracking <s> The CAVIAR dataset <s> We propose an online tracking algorithm in which the support instances are selected adaptively within the multiple instance learning framework. The support instances are selected from training 1-norm support vector machines in a feature space, thereby learning large margin classifiers for visual tracking. An algorithm is presented to update the support instances by taking image data obtained previously and recently into account. In addition, a forgetting factor is introduced to weigh the contribution of support instances obtained at different time stamps. Experimental results demonstrate that our tracking algorithm is robust in handling occlusion, abrupt motion and illumination. <s> BIB001 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> In this paper we propose a robust object tracking algorithm using a collaborative model. As the main challenge for object tracking is to account for drastic appearance change, we propose a robust appearance model that exploits both holistic templates and local representations. We develop a sparsity-based discriminative classifier (SD-C) and a sparsity-based generative model (SGM). In the S-DC module, we introduce an effective method to compute the confidence value that assigns more weights to the foreground than the background. In the SGM module, we propose a novel histogram-based method that takes the spatial information of each patch into consideration with an occlusion handing scheme. Furthermore, the update scheme considers both the latest observations and the original template, thereby enabling the tracker to deal with appearance change effectively and alleviate the drift problem. Numerous experiments on various challenging videos demonstrate that the proposed tracker performs favorably against several state-of-the-art algorithms. <s> BIB002 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called L1 trackers as it needs to solve an l 1 norm related minimization problem for many times. While these L1 trackers showed impressive tracking accuracies, they are very computationally demanding and the speed bottleneck is the solver to l 1 norm minimizations. This paper aims at developing an L1 tracker that not only runs in real time but also enjoys better robustness than other L1 trackers. In our proposed L1 tracker, a new l 1 norm related minimization model is proposed to improve the tracking accuracy by adding an l 1 norm regularization on the coefficients associated with the trivial templates. Moreover, based on the accelerated proximal gradient approach, a very fast numerical solver is developed to solve the resulting l 1 norm related minimization problem with guaranteed quadratic convergence. The great running time efficiency and tracking accuracy of the proposed tracker is validated with a comprehensive evaluation involving eight challenging sequences and five alternative state-of-the-art trackers. <s> BIB003 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> Sparse representation has been applied to visual tracking by finding the best candidate with minimal reconstruction error using target templates. However most sparse representation based trackers only consider the holistic representation and do not make full use of the sparse coefficients to discriminate between the target and the background, and hence may fail with more possibility when there is similar object or occlusion in the scene. In this paper we develop a simple yet robust tracking method based on the structural local sparse appearance model. This representation exploits both partial information and spatial information of the target based on a novel alignment-pooling method. The similarity obtained by pooling across the local patches helps not only locate the target more accurately but also handle occlusion. In addition, we employ a template update strategy which combines incremental subspace learning and sparse representation. This strategy adapts the template to the appearance change of the target with less possibility of drifting and reduces the influence of the occluded target template as well. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed tracking algorithm performs favorably against several state-of-the-art methods. <s> BIB004 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> In this paper, we propose a biologically inspired framework of visual tracking based on proto-objects. Given an image sequence, proto-objects are first detected by combining saliency map and topic model. Then the target is tracked based on spatial and saliency information of the proto-objects. In the proposed Bayesian approach, states of the target and proto-objects are jointly estimated over time. Gibbs sampling has been used to optimize the estimation during the tracking process. The proposed method robustly handles occlusion, distraction, and illumination change in the experiments. Experimental results also demonstrate that the proposed method outperforms the state-of-the-art methods in challenging tracking tasks. <s> BIB005 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> This study describes a complete system for multiple-target tracking in image sequences. The target appearance is represented as a set of weighted clusters in colour space. This is in contrast to the more typical use of colour histograms to model target appearance. The use of clusters allows a more flexible and accurate representation of the target, which demonstrates the benefits for tracking. However, it also introduces a number of computational difficulties, as calculating and matching cluster signatures are both computationally intensive tasks. To overcome this, the authors introduce a new formulation of incremental medoid-shift clustering that operates faster than mean shift in multi-target tracking scenarios. This matching scheme is integrated into a Bayesian tracking framework. Particle filters, a special case of Bayesian filters where the state variables are non-linear and non-Gaussian, are used in this study. An adaptive model update procedure is proposed for the cluster signature representation to handle target changes with time. The model update procedure is demonstrated to work successfully on a synthetic dataset and then on real datasets. Successful tracking results are shown on public datasets. Both qualitative and quantitative evaluations have been carried out to demonstrate the improved performance of the proposed multi-target tracking system. A higher tracking accuracy in long image sequences has been achieved compared to other standard tracking methods. <s> BIB006 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> Recently, sparse representation in the task of visual tracking has been obtained increasing attention and many algorithms are proposed based on it. In these algorithms for visual tracking, each candidate target is sparsely represented by a set of target templates. However, these algorithms fail to consider the structural information of the space of the target templates, i.e., target template set. In this paper, we propose an algorithm named non-local self-similarity (NLSS) based sparse coding algorithm (NLSSC) to learn the sparse representations, which considers the geometrical structure of the set of target candidates. By using non-local self-similarity (NLSS) as a smooth operator, the proposed method can turn the tracking into sparse representations problems, in which the information of the set of target candidates is exploited. Extensive experimental results on visual tracking have demonstrated the effectiveness of the proposed algorithm. <s> BIB007 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> Multi-target visual tracking is a challenge because of data association and mutual occlusion in the interacting targets. This paper presents a Gaussian mixture probability hypothesis density based multi-target visual tracking system with game-theoretical occlusion handling. Firstly, the spatial constraint based appearance model with other interacting targets' interferences is modeled. Then, a two-step occlusion reasoning algorithm is proposed. Finally, an n-person, non-zero-sum, non-cooperative game is constructed to handle the mutual occlusion problem. The individual targets within the occlusion region are regarded as the players in the constructed game to compete for the maximum utilities by using the certain strategies. A Nash Equilibrium of the game is the optimal estimation of the locations of the players within the occlusion region. Experiments on video sequences demonstrate the good performance of the proposed occlusion handling algorithm. <s> BIB008 </s> A survey of datasets for visual tracking <s> The CAVIAR dataset <s> Locally Orderless Tracking (LOT) is a visual tracking algorithm that automatically estimates the amount of local (dis)order in the target. This lets the tracker specialize in both rigid and deformable objects on-line and with no prior assumptions. We provide a probabilistic model of the target variations over time. We then rigorously show that this model is a special case of the Earth Mover's Distance optimization problem where the ground distance is governed by some underlying noise model. This noise model has several parameters that control the cost of moving pixels and changing their color. We develop two such noise models and demonstrate how their parameters can be estimated on-line during tracking to account for the amount of local (dis)order in the target. We also discuss the significance of this on-line parameter update and demonstrate its contribution to the performance. Finally we show LOT's tracking capabilities on challenging video sequences, both commonly used and new, displaying performance comparable to state-of-the-art methods. <s> BIB009
The  The Cehovin dataset [15] . Four of the five video sequences showing objects deforming and changing their appearance lems of occlusions, appearance/disappearance, similar object tracking, appearance changing, and so on. Many works test their algorithms on these datasets, among which some recent visual tracking works BIB002 BIB009 BIB003 BIB005 BIB006 BIB004 BIB007 BIB001 BIB008 .