In order to solve the problems of dbow2-based closed-loop detection algorithm, it is necessary to determine the appropriate level of dictionary tree and K value of clustering algorithm according to experience in advance. First, the new algorithm obtains the initial image feature clustering of training set by k-means ++ algorithm within the search range of cluster number (H, L). Secondly, by merging the form of similar classes, the cluster number is gradually reduced until the CRI function converges. Finally, the clustering value at this point is the best clustering value adopted by the training set to train the dictionary tree, and the clustering is repeated until the complete dictionary tree is generated. The feasibility of this algorithm is verified through experimental analysis, and the new method proposed can solve the problem of dictionary tree generation of training sets under different backgrounds, which plays a very important role in closed-loop detection based on visual image similarity detection, and has certain theoretical and practical reference value.
[1]
J. M. M. Montiel,et al.
ORB-SLAM: A Versatile and Accurate Monocular SLAM System
,
2015,
IEEE Transactions on Robotics.
[2]
Hauke Strasdat,et al.
Visual SLAM: Why filter?
,
2012,
Image Vis. Comput..
[3]
G. Klein,et al.
Parallel Tracking and Mapping for Small AR Workspaces
,
2007,
2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality.
[4]
Bernhard P. Wrobel,et al.
Multiple View Geometry in Computer Vision
,
2001
.
[5]
Hugh F. Durrant-Whyte,et al.
Mobile robot localization by tracking geometric beacons
,
1991,
IEEE Trans. Robotics Autom..
[6]
Olivier Faugeras,et al.
Motion and Structure from Motion in a piecewise Planar Environment
,
1988,
Int. J. Pattern Recognit. Artif. Intell..