Enforcing Non-Positive Weights for Stable Support Vector Tracking

June 2008

Enforcing Non-Positive Weights for Stable Support Vector Tracking

Authors:

Simon Lucey
Conference Paper
Proceedings of (CVPR) Computer Vision and Pattern Recognition

Abstract:

In this paper we demonstrate that the support vector tracking (SVT) framework ?rst proposed by Avidan is equivalent to the canonical Lucas-Kanade (LK) algorithm with a weighted Euclidean norm. From this equivalence we empirically demonstrate that in many circumstances the canonical SVT approach is unstable, and characterize these circumstances theoretically. We then propose a novel ?on-positive support kernel machine?(NSKM) to circumvent this limitation and allow the effective use of discriminative classi?cation within the weighted LK framework. This approach ensures that the pseudo-Hessian realized within the weighted LK algorithm is positive semide?nite which allows for fast convergence and accurate alignment/tracking. A further bene?t of our proposed method is that the NSKM solution results in a much sparser kernel machine than the canonical SVM leading to sizeable computational savings and much improved alignment performance.
@conference{Lucey-2008-9989,
author = {Simon Lucey},
title = {Enforcing Non-Positive Weights for Stable Support Vector Tracking},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2008},
month = {June},
keywords = {Support Vector Tracking},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.