Image compression using wavelet packet tree based on threshold entropy

Authors:
G. K. Kharate;A. A. Ghatol;P. P. Rege
Affiliations:
Head of IT Dept., K. K. Wagh Institute of Engg. Education and Research, Nashik, Maharashtra, India;Dr. Babasaheb Ambedkar Technology University, Loner, Mangaon, Raigad, Maharashtra, India;Dept. of Electronics and Communication, Pune Institute of Engineering and Technology, Shivajinagar, Pune, Maharashtra, India
Venue:
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
Year:
2006

Citing 2
Cited 1

Image compression—from DCT to wavelets: a review

Crossroads
Fractal image compression

CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning

A robust and fast non-local means algorithm for image denoising

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper describes a new technique for still colour image compression. The image compression includes transform of image, quantization and encoding. This paper mainly describes the transform of image and quantization technique. The algorithm is based on decomposition on orthogonal wavelet basis and it includes threshold entropy technique to construct the best tree. Quantization is adaptive, threshold is calculated on the basis of nature of image and type of wavelet is used. This paper also describes the comparison of wavelet transform and wavelet packet tree. The experimental aim is to determine the best method to improve the performance. The results are compared in terms of percentage of zeros; percentage of energy retained and signal to noise ratio for standard natural images as well as line-based images.