Browse > Article
http://dx.doi.org/10.9717/kmms.2019.22.1.035

A Fast and Efficient Sliding Window based URV Decomposition Algorithm for Template Tracking  

Lee, Geunseop (Division of Global Business and Technology, Hankuk University of Foreign Studies)
Publication Information
Abstract
Template tracking refers to the procedure of finding the most similar image patch corresponding to the given template through an image sequence. In order to obtain more accurate trajectory of the template, the template requires to be updated to reflect various appearance changes as it traverses through an image sequence. To do that, appearance images are used to model appearance variations and these are obtained by the computation of the principal components of the augmented image matrix at every iteration. Unfortunately, it is prohibitively expensive to compute the principal components at every iteration. Thus in this paper, we suggest a new Sliding Window based truncated URV Decomposition (TURVD) algorithm which enables updating their structure by recycling their previous decomposition instead of decomposing the image matrix from the beginning. Specifically, we show an efficient algorithm for updating and downdating the TURVD simultaneously, followed by the rank-one update to the TURVD while tracking the decomposition error accurately and adjusting the truncation level adaptively. Experiments show that the proposed algorithm produces no-meaningful differences but much faster execution speed compared to the typical algorithms in template tracking applications, thereby maintaining a good approximation for the principal components.
Keywords
Template Tracking; Principal Components; Truncated URV Decomposition;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G. Lee and J.L. Barlow, “Updating Approximate Principal Components with Applications to Template Tracking,” Numerical Linear Algebra with Applications, Vol. 24, No. 2, pp. e2081, 2017.   DOI
2 I. Whoang and K.N. Choi, "An Algorithm for Color Object Tracking," Journal of Korea Multimedia Society, Vol 10. No. 7, pp. 827-837, 2007.
3 I. Matthews, T. Ishikawa, and S. Baker, “The Template Update Problem,” IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 26, No. 6, pp. 810-815, 2004.   DOI
4 R. Badeau, G. Richard, and B. David, “Sliding Window Adaptive SVD Algorithms,” IEEE Transaction on Signal Processing, Vol. 52, No. 1, pp. 1-10, 2004.   DOI
5 M. Brand, “Fast Low-Rank Modification of the Thin Singular Value Decomposition,” Linear Algebra and Its Applications, Vol. 415, No. 1, pp. 20-30, 2006.   DOI
6 J.R. Bunch and C.P. Nielsen, “Updating the Singular Value Decomposition,” Numeriche Mathematik, Vol. 31, No. 2, pp. 111-129, 1978.   DOI
7 J. Weng, Y. Zhang, and W.S. Hwang, “Candid Covariance-Free Incremental Principal Component Analysis,” IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 25, No. 8, pp. 1034-1040, 2003.   DOI
8 H. Zhao, P.C. Yuen, and J.T. Kwok, “A Novel Incremental Principal Component Analysis and Its Application for Face Recognition,” IEEE Transaction on System Mans, and Cybernetics, Vol. 36, No. 4, pp. 873-886, 2006.   DOI
9 B. Lucas and T. Kanade, "An Iterative Image Registration Technique with an Application to Stereo Vision," Proceeding of Defense Advanced Research Projects Agency Image Understanding Workshop, pp. 674-679, 1981.
10 G.H. Golub and C.F. Van Loan, Matrix computations, The Johns Hopkins Press, Baltimore, 2013.
11 G.W. Stewart, "Updating a Rank-Revealing ULV Decomposition," Journal of Society for Industrial and Applied Mathematics Matrix Analysis and Applications, Vol. 14, No. 2, pp. 494-499, 1993.   DOI
12 G.W. Stewart, “An Updating Algorithm for Subspace Tracking,” IEEE Transaction on Signal Processing, Vol. 40, No. 6, pp. 1535-1541, 1992.   DOI
13 J.L. Barlow and H. Erbay, “Modifiable Low-Rank Approximation to a Matrix,” Numerical Linear Algebra with Applications, Vol. 16, No. 10, pp. 833-860, 2009.   DOI