COMPARATIVE STUDY OF COMPRESSION ALGORITHM BASED ON

BLOCK TRUNCATION CODING

T. Ilam Parithi K. Antony Sudha
Guest Lecturer Assistant Professor
Department of Computer Science Department of Computer Science & Engineering
Government Arts & Science College Einstein College of Engineering
Sankarankovil, Tenkasi - District Tirunelveli

INTRODUCTION
Compression is beneficial because it reduces the need for costly resources like hard
disc space or transmission bandwidth. One of the key factors that directly affects any
communication medium performs is image compression. Using a 64 kbps channel, a 16 MB
image requires more than four minutes downloading, However, if the same image is
compressed with a rate of 20:1 its size is reduced to 800 KB and takes only around 12
seconds to download. Transform coding and spatial coding are the two fundamental
technologies used in image data compression. Therefore, the need to develop efficient image
compression algorithms has become quite important. Implementing spatial coding is typically
easy in terms of memory requirements and number of operations. It is quite sensitive to
changes in data statistics and to the impacts of channel error, which decrease the quality of
the image. Multiple coding methods, including Block Truncation Coding (BTC) and Binary
Image Compression (BIC), have been examined in the spatial domain. In order to achieve
data compression, transform coding must transform the original image to a new space where
most of the energy will be focused in a small number of coefficients. Additionally, it is
feasible to mix the two methods using a method known as hybrid coding. In order to
eliminate any redundant information, spatial coding directly modifies sample image data.
Grayscale images can be compressed using the straightforward and simple BTC method.

LITERATURE SURVEY

Shih-Lun Chenet al.,proposed color and multispectral image compression using

Enhance block truncation code [1].These technique are based on the mean and standard
deviation. The satellite image is reshaped using this technique. There are several different
sub-blocks in the satellite image. After calculating mean values, each sub-block's pixel count
is compared to the mean, and each pixel's value is then changed to a binary integer in
accordance with the mean. Finally for the Enhance block truncation code for satellite images,
MSE, PSNR, and compression ratio are determined.
 C.Senthilkumar et al., proposed a hybrid compression technique based on the Walsh
Hadamard Transform (WHT) and Block Truncation Coding (BTC) has been proposed for the
compression of digital images [2] . By combining BTC and WHT, this hybrid approach seeks
to increase compression ratio. To evaluate the coding effectiveness and performance of the
hybrid approach and compare it to the BTC and WHT, several grayscale test images are
employed. Overall research suggests that the recommended strategy produces superior
outcomes.By dividing the input image and changing the layout of nearby reference pixels, the
conventional algorithm's processing dependence is eliminated. According to research results,
parallel implementation significantly improves visual quality while decreasing processing
time by 6–7 times.

Jing-Ming Guo et al. , proposed A modified Block Truncation Coding using max-min
quantizer (MBTC) [3]. The mean and standard deviation of the pixel values in each block are
used to determine the quantization in common BTC.

COMPARED ALGORITHMS
1. BTC
A simple and basic method for image compression is BTC.The basic premise of this
method is to split the original image into several non-overlapping segments, where each
block is represented by two different values.Compression in BTC is done block by
block.Each block has a size of MxN, then a and b are calculated for each block mean.Every
pixel in the block is thresholded using the block mean value to compress the image.If the
pixel surpasses the mean, it is given the value 1.The pixel is given the value 0 if not.Bitmap
image is the name given to the resulting image.The bit map image and the equivalents "a"
and "b" are transmitted together with the text.Consider an 8x8 block size and a standard 8-bit
image.In the decoding process, a bitmap picture is used to replace the original image like „1'
is changed to the high mean letter 'a' and '0' to the low mean letter 'b'.Block size encourages
the compression ratio to rise, but it also results in block distortions and poor image quality.

2. Enhanced BTC
The term "Enhanced BTC" refers to a novel method of image compression that
enhances the visual quality of reconstructed images called "Enhanced Adaptive Block
Truncation Coding with Edge Quantization Scheme."This technique reduces the amount of
bits required for compression and increases compression rate by using a variable-length code
to represent the index of each cluster.Through the use of a compressed image's edges, it also
improves the visual quality of the reconstructed image. To achieve the optimum balance
between compression effectiveness and image quality, an image can be divided into edge
blocks and non-edge blocks using an edge detector, and each kind of block can then be
compressed using a separate technique.

The following stages are part of the suggested procedure in the PDF file:

1. Dividing the image up into blocks .

2. recognising between edge and non-edge blocks .

3. Using various quantization methods for edge and non-edge blocks.

4. Reducing the amount of bits required for compression by using a variable-length code.

5. Using the tri-clustering technique on edge blocks to decrease the mean square error

6. Developing quantization ranges to account for the minute differences between two
quantization values

7. Increasing the number of clusters to more precisely approximation pixel values

