Kanade–Lucas–Tomasi feature tracker explained

In computer vision, the Kanade–Lucas–Tomasi (KLT) feature tracker is an approach to feature extraction. It is proposed mainly for the purpose of dealing with the problem that traditional image registration techniques are generally costly. KLT makes use of spatial intensity information to direct the search for the position that yields the best match. It is faster than traditional techniques for examining far fewer potential matches between the images.

The registration problem

The traditional image registration problem can be characterized as follows: Given two functions

F(x) and G(x) , representing pixel values at each location x in two images, respectively, where x is a vector. We wish to find the disparity vector h that minimizes some measure of the difference between F(x + h) and G(x) , for x in some region of interest R .

Some measures of the difference between

F(x + h) and G(x) :

• L₁ norm: $$\backslash sum\_\backslash left\backslash vert\; F(x+h)-G(x)\; \backslash right\backslash vert$$
• L₂ norm: $$\backslash sqrt$$
• Negative of normalized correlation: $$\backslash dfrac$$

Basic description of the registration algorithm

The KLT feature tracker is based on two papers:

In the first paper, Lucas and Kanade^[1] developed the idea of a local search using gradients weighted by an approximation to the second derivative of the image.

One-dimensional case

If

h is the displacement between two images F(x) and G(x) = F(x + h) then the approximation is made that

