## 1.

## Introduction

Visual object tracking, which is the process of estimating the motion parameters such as location, scale, and rotation of the object in an image sequence given the initial box in the first frame, is a popular problem in computer vision, with wide-ranging applications including visual navigation, military reconnaissance, and human–computer interaction.^{1}^{,}^{2} Although significant progress has been made in recent years, the problem is still difficult due to factors such as partial occlusion, deformation, scale variation, rotation, and background clutter.^{3} To solve these problems, numerous algorithms have been proposed.^{4}5.^{–}^{6}

The online learning algorithm is one of the useful algorithms that has been widely used to solve the problem of objects’ changing appearance. As some information of the objects to be tracked is known in advance in various scenarios, it is possible to employ prior knowledge to design the tracker. However, for other applications, as nothing about the objects of interest is known beforehand, no prior knowledge can be of use. Also, it is impossible to employ offline machine learning techniques to achieve efficient tracking because the appearance of an object is likely to vary due to its constant movements and also under different environmental conditions, such as varying level of brightness.^{7}^{,}^{8} Instead, online learning algorithms have been employed to adapt the object model to the abovementioned uncertainties. In practice, however, updating a model often introduces errors as it is difficult to explicitly assign hard class labels.

To efficiently track the constantly changing object and avoid the errors caused by an online learning algorithm, a model that precisely represents the object is needed. Various forms of representation of the object are used in practice, for example: points,^{9}^{,}^{10} contours,^{11}^{,}^{12} optical flow,^{13}^{,}^{14} or articulated models.^{15}^{,}^{16} Models that decompose the object into parts are more robust,^{17}^{,}^{18} as local changes only affect individual parts. Even when individual parts are lost or in an erroneous state, other object parts can still represent the object well. Keypoint, such as SIFT,^{19} SURF,^{20} ORB,^{21} AKAZE,^{22} and so on, is a representative kind of local feature that has been widely used in image fusion, object recognition, and other fields.

In this paper, a model-free tracking method based on fusing AKAZE and KLT features is proposed. The brief procedure is as follows: first, generate matching-keypoints by finding corresponding keypoints from the consecutive frames and the object template, then generate tracking-keypoints using the forward–backward flow tracking method, and at last, obtain credible keypoints by AKT fusion algorithm. To avoid the instability of a statistical method, the median method is adopted to compute object’s location, scale, and rotation in each frame.

## 2.

## Background Work

AKAZE^{22} is regarded as the improved version of SIFT features and SURF. It is a more stable feature detection algorithm. Traditional SIFT and SURF feature detection algorithms build scale space by the linear Gaussian pyramid. However, this kind of linear decomposition can cause loss of accuracy, object’s edge blur, and loss of details. In order to solve these problems, AKAZE algorithm uses the method based on nonlinear scale space. The fast explicit diffusion (FED)^{23} is used to construct scale space. By using this method, any step length can be applied. Compared to SIFT and SURF, the computational complexity is greatly reduced and the robustness is improved. In the following subsections, the detailed procedures of constructing nonlinear scale space using FED scheme will be illustrated. The process of feature detection and the effects of feature description of AKAZE algorithm based on modified-local difference binary (M-LDB) will then be discussed.

## 2.1.

### Building Nonlinear Scale Space

Similar to SIFT in the construction of the nonlinear scale space, scale level increases logarithmically. The scale space constructed has ${P}_{ai}^{t}(x,y)$ octaves and each octave has ${V}^{a}$ layers. Different octaves and layers are marked with serial numbers o and s, respectively. The relationship between them and the scale parameter σ is shown in the equation below:

