Authors
Gregory D Hager, Maneesh Dewan, Charles V Stewart
Publication date
2004/6/27
Conference
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
Volume
1
Pages
I-I
Publisher
IEEE
Description
Kernel-based objective functions optimized using the mean shift algorithm have been demonstrated as an effective means of tracking in video sequences. The resulting algorithms combine the robustness and invariance properties afforded by traditional density-based measures of image similarity, while connecting these techniques to continuous optimization algorithms. This paper demonstrates a connection between kernel-based algorithms and more traditional template tracking methods. here is a well known equivalence between the kernel-based objective function and an SSD-like measure on kernel-modulated histograms. It is shown that under suitable conditions, the SSD-like measure can be optimized using Newton-style iterations. This method of optimization is more efficient (requires fewer steps to converge) than mean shift and makes fewer assumptions on the form of the underlying kernel structure. In …
Total citations
20042005200620072008200920102011201220132014201520162017201820192020202120222023202419202136323437392725221296676373
Scholar articles
GD Hager, M Dewan, CV Stewart - Proceedings of the 2004 IEEE Computer Society …, 2004