Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Mean-shift visual tracking with NP-Windows density estimates|
|Citation:||Proceedings of the British Machine Vision Conference, 31 August-3rd September 2010 / Frédéric Labrosse, Reyer Zwiggelaar, Yonghuai Liu, Bernie Tiddeman (eds.): 103.1-103.10|
|Publisher Place:||United Kingdom|
|Conference Name:||British Machine Vision Conference (21st : 2010 : Aberystwyth, Wales, UK)|
|Chuan Zhao, Ian Reid|
|Abstract:||The mean-shift algorithm is a robust and easy method of finding local extrema in the density distribution of a data set. It has been used successfully for visual tracking in which the target is modelled using a colour histogram, and the image window with best matching histogram is sought. However a histogram is potentially a poor estimate of the underlying colour distribution: it is not invariant to the image scale, the number of histogram bins or the number of samples, and this can have an adverse affect on the speed and accuracy of convergence of the mean-shift algorithm. We apply a general non-parametric PDF estimation method  to replace the histogram in mean-shift tracking to improve its accuracy. This algorithm uses an interpolation scheme which fits piecewise functions to the signal samples, calculating the PDF by accumulating the contribution of each piecewise function. Its accuracy is dependent only on the accuracy of the piecewise representation, not the number of samples or the number of bins. Experiments are conducted to demonstrate that we improve mean-shift visual tracking both in accuracy and speed.|
|Rights:||© 2010 The Authors|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.