With the rapid development of various types of remote sensing platforms and sensors, the type, resolution and data volume of remote sensing data are also growing rapidly. Besides, users' demand for remote sensing ...
详细信息
ISBN:
(纸本)9781538614372
With the rapid development of various types of remote sensing platforms and sensors, the type, resolution and data volume of remote sensing data are also growing rapidly. Besides, users' demand for remote sensing data is also increasingly diversified, shifting from traditional industries to common users or even individual users. Under these external demands, the traditional way, distributing data organized by striping from single-satellite, can no longer meet the new demands for the management of massive remote sensing data in the world. To handle this problem, a new kind of organizing and indexing method for multiple remote sensing data, consisting of the multi-scale grid integer coding (MGIC) in 2D-space and the multi-scale time segment integer coding (MTISIC), was proposed to index temporal and spatial information of multiple remote sensing data, which would be much conducive to manage multi source, multi-scale and multi-temporal massive geo-spatial data and to develop a global, standardized, hierarchical, and shared organization model.
In this paper we detail a new approach for lossless integer compression that can be used to extend and improve several existing dynamic lossless data compression methods. The new methodology, referred to as Delta-Huff...
详细信息
ISBN:
(纸本)9781538648834
In this paper we detail a new approach for lossless integer compression that can be used to extend and improve several existing dynamic lossless data compression methods. The new methodology, referred to as Delta-Huffman, uses the Elias Delta code as a uniquely decodable representation of the infinite alphabet of unbounded integers and utilizes this representation to enable the application of dynamic Huffman coding on the Delta encoded set of integers. The method can be extended to combinations of other integer encoding techniques with additional dynamic symbol coding algorithms.
First presented in 1996, the binary interpolative coding (BIC) technique of Moffat and Stuiver is a highly-effective way of representing streams of integers in a parameter-free manner, especially if there are localize...
详细信息
ISBN:
(纸本)9798400707247
First presented in 1996, the binary interpolative coding (BIC) technique of Moffat and Stuiver is a highly-effective way of representing streams of integers in a parameter-free manner, especially if there are localized clusters of small values. In 2009 Teuhola presented an alternative interpretation of binary interpolative coding that employs a non-recursive structure;and also described tournament coding, a variant that provides better compression in some cases. In this updatewe illustrate an additional benefit arising from Teuhola's interpretation, a reduced sensitivity to block size effects;and also show that further small gains in compression effectiveness can be achieved through the use of localized codes. We provide results in support of these claims based on both synthetic data files and on inputs that reflect typical applications in which binary interpolative coding or tournament coding might be applied.
How to decrease the space consumed by index is a key issue in big data processing. In this paper, a new compression method is proposed to decrease the space consumption of inverted index. First, a lot of redundant int...
详细信息
ISBN:
(纸本)9781479970056
How to decrease the space consumed by index is a key issue in big data processing. In this paper, a new compression method is proposed to decrease the space consumption of inverted index. First, a lot of redundant integers are removed by using the techniques of splitting inverted list, adding tags and making groups. Second, the total number of small integers is increased by using d-gaps in each group. Third, these subsequences are compressed using different codes. At last, all compressed subsequences are combined into a long sequence. Experiment results show that our method decreases the compression ratio and its decoding speed is also fast.
A new method for encoding a sequence of integers, named Binary Adaptive Sequential coding with Return to Bias, is proposed in this paper. It extends the compressing pipeline for chain codes? compression consisting of ...
详细信息
A new method for encoding a sequence of integers, named Binary Adaptive Sequential coding with Return to Bias, is proposed in this paper. It extends the compressing pipeline for chain codes? compression consisting of Burrows Wheeler Transform, Move-To-Front Transform, and Adaptive Arithmetic coding. We also explain when to include the Zero-Run Transform into the above-mentioned pipeline. The Zero-Run Transform generates a sequence of integers corresponding to the number of zero-runs. This sequence is encoded by Golomb coding, Binary Adaptive Sequential coding, and the new Binary Adaptive Sequential coding with Return to Bias. Finally, a comparison is performed with the two state-of-the-art methods. The proposed method achieved similar compression efficiency for the Freeman chain code in eight directions. However, for the chain codes with shorter alphabets (Freeman chain code in four directions, Vertex Chain Code, and Three-OrThogonal chain code), the introduced method outperforms the referenced ones.
Partheno-genetic algorithm(PGA) was introduced to solve the problems of slow and premature convergence in traditional genetic algorithm (GA) during solution. A mathematical model of distribution network planning was e...
详细信息
Partheno-genetic algorithm(PGA) was introduced to solve the problems of slow and premature convergence in traditional genetic algorithm (GA) during solution. A mathematical model of distribution network planning was established aiming at the minimum annual comprehensive cost of the network. PGA was used to eliminate the parental cross operator in conventional GA that seriously damages the network feasibility, adopting the chromosome selecting method combining optimum preservation strategy and pairwise competition, the least maintaining algebra of the best individual as convergence criterion, thus improving local searching efficiency and global optimizing ability of the algorithm and obtaining the optimal solution of the model. The simulation results verify the feasibility and validity of this method.
暂无评论