where $o\in [0\dots O-1]$, $s\in [0\dots S-1]$, $i\in [0\dots M-1]$. $M$ is the total number of images that remain after filtration by the filter. Since the nonlinear diffusion filter is based on the scale of time, scale parameters ${\sigma}_{i}$ with the unit of pixel is transformed to the unit of time, as shown below: where ${t}_{i}$ is $o\in [0\dots O-1]$, $s\in [0\dots S-1]$, $i\in [0\dots M]$ called evolutionary time. For each input image, a Gaussian filter is first applied, then the gradient histogram of the image is calculated. The contrast factor ${P}_{i}^{t}(x,y)$ is set as 70% of the gradient histogram. In the case of two-dimensional (2-D) images, since the image derivative is one pixel grid size, the maximal step size ${t}_{\mathrm{max}}$ is 0.25 without violating stable conditions. Then by using a set of evolutionary time ${t}_{i}$, all the images of scale space can be obtained using FED scheme.## 2.2.

### Feature Detection

Feature detection of AKAZE is achieved by computing the Hessian local maxima after normalization of various scales for the filtered images in the nonlinear scale space. Calculation of a Hessian matrix is as follows:

## (3)

$${L}_{\text{Hessian}}^{i}={\sigma}_{i,\text{norm}}^{2}({L}_{xx}^{i}{L}_{yy}^{i}-{L}_{xy}^{i}{L}_{xy}^{i}),$$## 2.3.

### Feature Description

The diagram in Fig. 1, as supplied by Ref. 22, demonstrates LDB^{24} and M-LDB tests between grid divisions around a keypoint. The intensity is expressed by colorful grids and the gradients in $x$ are expressed by the arrows. The feature description of AKAZE algorithm is based on M-LDB that exploits gradient and intensity information from the nonlinear scale space. And there are two main improvements of M-LDB compared with LDB: (1) rotation invariance is obtained by estimating the main orientation of the keypoint, as is done in KAZE,^{25} and rotating the grid of LDB accordingly. (2) A function of the scale σ is used as the subsample grids in steps instead of using the average of all pixels inside each subdivision of the grid. The scale-dependent sampling in turn makes the descriptor robust to changes in scale.

## 3.

## Fusing AKT Tracking

## 3.1.

### Forward–Backward Flow Tracking

Because of the environmental impact or object’s appearance change, the results of KLT often produce deviation, an evaluation method needs to be established to judge the accuracy of tracking results. Forward–backward error,^{26} which is based on the forward–backward continuity assumption, can effectively estimate the trajectory error of keypoints, i.e., if the object tracking is correct, then the tracking results are independent of time.

As shown in Fig. 2, for two adjacent frame ${I}_{t-1}$ and ${I}_{t}$, ${x}_{t-1}$ is a random keypoint from object template in the frame ${I}_{t-1}$, ${x}_{t}$ is the corresponding keypoint of ${x}_{t-1}$ in the frame ${I}_{t}$ using forward tracking, and ${\widehat{x}}_{t-1}$ is the corresponding keypoint of ${x}_{t}$ in the frame ${I}_{t-1}$ using backward tracking. Forward–backward error is defined as the Euclidean distance between two keypoints in frame ${I}_{t-1}$, i.e., ${e}_{t-1}^{FB}=\Vert {x}_{t-1}-{\widehat{x}}_{t-1}\Vert $. If error ${e}_{t-1}^{FB}$ is bigger than a threshold which we set, the keypoint will be tracked falsely.

We set the location of keypoint and status of forward–backward error as a pair pair (keypoint, status). If the status corresponding to keypoint is TRUE, which means the status of forward KLT and backward KLT themselves both must be TRUE, and error ${e}_{t-1}^{FB}$ is smaller than the Euclidean distance threshold, then we call the keypoint with TRUE status tracking-keypoint. The rest are called failing tracking-keypoint.

## 3.2.

### Model of AKT

When calculating the homographic matrix between the initial keypoints and the current keypoint based on the traditional AKAZE algorithm, robust statistical methods, such as RANSAC and LMEDS, are usually adopted. However, when the number of outliers is too much, homographic matrix estimation will get poor results. So, in this paper, we put forward a tracking model called AKT, which can fundamentally eliminate the false matching-keypoints and reduce the proportion of outliers to effectively solve the problem of inaccurate parameter estimation.

