Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: Fourier Lucas-Kanade algorithm
Author: Lucey, S.
Navarathna, R.
Ashraf, A.
Sridharan, S.
Citation: IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013; 35(6):1383-1396
Publisher: IEEE
Issue Date: 2013
ISSN: 0162-8828
Statement of
Simon Lucey, Rajitha Navarathna, Ahmed Bilal Ashraf, Sridha Sridharan
Abstract: In this paper, we propose a framework for both gradient descent image and object alignment in the Fourier domain. Our method centers upon the classical Lucas & Kanade (LK) algorithm where we represent the source and template/model in the complex 2D Fourier domain rather than in the spatial 2D domain. We refer to our approach as the Fourier LK (FLK) algorithm. The FLK formulation is advantageous when one preprocesses the source image and template/model with a bank of filters (e.g., oriented edges, Gabor, etc.) as 1) it can handle substantial illumination variations, 2) the inefficient preprocessing filter bank step can be subsumed within the FLK algorithm as a sparse diagonal weighting matrix, 3) unlike traditional LK, the computational cost is invariant to the number of filters and as a result is far more efficient, and 4) this approach can be extended to the Inverse Compositional (IC) form of the LK algorithm where nearly all steps (including Fourier transform and filter bank preprocessing) can be precomputed, leading to an extremely efficient and robust approach to gradient descent image matching. Further, these computational savings translate to nonrigid object alignment tasks that are considered extensions of the LK algorithm, such as those found in Active Appearance Models (AAMs).
Keywords: Humans
Facial Expression
Fourier Analysis
Image Processing, Computer-Assisted
Pattern Recognition, Automated
Rights: © 2013 IEEE
DOI: 10.1109/TPAMI.2012.220
Grant ID:
Appears in Collections:Aurora harvest 4
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.