Using Hilbert curve in image storing and retrieving

Authors:
Zhexuan Song;Nick Roussopoulos
Affiliations:
Department of Computer Science, University of Maryland, College Park, Maryland;Department of Computer Science & Institute For Advanced Computer Studies, University of Maryland, College Park, Maryland
Venue:
MULTIMEDIA '00 Proceedings of the 2000 ACM workshops on Multimedia
Year:
2000

Citing 7
Cited 2

An algorithm for displaying a class of space-filling curves

Software—Practice & Experience
Efficient and effective querying by image content

Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast parallel similarity search in multimedia databases

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Computer Vision

Computer Vision
Query by Visual Example - Content based Image Retrieval

EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Similarity Retrieval on Pictorial Databases Based upon Module Operation

Proceedings of the 3rd International Conference on Database Systems for Advanced Applications (DASFAA)
An Approach to Image Retrieval for Image Databases

DDEXA '93 Proceedings of the 4th International Conference on Database and Expert Systems Applications

A new algorithm for encoding and decoding the Hilbert order

Software—Practice & Experience
Space-filling curves in adaptive curvilinear coordinates for computer numerically controlled five-axis machining

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a method to accelerate the speed of retrieving subset of uncompressed images in a database without using extra disk space. First we change the storing method: pixels of an image are saved in Hilbert order instead of Row-wise order in traditional method. After studying the property of Hilbert curve, we give a new algorithm which greatly reduces the data segment numbers on the disk. Although we have to retrieve more data than necessary, because the speed of sequential readings is much faster than the speed of random readings, our method spends about 10% less elapsed time which is showed in our simulation experiments. In some systems, the saving can be as high as 90%.