Published Articles >> Table of Contents >> Abstract

2005 IEEE International Conference on Multimedia and Expo   pp. 1448-1451
KPYR: An Efficient Indexing Method
T. Urruty, LIFL-UMR CNRS 8022. Laboratoire d’Informatique Fondamentale de Lille Université de Lille 1, France, urruty@lifl.fr
F. Belkouch
C. Djeraba

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICME.2005.1521704
Send link to a friend

Abstract
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clustering algorithm to partition the data space into sub spaces on which we apply Pyramid Technique [1]. We thus reduce the search space concerned by a query and improve the performances. We show that our approach provides interesting and performing experimental results for both K-Nearest Neighbors and Window queries.
Back to Top Additional Information
Citation:  T. Urruty, F. Belkouch, C. Djeraba, "KPYR: An Efficient Indexing Method," icme, pp. 1448-1451,  2005 IEEE International Conference on Multimedia and Expo,  2005