11 October 2000 Linear mapping functions for high-dimensional indexing in image databases
Author Affiliations +
Proceedings Volume 4210, Internet Multimedia Management Systems; (2000) https://doi.org/10.1117/12.403807
Event: Information Technologies 2000, 2000, Boston, MA, United States
The problem of indexing high-dimensional data has received renewed interest because of its necessity in emerging multimedia databases. The limitations of traditional tree-based indexing and the dimensionality curse is well known. We have proposed a hierarchical indexing structure based on linear mapping functions, which is not tree-based, and not necessarily balanced. At each level of the hierarchy, a linear mapping function is used to distribute the data among buckets. The feasibility and the performance of the indexing structure is dependent on finding appropriate mapping functions for any given data set. In this paper we present the approach taken in arriving at a few classes of mapping functions. We have given a heuristic algorithm to determine the choice of the most appropriate mapping function for a given data set. The results of experiments with real life data are presented and they indicate that the proposed indexing structure with linear mapping functions is indeed practical.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Santha Sumanasekara, Santha Sumanasekara, Medahalli V. Ramakrishna, Medahalli V. Ramakrishna, } "Linear mapping functions for high-dimensional indexing in image databases", Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000); doi: 10.1117/12.403807; https://doi.org/10.1117/12.403807


Peano key rediscovery for content-based retrieval of images
Proceedings of SPIE (October 05 1997)
Video indexing based on image and sound
Proceedings of SPIE (October 05 1997)
An edge admission control scheme for multicast
Proceedings of SPIE (February 07 2005)

Back to Top