文件名称:Ichange
-
所属分类：
- 标签属性：
- 上传时间：2015-08-20
-
文件大小：453.05kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
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
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.