title: On optimal dynamic sequential search for matching in real-time machine vision.
abstract: In the matching tasks of tracking and geometrical vision, there are usually priors available on the absolute and/or relative image locations of features of interest. In this paper, we use these priors dynamically to guide a feature by feature matching search that can achieve global matching with much fewer image processing operations and lower overall computational cost. First, the concept of dynamic sequential search (DSS) is presented. Then, the problem of determining an optimal search order for DSS is investigated, when the probabilistic distribution of the features can be described by a multivariate Gaussian model. Based on the general formulas for sequentially updating the predicted positions of the features as well as their innovation covariance, the theoretic lower bound for the sum of the areas of the features search-regions is derived, and the necessary and sufficient condition for the optimal search order to approach this lower bound is presented. After that, an algorithm for dynamically determining a suboptimal search order is presented, with a computational complexity of O(n3), which is two magnitudes lower than those of the state-of-the-art algorithms. The effectiveness of the proposed method is validated by both statistical simulation and real-world experiments with a monocular visual SLAM (simultaneous localization and mapping) system. The results verify that the performance of the proposed method is better than the state-of-the-art algorithms, with both fewer image processing operations and lower overall computational cost.
authors.forename: Zhibin
authors.initials: Z
authors.lastname: Liu
authors.forename: Zongying
authors.initials: Z
authors.lastname: Shi
authors.forename: Wenli
authors.initials: W
authors.lastname: Xu