学習ベースの次元削減によるコンパクトで効果的な局所特徴記述子の計算
Learning-Based Dimensionality Reduction for Computing Compact and Effective Local Feature Descriptors
多層パーセプトロン(MLP)を用いて、SIFTやHardNetなどの高次元局所特徴記述子を低次元化する手法を提案し、PCAより優れた次元削減性能と下流タスクでの性能向上を示した。
著者: Hao Dong, Xieyuanli Chen, Mihai Dusmanu, Viktor Larsson, Marc Pollefeys, Cyrill Stachniss
分類: cs.CV, cs.RO
原文アブストラクト
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 hand-crafted 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 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 will be available at https://github.com/PRBonn/descriptor-dr.
関連論文
- 画像点記述子のための残差学習特徴記述子
