International audienceIn this paper we address the subject of large multimedia database indexing for content-based retrieval.We introduce multicurves, a new scheme for indexing high-dimensional descriptors. This technique, based on the simultaneous use of moderate-dimensional space-filling curves, has as main advantages the ability to handle high-dimensional data (100 dimensions and over), to allow the easy maintenance of the indexes (inclusion and deletion of data), and to adapt well to secondary storage, thus providing scalability to huge databases (millions, or even thousands of millions of descriptors).We use multicurves to perform the approximate k nearest neighbors search with a very good compromise between precision and speed. The ev...
Abstract. The optimized distance-based access methods currently available for multidimensional index...
International audienceThis paper introduces a group testing framework for detecting large similariti...
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due...
During the last decade, multimedia databases have become increasingly important in many application ...
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do ...
This manuscript gives an overview of several years ofresearch aiming at inventing and evaluating sys...
International audienceIn this paper, we propose and evaluate a method for optimizing descriptors use...
This paper presents a k-means based algorithm for approximate nearest neighbor search. The proposed ...
AbstractA suitable indexing scheme for multimedia information retrieval is the need of the hour and ...
A survey of technologies and algorithms for parsing and indexing multimedia databases. Conventional ...
Many new applications, such as multimedia databases, employ the so-called feature transformation whi...
International audienceMost existing content-based image retrieval systems built above a very large d...
Many indexing approaches for high–dimensional data points have evolved into very complex and hard to...
Current multimedia applications require efficient tools for modeling and search. While solid models ...
One of the challenges in the development of an image retrieval system is to achieve an efficient ind...
Abstract. The optimized distance-based access methods currently available for multidimensional index...
International audienceThis paper introduces a group testing framework for detecting large similariti...
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due...
During the last decade, multimedia databases have become increasingly important in many application ...
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do ...
This manuscript gives an overview of several years ofresearch aiming at inventing and evaluating sys...
International audienceIn this paper, we propose and evaluate a method for optimizing descriptors use...
This paper presents a k-means based algorithm for approximate nearest neighbor search. The proposed ...
AbstractA suitable indexing scheme for multimedia information retrieval is the need of the hour and ...
A survey of technologies and algorithms for parsing and indexing multimedia databases. Conventional ...
Many new applications, such as multimedia databases, employ the so-called feature transformation whi...
International audienceMost existing content-based image retrieval systems built above a very large d...
Many indexing approaches for high–dimensional data points have evolved into very complex and hard to...
Current multimedia applications require efficient tools for modeling and search. While solid models ...
One of the challenges in the development of an image retrieval system is to achieve an efficient ind...
Abstract. The optimized distance-based access methods currently available for multidimensional index...
International audienceThis paper introduces a group testing framework for detecting large similariti...
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due...