Comparison Between Block-Encoding and Quadtree Compression Methods for Raster Maps
| Autor: | Su Su Hlaing, Mie Mie Khin, Mie Mie Tin, Phyo Phyo Wai, Khin Lay Mon |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Lossless compression
Block code Computer science business.industry ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology computer.file_format Compression method 020204 information systems Compression (functional analysis) 0202 electrical engineering electronic engineering information engineering Quadtree 020201 artificial intelligence & image processing Segmentation Computer vision Artificial intelligence Raster graphics business computer |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9789811308680 |
| DOI: | 10.1007/978-981-13-0869-7_29 |
| Popis: | The compression methods are essential for big data, such as maps, images and large data, because the storage spaces are more required as long as data are being overloading. In this paper, quadtree compression method and block-encoding compression method are compared by their lossless compression results based on the raster maps. Quadtree is a method which is very mature and popular in segmentation and compression area. Block-encoding method is a 2D version of run-length encoding method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|