Abstract

Recently, image compression using adaptive block truncation coding based on edge quantization (ABTC-EQ) was proposed by Mathews and Nair. Their approach deals with an image for two types of blocks, edge blocks and non-edge blocks. Different from using the bi-clustering approach on all blocks in previous block truncation coding (BTC)-like schemes, ABTC-EQ adopts tri-clustering to tackle edge blocks. The compression ratio of ABTC-EQ is reduced, but the visual quality of the reconstructed image is significantly improved. However, it is observed that ABTC-EQ uses 2 bits to represent the index of three clusters in a block. We can only use an average of 5/3 bits by variable-length code to represent the index of each cluster. On the other hand, there are two observations on the quantization levels in a block. The first observation is that the difference between the two quantization values is often smaller than the quantization values themselves. The second observation is that more clusters may enhance the visual quality of the reconstructed image. Based on variable-length coding and the above observations, we design variants of ABTC-EQ to enhance the visual quality of the reconstructed image and compression ratio.

Highlights

  • Rapid improvements in the area of network and information technology increase the services of digital multimedia, especially digital image, in today’s digitalized and information world

  • Variable-length coding used for our method enable to enhance the peak signal-to-noise ratio (PSNR) and compression ratio (CR)

  • Lena, Butterfly, Cameraman, Lake, and Peppers are used for evaluating all block truncation coding (BTC)-like schemes: absolute moment BTC (AMBTC), modified BTC (MBTC), ABTC-EQ, and the proposed schemes (Scheme A, Scheme B and Scheme C)

Read more

Summary

Introduction

Rapid improvements in the area of network and information technology increase the services of digital multimedia, especially digital image, in today’s digitalized and information world. We deal with block truncation coding (BTC) and its variants [1,2,3,4], which are lossy compression algorithms. Because of their stable compression rates and low computation efforts, BTC-like schemes are widely used in cryptography, e.g., data hiding [5,6,7,8,9], watermarking [10], secret image sharing, and visual cryptography [11,12,13,14]

Objectives
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call