Searching for nearest neighbors with a dense space partitioning
Lists
Only you see this
Abstract
Product quantization based approximate nearest neighbor search with the use of inverted index structures have recently received increasing attention. In this paper, we propose a new inverted index structure for searching nearest neighbors in very large datasets of high dimensional data. For data indexing, our proposed method creates a dense space partitioning using multiple centroids based assigning, which generates shorter candidate lists and improves the search speed. Our experiments with a dataset of one billion SIFT features show that while achieving higher accuracy, our method demonstrates better performances on search speed compared to IV-FADC, the conventional product quantization based inverted index structure.
BibTeX
@inproceedings{nguyen2015searching,
author = {Tuan Anh Nguyen and Yusuke Matsui and Toshihiko Yamasaki and Kiyoharu Aizawa},
title = {{Searching for nearest neighbors with a dense space partitioning}},
booktitle = {ICIP},
year = {2015},
doi = {10.1109/icip.2015.7351650},
}Loading related content...