Affordable Access

Publisher Website

Reduced memory listless speck image compression

Authors
Publisher
Elsevier Inc.
Publication Date
Volume
16
Issue
6
Identifiers
DOI: 10.1016/j.dsp.2006.06.001
Keywords
  • Embedded Zerotree Wavelet (Ezw)
  • Set Partitioning In Hierarchical Trees (Spiht)
  • Set Partitioned Embedded Block Coder (Speck)
Disciplines
  • Computer Science

Abstract

Abstract In this paper a variant of the set partitioned embedded block coder (SPECK) image compression called listless SPECK (LSK) is presented. LSK operates without lists and is suitable for a fast, simple hardware implementation. LSK has a fixed predetermined memory requirement about 50% larger than needed for the independent image. Instead of lists, a state table with two bits per coefficient is used to keep track of the block coding and the information that has been encoded. LSK sparsely marks selected block nodes of insignificant blocks in the state table, in such a way that large groups of predictably insignificant pixels are easily identified and skipped during the coding process. The image data is stored as a one-dimensional recursive zigzag array for computational efficiency and algorithmic simplicity. Performance of the proposed algorithm on standard test images is nearly same as SPECK.

There are no comments yet on this publication. Be the first to share your thoughts.