We propose an efficient robust version of the Lucas–Kanade template matching algorithm. The robust weights used by the algorithm are based on evidence which is accumulated over many frames. We also present a robust extension of the algorithm proposed by Matthews et al. [Matthews, I., Ishikawa, T., Baker, S., 2004. The template update problem. IEEE Trans. Pattern Anal. Machine Intell. 26 (6), 810–815] which corrects the template drift. We demonstrate that in terms of tracking accuracy, the robust version of the drift-correcting algorithm outperforms the original algorithm, while remaining still extremely fast.
The basic reconstruction problem lead with the general task of retrieving a scenery from observations made by a random walker. A critical factor associated with the problem is reconstructing the scenery in polynomial time. In this article, we propose a novel technique based on the modern DNA sequencing method for reconstructing a 3-color scenery of length nn. The idea is first to Cheapest Uk Ugg Boots
reconstruct small pieces of length order log nn and then assembled them together to form the required piece. We show that this reconstruction and assembly for Cheapest Genuine Uggs Uk
a finite piece of a 3-color scenery takes polynomial amount of time.