Facebook Instagram Twitter RSS Feed PodBean Back to top on side

QMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression

In: Computing and Informatics, vol. 32, no. 4
J. Kim - K. Kim - D. Oh

Details:

Year, pages: 2013, 678 - 696
Keywords:
Spatial data, spatial-data compression, MBR, RMBR, HMBR, QMBR
About article:
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.
How to cite:
ISO 690:
Kim, J., Kim, K., Oh, D. 2013. QMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression. In Computing and Informatics, vol. 32, no.4, pp. 678-696. 1335-9150.

APA:
Kim, J., Kim, K., Oh, D. (2013). QMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression. Computing and Informatics, 32(4), 678-696. 1335-9150.