The diagram in Fig. 3 demonstrates how the AKT algorithm fuses the matching-keypoints and tracking-keypoints by AKT algorithm. The collection of ${V}^{a}$ is composed of matching-keypoints ${P}_{ai}^{t}(x,y)$ in the $t$’th frame corresponding to the keypoints in object template obtained by AKAZE matching algorithm. And these matching-keypoints are represented by black circles in Fig. 3. The collection of ${V}^{k}$ is composed of tracking-keypoints ${P}_{ki}^{t}(x,y)$ in the $t$’th frame corresponding to the keypoints in object template obtained by KLT algorithm. And these tracking-keypoints are represented by gray circles in Fig. 3. There is a one-to-one correspondence between matching-keypoints and tracking-keypoints. Keypoints surrounded by the curve are credible keypoints in the $t$’th frame, which will make contributions to calculating an object’s location, scale, and rotation. The rest of the key points are outliers and thus, they are deleted. The credible keypoints are obtained by fusing matching-keypoints and tracking-keypoints. Its collection is $V$.

Sort the Euclidean distance ${l}_{i}^{t}$ between the $i$’th pair of matching-keypoints and tracking-keypoints in the $t$’th frame in descending order, then the experiments show that the optimal value ${l}_{Th}^{t}$ to be set as maximum allowable deviation threshold is in 0.26th of the distance sequence because enough credible keypoints are ensured, and the obvious false matching-keypoints can be removed. This means that the all but the bottom 0.74th pairs of points are valid matches. Set keypoint ${P}_{i}^{t}(x,y)$ as the center, $a$ as the width and the height of the patch as ${M}_{i}^{t}$. The degree of similarity between two patches is defined as

where ${\beta}_{\mathrm{NCC}}$ is the normalization correlation coefficient. Set minimum allowed similarity threshold to be ${\alpha}_{Th}$, the set $V$ of credible keypoints is composed of three parts: (1) when the Euclidean distance between the $i$’th pair of matching-keypoints and tracking-keypoints satisfies ${l}_{i}^{t}\le {l}_{Th}^{t}$, keypoints ${P}_{ai}^{t}(x,y)\in V$; (2) when ${l}_{i}^{t}>{l}_{Th}^{t}$, AKAZE match or KLT track may cause an error, lead to an excessively large deviation, so mistakenly deleted credible keypoints can be screened out by referring to similarity, namely if $\alpha ({M}_{i},{M}_{i}^{t})>{\alpha}_{Th}$, matching-keypoints ${P}_{ai}^{t}(x,y)\in V$; and (3) if $\alpha ({M}_{i},{M}_{i}^{t})>{\alpha}_{Th}$, tracking-keypoints ${P}_{ki}^{t}(x,y)\in V$.## 3.3.

### Bounding Box

The traditional ways to calculate the homographic matrix are statistical methods, such as RANSAC and LMEDS. However, experiments show that the estimation of homography gives poor results for nonplanar objects, even though the keypoint association was performed correctly.^{27} So, in this paper, the median method is put forward to compute object’s location, scale, and rotation in each frame.

As shown in Fig. 4, ${P}_{\text{center}}(x,y)$ and ${P}_{\text{center}}^{t}(x,y)$ represent the center of the initial template and the object’s bounding box in the $t$’th frame, respectively. ${P}_{i}(x,y)$ and ${P}_{i}^{t}(x,y)$ represent credible keypoints of the initial template and that in the $t$’th frame. ${\theta}_{n}$ and ${\theta}_{n}^{t}$ represent the angle between the $i$ and $i+1$ keypoints of the initial template and that in the $t$’th frame. ${d}_{n}$ and ${d}_{n}^{t}$, respectively, represent the Euclidean distance between the keypoints in the initial template and that in the $t$’th frame. With the following equations, the relative changing rate of position, scale and rotation angle can be calculated:

## (5)

