The inverted multi-index

Artem Babenko, Victor Lempitsky

    Результат исследований: Вклад в журналСтатьярецензирование

    103 Цитирования (Scopus)

    Аннотация

    A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes the inverted index idea by replacing the standard quantization within inverted indices with product quantization. For very similar retrieval complexity and pre-processing time, inverted multi-indices achieve a much denser subdivision of the search space compared to inverted indices, while retaining their memory efficiency. Our experiments with large datasets of SIFT and GIST vectors demonstrate that because of the denser subdivision, inverted multi-indices are able to return much shorter candidate lists with higher recall. Augmented with a suitable reranking procedure, multi-indices were able to significantly improve the speed of approximate nearest neighbor search on the dataset of 1 billion SIFT vectors compared to the best previously published systems, while achieving better recall and incurring only few percent of memory overhead.

    Язык оригиналаАнглийский
    Номер статьи6915715
    Страницы (с-по)1247-1260
    Число страниц14
    ЖурналIEEE Transactions on Pattern Analysis and Machine Intelligence
    Том37
    Номер выпуска6
    DOI
    СостояниеОпубликовано - 1 июн. 2015

    Fingerprint

    Подробные сведения о темах исследования «The inverted multi-index». Вместе они формируют уникальный семантический отпечаток (fingerprint).

    Цитировать