Share Email Print

Proceedings Paper

Linear mapping functions for high-dimensional indexing in image databases
Author(s): Santha Sumanasekara; Medahalli V. Ramakrishna
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 11 October 2000
PDF: 10 pages
Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000); doi: 10.1117/12.403807
Show Author Affiliations
Santha Sumanasekara, RMIT Univ. (Australia)
Medahalli V. Ramakrishna, Monash Univ. (Australia)

Published in SPIE Proceedings Vol. 4210:
Internet Multimedia Management Systems
John R. Smith; Chinh Le; Sethuraman Panchanathan; C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?