The implementation and performance of compressed databases
ACM SIGMOD Record
Lossless Compression of Pre-press Images Using a Novel Colour Decorrelation Technique
ICIAP '97 Proceedings of the 9th International Conference on Image Analysis and Processing-Volume II
LOCO-I: a low complexity, context-based, lossless image compression algorithm
DCC '96 Proceedings of the Conference on Data Compression
An asymmetric lossless image compression technique
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Glicbawls?? Grey Level Image Compression by Adaptive Weighted Least Squares
DCC '01 Proceedings of the Data Compression Conference
General-purpose simd within a register: parallel processing on consumer microprocessors
General-purpose simd within a register: parallel processing on consumer microprocessors
Super-Scalar RAM-CPU Cache Compression
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Software—Practice & Experience
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Floating-point buffer compression in a unified codec architecture
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
FPC: A High-Speed Compressor for Double-Precision Floating-Point Data
IEEE Transactions on Computers
SIMD-scan: ultra fast in-memory table scan using on-chip vector processing units
Proceedings of the VLDB Endowment
Index compression using 64-bit words
Software—Practice & Experience
Fast integer compression using SIMD instructions
Proceedings of the Sixth International Workshop on Data Management on New Hardware
Optimal prefix codes for sources with two-sided geometric distributions
IEEE Transactions on Information Theory
An analysis of some common scanning techniques for lossless image coding
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
This report introduces a new lossless asymmetric single instruction multiple data codec designed for extremely efficient decompression of large satellite images. A throughput in excess of 3GB/s allows decompression to proceed in parallel with asynchronous transfers from fast block devices such as disk arrays. This is made possible by a simple and fast single instruction multiple data entropy coder that removes leading null bits. Our main contribution is a new approach for vectorized prediction and encoding. Unlike previous approaches that treat the entropy coder as a black box, we account for its properties in the design of the predictor. The resulting compressed stream is 1.2 to 1.5 times as large as JPEG-2000, but can be decompressed 100 times as quickly – even faster than copying uncompressed data in memory. Applications include streaming decompression for out of core visualization. To the best of our knowledge, this is the first entirely vectorized algorithm for lossless compression. Copyright © 2011 John Wiley & Sons, Ltd.