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

Baligar, VP and Patnaik, LM and Nagabhushana, GR (2006) Low complexity, and high fidelity image compression using fixed threshold method. In: Information Sciences, 176 (6). pp. 664-675.

PDF Low_complexity,_and_high_fidelity_image_compression_using_fixed_threshold_method.pdf Restricted to Registered users only Download (485kB) | Request a copy

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.

Item Type:	Journal Article
Publication:	Information Sciences
Publisher:	Elsevier Inc.
Additional Information:	Copyright of this article belongs to Elsevier Inc.
Department/Centre:	Division of Electrical Sciences > High Voltage Engineering (merged with EE) Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	21 Nov 2007
Last Modified:	19 Sep 2010 04:28
URI:	http://eprints.iisc.ac.in/id/eprint/7244

Actions (login required)

View Item