Description: In this paper, we propose a method to accelerate the speed of subset query on uncompressed images. First, we change
the method to store images the pixels of images are stored on the disk in the Hilbert order instead of row-wise order
that is used in traditional methods. After studying the properties of the Hilbert curve, we give a new algorithm which
greatly reduces the number of data segments in subset query range. Although, we have to retrieve more data than
necessary, because the speed of sequential readings is much faster than the speed of random access readings, it takes
about 10 less elapsed time
To Search:
File list (Check if you may need any files):
Using Hilbert curve in image storing and retrieving.pdf
Download