International audienceA new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approach relies on the construction of a new sparse vector designed to approximate the normalized inner-product between underlying signal vectors. The resulting ANN search algorithm shows significant improvement compared to querying with the original sparse vectors. The system makes use of a proposed transform that succeeds in uniformly distributing the input dataset on the unit sphere while preserving relative angular distances
Representative data in terms of a set of selected samples is of interest for various machine learnin...
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
In order to improve efficiency in Approximate Near-est Neighbor (ANN) search, we exploit the structu...
International audienceA new method is introduced that makes use of sparse image representations to s...
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...
Fast and approximate nearest-neighbor search methods have recently become popular for scaling nonpar...
Increasing sizes of databases and data stores mean that the traditional tasks, such as locating a ne...
Abstract — This paper introduces a product quantization based approach for approximate nearest neigh...
International audienceThe problem of finding nearest neighbours in terms of Euclidean distance, Hamm...
Representing data as a linear combination of a set of selected known samples is of interest for vari...
This paper addresses the problem of Approximate Nearest Neighbor (ANN) search in pattern recognition...
© 2014 Elsevier Ltd. All rights reserved. Representing data as a linear combination of a set of sele...
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications f...
In this paper, we propose a novel scheme for approximate nearest neighbor (ANN) retrieval based on d...
Representative data in terms of a set of selected samples is of interest for various machine learnin...
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
In order to improve efficiency in Approximate Near-est Neighbor (ANN) search, we exploit the structu...
International audienceA new method is introduced that makes use of sparse image representations to s...
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...
Fast and approximate nearest-neighbor search methods have recently become popular for scaling nonpar...
Increasing sizes of databases and data stores mean that the traditional tasks, such as locating a ne...
Abstract — This paper introduces a product quantization based approach for approximate nearest neigh...
International audienceThe problem of finding nearest neighbours in terms of Euclidean distance, Hamm...
Representing data as a linear combination of a set of selected known samples is of interest for vari...
This paper addresses the problem of Approximate Nearest Neighbor (ANN) search in pattern recognition...
© 2014 Elsevier Ltd. All rights reserved. Representing data as a linear combination of a set of sele...
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications f...
In this paper, we propose a novel scheme for approximate nearest neighbor (ANN) retrieval based on d...
Representative data in terms of a set of selected samples is of interest for various machine learnin...
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
In order to improve efficiency in Approximate Near-est Neighbor (ANN) search, we exploit the structu...