Deep similarity trackers are able to track above real-time speed. However, their accuracy is considerably lower than deep classification based trackers since they avoid valuable online cues. To feed the target-specific information for real-time object tracking, we propose a novel Siamese attention network. Different types of attention mechanisms are used to capture different contexts of target information and then learned knowledge is used to feed target cues at different representation levels of similarity tracking. In addition, an online learning mechanism is employed to utilise the available target-specific data. The proposed tracker reduces the impact of noise in the target template and improves the accuracy of similarity tracking by feeding target cues into the similarity search. Extensive evaluation performed on OTB-2013/50/100 and VOT2018 benchmark datasets demonstrate the proposed tracker outperforms state-of-the-art approaches while maintaining real-time tracking speed.

Visual tracking frameworks employing Convolutional Neural Networks (CNNs) have shown state-of-the-art performance due to their hierarchical feature representation. While classification and update based deep neural net tracking have shown good performance in terms of accuracy, they have poor tracking speed. On the other hand, recent matching based techniques using CNNs show higher than real-time speed in tracking but this speed is achieved at a considerably lower accuracy. To successfully manage the trade-off between accuracy and speed, we propose a novel CNN architecture for visual tracking. We achieve this trade-off balance by using an approach in which consecutive similar frames are processed with a similarity matching technique, and dissimilar frames are processed with a classification approach within the CNN architecture. The tracking speed is improved by avoiding unnecessary model updates through the measurement of similarity between adjacent frames, while the accuracy is maintained by adopting a classification approach when needed, with deeper level features. Extensive evaluation performed on a publicly available benchmark dataset demonstrates our proposed tracker shows competitive performance while maintaining near real-time speed.

Convolutional neural networks (CNNs) have been employed in visual tracking due to their rich levels of feature representation. While the learning capability of a CNN increases with its depth, unfortunately spatial information is diluted in deeper layers which hinders its important ability to localise targets. To successfully manage this trade-off, we propose a novel residual network based gating CNN architecture for object tracking. Our deep model connects the front and bottom convolutional features with a gate layer. This new network learns discriminative features while reducing the spatial information lost. This architecture is pre-trained to learn generic tracking characteristics. In online tracking, an efficient domain adaptation mechanism is used to accurately learn the target appearance with limited samples. Extensive evaluation performed on a publicly available benchmark dataset demonstrates our proposed tracker outperforms state-of-the-art approaches.

As stated by Tom DeMacro, something that cannot be measured is uncontrollable. Thus, a number of metrics have been developed to measure the complexity associated with software by considering various aspects such as size, control flow and data flow between modules, cognitive informatics etc. Amongst these aspects, cognitive informatics is recognized as a promising aspect in measuring software complexity. Thus, majority of the complexity metrics that were proposed after the introduction of cognitive informatics have been proposed mainly based on the cognitive aspect. Amongst them, Chhillar and Bhasins' weighted composite complexity measure is one of the few metrics that had attempted to measure the complexity of a program by considering more than three or more complexity factors. After a thorough analysis, in a previous study, the authors identified that the weighted composite complexity measure could be further improved by considering more complexity factors. This paper extends the previous study to identify the most appropriate factors that could be considered by the weighted composite complexity measure. Using the opinions of the industry experts, the authors were able to discover that compound conditional statements, threads and recursion could also be considered by the weighted composite complexity measure. Accordingly, the weighted composite complexity measure was enhanced to capture the complexities that arise due to those factors. The paper also includes a demonstration of the complexity calculation method of the improved weighted composite complexity measure with the use of three sample java programs, which were written by incorporating the above mentioned factors. In addition, an application of the weighted composite complexity measure to the same programs are also given in the paper, to illustrate the changes in complexity values of the two measures.