Low complexity, and high fidelity image compression using fixed threshold method

Authors:
V. P. Baligar;L. M. Patnaik;G. R. Nagabhushana
Affiliations:
Department of High Voltage Engineering, Indian Institute of Science, Bangalore 12, India;Microprocessor Applications Laboratory, Department of Computer Science and Automation, Indian Institute of Science, Bangalore 12, India;Department of High Voltage Engineering, Indian Institute of Science, Bangalore 12, India
Venue:
Information Sciences: an International Journal
Year:
2006

Citing 4
Cited 2

The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Embedded image coding using zerotrees of wavelet coefficients

IEEE Transactions on Signal Processing
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

Measure of image sharpness using eigenvalues

Information Sciences: an International Journal
Lossy-to-lossless 3D image coding through prior coefficient lookup tables

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper deals with the design and implementation of an image coding algorithm based on fixed threshold method. Threshold is the Peak Absolute Error (PAE) allowed in the reconstructed image. It has been shown that lossless edges with near-lossless/lossless filled area give a high fidelity images. Results are compared with Set Partitioning In Hierarchical Tree (SPIHT) [A. Said, W.A. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circ. Syst. Video Technol. 12 (1996) 243-250] method. Experimented results show that the proposed method provides high fidelity images, and it has been shown that these images are visually better than images reconstructed using SPIHT algorithm for the same compression ratio. The execution time of the algorithm is almost half compared to that of the SPIHT algorithm which requires wavelet transform of an image.