Open AccessGridding place recognition for fast loop closure detection on mobile platforms
Author(s) -
Yang Zhe,
Pan Yun,
Huan Ruohong,
Bao Yaoqi
Publication year - 2019
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2019.1148
Subject(s) - computer science , closure (psychology) , loop (graph theory) , grid , matching (statistics) , mobile device , real time computing , artificial intelligence , pattern recognition (psychology) , algorithm , computer vision , mathematics , combinatorics , economics , market economy , statistics , geometry , operating system
Loop closure detection is an indispensable component to reduce the error accumulation in localisation applications, however, it is hard to be implemented as a real‐time application with high accuracy on the mobile platform. A place recognition method called gridding place recognition (GPR) is proposed for ultra‐fast loop closure detection with high accuracy maintained. The GPR splits the images into multiple grids for high parallelism and uses bags of word features to summarise each grid. The matching results for each grid are then retrieved and merged for further determination of loop closure under extra temporal and spatial constraints. The authors implement the method on a mobile platform, and the best accuracy and fastest execution time of 47 frames per second are achieved on several public benchmarks compared with other typical or fast loop closure algorithms.