Sequence-based mapping for probabilistic visual loop-closure detection

被引:1
作者
Tsintotas, Konstantinos A. [1 ]
Bampis, Loukas [1 ]
An, Shan [2 ]
Fragulis, George F. [3 ]
Mouroutsos, Spyridon G. [4 ]
Gasteratos, Antonios [1 ]
机构
[1] Democritus Univ Thrace, Dept Prod & Management Engn, 12 Vas Sophias, GR-67132 Xanthi, Greece
[2] JD Com, AR VR Dept, Beijing 100191, Peoples R China
[3] Univ Western Macedonia, Dept Elect & Comp Engn, GR-50100 Kila, Kozani, Greece
[4] Democritus Univ Thrace, Dept Elect & Comp Engn, GR-67100 Xanthi, Greece
来源
2021 IEEE INTERNATIONAL CONFERENCE ON IMAGING SYSTEMS AND TECHNIQUES (IST) | 2021年
关键词
PLACE RECOGNITION; IMAGE FEATURES; FAB-MAP; LOCALIZATION; WORDS; BAG; NAVIGATION; VISION; BINARY; SCALE;
D O I
10.1109/IST50367.2021.9651458
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
During simultaneous localization and mapping, the robot should build a map of its surroundings and simultaneously estimate its pose in the generated map. However, a fundamental task is to detect loops, i.e., previously visited areas, allowing consistent map generation. Moreover, within long-term mapping, every autonomous system needs to address its scalability in terms of storage requirements and database search. In this paper, we present a low-complexity sequencebased visual loop-closure detection pipeline. Our system dynamically segments the traversed route through a feature matching technique in order to define sub-maps. In addition, visual words are generated incrementally for the corresponding sub-maps representation. Comparisons among these sequences-of-images are performed thanks to probabilistic scores originated from a voting scheme. When a candidate sub-map is indicated, global descriptors are utilized for image-to-image pairing. Our evaluation took place on several publicly-available datasets exhibiting the system's low complexity
引用
收藏
页数:6
相关论文
共 66 条
[1]  
Agrawal M, 2008, LECT NOTES COMPUT SC, V5305, P102, DOI 10.1007/978-3-540-88693-8_8
[2]  
Alahi A, 2012, PROC CVPR IEEE, P510, DOI 10.1109/CVPR.2012.6247715
[3]   KAZE Features [J].
Alcantarilla, Pablo Fernandez ;
Bartoli, Adrien ;
Davison, Andrew J. .
COMPUTER VISION - ECCV 2012, PT VI, 2012, 7577 :214-227
[4]  
An S, 2022, Arxiv, DOI arXiv:2010.11703
[5]  
An S, 2019, IEEE INT C INT ROBOT, P378, DOI [10.1109/iros40897.2019.8968043, 10.1109/IROS40897.2019.8968043]
[6]   Fast and Incremental Method for Loop-Closure Detection Using Bags of Visual Words [J].
Angeli, Adrien ;
Filliat, David ;
Doncieux, Stephane ;
Meyer, Jean-Arcady .
IEEE TRANSACTIONS ON ROBOTICS, 2008, 24 (05) :1027-1037
[7]  
[Anonymous], 1999, MODERN INFORM RETRIE
[8]  
Arroyo R, 2014, IEEE INT C INT ROBOT, P3089, DOI 10.1109/IROS.2014.6942989
[9]  
Badino H, 2012, IEEE INT CONF ROBOT, P1635, DOI 10.1109/ICRA.2012.6224716
[10]   Unsupervised semantic clustering and localization for mobile robotics tasks [J].
Balaska, Vasiliki ;
Bampis, Loukas ;
Boudourides, Moses ;
Gasteratos, Antonios .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2020, 131