Modified Listless Set Partitioning in Hierarchical Trees (MLS) for Memory Constrained Image Coding Applications
キーワード:
Image coding、 wavelet、 SPIHT、 NLS、 MLS、 memory efficient image coder要旨
SPIHT image coding algorithm is a very effective state-of-art technique for compression of wavelet transformed images. However, the use of three continuously growing linked lists, limit its applications to achieve high quality images in memory constrained environments. The No List SPIHT (NLS) is an attempt to implement SPIHT algorithm without lists, but it uses 4 bits per coefficient state markers to keep track of significant/insignificant information of pixels/sets. This paper presents a listless implementation of SPIHT algorithm that uses state markers with only 2.5 bits/coefficients(on an average) to keep track of pixels, set and subsets information. Simulation results show that the proposed modified listless SPIHT (MLS) coder has nearly the same coding performance as that of SPIHT and NLS, but it requires significantly smaller memory compared to these coders. Keywords: Image coding, wavelet, SPIHT, NLS, MLS, memory efficient image coder追加ファイル
発行日
巻号
セクション
ライセンス
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
· I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
· I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
· I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
· I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
_______________
We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |