The advantage of an online semi-supervised boosting method which takes object tracking problem as a classification problem, is training a binary classifier from labeled and unlabeled examples. Appropriate object features are selected based on real time changes in the object. However, the online semi-supervised boosting method faces one key problem: The traditional self-training using the classification results to update the classifier itself, often leads to drifting or tracking failure, due to the accumulated error during each update of the tracker. To overcome the disadvantages of semi-supervised online boosting based on object tracking methods, the contribution of this paper is an improved online semi-supervised boosting method, in which the learning process is guided by positive (P) and negative (N) constraints, termed P-N constraints, which restrict the labeling of the unlabeled samples. First, we train the classification by an online semi-supervised boosting. Then, this classification is used to process the next frame. Finally, the classification is analyzed by the P-N constraints, which are used to verify if the labels of unlabeled data assigned by the classifier are in line with the assumptions made about positive and negative samples. The proposed algorithm can effectively improve the discriminative ability of the classifier and significantly alleviate the drifting problem in tracking applications. In the experiments, we demonstrate real-time tracking of our tracker on several challenging test sequences where our tracker outperforms other related on-line tracking methods and achieves promising tracking performance.
Recently, Kernel Correlation Filter (KCF) has achieved great attention in visual tracking filed, which provide excellent tracking performance and high possessing speed. However, how to handle the scale variation is still an open problem. In this paper, focusing on this issue that a method based on Gaussian scale space is proposed. First, we will use KCF to estimate the location of the target, the context region which includes the target and its surrounding background will be the image to be matched. In order to get the matching image of a Gaussian scale space, image with Gaussian kernel convolution can be gotten. After getting the Gaussian scale space of the image to be matched, then, according to it to estimate target image under different scales. Combine with the scale parameter of scale space, for each corresponding scale image performing bilinear interpolation operation to change the size to simulate target imaging at different scales. Finally, matching the template with different size of images with different scales, use Mean Absolute Difference (MAD) as the match criterion. After getting the optimal matching in the image with the template, we will get the best zoom ratio s, consequently estimate the target size. In the experiments, compare with CSK, KCF etc. demonstrate that the proposed method achieves high improvement in accuracy, is an efficient algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.