Javascript must be enabled to continue!
Compact data structures for raster data.
View through CrossRef
A raster model consists of a matrix of cells in which each cell contains a value that represents information. A raster time series is an ordered collection of independent rasters. Raster and raster time series models have been applied in different domains, such as terrain altitude, temperature, atmospheric pressure, images, etc. Usually, the raster time series represents the raster data changes over time.
The main attribute of those models is the data locality. Data locality indicates that con tiguous cells (spatially or temporally) contain similar values. Compression data exploits this characteristic. Besides, compact data structures allow the data to be compacted and respond to different queries without descompacting. Compact data structures have been used to rep resent raster data and raster time series, but it is possible to improve the efficiency of these structures.
The work on this thesis focuses on improving the raster and raster time series compres sion. The thesis introduces an algorithm for constructing the Heuristic T-k2-raster that in tegrates a dynamic-programming approach, and proposes a new compact data structure for raster time series, the ZT-k2-raster, based on the k2-raster model. Additionally, alternative heuristic construction algorithms that incorporate clustering techniques have been developed to exploit temporal patterns better. The work also includes the implementation of a massively parallel k2-raster construction algorithm for GPGPU architectures, together with a comprehen sive experimental evaluation of all proposed methods and their performance.
The experimental results confirm that these strategies improve compression and represen tation under specific conditions. The dynamic-programming approach consistently outperforms the baseline heuristic on synthetic datasets with high temporal and low spatial locality. In con trast, the clustering-based heuristics provide clear advantages for datasets with cyclic temporal patterns. The analysis of compressibility measures reveals a strong positive correlation with raster size and a strong negative correlation with spatial locality. Furthermore, a new alphabet sensitive 2D compressibility measure is introduced to better characterize raster compressibility. Finally, ZT-k2-raster achieves a competitive space–time trade-off for representing raster time series, and the parallel implementation demonstrates substantial acceleration during the con struction phase.
Title: Compact data structures for raster data.
Description:
A raster model consists of a matrix of cells in which each cell contains a value that represents information.
A raster time series is an ordered collection of independent rasters.
Raster and raster time series models have been applied in different domains, such as terrain altitude, temperature, atmospheric pressure, images, etc.
Usually, the raster time series represents the raster data changes over time.
The main attribute of those models is the data locality.
Data locality indicates that con tiguous cells (spatially or temporally) contain similar values.
Compression data exploits this characteristic.
Besides, compact data structures allow the data to be compacted and respond to different queries without descompacting.
Compact data structures have been used to rep resent raster data and raster time series, but it is possible to improve the efficiency of these structures.
The work on this thesis focuses on improving the raster and raster time series compres sion.
The thesis introduces an algorithm for constructing the Heuristic T-k2-raster that in tegrates a dynamic-programming approach, and proposes a new compact data structure for raster time series, the ZT-k2-raster, based on the k2-raster model.
Additionally, alternative heuristic construction algorithms that incorporate clustering techniques have been developed to exploit temporal patterns better.
The work also includes the implementation of a massively parallel k2-raster construction algorithm for GPGPU architectures, together with a comprehen sive experimental evaluation of all proposed methods and their performance.
The experimental results confirm that these strategies improve compression and represen tation under specific conditions.
The dynamic-programming approach consistently outperforms the baseline heuristic on synthetic datasets with high temporal and low spatial locality.
In con trast, the clustering-based heuristics provide clear advantages for datasets with cyclic temporal patterns.
The analysis of compressibility measures reveals a strong positive correlation with raster size and a strong negative correlation with spatial locality.
Furthermore, a new alphabet sensitive 2D compressibility measure is introduced to better characterize raster compressibility.
Finally, ZT-k2-raster achieves a competitive space–time trade-off for representing raster time series, and the parallel implementation demonstrates substantial acceleration during the con struction phase.
Related Results
The Effects of Land Use and Land Cover Geoinformation Raster Generalization in the Analysis of LUCC in Portugal
The Effects of Land Use and Land Cover Geoinformation Raster Generalization in the Analysis of LUCC in Portugal
Multiple land use and land cover (LUC) datasets are available for the analysis of LUC changes (LUCC) in distinct territories. Sometimes, different LUCC results are produced to char...
Raster Angle Prediction of Additive Manufacturing Process Using Machine Learning Algorithm
Raster Angle Prediction of Additive Manufacturing Process Using Machine Learning Algorithm
As additive manufacturing (AM) processes become integrated with artificial intelligence systems, the time and cost of the fabrication process decrease. In this study, the raster an...
Dotted Raster-Stereography
Dotted Raster-Stereography
Raster-stereography is a 3D surface topography technique, which provide height and curvature information of the subject. This is a non-contact, non-invasive and radiation free tech...
Kajian Penerapan Konsep Compact City di Kecamatan Cilandak, Jakarta Selatan
Kajian Penerapan Konsep Compact City di Kecamatan Cilandak, Jakarta Selatan
Abstract. Cilandak is one of the districts that connects several cities with the Special Capital Region of Jakarta. This makes Cilandak District have a development that refers to T...
Fracture phases of the CT specimens printed in PLA according to the raster width
Fracture phases of the CT specimens printed in PLA according to the raster width
AbstractThis article investigates the impact of raster width on crack propagation resistance in structures manufactured using the FDM (Fused Deposition Modeling) additive manufactu...
The Entropy of Co-Compact Open Covers
The Entropy of Co-Compact Open Covers
Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space (compactness and metrizability are not necessarily r...
TAAT Technology toolkits and their strategic deployment: <i>TAAT Clearinghouse technical report series 001</i>
TAAT Technology toolkits and their strategic deployment: <i>TAAT Clearinghouse technical report series 001</i>
The African Development Bank recently launched Feed Africa: A Strategy for Agricultural Transformation in Africa. This loan program is intended to unlock Africa’s agricultural pote...
Development of a Compact Topside Processing Facility
Development of a Compact Topside Processing Facility
Abstract
Compact separation technologies have been gradually introduced into topside facilities during the last decade. Deployments have typically been motivated ...

