Object tracking is still an intriguing task as the target undergoes significant appearance changes due to illumination, fast motion, occlusion and shape deformation. Background clutter and numerous other environmental factors are other major constraints which remain a riveting challenge to develop a robust and effective tracking algorithm. In the present study, an adaptive Spatio-temporal context (STC)-based algorithm for online tracking is proposed by combining the context-aware formulation, Kalman filter, and adaptive model learning rate. For the enhancement of seminal STC-based tracking performance, different contributions were made in the proposed study. Firstly, a context-aware formulation was incorporated in the STC framework to make it computationally less expensive while achieving better performance. Afterwards, accurate tracking was made by employing the Kalman filter when the target undergoes occlusion. Finally, an adaptive update scheme was incorporated in the model to make it more robust by coping with the changes of the environment. The state of an object in the tracking process depends on the maximum value of the response map between consecutive frames. Then, Kalman filter prediction can be updated as an object position in the next frame. The average difference between consecutive frames is used to update the target model adaptively. Experimental results on image sequences taken from Template Color (TC)-128, OTB2013, and OTB2015 datasets indicate that the proposed algorithm performs better than various algorithms, both qualitatively and quantitatively.

Compressed Sensing (CS) theory breaks the Nyquist theorem through random under-sampling and enables us to reconstruct a signal from 10%-50% samples. Magnetic Resonance Imaging (MRI) is a good candidate for application of compressed sensing techniques due to i) implicit sparsity in MR images and ii) inherently slow data acquisition process. In multi-slice MRI, strong inter-slice correlation has been exploited for further scan time reduction through interpolated compressed sensing (iCS). In this paper, a novel fast interpolated compressed sensing (FiCS) technique is proposed based on 2D variable density under-sampling (VRDU) scheme. The 2D-VRDU scheme improves the result by sampling the high energy central part of the k-space slices. The novel interpolation technique takes two consecutive slices and estimates the missing samples of the target slice (T slice) from its left slice (L slice). Compared to the previous methods, slices recovered with the proposed FiCS technique have a maximum correlation with their corresponding original slices. The proposed FiCS technique is evaluated by using both subjective and objective assessment. In subjective assessment, our proposed technique shows less partial volume loss compared to existing techniques. For objective assessment different performance metrics, such as structural similarity index measurement (SSIM), peak signal to noise ratio (PSNR), mean square error (MSE) and correlation, are used and compared with existing interpolation techniques. Simulation results on knee and brain dataset shows that the proposed FiCS technique has improved image quality and performance with even reduced scan time, lower computational complexity and maximum information content.

Visual object tracking (VOT) is a vital part of various domains of computer vision applications such as surveillance, unmanned aerial vehicles (UAV), and medical diagnostics. In recent years, substantial improvement has been made to solve various challenges of VOT techniques such as change of scale, occlusions, motion blur, and illumination variations. This paper proposes a tracking algorithm in a spatiotemporal context (STC) framework. To overcome the limitations of STC based on scale variation, a max-pooling-based scale scheme is incorporated by maximizing over posterior probability. To avert target model from drift, an efficient mechanism is proposed for occlusion handling. Occlusion is detected from average peak to correlation energy (APCE)-based mechanism of response map between consecutive frames. On successful occlusion detection, a fractional-gain Kalman filter is incorporated for handling the occlusion. An additional extension to the model includes APCE criteria to adapt the target model in motion blur and other factors. Extensive evaluation indicates that the proposed algorithm achieves significant results against various tracking methods.

Despite eminent progress in recent years, various challenges associated with object tracking algorithms such as scale variations, partial or full occlusions, background clutters, illumination variations are still required to be resolved with improved estimation for real-time applications. This paper proposes a robust and fast algorithm for object tracking based on spatio-temporal context (STC). A pyramid representation-based scale correlation filter is incorporated to overcome the STC’s inability on the rapid change of scale of target. It learns appearance induced by variations in the target scale sampled at a different set of scales. During occlusion, most correlation filter trackers start drifting due to the wrong update of samples. To prevent the target model from drift, an occlusion detection and handling mechanism are incorporated. Occlusion is detected from the peak correlation score of the response map. It continuously predicts target location during occlusion and passes it to the STC tracking model. After the successful detection of occlusion, an extended Kalman filter is used for occlusion handling. This decreases the chance of tracking failure as the Kalman filter continuously updates itself and the tracking model. Further improvement to the model is provided by fusion with average peak to correlation energy (APCE) criteria, which automatically update the target model to deal with environmental changes. Extensive calculations on the benchmark datasets indicate the efficacy of the proposed tracking method with state of the art in terms of performance analysis.

During recent years correlation tracking is considered fast and effective by the virtue of circulant structure of the sampling data for learning phase of filter and Fourier domain calculation of correlation. During the occurrence of occlusion, motion blur and out of view movement of target, most of the correlation filter based trackers start to learn using erroneous samples and tracker starts drifting. Currently, adaptive correlation filter based tracking algorithms are being combined with redetection modules. This hybridization helps in redetection of the target in long term tracking. The redetection modules are mostly classifier, which classify the true object after tracking failure occurrence. The methods perform favorable during short term occlusion or partial occlusion. To further increase the tracking efficiency specifically during long term occlusion, while maintaining real time processing speed, this study proposes tracking failure avoidance method. We first propose, a strategy to detect the occlusion using two cues from the response map i.e., peak correlation score and peak to side lobe ratio. After successful detection of tracking failure, second strategy is proposed to save the target being getting more erroneous. Kalman filter based predictor continuously predicts the location during occlusion. Kalman filter passes this result to Support Vector Machine (SVM). When the target reappears in frame, support vector machine based classifier classifies the correct object using the predicted location of Kalman filter. This decreases the chance of tracking failure as Kalman filter continuously updates itself during occlusion and predicts the next location using its own previous prediction. Once the true object is detected by classifier after the clearance of occlusion, this result is forwarded to correlation filter tracker to resume its operation of tracking and updating its parameters. Together these two proposed schemes show significant improvement in tracking efficiency. Furthermore, this collaboration in redetection phase shows significant improvement in the tracking accuracy over videos containing six challenging aspects of visual object tracking as mentioned in the literature.

Magnetic Resonance Imaging (MRI) is an important yet slow medical imaging modality. Compressed sensing (CS) theory has enabled to accelerate the MRI acquisition process using some nonlinear reconstruction techniques from even 10% of the Nyquist samples. In recent years, interpolated compressed sensing (iCS) has further reduced the scan time, as compared to CS, by exploiting the strong interslice correlation of multislice MRI. In this paper, an improved efficient interpolated compressed sensing (EiCS) technique is proposed using radial undersampling schemes. The proposed efficient interpolation technique uses three consecutive slices to estimate the missing samples of the central target slice from its two neighboring slices. Seven different evaluation metrics are used to analyze the performance of the proposed technique such as structural similarity index measurement (SSIM), feature similarity index measurement (FSIM), mean square error (MSE), peak signal to noise ratio (PSNR), correlation (CORR), sharpness index (SI), and perceptual image quality evaluator (PIQE) and compared with the latest interpolation techniques. The simulation results show that the proposed EiCS technique has improved image quality and performance using both golden angle and uniform angle radial sampling patterns, with an even lower sampling ratio and maximum information content and using a more practical sampling scheme.