Share Email Print
cover

Proceedings Paper

Progressive image compression algorithm based on lattice vector quantization
Author(s): Anna Tatsaki; Thanos Stouraitis; Costas E. Goutis
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, a low computational complexity and high efficiency algorithm for progressive image compression is presented. The image is partitioned into blocks of pixels and a prime- factor 2-D discrete cosine transform (DCT) is applied. Because of the regular structure the DCT algorithm, the coefficients could be computed in groups. Each group of DCT coefficients is then vector quantized by using the pyramid vector quantizer algorithm. Since, the DCT coefficients of each group are allocated with a different number of bits, three PVQs are used with different radii.

Paper Details

Date Published: 17 February 1995
PDF: 9 pages
Proc. SPIE 2451, Advanced Image and Video Communications and Storage Technologies, (17 February 1995); doi: 10.1117/12.201201
Show Author Affiliations
Anna Tatsaki, Univ. of Patras (Greece)
Thanos Stouraitis, Univ. of Patras (Greece)
Costas E. Goutis, Univ. of Patras (Greece)


Published in SPIE Proceedings Vol. 2451:
Advanced Image and Video Communications and Storage Technologies
Naohisa Ohta; Heinz U. Lemke; Jean Claude Lehureau, Editor(s)

© SPIE. Terms of Use
Back to Top