Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: In UC, several lossless coding tools such as dictionary-entropy coders, run-length encoding (RLE), Hextile, and a few filters used in portable network graphics format are united into H.264 like intraframe hybrid video coding.
Abstract: This paper proposes a compound image coding method named united coding (UC). In UC, several lossless coding tools such as dictionary-entropy coders, run-length encoding (RLE), Hextile, and a few filters used in portable network graphics (PNG) format are united into H.264 like intraframe hybrid video coding. The basic coding unit (BCU) has a size typically between 16?×?16 pixels to 64?×?64 pixels. All coders in UC are used to code each BCU. Then, the lossless coder that generates minimum bit-rate (R) is chosen as the optimal lossless coder. Finally, the final optimal coder is chosen from the lossy intraframe hybrid coder and the optimal lossless coder using R-D cost based optimization criterion. Moreover, the data coded by one lossless coder can be used as the dictionary of other lossless coders. Experimental results demonstrate that compared with H.264, UC achieves up to 20 dB PSNR improvement and better visual picture quality for compound images with mixed text, graphics and natural picture. Compared with lossless coders such as gzip and PNG, UC can achieve 2---5 times higher compression ratio with just a minor loss and keep partial-lossless picture quality. The partial-lossless nature of UC is indispensable for some typical applications, such as cloud computing and rendering, cloudlet-screen computing and remote desktop, where lossless coding of partial image regions is demanded. On the other hand, the implementation complexity and cost increment of UC is moderate, typically less than 25 % of a traditional hybrid coder such as H.264.
16 citations
07 Nov 2002
TL;DR: The compression performance of JPEG which has been encrypted with the zig-zag permutation algorithm is evaluated, a security enhancement to the scheme is suggested, and an alternative to entropy coding recommended by JPEG is proposed to compensate for the compression drop occurring due to permutation.
Abstract: Recent development in the Internet and Web based technologies require faster communication of multimedia data in a secure form. A number of encryption schemes for MPEG have been proposed. In this paper, we evaluate the compression performance of JPEG which has been encrypted with the zig-zag permutation algorithm, suggest a security enhancement to the scheme, and propose an alternative to entropy coding recommended by JPEG to compensate for the compression drop occurring due to permutation.
16 citations
29 Mar 1994
TL;DR: The authors present experimental results demonstrating that the customized JPEG encoder offers a significant performance advantage over a coder that uses the default quantization and Huffman tables.
Abstract: Describes a procedure by which JPEG compression may be customized for grayscale images that are to be compressed, halftoned, and printed. The technique maintains 100% compatibility with the JPEG standard, and is applicable with any halftoning algorithm. The JPEG quantization table is designed using frequency-domain characteristics of the halftoning patterns and the human visual system, and the Huffman tables are optimized for low-rate coding. The authors present experimental results demonstrating that the customized JPEG encoder offers a significant performance advantage over a coder that uses the default quantization and Huffman tables. The results also show that the customized encoder typically achieves rates in the range 0.13-0.25 bits per pixel (image dependent) with practically no visible compression artifacts in the printed images. >
16 citations
17 Jun 2013
TL;DR: Compared to the state-of-the-art methods the proposed JPEG anti-forensic method is able to achieve a higher image visual quality while being undetectable under existing detectors.
Abstract: This paper proposes an anti-forensic method that disguises the footprints left by JPEG compression, whose objective is to fool existing JPEG forensic detectors while keeping a high visual quality of the processed image. First we examine the reliability of existing detectors and point out the potential vulnerability of the quantization table estimation based detector. Then we construct a new, non-parametric method to DCT histogram smoothing without any histogram statistical model. Finally JPEG forensic detectors are fooled by optimizing an objective function considering both the anti-forensic terms and a natural image statistical model. We show that compared to the state-of-the-art methods the proposed JPEG anti-forensic method is able to achieve a higher image visual quality while being undetectable under existing detectors.
16 citations
01 Aug 1994
TL;DR: In this article, the authors present scalable compression algorithms for image browsing using the progressive and hierarchical modes in the JPEG standard, which are referred to as SNR and spatial scalability, respectively.
Abstract: We present scalable compression algorithms for image browsing. Recently, the International Standards Organization (ISO) has proposed the JPEG standard for still image compression. JPEG standard not only provides the basic feature of compression (baseline algorithm) but also provides the framework for reconstructing images in different picture qualities and sizes. These features are referred to as SNR and spatial scalability, respectively. SNR scalability and spatial scalability can be implemented using the progressive and hierarchical modes in the JPEG standard. In this paper, we implement and investigate the performance of the progressive and hierarchical coding modes of the JPEG standard and compare their performance with the baseline algorithm. >
16 citations