High-dimensional descriptor indexing for large multimedia databases
Proceedings of the 17th ACM conference on Information and knowledge management
Extensions of the k Nearest Neighbour methods for classification problems
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
| Hi-index | 0.01 |
In this work, a fast approximate nearest neighbour search algorithm using single Space-filling Curve (SPFC) Mapping and a set of synthetic prototype representations is presented. The results are comparable to a multiplespacefilling scheme, but achieving a much faster execution time, since computing multiple transformations and SPFC Mapping's is avoided, at the expense of having a more densely populated one-dimensional representation of the data-set. The advantages and limitations of the model are discussed, and an experimental evaluation with synthetic data and with a large, real high-dimensional optical character recognition data-set is presented.