Abstract
In this paper, we propose QMBRi, the inverse representation of the quantized minimum bounding rectangles (MBRs) scheme, which compresses a minimum bounding rectangle key into one byte for spatial-data compression. QMBRi is a novel spatial-data compression scheme that is based on inverse quantization and overcomes the shortcomings of conventional relative coordination or quantization schemes. If a spatial data is far from the starting point of the search region, the relative coordination scheme does not guarantee compression. In a quantization scheme, since the MBRs are expanded, the overlapping of MBRs is increased and the search performance is reduced. The proposed scheme overcomes these shortcomings, and simulation results suggest that it performs better than other schemes.
Keywords
Cite this article
@article{cai-1944,
author = {Jongwan Kim and Dukshin Oh and Keecheon Kim},
title = {QMBR^i},
journal = {Computing and Informatics},
volume = {32},
number = {4},
pages = {679--696},
year = {2013},
issn = {1335-9150},
url = {https://cai.type.sk/content/2013/4/qmbr-i/}
}
TY - JOUR AU - Jongwan Kim AU - Dukshin Oh AU - Keecheon Kim TI - QMBRi JO - Computing and Informatics VL - 32 IS - 4 SP - 679 EP - 696 PY - 2013 SN - 1335-9150 UR - https://cai.type.sk/content/2013/4/qmbr-i/ KW - Spatial data KW - spatial-data compression KW - MBR KW - RMBR KW - HMBR KW - QMBR ER -
Kim, J., Oh, D., & Kim, K. (2013). QMBRi. Computing and Informatics, 32(4), 679–696. https://cai.type.sk/content/2013/4/qmbr-i/