Recently, Approximate Nearest Neighbor (ANN) Search has become a very popular approach for similarity search on large-scale datasets. In this paper, we propose a novel vector quantization method for ANN, which introduces a joint multi-layer K-Means clustering solution for determination of the codebooks. The performance of the proposed method is improved further by a joint encoding scheme. Experimental results verify the success of the proposed algorithm as it outperforms the state-of-the-art methods.Scopu
Approximate nearest neighbor (ANN) search is a fundamental problem in computer vision, machine learn...
Nearest neighbor searching is an important geometric subproblem in vector quantization. Existing stu...
Product quantization is an effective vector quantization approach to compactly encode high-dimension...
The technological developments of the last twenty years are leading the world to a new era. The inve...
Approximate Nearest Neighbor (ANN) search has become a popular approach for performing fast and effi...
Increasing sizes of databases and data stores mean that the traditional tasks, such as locating a ne...
Approximate nearest neighbor (ANN) search is fundamental for fast content-based image retrieval. Whi...
We propose an approximate nearest neighbor search method based on quantization. It uses, in particul...
The technological developments of the last twenty years are leading the world to a new era. The inve...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
Abstract — This paper introduces a product quantization based approach for approximate nearest neigh...
We consider approaches for exact similarity search in a high dimensional space of correlated feature...
K-nearest neighbor's classification and regression is broadly utilized as a part of data mining beca...
Approximate nearest neighbor (ANN) search is a fundamental problem in computer vision, machine learn...
Nearest neighbor searching is an important geometric subproblem in vector quantization. Existing stu...
Product quantization is an effective vector quantization approach to compactly encode high-dimension...
The technological developments of the last twenty years are leading the world to a new era. The inve...
Approximate Nearest Neighbor (ANN) search has become a popular approach for performing fast and effi...
Increasing sizes of databases and data stores mean that the traditional tasks, such as locating a ne...
Approximate nearest neighbor (ANN) search is fundamental for fast content-based image retrieval. Whi...
We propose an approximate nearest neighbor search method based on quantization. It uses, in particul...
The technological developments of the last twenty years are leading the world to a new era. The inve...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
International audienceWe propose an approximate nearest neighbor search method based on product quan...
Abstract — This paper introduces a product quantization based approach for approximate nearest neigh...
We consider approaches for exact similarity search in a high dimensional space of correlated feature...
K-nearest neighbor's classification and regression is broadly utilized as a part of data mining beca...
Approximate nearest neighbor (ANN) search is a fundamental problem in computer vision, machine learn...
Nearest neighbor searching is an important geometric subproblem in vector quantization. Existing stu...
Product quantization is an effective vector quantization approach to compactly encode high-dimension...