Data compression (or source coding) is the process of creating binary representations of data which require less storage space than the original data 7; 14; 15]. Lossless compression is used where perfect reproduction is required while lossy compression is used where perfect reproduction is not possible or requires too many bits. Achieving optimal compression with respect to resource constraint...

Frequently, it is observed that the sequence of indexes generated by a vector quantizer (VQ) contains a high degree of correlation, and, therefore, can be further compressed using lossless data compression techniques. In this paper, we address the problem of codebook reordering regarding the compression of the image of VQ indexes by general purpose lossless image coding methods, such as JPEG-LS...

The ISO JPEG Still Image Compression Standard is popularly known for its DCT-based compression technique, but its non-DCT based lossless mode of operation is less well known. Lossless JPEG uses a form of discrete pulse code modulation (DPCM) [3]. That is, a linear combination of a pixel’s left, upper and upper left neighbors is used to predict the pixel’s value, and the difference between the p...

Due to the increasing prevalence of high bit depth and YCbCr 4:4:4 video data, it is desirable to develop a JND-based visually lossless coding technique which can account for high bit depth 4:4:4 data in addition to standard 8-bit precision chroma subsampled data. In this paper, we propose a Coding Block (CB)-level JND-based luma and chroma perceptual quantisation technique for HEVC named Pixel...

Onboard image processing systems for a hyperspectral sensor have been developed in order to maximize image data transmission efficiency for large volume and high speed data downlink capacity. Since more than 100 channels are required for hyperspectral sensors on Earth observation satellites, fast and small-footprint lossless image compression capability is essential for reducing the size and we...

A serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) scheme is amalgamated with a unity-rate precoded Time-Hopping (TH) Pulse Position Modulation (PPM) aided Ultra-Wide Bandwidth (UWB) SpreadSpectrum (SS) impulse radio design. The proposed design is capable of operating at low Signal-to-Noise Ratios (SNR) in Nakagami-m fading channels contaminated by Partial ...

Reduced pyramids, including in particular pyramids without analysis lters are known to produce excellent results when used for lossless signal and image compression. The present paper presents a methodology for the optimal construction of such pyramids by selecting the interpolation synthesis postlters so as to minimize the error variance at each level of the pyramid. This establishes optimally...

This paper proposed an embedded image compression algorithm called Lossless Multi-Partitioning Successive Zero Coder (LMP-SZC) using the integer wavelet transform for progressive image transmission (PIT). By dynamically adjusting the partitions based on the space-frequency domain coefficients, our algorithm can achieve lower complexity and superior coding efficiency as compared with other well-...

A cluster−based lossless compression algorithm for hyperspectral images is presented. Clustering is carried out on the original data according to the vectors spectra, and it is used to set up multiple contexts for predictive lossless coding. Low−order predictions are performed using adaptive Linear Least Squares (LLS) estimations which exploit the additional information provided by clustering. ...

This paper proposes a prediction-based lossless wavelet coder, which is adaptive to the oriention of the wavelet pyramid. We adapt the joint statistical regularities in the wavelet domain to create the predictor adaptively, thus eliminating the need to transmit the predictor and reducing the coding overhead. For simplexity, we adopt a simple adaptive predictor. Numerical results show that our c...