Space-Filling Curve for Image Dynamical Indexing
In image retrieval, high-dimensional features lead often to good results, however, their uses in indexing and searching are time-consuming. The space-filling curve that reduces the number of dimensions to one while preserving the neighborhood relation can be used in this context. A new fast technique for image indexing is developed which enables rapid insertions of new images without changing existing data. The retrieving is accelerated by avoiding the distance computing because images are ordered on 1-D data structure. Hilbert curve, the most neighborhood preserving space-filling curve, is used in the experimentation. A proposal of fast mapping facilitates the computing of 1-D Hilbert indexes from high dimensional features.
- 3.Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS ’89, pp 247–252. ACM, New York (1989)Google Scholar
- 7.Moon, B., Jagadish, H., Faloutsos, C., Saltz, J.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowl. Data Eng. 13(1), 124–141 (2001)Google Scholar
- 8.Morton, G.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. IBM, Ottawa (1966)Google Scholar
- 10.Sagan, H.: Space-Filling Curves, vol. 2. Springer, New York (1994)Google Scholar
- 11.Smith, J., Chang, S.: Tools and techniques for color image retrieval. Storage Retr. Image Video Databases IV 2670, 426–437 (1996)Google Scholar