A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
KPYR: An Efficient Indexing Method
2005 IEEE International Conference on Multimedia and Expo
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 subspaces 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. 0-7803-9332
doi:10.1109/icme.2005.1521704
dblp:conf/icmcs/UrrutyBD05
fatcat:cd37j3vhsjbbhjlzf2eb6czkqu