Getting robust observation for single object tracking: a statistical Kernel-based approach

Authors:
Mohd Asyraf Zulkifley;Bill Moran
Affiliations:
Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria, Australia;Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria, Australia
Venue:
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Year:
2011

Citing 9
Cited 0

Pfinder: Real-Time Tracking of the Human Body

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Earth Mover's Distance as a Metric for Image Retrieval

International Journal of Computer Vision
Color Constant Color Indexing

IEEE Transactions on Pattern Analysis and Machine Intelligence
Kernel-Based Object Tracking

IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Recognition from Local Scale-Invariant Features

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Speeded-Up Robust Features (SURF)

Computer Vision and Image Understanding
Mean Shift tracking with multiple reference color histograms

Computer Vision and Image Understanding
Mean shift blob tracking with kernel histogram filtering and hypothesis testing

Pattern Recognition Letters
Improved kernel-based object tracking under occluded scenarios

ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mean shift-based algorithms perform well when the tracked object is in the vicinity of the current location. This cause any fast moving object especially when there is no overlapping region between the frames fails to be tracked. The aim of our algorithm is to offer robust kernel-based observation as an input to a single object tracking. We integrate kernel-based method with feature detectors and apply statical decision making. The foundation of the algorithm is patch matching where Epanechnikov kernel-based histogram is used to find the best patch. The patch is built based on Shi and Tomasi [1] corner detector where a vector descriptor is built at each detected corner. The patches are built at every matched points and the similarity between two histograms are modelled by Gaussian distribution. Two set of histograms are built based on RGB and HSV colour space where Neyman-Pearson method decides the best colour model. Diamond search configuration is applied to smooth out the patch position by applying maximum likelihood method. The works by Comaniciu et al. [2] is used as performance comparison. The results show that our algorithm performs better as we have no failure yet lesser average accuracy in tracking fast moving object.