Learning-Based Dimensionality Reduction for Computing Compact and Effective Local Feature Descriptors

被引:5
作者
Dong, Hao [1 ]
Chen, Xieyuanli [1 ]
Dusmanu, Mihai [2 ]
Larsson, Viktor [3 ]
Pollefeys, Marc [2 ,4 ]
Stachniss, Cyrill [1 ,5 ,6 ]
机构
[1] Univ Bonn, Bonn, Germany
[2] Swiss Fed Inst Technol, Zurich, Switzerland
[3] Lund Univ, Lund, Sweden
[4] Microsoft Res, Redmond, WA USA
[5] Univ Oxford, Dept Engn Sci, Oxford, England
[6] Lamarr Inst Machine Learning & Artificial Intelli, Dortmund, Germany
来源
2023 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA | 2023年
关键词
SELECTION;
D O I
10.1109/ICRA48891.2023.10161381
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A distinctive representation of image patches in form of features is a key component of many computer vision and robotics tasks, such as image matching, image retrieval, and visual localization. State-of-the-art descriptors, from handcrafted descriptors such as SIFT to learned ones such as HardNet, are usually high-dimensional; 128 dimensions or even more. The higher the dimensionality, the larger the memory consumption and computational time for approaches using such descriptors. In this paper, we investigate multi-layer perceptrons (MLPs) to extract low-dimensional but high-quality descriptors. We thoroughly analyze our method in unsupervised, self-supervised, and supervised settings, and evaluate the dimensionality reduction results on four representative descriptors. We consider different applications, including visual localization, patch verification, image matching and retrieval. The experiments show that our lightweight MLPs trained using supervised method achieve better dimensionality reduction than PCA. The lower-dimensional descriptors generated by our approach outperform the original higher-dimensional descriptors in downstream tasks, especially for the hand-crafted ones. The code is available at https://github.com/PRBonn/descriptor-dr.
引用
收藏
页码:6189 / 6195
页数:7
相关论文
共 35 条
[1]  
[Anonymous], 2012, P IEEE C COMP VIS PA
[2]  
Balakrishnama S., 1998, Inst. Signal Inf. Process, V18, P1, DOI 10.1109/IJCNN.2000.861335
[3]  
Balntas V., 2016, Bmvc, V1, P3, DOI DOI 10.5244/C.30.119
[4]   HPatches: A benchmark and evaluation of handcrafted and learned local descriptors [J].
Balntas, Vassileios ;
Lenc, Karel ;
Vedaldi, Andrea ;
Mikolajczyk, Krystian .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :3852-3861
[5]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[6]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[7]   Discriminative Learning of Local Image Descriptors [J].
Brown, Matthew ;
Hua, Gang ;
Winder, Simon .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (01) :43-57
[8]  
Cai H, 2019, IEEE ICC
[9]   BRIEF: Computing a Local Binary Descriptor Very Fast [J].
Calonder, Michael ;
Lepetit, Vincent ;
Oezuysal, Mustafa ;
Trzcinski, Tomasz ;
Strecha, Christoph ;
Fua, Pascal .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (07) :1281-1298
[10]   Deep Clustering for Unsupervised Learning of Visual Features [J].
Caron, Mathilde ;
Bojanowski, Piotr ;
Joulin, Armand ;
Douze, Matthijs .
COMPUTER VISION - ECCV 2018, PT XIV, 2018, 11218 :139-156