Loop closure detection with patch-level local features and visual saliency prediction

被引:7
|
作者
Jin, Sheng [1 ]
Dai, Xuyang [1 ]
Meng, Qinghao [1 ]
机构
[1] Tianjin Univ, Inst Robot & Autonomous Syst, Sch Elect & Informat Engn, Tianjin 300072, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Loop closure detection; Visual saliency; Patch-level local feature; Scene parsing; PLACE RECOGNITION; IMAGE FEATURES; LOCALIZATION; KERNELS; VISION; BAGS;
D O I
10.1016/j.engappai.2023.105902
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Loop closure detection (LCD) is essential in the field of visual Simultaneous Localization and Mapping (vSLAM). In the LCD system, geometrical verification based on image matching plays a crucial role in avoiding erroneous detections. This paper focuses on adopting patch-level local features for image matching to compute the similarity score between the current query image and the candidate images. However, an important factor that may reduce the robustness is that some distracting and dynamic regions in a scene (e.g., the sky, cars, pedestrians, the ground, etc.) are not helpful and may seriously harm the performance. To address this challenge, we first use a newly designed patch descriptor loss to optimize the distance relationship between the patch-level local features. In this way, the patch-level local features extracted from the query/candidate images are more suitable for performing image matching. Moreover, we mimic the visual attention mechanism and propose a patch matching with saliency strategy, which enables local patches in salient regions to play crucial roles in image matching by assigning suitable weights to them. Finally, experiments on several public datasets demonstrate that the proposed LCD system can achieve encouraging improvements over the state-of-the-art approaches regarding recall rates under 100% precision.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Hierarchical loop closure detection with weighted local patch features and global descriptorsHierarchical loop closure detection with weighted local patch features and global descriptorsRen et al.
    Mingrong Ren
    Xiurui Zhang
    Bin Liu
    Yuehui Zhu
    Applied Intelligence, 2025, 55 (4)
  • [2] Contour Detection from Deep Patch-level Boundary Prediction
    Chua, Teck Wee
    Shen, Li
    2017 IEEE 2ND INTERNATIONAL CONFERENCE ON SIGNAL AND IMAGE PROCESSING (ICSIP), 2017, : 5 - 9
  • [3] Hierarchical loop closure detection with weighted local patch features and global descriptors
    Ren, Mingrong
    Zhang, Xiurui
    Liu, Bin
    Zhu, Yuehui
    APPLIED INTELLIGENCE, 2025, 55 (04)
  • [4] Detection of Face Morphing Attacks Based on Patch-Level Features and Lightweight Networks
    Long, Min
    Zhao, Xuan
    Zhang, Le-Bing
    Peng, Fei
    SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
  • [5] Explainable patch-level histopathology tissue type detection with bag-of-local-features models and data augmentation
    Galiger, Gergo
    Bodo, Zalan
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2023, 15 (01) : 60 - 80
  • [6] Patch-Level Unsupervised Planetary Change Detection
    Saha, Sudipan
    Zhu, Xiao Xiang
    IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2022, 19
  • [7] Visual Estimation of Building Condition with Patch-level ConvNets
    Koch, David
    Despotovic, Miroslav
    Sakeena, Muntaha
    Doeller, Mario
    Zeppelzauer, Matthias
    RETECH'18: PROCEEDINGS OF THE 2018 ACM WORKSHOP ON MULTIMEDIA FOR REAL ESTATE TECH, 2018, : 12 - 17
  • [8] Robust Visual Loop Closure Detection with Repetitive Features
    Lee, Seongwon
    Jo, HyungGi
    Cho, Hae Min
    Kim, Euntai
    2018 15TH INTERNATIONAL CONFERENCE ON UBIQUITOUS ROBOTS (UR), 2018, : 891 - 895
  • [9] Improving ViT interpretability with patch-level mask prediction
    Kang, Junyong
    Heo, Byeongho
    Choe, Junsuk
    PATTERN RECOGNITION LETTERS, 2025, 187 : 73 - 79
  • [10] Active Contour Integrating Patch-Level and Pixel-Level Features
    Mao, Xinyue
    Chen, Yufei
    Liu, Xianhui
    Zhao, Weidong
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2017, PT I, 2017, 10361 : 353 - 365