Fast and Memory Efficient Graph Optimization via ICM for Visual Place Recognition

被引：0
|
作者：
Schubert, Stefan [1 ]
Neubert, Peer [2 ]
Protzel, Peter [2 ]
机构：
[1] Extensions Based on Structural Information of the Task
[2] Chemnitz University of Technology
来源：
Robotics: Science and Systems | 2021年
关键词：
723.5 Computer Applications - 741.2 Vision - 921.5 Optimization Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Cost functions
引用
收藏
相关论文
共 50 条
  • [1] Fast and Memory Efficient Graph Optimization via ICM for Visual Place Recognition
    Schubert, Stefan
    Neubert, Peer
    Protzel, Peter
    ROBOTICS: SCIENCE AND SYSTEM XVII, 2021,
  • [2] Robust Visual Place Recognition with Graph Kernels
    Stumm, Elena
    Mei, Christopher
    Lacroix, Simon
    Nieto, Juan
    Hutter, Marco
    Siegwart, Roland
    2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, : 4535 - 4544
  • [3] Structured Pruning for Efficient Visual Place Recognition
    Grainge, Oliver
    Milford, Michael
    Bodala, Indu
    Ramchurn, Sarvapali D.
    Ehsan, Shoaib
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2025, 10 (02): : 2024 - 2031
  • [4] How fast is rapid visual recognition memory?
    Besson, G.
    Ceccaldi, M.
    Didic, M.
    Barbeau, E. J.
    PERCEPTION, 2011, 40 : 33 - 34
  • [5] Binary Neural Networks for Memory-Efficient and Effective Visual Place Recognition in Changing Environments
    Ferrarini, Bruno
    Milford, Michael J.
    McDonald-Maier, Klaus D.
    Ehsan, Shoaib
    IEEE TRANSACTIONS ON ROBOTICS, 2022, 38 (04) : 2617 - 2631
  • [6] Graph-Based Non-Linear Least Squares Optimization for Visual Place Recognition in Changing Environments
    Schubert, Stefan
    Neubert, Peer
    Protzel, Peter
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2021, 6 (02) : 811 - 818
  • [7] Efficient Visual Place Recognition by Adaptive CNN Landmark Matching
    Chen, Yutian
    Gan, Wenyan
    Zhu, Yi
    Tian, Hui
    Wang, Cong
    Ma, Wenfeng
    Li, Yunbo
    Wang, Dong
    He, Jixian
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2021, 15 (11): : 4084 - 4104
  • [8] A fast and memory-efficient hierarchical graph clustering algorithm
    Szilágyi, László
    Szilágyi, Sándor Miklós
    Hirsbrunner, Béat
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8834 : 247 - 254
  • [9] Memory-Efficient Adjoints via Graph Partitioning
    Charoenwanit, Ekkapot
    2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [10] A Fast and Memory-Efficient Hierarchical Graph Clustering Algorithm
    Szilagyi, Laszlo
    Szilagyi, Sandor Miklos
    Hirsbrunner, Beat
    NEURAL INFORMATION PROCESSING (ICONIP 2014), PT I, 2014, 8834 : 247 - 254
12345