A fast SPIHT algorithm based on the end scan threshold

DOI

10.2991/amcce-15.2015.295How to use a DOI?

Keywords

Image compression; SPIHT; End scan threshold; minimum output bits

Abstract

A fast set partitioning in hierarchical tree (SPIHT) algorithm based on the end scan threshold is proposed in this paper. Because the coding process of the SPIHT needs repeat scanning and sorting, so it takes a lot of extra time and storage space. In order to save the time and space overhead, the end scan threshold is used in encoding to terminate the scan process when the compression is enough. Experimental results show that the end scan threshold for the different images is the same in the case of the same compression ratio, and when the improved algorithm is used in the sorting process, it can reduce the data stream storage space in coding and the time consumption and decoding. In addition, the quality of reconstructed image is equivalent to SPIHT algorithm.

Copyright

© 2015, 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  - Changhua Liu
AU  - Xiaole Xu
PY  - 2015/04
DA  - 2015/04
TI  - A fast SPIHT algorithm based on the end scan threshold
BT  - Proceedings of the 2015 International Conference on Automation, Mechanical Control and Computational Engineering
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/amcce-15.2015.295
DO  - 10.2991/amcce-15.2015.295
ID  - Liu2015/04
ER  -