8. Outlining three distinct strategies (Scheme A, Scheme B, and Scheme C) that trade off
compression rate versus image quality based on various findings.

9. Producing experimental findings that highlight the benefits and success of the concepts
presented offered.

3. Modified Block Truncation Coding (MBTC)

Digital grey level images are compressed using the Modified Block Truncation Coding
(MBTC) lossy image compression method, which employs a max-min quantizer.In MBTC,
the compressed image is created by splitting the original image into blocks, quantizing each
block according to the threshold, and creating a bit map. By conserving the higher mean and
lower mean of each block, the compressed image is decoded. quantization is performed based
on the average value of the maximum, minimum, and mean of the blocks of pixels rather than
the mean and standard deviation.The error between the pixel values of the original and the
reconstructed image is reduced as a result of the reduction in the difference between the pixel
values in each segment.As a result, the decoding process produces an image of higher quality
while using the same bit rate as the traditional BTC.By overcoming the drawbacks of
traditional BTC, the MBTC algorithm creates more aesthetically beautiful images with higher
resolution while still keeping a good compression ratio.

4. ABTC-EQ
ABTC-EQ (Adaptive BTC – Edge Quantization) is an image compression method that uses
edge-based block truncation. In order to quantize the pixel values based on the edge
information, the method first uses the Canny edge detector to determine the edge information
in an input image.The tri-clustering method matches pixel grayscale values using three
values, which can lower mean square error and enhance image quality. This technique
improves on BTC by handling more complicated images and achieving higher compression
rates without affecting image quality. This method is as follows:

1. Enter a grayscale image with a size of M x N pixels together with the block size k that
will be used to separate the image into non-overlapping blocks.
2. Locating the edge map using emap
The Canny edge operator is used to derive the edge map of the input image. The
Canny edge detector is a superior edge detection technique with multiple stages that
can identify a variety of edges in images. The noise reduction phase of the technique
involves applying a Gaussian filter on the image in order to smooth it out. Find the
intensity gradient in the second stage and use the edge thinning method known as
non-maximum suppression. then use connection analysis and double thresholding to
follow the image's edges.
3. The image should be divided into blocks of size k k, where k can have a value of 4, 8,
16, etc.
4. Block classification : Classify the blocks so that the corresponding image block W is
defined as an edge block, otherwise a non-edge block, if any one of the edge values in
E is 1, but not all of the edge values are 1. When defining an identifier flag, it is given
the values 0 for an edge block and 1 for a non-edge block.
5. Adaptive Encoding.
6. Adaptive Decoding.
The resulting matrix indicates the reconstructed image. Repeat the process for each
block.
There may be blocks in the edge map that have all values of 0 or 1, in which case
there are no edges, creating a visually continuous effect. For these non-edge blocks,
quantization is carried out depending on the threshold, which is the average of the
 maximum, minimum, and means value. The mean values of the upper range and
lower range are used as the reconstruction values when recreating such blocks. For the
edge block, it is assumed that an edge separates the region into three sections: the
background, the foreground, and the section with edge pixels.

CONCLUSION

This paper focus on Compression algorithms based on Block truncation coding such as BTC ,

Enhanced BTC , Modified Block Truncation Coding ,ABTC-EQ. Each Algorithm is an

enhanced from BTC and they differ by the approach and they produce better results based on

the complexity in their inputs

REFERENCE

[1] Shuyuan Zhu, Zhiying He, XiandongMeng, Jiantao Zhou and Bing Zeng, “Compression-
dependent Transform Domain Downward Conversion for Block-based Image Coding”, IEEE
Transactions on Image Processing, Volume: 27, Issue: 6, June 2018.

[2] Sunwoong Kim and Hyuk-Jae Lee, “RGBW Image Compression by Low-Complexity
Adaptive Multi-Level Block Truncation Coding”, IEEE Transactions on Consumer
Electronics, Vol. 62, No. 4, November 2016.

[3] Jing-Ming Guo, Senior Member, IEEE, and Yun-Fu Liu, Member, IEEE, “Improved
Block Truncation Coding Using Optimized Dot Diffusion”, IEEE Transactions on Image
Processing, Vol. 23, No. 3, March 2014.

[4] Jayamol Mathews, Madhu S. Nair, “Modified BTC Algorithm for Gray Scale Images
using max-min Quantizer”, 978-1-4673-5090-7/13/$31.00 ©2013 IEEE.

[5] Lin, C.; Liu, X. A reversible data hiding scheme for block truncation compressions based
on histogrammodification. In Proceedings of the 2012 Sixth International Conference on
Genetic and EvolutionaryComputing, Kitakushu, Japan, 25–28 August 2012; pp. 157–160.

[6] C. C. Chang, H. C. Hsia, and T. S. Chen. A progressive image transmission scheme based
on block truncation coding. In LNCS Vol 2105, pages 383–397, 2001.