$${d}_{\text{center}}^{t}(x,y)=\text{median}(\Vert {P}_{i}^{t}(x,y)-{P}_{i}(x,y)\Vert ),i\in [1,N],$$## (9)

$${x}_{\text{rotate}}^{t}=\mathrm{cos}\text{\hspace{0.17em}}{\theta}_{\text{center}}^{t}\xb7{x}_{{P}_{di}}-\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{\text{center}}^{t}\xb7{y}_{{P}_{di}},$$## (10)

$${y}_{\text{rotate}}^{t}=\mathrm{cos}\text{\hspace{0.17em}}{\theta}_{\text{center}}^{t}\xb7{y}_{{P}_{di}}+\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{\text{center}}^{t}\xb7{x}_{{P}_{di}},$$## (11)

$${P}_{ri}^{t}(x,y)={P}_{\text{center}}^{t}(x,y)+{s}_{\text{center}}^{t}\xb7{P}_{\text{rotate}}^{t}({x}_{\text{rotate}}^{t},{y}_{\text{rotate}}^{t}),i=[\mathrm{1,4}],$$## 3.4.

### Algorithm Procedure

Given a sequence of images ${I}_{1},\dots ,{I}_{n}$ and an initializing region ${b}_{1}$ in $\text{\hspace{0.17em}\hspace{0.17em}}{I}_{1}$, our aim in each frame of the sequence is to recover the box of the object of interest. Steps of the AKT Algorithm 1 are as follows:

## Algorithm 1:

Fusing AKAZE-KLT tracking.

Input: Sequences of images $S=({I}_{1},{I}_{2},\dots ,{I}_{n})$ and initializing object template ${b}_{1}$. |

1: ${P}_{i}(x,y)\leftarrow \mathrm{AKAZE}\_\text{detect}({I}_{1})$, detect and describe keypoints of object template in the first frame using AKAZE algorithm. |

2: for$t=2\dots n$do |

3: ${P}_{di}^{t}(x,y)\leftarrow \mathrm{AKAZE}\_\text{detect}[{I}_{t}(\mathrm{ROI})]$, detect and describe keypoints of search window in the ${t}^{th}$ frame |

4: ${P}_{ai}^{t}(x,y)\leftarrow \mathrm{AKAZE}\_\mathrm{match}({P}_{i},{P}_{di}^{t})$, match keypoints of object template and search window using AKAZE algorithm. |

5: ${P}_{ki}^{t}(x,y)\leftarrow \mathrm{KLT}\_\text{track}[{P}_{i}(x,y),{I}_{1},{I}_{t}]$, track keypoints of object template in search window in the ${t}^{th}$ frame using forward-backward KLT algorithm. |

6: ${P}_{i}^{t}(x,y)\leftarrow \text{fuse}[{P}_{ai}^{t}(x,y),{P}_{ki}^{t}(x,y)]$, fuse the results of AKAZE matching and KLT tracking using AKT algorithm. |

7: ${d}_{\text{center}}^{t}(x,y)=\mathrm{median}(\Vert {P}_{i}^{t}(x,y)-{P}_{i}(x,y)\Vert )$ |

8: ${s}_{\text{center}}^{t}=\text{median}({d}_{n}^{t}/{d}_{n}),n\in [1,(N-1)!]$ |

9: ${\theta}_{\text{center}}^{t}=\text{median}({\theta}_{n}^{t}-{\theta}_{n}),n\in [1,(N-1)!]$ |

10: ${b}_{t}\leftarrow \{{P}_{r1}^{t}(x,y),\dots ,{P}_{r4}^{t}(x,y)\}$, the tracking box is acquired by coordinates of four vertices. |

11: end for |

Output: Tracking box $B=({b}_{1},{b}_{2},\dots {b}_{n})$, tracking location ${d}_{\text{center}}^{t}(x,y)$, tracking scale ${s}_{\text{center}}^{t}$, tracking rotation ${\theta}_{\text{center}}^{t}$. |

## 4.

## Experimental Results

