Re-localization acceleration with Medoid Silhouette Clustering
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929442693054464 |
|---|---|
| author | Zhang, Hongyi Mayol-Cuevas, Walterio |
| author_facet | Zhang, Hongyi Mayol-Cuevas, Walterio |
| contents | Two crucial performance criteria for the deployment of visual localization are speed and accuracy. Current research on visual localization with neural networks is limited to examining methods for enhancing the accuracy of networks across various datasets. How to expedite the re-localization process within deep neural network architectures still needs further investigation. In this paper, we present a novel approach for accelerating visual re-localization in practice. A tree-like search strategy, built on the keyframes extracted by a visual clustering algorithm, is designed for matching acceleration. Our method has been validated on two tasks across three public datasets, allowing for 50 up to 90 percent time saving over the baseline while not reducing location accuracy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_20749 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Re-localization acceleration with Medoid Silhouette Clustering Zhang, Hongyi Mayol-Cuevas, Walterio Computer Vision and Pattern Recognition Two crucial performance criteria for the deployment of visual localization are speed and accuracy. Current research on visual localization with neural networks is limited to examining methods for enhancing the accuracy of networks across various datasets. How to expedite the re-localization process within deep neural network architectures still needs further investigation. In this paper, we present a novel approach for accelerating visual re-localization in practice. A tree-like search strategy, built on the keyframes extracted by a visual clustering algorithm, is designed for matching acceleration. Our method has been validated on two tasks across three public datasets, allowing for 50 up to 90 percent time saving over the baseline while not reducing location accuracy. |
| title | Re-localization acceleration with Medoid Silhouette Clustering |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2407.20749 |