Skip to Main content Skip to Navigation
New interface
Conference papers

Scalability of the NV-tree: Three Experiments

Abstract : The NV-tree is a scalable approximate high-dimensional indexing method specifically designed for large-scale visual instance search. In this paper, we report on three experiments designed to evaluate the performance of the NV-tree. Two of these experiments embed standard benchmarks within collections of up to 28.5 billion features, representing the largest single-server collection ever reported in the literature. The results show that indeed the NV-tree performs very well for visual instance search applications over large-scale collections.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Laurent Amsaleg Connect in order to contact the contributor
Submitted on : Wednesday, July 18, 2018 - 2:17:41 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM
Long-term archiving on: : Friday, October 19, 2018 - 5:15:10 PM


Files produced by the author(s)


  • HAL Id : hal-01843046, version 1


Laurent Amsaleg, Björn Þór Jónsson, Herwig Lejsek. Scalability of the NV-tree: Three Experiments. SISAP 2018 - 11th International Conference on Similarity Search and Applications, Oct 2018, Lima, Peru. pp.1-14. ⟨hal-01843046⟩



Record views


Files downloads