Share Email Print
cover

Proceedings Paper

Low-complexity waveform coding via alphabet and sample-set partitioning
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than first order entropy even with fast Huffman adaptive codecs. Numerical results with its application for lossy and lossless image compression show the efficacy of the new method, comparable to the best known methods.

Paper Details

Date Published: 10 January 1997
PDF: 13 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263240
Show Author Affiliations
Amir Said, State Univ. of Campinas (Brazil)
William A. Pearlman, Rensselaer Polytechnic Institute (United States)


Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp III, Editor(s)

© SPIE. Terms of Use
Back to Top
PREMIUM CONTENT
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?
close_icon_gray