Lossless JPEG

About: Lossless JPEG is a research topic. Over the lifetime, 2415 publications have been published within this topic receiving 51110 citations. The topic is also known as: Lossless JPEG & .jls.

Burrows-Wheeler based JPEG

Abstract: Recently, the use of the Burrows-Wheeler method for data compression has been expanded. A method of enhancing the compression efficiency of the common JPEG standard is presented in this paper, exploiting the Burrows-Wheeler compression technique. The paper suggests a replacement of the traditional Huffman compression used by JPEG by the Burrows-Wheeler compression. When using high quality images, this replacement will yield a better compression ratio. If the image is synthetic, even a poor quality image can be compressed better.

Objective Performance Evaluation of the HEVC Main Still Picture Profile

Abstract: The first version of the High Efficiency Video Coding (HEVC) standard was approved by both ITU-T and ISO/IEC in 2013 and includes three profiles: Main and Main 10 for typical video data with 8 and 10 bits, respectively, as well as a profile referred to as Main Still Picture (MSP) profile. Apparently, the MSP profile extends the HEVC application space toward still images which, in turn, brings up the question of how this HEVC profile performs relative to existing still image coding technologies. This paper aims at addressing this question from a coding-efficiency point-of-view by presenting a rate-distortion performance analysis of the HEVC MSP profile in comparison to other popular still image and video compression schemes, including JPEG, JPEG 2000, JPEG XR, H.264/MPEG-4 AVC, VP8, VP9, and WebP. In summary, it can be stated that the HEVC MSP profile provides average bit-rate savings in the range from 10% to 44% relative to the whole set of competing video and still image compression schemes when averaged over a representative test set of photographic still images. Compared with Baseline JPEG alone, the average bit-rate saving for the HEVC MSP profile is 44%.

Fast and robust watermarking of JPEG files

Abstract: In this paper, we present a fast watermarking method that applies to JPEG images. JPEG is a standard image format supported by virtually all available image software applications. Our method manipulates the quantized DCT coefficients directly and can be implemented in real time. We use texture masking to embed a stronger watermark signal in certain texture areas. Watermark robustness to JPEG compression, additive Gaussian noise and image cropping attacks is studied with the proposed system. The relationship between watermark robustness and watermark position is also studied. A description of the method is included and results are presented along with a discussion of possible improvements.

On the design of a novel JPEG quantization table for improved feature detection performance

Abstract: Keypoint or interest point detection is the first step in many computer vision algorithms. The detection performance of the state-of-the-art detectors is, however, strongly influenced by compression artifacts, especially at low bit rates. In this paper, we design a novel quantization table for the widely-used JPEG compression standard which leads to improved feature detection performance. After analyzing several popular scale-space based detectors, we propose a novel quantization table which is based on the observed impact of scale-space processing on the DCT basis functions. Experimental results show that the novel quantization table outperforms the JPEG default quantization table in terms of feature repeatability, number of correspondences, matching score, and number of correct matches.

Improved decoder for transform coding with application to the JPEG baseline system

Abstract: Transform coding, a simple yet efficient image coding technique, has been adopted by the Joint Photographic Experts Group (JPEG) as the basis for an emerging coding standard for compression of still images. However, for any given transform encoder, the conventional inverse transform decoder is suboptimal. Better performance can be obtained by a nonlinear interpolative decoder that performs table lookups to reconstruct the image blocks from the code indexes. Each received code index of an image block addresses a particular codebook to fetch a component vector. The image block can be reconstructed as the sum of the component vectors for that block. An iterative algorithm for designing a set of locally optimal codebooks is developed. Computer simulation results demonstrate that this improved decoding technique can be applied in the JPEG baseline system to decode enhanced quality pictures from the bit stream generated by the standard encoding scheme. >