Share Email Print

Proceedings Paper

High-performance low-complexity image compression
Author(s): William A. Pearlman
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Optimal performance in a data compression scheme is very hard to obtain without inordinate computational complexity. However, there are possibilities of obtaining high performance with low complexity by proper exploitation of the characteristics of the data. Here, we shall concentrate on two recent low complexity algorithms for image compression which exploit data characteristics very efficiently. We shall try to discover principals for realizing high performance with low complexity and explain how these recent algorithms utilize these principles We shall also present image compression result with actual codecs which realize the promise of high compression with low complexity.

Paper Details

Date Published: 30 October 1997
PDF: 13 pages
Proc. SPIE 3164, Applications of Digital Image Processing XX, (30 October 1997); doi: 10.1117/12.292755
Show Author Affiliations
William A. Pearlman, Rensselaer Polytechnic Institute (United States)

Published in SPIE Proceedings Vol. 3164:
Applications of Digital Image Processing XX
Andrew G. Tescher, Editor(s)

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