Skip to Main content Skip to Navigation

Euclidean lattices for high dimensional indexing and searching

Loïc Paulevé 1 
1 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : For similarity based searching, multimedia data are represented by one or more numerical vectors: we search the nearest neighbors of the query. Because of the huge number of these data and their high dimension, classical indexing technics are inefficient. The goal of this internship is to study the use of euclidean lattices for database indexing. Lattices have nice properties: they are spatial quantizers, thereby generate a partition of the space and decoding (quantization step) may be done very quickly. Then, we hope to be able to rapidly find a small space region containing data similar to a given query point, without reading all the database.
Document type :
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Thursday, October 2, 2008 - 1:14:48 PM
Last modification on : Wednesday, February 2, 2022 - 3:58:55 PM
Long-term archiving on: : Friday, June 4, 2010 - 12:06:23 PM


Files produced by the author(s)


  • HAL Id : inria-00326262, version 1


Loïc Paulevé. Euclidean lattices for high dimensional indexing and searching. [Research Report] PI 1903, 2008, pp.57. ⟨inria-00326262⟩



Record views


Files downloads