$$F\text{'}(x)\; \backslash approx\; \backslash dfrac=\backslash dfrac\backslash ,$$

so that

$$h\; \backslash approx\; \backslash dfrac\backslash ,$$

This approximation to the gradient of the image is only accurate if the displacement of the local area between the two images to be registered is not too large. The approximation to

h depends on x . For combining the various estimates of h at various values of x , it is natural to average them:

$$h\; \backslash approx\; \backslash dfrac.$$

The average can be further improved by weighting the contribution of each term to it, which is inversely proportional to an estimate of

\left \vert F''(x) \right \vert , where

$$F$$(x) \approx \dfrac.

For the purpose of facilitating the expression, a weighting function is defined:

$$w(x)\; =\; \backslash dfrac.$$

The average with weighting is thereby:

$$h\; =\; \backslash dfrac.$$

Upon obtaining the estimate

F(x) can be moved by the estimate of h . The procedure is applied repeatedly, yielding a type of Newton–Raphson iteration. The sequence of estimates will ideally converge to the best h . The iteration can be expressed by

$$\backslash beginh\_\; =\; 0\; \backslash \backslash h\_\; =\; h\_\; +\; \backslash dfrac\backslash end$$

An alternative derivation

The derivation above cannot be generalized well to two dimensions for the 2-D linear approximation occurs differently. This can be corrected by applying the linear approximation in the form:

$$F(x+h)\; \backslash approx\; F(x)+hF\text{'}(x),$$

to find the

h which minimizes the L₂ norm measure of the difference (or error) between the curves, where the error can be expressed as:

$$E=\backslash sum\_\backslash left\; [F(x+h)-G(x)\backslash right\; ]^.$$

To minimize the error with respect to

h , partially differentiate E and set it to zero:

$$\backslash Rightarrow\; h\; \backslash approx\; \backslash dfrac\backslash ,$$

This is basically the same as the 1-D case, except for the fact that the weighting function

w(x) = F'(x) ^{2.} And the iteration form with weighting can be expressed as:

$$\backslash beginh\_0\; =\; 0\; \backslash \backslash h\_=h\_k\; +\; \backslash dfrac\backslash end$$

Performance

To evaluate the performance of the algorithm, we are naturally curious about under what conditions and how fast the sequence of

h _{k} 's converges to the real h .

Consider the case:

Both versions of the registration algorithm will converge to the correct

h for \left\vert h\right\vert < \pi , i.e. for initial misregistrations as large as one-half wavelength. The range of convergence can be improved by suppressing high spatial frequencies in the image, which could be achieved by smoothing the image, that will also undesirably suppress small details of it. If the window of smoothing is much larger than the size of the object being matched, the object may be suppressed entirely, so that a match would be no longer possible.

Since lowpass-filtered images can be sampled at lower resolution with no loss of information, a coarse-to-fine strategy is adopted. A low-resolution smoothed version of the image can be used to obtain an approximate match. Applying the algorithm to higher resolution images will refine the match obtained at lower resolution.

As smoothing extends the range of convergence, the weighting function improves the accuracy of approximation, speeding up the convergence. Without weighting, the calculated displacement

h _{1} of the first iteration with F(x) = \sin x falls off to zero as the displacement approaches one-half wavelength.

Implementation

The implementation requires the calculation of the weighted sums of the quantities

F'G, F'F, and (F') ^{2} over the region of interest R. Although F'(x) cannot be calculated exactly, it can be estimated by:

$$F\text{'}(x)\; \backslash approx\; \backslash dfrac,$$

where

\Delta x is chosen appropriately small.

Some sophisticated technique can be used for estimating the first derivatives, but in general such techniques are equivalent to first smoothing the function, and then taking the difference.

Generalization to multiple dimensions

The registration algorithm for 1-D and 2-D can be generalized to more dimensions. To do so, we try to minimize the L₂ norm measure of error:

$$E=\backslash sum\_\backslash left\; [F(\backslash mathbf\{x\}+\backslash mathbf\{h\})-G(\backslash mathbf\{x\})\backslash right\; ]^,$$

where

x and h are n-dimensional row vectors.

A linear approximation analogous:

$$F(\backslash mathbf+\backslash mathbf)\; \backslash approx\; F(\backslash mathbf)+\backslash mathbf\backslash left(\backslash dfracF(\backslash mathbf)\backslash right)^.$$

And partially differentiate

E with respect to h :

$$\backslash Rightarrow\; \backslash mathbf\; \backslash approx\; \backslash left\; [\backslash sum\_\{\backslash mathbf\{x\}\}\backslash left\; [G(\backslash mathbf\{x\})-F(\backslash mathbf\{x\})\backslash right\; ]\backslash left\; (\backslash dfrac\backslash right)\backslash right\; ]\; \backslash left\; [\backslash sum\_\{\backslash mathbf\{x\}\}\backslash left\; (\backslash dfrac\{\backslash partial\; F\}\{\backslash partial\backslash mathbf\{x\}\}\backslash right)^\{T\}\backslash left\; (\backslash dfrac\{\backslash partial\; F\}\{\backslash partial\backslash mathbf\{x\}\}\backslash right)\backslash right\; ]^,$$

which has much the same form as the 1-D version.

Further generalizations

The method can also be extended to take into account registration based on more complex transformations, such as rotation, scaling, and shearing, by considering

$$G(x)\; =\; F(Ax+h),$$

where

A is a linear spatial transform. The error to be minimized is then

$$E\; =\; \backslash sum\_\backslash left\; [F(Ax+h)-G(x)\backslash right\; ]^2.$$

To determine the amount

\Delta A to adjust A and \Delta h to adjust h , again, use the linear approximation:

$$F(x(A+\backslash Delta\; A)+(h+\backslash Delta\; h))\backslash approx\; F(Ax+h)+(\backslash Delta\; Ax+\backslash Delta\; h)\backslash dfracF(x).$$

The approximation can be used similarly to find the error expression, which becomes quadratic in the quantities to be minimized with respect to. After figuring out the error expression, differentiate it with respect to the quantities to be minimized and set the results zero, yielding a set of linear equations, then solve them.

A further generalization is designed for accounting for the fact that the brightness may be different in the two views, due to the difference of the viewpoints of the cameras or to differences in the processing of the two images. Assume the difference as linear transformation:

$$F(x)=\backslash alpha\; G(x)+\backslash beta,$$

where

\alpha represents a contrast adjustment and \beta represents a brightness adjustment.

Combining this expression with the general linear transformation registration problem:

$$E=\backslash sum\_\backslash left\; [F(Ax+h)-(\backslash alpha\; G(x)+\backslash beta)\backslash right\; ]^2$$

as the quantity to minimize with respect to

\alpha, \beta, A, and h.

Detection and tracking of point features

In the second paper Tomasi and Kanade^[2] used the same basic method for finding the registration due to the translation but improved the technique by tracking features that are suitable for the tracking algorithm. The proposed features would be selected if both the eigenvalues of the gradient matrix were larger than some threshold.

By a very similar derivation, the problem is formulated as

$$\backslash nabla\; d\; =\; e$$

where

\nabla is the gradient. This is the same as the last formula of Lucas–Kanade above. A local patch is considered a good feature to track if both of the two eigenvalues (λ _{1} and λ _{2} ) of \nabla are larger than a threshold.

A tracking method based on these two papers is generally considered a KLT tracker.

Improvements and variations

In a third paper, Shi and Tomasi^[3] proposed an additional stage of verifying that features were tracked correctly.

An affine transformation is fit between the image of the currently tracked feature and its image from a non-consecutive previous frame. If the affine compensated image is too dissimilar the feature is dropped.

The reasoning is that between consecutive frames a translation is a sufficient model for tracking but due to more complex motion, perspective effects, etc. a more complex model is required when frames are further apart.

Using a similar derivation as for the KLT, Shi and Tomasi showed that the search can be performed using the formula

$$Tz\; =\; a$$

where

T is a matrix of gradients, z is a vector of affine coefficients and a is an error vector. Compare this to \nabla d = e .

See also

• Kanade–Tomasi features in the context of feature detection
• Lucas–Kanade method, an optical flow algorithm derived from reference 1.

Notes and References

1. Bruce D. Lucas and Takeo Kanade. An Iterative Image Registration Technique with an Application to Stereo Vision. International Joint Conference on Artificial Intelligence, pages 674–679, 1981.
2. Carlo Tomasi and Takeo Kanade. Detection and Tracking of Point Features. Carnegie Mellon University Technical Report CMU-CS-91-132, April 1991.
3. Jianbo Shi and Carlo Tomasi. Good Features to Track. IEEE Conference on Computer Vision and Pattern Recognition, pages 593 - 600, 1994.