Résumé en anglais

This article presents a quadtree-based data structure for effective indexing of images. An image is represented by a multi-level feature vector, computed by a recursive decomposition of the image into four quadrants and stored as a full fixed-depth balanced quadtree. A node of the quadtree stores a feature vector of the corre sponding image quadrant. A more general quadtree-based structure called QUIP-tree (QUadtree-based Index f or image retrieval and Pattern search ) is used to index the multi-level feature vectors of the images and their quadrants. A QUIP-tree node is an entry to a set of clusters that groups similar quadrants according to som e pre-defined distances. The QUIP-tree allows a multi-level filtering in content-based image retrieval as well as partial queries on images.