A Review: DWT-DCT Technique and Arithmetic-Huffman Coding based Image Compression
G. S. Shashi Kumar, Er. Sukhreet Singh Brar, Rajeev Kumar, Ashok S. Kumar
Abstract
Open-access reader
G. S. Shashi Kumar, Er. Sukhreet Singh Brar, Rajeev Kumar, Ashok S. Kumar
Abstract
Open-access reader
Nowadays, the volume of the data is increasing with time which generates a problem in storage and transfer.To overcome this problem, the data compression is the only solution.Data compression is the science (or an art) of representing information in compact form.This is an active research area.Compression is to save the hardware storage space and transmission bandwidth by reducing the redundant bits.Basically, lossless & lossy are two types of data compression technique.In lossless data compression, original data is similar to decompressed or decoded data, but in lossy technique is not same.In this paper, Study lossless image compression technique.The purpose of image compression is to maximum bandwidth utilization and reduces storage capacity.This technique is beneficial to image storage and transfer.At the present time, Mostly image compression research have focused on the wavelet transform due to better performance over another transform.The performance is evaluated by using MSE & PSNR.DWT, quantization, Arithmetic, Huffman coding and DCT techniques are briefly introduced.After decompression, the quality of image is evaluated using PSNR parameter between original & decoded image.Compression ratio (CR) parameter is calculated to measure how many times image compressed.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Nowadays, the volume of the data is increasing with time which generates a problem in storage and transfer.To overcome this problem, the data compression is the only solution.Data compression is the science (or an art) of representing information in compact form.This is an active research area.Compression is to save the hardware storage space and transmission bandwidth by reducing the redundant bits.Basically, lossless & lossy are two types of data compression technique.In lossless data compression, original data is similar to decompressed or decoded data, but in lossy technique is not same.In this paper, Study lossless image compression technique.The purpose of image compression is to maximum bandwidth utilization and reduces storage capacity.This technique is beneficial to image storage and transfer.At the present time, Mostly image compression research have focused on the wavelet transform due to better performance over another transform.The performance is evaluated by using MSE & PSNR.DWT, quantization, Arithmetic, Huffman coding and DCT techniques are briefly introduced.After decompression, the quality of image is evaluated using PSNR parameter between original & decoded image.Compression ratio (CR) parameter is calculated to measure how many times image compressed.
Key concepts: Lossless compression, Lossy compression, Image compression, Huffman coding, Data compression, Texture compression, Computer science, Color Cell Compression