Efficient Similarity Indexing and Searching in High Dimensions
Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods to the curse of dimensionality. This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. Experiments on both handwritten digits and 3-D shape descriptors have shown the proposed algorithm to be highly effective and efficient in indexing and searching real data sets of several hundred dimensions. We also compare its performance to that of the state-of-the-art locality sensitive hashing algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
Vocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
A Semantic Indexing Structure for Image Retrieval
In large-scale image retrieval, many indexing methods have been proposed to narrow down the searching scope of retrieval. The features extracted from images usually are of high dimensions or unfixed sizes due to the exis…
Image RetrievalRetrievalSemantic SimilaritySemantic Textual SimilarityEfficient Document Indexing Using Pivot Tree
We present a novel method for efficiently searching top-k neighbors for documents represented in high dimensional space of terms based on the cosine similarity. Mostly, documents are stored as bag-of-words tf-idf represe…
RetrievalA Fingerprint Indexing Method Based on Minutia Descriptor and Clustering
In this paper we propose a novel fingerprint indexing approach for speeding up in the fingerprint recognition system. What kind of features are used for indexing and how to employ the extracted features for searching are…
ClusteringScalable high-dimensional indexing and searching with Hadoop
While high-dimensional search-by-similarity techniques reached their maturity and in overall provide good performance, most of them are unable to cope with very large multimedia collections. The 'big data' challenge howe…
Vocal Bursts Intensity PredictionPartial 3D Object Retrieval using Local Binary QUICCI Descriptors and Dissimilarity Tree Indexing
A complete pipeline is presented for accurate and efficient partial 3D object retrieval based on Quick Intersection Count Change Image (QUICCI) binary local descriptors and a novel indexing tree. It is shown how a modifi…
3D Object RetrievalRetrieval