Efficient JPEG Research Articles

Progressive Histogram Modification for JPEG Reversible Data Hiding

With the development of social network, a large number of private JPEG images are stored in social cloud platform. Correspondingly, the platform embeds user ID or authentication labels to manage these privacy images, preventing them from being arbitrarily accessed or tampered by illegal persons. However, data embedding in JPEG domain inevitably produces irreversible modifications to DCT coefficients, thus resulting in obvious or even serious distortion in the host JPEG images. To address this problem, this paper proposes an efficient JPEG reversible data hiding (RDH) method by constructing progressive two-dimensional histogram mappings. We firstly design distortion function to calculate the cost of each DCT frequency band, and then sort them to build histogram mapping containing a series of coefficient pairs. Subsequently, a progressive mapping mechanism is introduced to maintain most of AC coefficients unchanged. According to the given capacity, this mechanism can adaptively generate an optimum two-dimensional histogram mapping to embed secret messages. Our scheme can achieve an effective balance among embedding capacity, visual quality of the marked image and file size expansion, while keeping high cost-performance complexity. Extensive experiments demonstrate that our method outperforms existing JPEG RDH schemes in terms of visual quality and file size increment of the marked image, and provides an efficient solution for the confidentiality and security access problem of sensitive private image in cloud environment.

Efficient and Effective Blind JPEG Image Improvement With Sequential Feature Processing

Efficient and Effective Blind JPEG Image Improvement With Sequential Feature Processing

EARN: toward efficient and robust JPEG compression artifact reduction

EARN: toward efficient and robust JPEG compression artifact reduction

JPEG Reversible Data Hiding Using Dynamic Distortion Optimizing With Frequency Priority Reassignment

JPEG Reversible data hiding (RDH) aims at correctly extracting hidden data and perfectly recovering the original JPEG image. By combining different frequency selection and block ordering manners, appropriate AC coefficients can be determined to achieve an efficient JPEG RDH scheme using histogram shifting (HS) mechanism. Nevertheless, existing methods only rely on rough frequency band distortion model by involving all DCT blocks, ignoring the dynamic influence of block ordering on embedding block selection. As a result, JPEG image containing hidden data may have an obvious distortion and file size expansion due to an inappropriate frequency band selection. To address the aforementioned problem, we design a new JPEG RDH scheme to optimize distortion model with frequency priority reassignment. Our method firstly orders all DCT blocks by referring to zero AC coefficients of each block. Subsequently, based on the given secret data, only partial ordered blocks are selected to calculate the distortion of each DCT frequency, which can further optimize unit distortion caused by shiftable coefficients. Furthermore, we employ the adjustment parameter to adaptively reassign the priority of each frequency band based on its influence on file size expansion, which can significantly reduce file size expansion of the marked JPEG image. Extensive experiments demonstrate that our method outperforms existing JPEG RDH methods with better visual quality and smaller file size increment of the marked image.

Efficient JPEG Batch Steganography Using Intrinsic Energy of Image Contents

Batch steganography aims at properly allocating a large payload to multiple covers, so as to keep the whole covert communication at a satisfactory level of security. JPEG is currently one of the most widely used formats for image storage and transmission. This paper presents an efficient JPEG batch steganographic scheme, which allocates the payload in a linear manner w.r.t. a new heuristic measure - the intrinsic energy of JPEG image contents, in which more concerns are with the high frequency components, and the proposed measure could also be easily generalized to cover selection in batch steganographic applications. And a calibration strategy is elaborately designed to balance the security level when JPEG covers of various QFs are involved in JPEG batch steganography. In this way, the proposed scheme can effectively resolve the problem that the statistical undetectability fluctuates dramatically w.r.t. the size and quality factor when the batch set is involved with various image parameters, and consequently maintains the overall security of the practical JPEG batch steganographic system. Experimental results show that the proposed method exhibits security performance superior or comparable to the state-of-the-art batch schemes while maintaining a low computational cost.

An Efficient DCT-SVD Steganographic Approach Applied to JPEG Images

To prove the origin of images in social media, this work proposes an efficient JPEG image steganography approach. After structuring the cover image into blocks of 8*8 pixels, Discrete Cosine Transform is applied to each block of pixels. The latter are quantified using a quantization

An efficient JPEG image compression based on Haar wavelet transform, discrete cosine transform, and run length encoding techniques for advanced manufacturing processes

Image compression plays a key role in the transmission of an image and storage capacity. Image compression aims to reduce the size of the image with no loss of significant information and no loss of quality in the image. To reduce the storage capacity of the image, the image compression is proposed in order to offer a compact illustration of the information included in the image. Image compression exists in the form of lossy or lossless. Even though image compression mechanism has a prominent role for compressing images, certain conflicts still exist in the available techniques. This paper presents an approach of Haar wavelet transform, discrete cosine transforms, and run length encoding techniques for advanced manufacturing processes with high image compression rates. These techniques work by converting an image (signal) into half of its length which is known as “detail levels”; then, the compression process is done. For simulation purposes of the proposed research, the images are segmented into 8 × 8 blocks and then inversed (decoded) operation is performed on the processed 8 × 8 block to reconstruct the original image. The same experiments were done on two other algorithms, that is, discrete cosine transform and run length encoding schemes. The proposed system is tested by comparing the results of all the three algorithms based on different images. The comparison among these techniques is drawn on the basis of peak signal to noise ratio and compression ratio. The results obtained from the experiments show that the Haar wavelet transform outperforms very well with an accuracy of 97.8% and speeds up the compression and decompression process of the image with no loss of information and quality of image. The proposed study can easily be implemented in industries for the compression of images. These compressed images are suggested for multiple purposes like image compression for metrology as measurement materials in advanced manufacturing processes, low storage and bandwidth requirements, and compressing multimedia data like audio and video formats.