We evaluated the proposed tracking algorithm based on fusing AKAZE and KLT (AKT) algorithm using sequences, as supplied by Ref. 28, with challenging factors including partial occlusion, drastic illumination changes, nonrigid deformation, background clutter, and motion blur. We compared the proposed AKT tracker with seven state-of-the-art methods: tracking-learning-detection (TLD),^{14} compressive tracker (CT),^{29} context tracker (CXT),^{30} color-based probabilistic tracking (CPF),^{31} structured output tracking with kernels (Struck),^{32} multiple instance learning tracker (MIL)^{33} and the circulant structure of tracking with kernels (CSK).^{34} All data in the experimental results and the quantitative evaluation are based on the unified dataset and the same initial state conditions. Since our algorithm focuses primarily on the challenges of partial occlusion, deformation, rotation, and scale variation, we only include eight of the videos that mainly contain these challenges and neglect the others in the following discussions. Additionally, the results of precision and success rate are based on 22 videos, in which the good ones are as shown in Fig. 5 and Table 1. Experimental environment: Visual Studio 2013 + OpenCV3.1.0. Equipment is configured to: 2.00 GHz, dual processor, a 64-bit operating system, the 32-Gb installed memory.

## Table 1

The CLE and average frame per second (pixel/FPS).

Sequence26 | TLD14 | CT27 | CXT28 | CPF29 | Struck30 | MIL31 | CSK32 | AKT |
---|---|---|---|---|---|---|---|---|

FaceOcc1 | 32.9/12.3 | 32.0/42.3 | 22.6/10.1 | 31.7/25.2 | 2.6/9.8 | 31.0/24.0 | 16.9/108.2 | 12.0/41.0 |

Gym | 15.7/19.1 | 26.5/49.7 | 8.7/6.5 | 21.8/50.5 | 9.3/7.2 | 16.8/23.8 | 11.0/109.9 | 23/52.1 |

Jogging1 | 11.3/20.0 | 92.7/58.5 | 49.5/23.1 | 21.9/51.6 | 49.0/10.2 | 94.4/23.8 | 236.0/170.8 | 11.7/82.5 |

Jogging2 | 14.3/16.1 | 138.6/59.4 | 125.4/25.5 | 20.8/45.9 | 89.0/10.0 | 136.8/26.4 | 98.6/134.5 | 7.9/72.4 |

Mhyang | 8.9/15.1 | 25.8/46.3 | 5.5/11.0 | 15.5/102.5 | 5.3/9.5 | 15.2/27.5 | 5.4/148.4 | 8.2/67.7 |

Sylvester | 12.5/16.3 | 13.5/45.2 | 20.5/4.5 | 16.2/57.2 | 7.8/7.0 | 14.3/25.9 | 10.2/150.5 | 13.7/85.7 |

Walking | 64.5/18.8 | 78.6/32.0 | 168.8/9.8 | 4.6/53.1 | 6.4/10.5 | 5.6/25.0 | 7.7/186.4 | 5.2/117.5 |

Walking2 | 24.3/20.1 | 65.6/48.3 | 30.4/14.8 | 49.9/52.1 | 13.9/10.6 | 35.5/31.5 | 28.8/150.9 | 13.1/104.1 |

Average CLE | 23.0 | 59.2 | 53.9 | 22.8 | 25.2 | 43.7 | 39.3 | 11.9 |

Average FPS | 17.2 | 47.6 | 13.2 | 54.8 | 9.3 | 26.0 | 144.9 | 77.9 |

There are a range of measures available in previous research for assessing the performance of tracking algorithms quantitatively. Many authors employ the center-error measure that expresses the distance between the centroid of the algorithmic output and the centroid of the ground truth. This measure is only a rough assessment of the localization. Since it is not bounded, the comparison of results obtained on different sequences is difficult. So, we also employed the widely used overlap measure

