A Simple and Fast Algorithm for Image Coding Based on SPIHT

DOI

10.2991/aiie-16.2016.63How to use a DOI?

Keywords

image compression; set partitioning in hierarchical tree; image coding; wavelet transform; zero tree coding

Abstract

The complicate calculation and frequent comparison based on spatial orientation tree (SOT) structure in SPIHT severely reduce the coding speed. To overcome these shortcomings, a modified image compression algorithm is proposed without SOT. The algorithm sorts the wavelet coefficients in descending order to eliminate the correlation among wavelet coefficients and obtain a one-dimensional coordinate list corresponding to the sorted wavelet coefficients. This algorithm stops the sorting pass immediately when a wavelet coefficient from the sorted coordinate list is not significant in a bit plane, which simplifies the process of scanning. Experimental results show that the proposed algorithm drastically improves the coding speed.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yiqun Zhang
AU  - Peijie Lin
AU  - Lijun Wu
AU  - Shuying Cheng
PY  - 2016/11
DA  - 2016/11
TI  - A Simple and Fast Algorithm for Image Coding Based on SPIHT
BT  - Proceedings of the 2016 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE 2016)
PB  - Atlantis Press
SP  - 273
EP  - 277
SN  - 1951-6851
UR  - https://doi.org/10.2991/aiie-16.2016.63
DO  - 10.2991/aiie-16.2016.63
ID  - Zhang2016/11
ER  -