An improved anti-forensic technique for JPEG compression

The availability of numerous powerful image processing tools or software makes it easier to manipulate the digital information without the addition of any footprints. JPEG compression based tampering detectors are generally employed in digital image forensics. An efficient anti-forensic technique is required to measure the capability of JPEG forensic detectors. In this article, an efficient JPEG anti-forensic technique is presented to hide the JPEG compression artifacts in spatial as well as Discrete Cosine Transform (DCT) domain. We initially employ shifted block DCT approach on the considered JPEG compressed image to fill the gaps in the comb-like distribution of DCT coefficients. This shifted block DCT approach led to the addition of dithering noise itself without the need of any adaptive dithering model. Therefore, the computational cost to create a JPEG forgery reduces significantly. The result of this shifted block DCT approach is further processed in the second step by TV (Total variation)-based deblocking operation to remove the blocking artifacts left during the JPEG compression in the spatial domain. The experimental results illustrate that the presented approach has better performance in comparison to the existing techniques in terms of image visual quality and forensic undetectability with highly reduced computational cost.

Optimized JPEG 2000 Compression for Efficient Storage of Histopathological Whole-Slide Images

Background: Whole slide images (WSIs, digitized histopathology glass slides) are large data files whose long-term storage remains a significant cost for pathology departments. Currently used WSI formats are based on lossy image compression alogrithms, either using JPEG or its more efficient successor JPEG 2000. While the advantages of the JPEG 2000 algorithm (JP2) are commonly recognized, its compression parameters have not been fully optimized for pathology WSIs. Methods: We defined an optimized parametrization for JPEG 2000 image compression, designated JP2-WSI, to be used specifically with histopathological WSIs. Our parametrization is based on allowing a very high degree of compression on the background part of the WSI while using a conventional amount of compression on the tissue-containing part of the image, resulting in high overall compression ratios. Results: When comparing the compression power of JP2-WSI to the commonly used fixed 35:1 compression ratio JPEG 2000 and the default image formats of proprietary Aperio, Hamamatsu, and 3DHISTECH scanners, JP2-WSI produced the smallest file sizes and highest overall compression ratios for all 17 slides tested. The image quality, as judged by visual inspection and peak signal-to-noise ratio (PSNR) measurements, was equal to or better than the compared image formats. The average file size by JP2-WSI amounted to 15, 9, and 16 percent, respectively, of the file sizes of the three commercial scanner vendors’ proprietary file formats (3DHISTECH MRXS, Aperio SVS, and Hamamatsu NDPI). In comparison to the commonly used 35:1 compressed JPEG 2000, JP2-WSI was three times more efficient. Conclusions: JP2-WSI allows very efficient and cost-effective data compression for whole slide images without loss of image information required for histopathological diagnosis.

Mimo Based Efficient JPEG Image Transmission and Reception by Multistage Receivers

Mimo Based Efficient JPEG Image Transmission and Reception by Multistage Receivers

Efficient JPEG 2000 VBR Compression with True Constant Perceived Quality

This paper describes a novel JPEG 2000 variable bit rate (VBR) encoding system for digital cinema that uses visually lossless viewing distance as the image quality metric to provide true constant perceived quality. In this approach, the wavelet coefficients are quantized using a human visual system model so that there are no detectable compression errors when a movie is viewed at the specified viewing distance (or at any greater distance). The compressed codestream includes only the minimum information that is needed to ensure visually lossless quality, so coding efficiency is high. Compression times are also significantly reduced, as compared to typical VBR systems, which results in a more efficient workflow. These benefits are achieved while maintaining full compatibility with the Digital Cinema Initiatives (DCI) compression specifications.

Efficient and Syntax-Compliant JPEG 2000 Encryption Preserving Original Fine Granularity of Scalability

A novel syntax-compliant encryption primitive and an efficient syntax-compliant JPEG 2000 encryption scheme are presented in this paper. The syntax-compliant encryption primitive takes, as input, syntax-compliant plaintext and produces syntax-compliant ciphertext. It is faster than all the other syntax-compliant encryption primitives we know. Our JPEG 2000 encryption scheme encrypts independently either each codeblock segment (normal mode) or each intersection of a codeblock segment and a codeblock contribution to a packet (in situ mode). Truncation-invariant parameters uniquely identifying each independently encrypted data block are combined with a global initialization vector to generate on the fly an initialization vector (IV) used to encrypt the data block. These IVs can be correctly regenerated even when the encrypted codestream is truncated. Encrypted codestreams are syntax-compliant. The original granularity of scalability is fully preserved after encryption so that an encrypted codestream can be truncated to adapt to different representations without decryption. Our JPEG 2000 encryption scheme is fast, error-resilient, and has negligible file-size overhead.