A Case-Study of Scoring Schemes for the PvS-Index Herwig Lejsek   View Paper (PDF)   Return to Paper Session III: High-Dimensional Data Analysis and Indexing Abstract Recently we have proposed a new indexing method for high-dimensional data, the PvS-index. It provides fast query processing in constant time and is well suited for doing similarity search in Image Retrieval Systems using local descriptors. It is based on projecting data points onto random lines and uses this information to segment them into appropriately sized buckets, which can be read in just one I/O operation. After this preprocessing step the search queries just three buckets per query descriptor and uses a recent rank aggregation method, OMEDRANK, in order to provide good approximate results for the nearest neighbour problem. We have recently shown that PvS-indexing works well for large collections of real image data. In that work, however, we used a simple scoring scheme and collected few nearest neighbours for each query descriptor. In this study we examine how much the actual number of nearest neighbours, gathered for each local descriptor, in uences the nal query result, when searching a PvS-index. Based on the results we propose two new alternative scoring schemes, which improve the retrieval quality and stabilise the results, making the search less a ected by the actual number of nearest neighbours accumulated. ©2006 Association for Computing Machinery