文件名称:Ichange
介绍说明－－下载内容均来自于网络，请自行研究使用
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-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
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-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Using Hilbert curve in image storing and retrieving.pdf