Optimizing Domain-Specific Image Retrieval: A Benchmark of FAISS and Annoy with Fine-Tuned Features
Not on the map. Why?
Abstract (arXiv)
Approximate Nearest Neighbor search is one of the keys to high-scale data retrieval performance in many applications. The work is a bridge between feature extraction and ANN indexing through fine-tuning a ResNet50 model with various ANN methods: FAISS and Annoy. We evaluate the systems with respect to indexing time, memory usage, query time, precision, recall, F1-score, and Recall@5 on a custom image dataset. FAISS's Product Quantization can achieve a precision of 98.40% with low memory usage at 0.24 MB index size, and Annoy is the fastest, with average query times of 0.00015 seconds, at a slight cost to accuracy. These results reveal trade-offs among speed, accuracy, and memory efficiency and offer actionable insights into the optimization of feature-based image retrieval systems. This study will serve as a blueprint for constructing actual retrieval pipelines and be built on fine-tuned deep learning networks and associated ANN methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 36 references that are in the map. First posted on arXiv 2 Dec 2024.
Builds on
13 of 36 references.
References · 13
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 420
- 2024The Faiss librarycited by 370
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
- 2023Survey of Vector Database Management Systemscited by 38
- 2023ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithmscited by 24
- 2018Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Datacited by 20
- 2022Constrained Approximate Similarity Search on Proximity Graphcited by 5
- 2024Curator: Efficient Indexing for Multi-Tenant Vector Databasescited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026GPU-Accelerated ANNS: Quantized for Speed, Built for Change11 Jan 2026