Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices
원문 초록
In this paper, we present an experimental comparison of various graph-based approximate nearest neighbor (ANN) search algorithms deployed on edge devices for real-time nearest neighbor search applications, such as smart city infrastructure and autonomous vehicles. To the best of our knowledge, this specific comparative analysis has not been previously conducted. While existing research has explored graph-based ANN algorithms, it has often been limited to single-threaded implementations on standard commodity hardware. Our study leverages the full computational and storage capabilities of edge devices, incorporating additional metrics such as insertion and deletion latency of new vectors and power consumption. This comprehensive evaluation aims to provide valuable insights into the performance and suitability of these algorithms for edge-based real-time tracking systems enhanced by nearest-neighbor search algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Survey on Vision-Language-Action Models for Autonomous Driving
Where, What, Why: Towards Explainable Driver Attention Prediction
Iterative Camera-LiDAR Extrinsic Optimization via Surrogate Diffusion
Foundation Models in Autonomous Driving: A Survey on Scenario Generation and Scenario Analysis
SDTagNet: Leveraging Text-Annotated Navigation Maps for Online HD Map Construction
STSBench: A Spatio-temporal Scenario Benchmark for Multi-modal Large Language Models in Autonomous Driving
토론
이 논문과 연결된 포럼 글이 아직 없습니다.