An Improved JPEG Image Compression Technique based on Selective Quantization

Abstract

In today's communicative and multimedia computing world, JPEG images play a vast consequential role. The JPEG images have been able to satisfy the users by fulfilling their demand of preserving numerous digital images within considerably less storage space. Although the JPEG standard offers four different sorts of compression mechanism, among them the Baseline JPEG or Lossy Sequential DCT Mode of JPEG is most popular since it can store a digital image by temporarily removing its psychovisual redundancy and thereby offering a very less storage space for a large image. Again, the computational complexity of Baseline JPEG is also considerably less as compression takes place in Discrete Cosine Transform domain. Therefore, Baseline JPEG is substantially useful while storing, sharing and transmitting digital images. Despite removing a large amount of psychovisual redundancy, the Baseline JPEG still contains redundant data in DCT domain. This paper explores the fact and introduces an improved technique that modifies the Baseline JPEG algorithm. It describes a way to further compress a JPEG image without any additional loss while achieving a better compression ratio than that is achievable by Baseline JPEG. The contribution of this work is to incorporate a simple mathematical series with Baseline JPEG before applying optimal encoding and perform a Selective Quantization that essentially does not loss any information after decompression but reduces the redundant data in DCT domain. The proposed technique is tested on over 200 textbook images that are extensively used for testing standard Image Processing and Computer Vision algorithms. The experimental results show that our proposed approach achieves 2.15% and 14.10% better compression ratio than that is achieved by Baseline JPEG on an average for gray-scale and true-color images respectively. General Terms:JPEG, Huffman Coding

Reducing Storage in Large-Scale Photo Sharing Services using Recompression

“…Several papers have explored JPEG compression. Some of them focus on compressing JPEG losslessly [34], [35], [36], [37], [38]. However, as shown in Section IV, they either cannot achieve as high compression as ROMP, or have much higher complexity.…”

Biometric Quality: Analysis of Iris Recognition Techniques with other Biometric Authentication Systems

“…All previously mentioned recognition stages have been performed on each image. In initial stage, localization of iris circular inner and outer boundaries, then that of eyelids; later choosing 128 circles on iris area, and eventually transforming polar to Cartesian coordinates has been performed [18].…”

“…If the value of feature vector in a point is equal to the value of other feature vector in that point, digit 1 and if they are not equal, digit zero is allocated to that point and then the values allocated to the pixels are summed up and similarity criterion of the two vectors is attained by finding the best of Hamming distance (HD) [17,18,19] accordance in following equation:…”

Context adaptive thresholding and entropy coding for very low complexity JPEG transcoding

“…There exist some prior works that focus on lossless compression [4,5,6,7,8]. Compared to these schemes, ROMP, can achieve competitively high compression at very low complexity.…”