where ${b}_{T}$ is the tracker output and ${b}_{GT}$ refers to the manually annotated bounding box, $\cup $ represents union, namely, the overlap of ${b}_{T}$, and ${b}_{GT}$, $\cap $ represents intersection of these boxes. The overlap rate is a better indicator for per-frame success when bounded between 0 and 1.^{35}

Since the rotation is not considered in the ground truth of the benchmarks, it is excluded in the overlap comparisons between our results and the benchmarks.

## 4.1.

### Accuracy Comparison of Methods for Tracking

The tracking performance of the AKT algorithm on different datasets^{28} is as shown in Fig. 5. Sequences (a) and (b) mainly contain the challenging aspect of partial occlusion. Sequences (c) and (d) mainly contain deformation. Sequences (e) and (f) mainly contain plane rotation and out-of-rotation. Sequences (g) and (h) mainly contain scale variation, and so on. The results show that facing different situations, the AKT algorithm can accurately track the object and has a very good robustness.

Although the AKT algorithm shows good tracking results in these videos, there are still some challenges that are hard to deal with. Since the AKT algorithm is based on keypoints, when the object’s appearance is smooth or the texture is not rich, it may struggle, as shown in Fig. 6(a). Also, when the object’s appearance is almost or totally changed, the tracking box may drift. For example, the initial object is the face, but when the person turns around, it is hard to track because of the changed appearance, as shown in Fig. 6(b).

## 4.2.

### Performance Comparison of Methods for Tracking

The center location error (CLE) and average frame per second (fps) of AKT algorithm and other seven kinds of tracking algorithms are shown in Table 1 (bold fonts indicate the best or second best performance), the results of the other seven kinds of tracking methods on different sequences in the table comes from Ref. 26. In Table 1, the results show that among the tracking on the eight datasets, the frame rate of AKT algorithm is 77.9 fps, showing a high real-time performance (the average fps comes in the top two 7 times), and achieving a high tracking accuracy with the average CLE of 11.9 pixels (the average CLE comes in the top two 5 times), the tracking performance is better than the other seven methods.

The CLE is defined as the average Euclidean distance between the center locations of the tracking boxes using our method and the manually labeled ground truths. Then the average CLE over all the frames of one sequence is used to summarize the overall performance for that sequence. Precision plot shows the percentage of frames whose estimated location is within the given threshold distance ${T}_{th}$ of the ground truth, as shown in Fig. 7(a). The results show that precision of AKT tracking is higher than the other algorithms and similar to Struck.

To measure the performance of success rate on a sequence of frames, we count the number of successful frames whose overlap $o$ is larger than the given threshold ${T}_{th}^{\prime}$. The success plot shows the ratios of successful frames at the thresholds varied from 0 to 1, as shown in Fig. 7(b). The results show that AKT algorithm is superior to other algorithms.

## 4.3.

### Error Comparison of Methods for Homography Estimation

In order to evaluate the different methods for homography estimation, we developed our own dataset because the data supplied by Ref. 26 did not include rotation data. We gained a total of 200 frames randomly as original frames. Then we transformed these frames using the affine model, as shown in Eq. (13).

## (13)

$$\left[\begin{array}{c}{x}^{\prime}\\ {y}^{\prime}\end{array}\right]=s\left[\begin{array}{cc}\mathrm{cos}\text{\hspace{0.17em}}\alpha & \mathrm{sin}\text{\hspace{0.17em}}\alpha \\ -\mathrm{sin}\text{\hspace{0.17em}}\alpha & \mathrm{cos}\text{\hspace{0.17em}}\alpha \end{array}\right]\left[\begin{array}{c}x\\ y\end{array}\right]+\left[\begin{array}{c}dx\\ dy\end{array}\right],$$Then, under the condition that the keypoints of original frames and that of transformed frames are the same, we calculate the errors of displacement (pixel), scale (1) and rotation (deg) to get the error figures (method LMEDS in red, RANSAC in blue, MEDIAN in green), as shown in Fig. 8. The independent variable of error figures is the number of frames, whereas the dependent variable is the error.

