Memory-efficient spatial prediction image compression scheme

Nandi, Anil V and Patnaik, L M and Banakar, RM (2007) Memory-efficient spatial prediction image compression scheme. In: Image and Vision Computing, 25 (6). pp. 899-906.

PDF scie.pdf - Published Version Restricted to Registered users only Download (808kB) | Request a copy

Abstract

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	Image and Vision Computing
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	26 Mar 2010 06:26
Last Modified:	19 Sep 2010 05:58
URI:	http://eprints.iisc.ac.in/id/eprint/26540

Actions (login required)

View Item