Robust Visual Tracking Using Illumination Invariant Features in Adaptive Scale Model

Abstract

When entering into the realm of Computer Vision, the first thing which comes in to mind is Visual tracking. Visual tracking by far comes into one of the most actively investigated research areas because of the fact that it has an extensive collection of applications in areas such as activity recognition, surveillance, motion analysis and as well as human computer interaction. Some serious challenges of this area which still create hindrance in achieving 100% accuracy are abrupt appearance and pose changes of an object along with its background blockage due to blockages called occlusion, illumination and lighting variances and changes in scale of target object in the frames. Moreover, diverse algorithms had been proposed for the resolution of said issue. Now in such cases, if we study the statistical analysis of correlation between two frames in a certain video, it can be efficiently utilized to get the most exact location of the targeted object. The algorithms in existence today do not completely exploit a strong spatio-temporal relationship that very often occurs between the two successive frames in a video sequence. Recent advances in correlation-based tracking systems have been proposed to address the problem in successive frames. In this thesis a very simple yet quite speedy and robust algorithm that in actual brings all the relevant information used for Visual Tracking. Two of the Models proposed are the “Locality Sensitive Histogram” and “Discriminative Scale Tracking Method”. These are robust enough to the variations which are based on appearance which are normally presented by blockage, pose, illumination and lighting variations alike. A scheme is proposed called scale adaptation which is very much clever to adapt variations of targeted scale in the most efficient manner. The Discriminative Scale Tracking Method is used for detection as well as scale change ultimately resulting in an effective tracking method in the end. Various different experiments with the best algorithms have demonstrated on challenging sequences that the suggested methodology attains promising results as far as robustness, accuracy, and speed is concerned.