The average error (AE) is used for comparison as the first evaluation criterion, as shown in Table 2. There will be noises causing by obvious variable estimation error, so to make better comparison of the methods for homography estimation, we set up average error without noise (AEN) as the second evaluation criterion. From the error figures, we set 100 pixels as location noise threshold, 10 as scale noise threshold, 150 deg as rotation noise threshold. The lower the AE and AEN, the better the performance of method for homography estimation. The smaller the difference between AE and AEN, the more stable the method for homography estimation. Therefore, the experimental results show not only that the median method is more stable, not having apparent noises, but also that its value of AE and AEN is less than that of the traditional statistical method.

## Table 2

The AE and AEN of center location, scale, and rotation (pixel/1/deg).

Methods | x-coordinate (pixel) | y-coordinate (pixel) | Scale | Rotation (deg) | ||||
---|---|---|---|---|---|---|---|---|

AE | AEN (<100) | AE | AEN (<100) | AE | AEN (<10) | AE | AEN (<150) | |

LMEDS | 59.495 | 18.216 | 41.185 | 14.620 | 0.848 | 0.538 | 47.211 | 38.858 |

RANSAC | 55.330 | 11.055 | 55.725 | 13.384 | 52.999 | 0.504 | 41.792 | 33.185 |

MEDIAN | 12.385 | 11.369 | 10.320 | 9.864 | 0.043 | 0.043 | 19.396 | 19.396 |

## 4.4.

### Selection of Threshold for Tracking Results

The ratio of the number of inliers to the total number of matching-keypoints is called inlier ratio (IR). The larger the IR, the better the estimation of homographies. We impose that the error in location for two corresponding keypoints has to be less than 2.5 pixels, i.e., $\Vert {F}_{b}^{\prime}-H({F}_{a})\Vert <2.5$, where $H$ is the true homography between the frames, ${F}_{a}$ is the location of keypoint $a$ in original frame $F$, and ${F}_{b}^{\prime}$ is the location of keypoint $b$ in transformed frame ${F}_{b}$. The keypoint meeting above condition is called inlier. To find the threshold for better tracking, we still use the dataset put forward in Sec. 4.3 with the total number changed to 2000. We calculate the IR of these corresponding frames and the mean of IR is 0.74, as shown in Fig. 9. Therefore, we set optimal value ${l}_{Th}^{t}$ for tracking as the mean of IR to avoid outliers.

## 5.

## Conclusion

In this paper, in an effort to reduce an excess of outliers when using traditional AKAZE match-tracking algorithm and solve the problems caused by poor homography estimates produced by statistical methods, AKT algorithm is put forward. The experimental results on different datasets show that the AKT algorithm can deal with challenges, such as partial occlusion, deformation, scale variation, rotation, and background clutter, showing high real-time performance and accuracy. However, since the tracking method used is based on keypoints, when the objects appearance is smooth, and texture is not rich, using the AKT algorithm may result in reduction of the effectiveness of tracking. Therefore, in future work, we will address the problems mentioned above.

## Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant No. 61471194), Science and Technology on Electro-optic Control Laboratory and Aeronautical Science Foundation of China (Grant No. 20135152049), CASC (Grant No. China Aerospace Science and Technology Corporation) Aerospace Science and Technology Innovation Foundation Project; the Fundamental Research Funds for the Central Universities; Nanjing University of Aeronautics and Astronautics Graduate School Innovation Base (Laboratory) Open Foundation Program (Grant No. kfjj20151505).

## References

## Biography

**Junhua Yan** is an assistant professor at Nanjing University of Aeronautics and Astronautics, a visiting researcher in Science and Technology on Electro-Optic Control Laboratory. She received her BSc, MSc, and PhD degrees from Nanjing University of Aeronautics and Astronautics in 1993, 2001, and 2004, respectively. She is the author of more than 30 journal papers and has 5 patents. Her current research interests include multisource information fusion, and target detection, tracking, and recognition.