Robust Visual Tracking via Multiple Kernel Boosting with Affinity Constraints
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
| Authors | Fan Yang, Huchuan Lu, Ming-Hsuan Yang |
| Journal/Conference Name | IEEE Transactions on Circuits and Systems for… |
| Paper Category | ECE |
| Paper Abstract | We propose a novel algorithm by extending the multiple kernel learning framework with boosting for an optimal combination of features and kernels, thereby facilitating robust visual tracking in complex scenes effectively and efficiently. While spatial information has been taken into account in conventional multiple kernel learning algorithms, we impose novel affinity constraints to exploit the locality of support vectors from a different view. In contrast to existing methods in the literature, the proposed algorithm is formulated in a probabilistic framework that can be computed efficiently. Numerous experiments on challenging data sets with comparisons to state-of-the-art algorithms demonstrate the merits of the proposed algorithm using multiple kernel boosting and affinity constraints. |
| Date of publication | 2014 |
| Code Programming Language | MATLAB |
| Comment |
Copyright Researcher 2022