2009 IEEE Conference on Computer Vision and Pattern Recognition Efficient image alignment using linear appearance models Miami, FL, USA June 20-June 25 ISBN: 978-1-4244-3992-8
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigen-tracking) are one of the most popular approaches to align templates with appearance variations (e.g. illumination, iconic changes). A number of well known tracking algorithms have been proposed in the last years to accurately fit these models to images. Computational efficiency is an important limitation in object tracking algorithms and different efficient techniques, such as the ldquoprojected-outrdquo optimization, have been proposed. They reduce the computational cost using an efficient formulation in which many of the involved operations can be precomputed. On the other hand, alternative ldquosimultaneousrdquo algorithms jointly optimize pose and appearance parameters, providing better performance but increasing the computational cost. In this paper, we propose an algorithm for efficient linear appearance model fitting based on the inverse compositional simultaneous optimization of pose and appearance. We introduce a novel formulation which reduces the required computational time while maintaining similar convergence properties of previous ldquosimultaneousrdquo approaches. Experimental results illustrate the capabilities of this algorithm in face tracking.
Index Terms:
inverse compositional simultaneous optimization, efficient image alignment, visual tracking, computer vision, linear subspace technique, tracking algorithm, computational efficiency, object tracking, linear appearance model fitting
Citation:
J. Gonzalez-Mora, N. Guil, E.L. Zapata, F. de la Torre, "Efficient image alignment using linear appearance models," cvpr, pp.2230-2237, 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||