Progressive image compression algorithm based on lattice vector quantization

Anna Tatsaki; Thanos Stouraitis; Costas E. Goutis

doi:10.1117/12.201201

17 February 1995 Progressive image compression algorithm based on lattice vector quantization

Anna Tatsaki, Thanos Stouraitis, Costas E. Goutis

Proceedings Volume 2451, Advanced Image and Video Communications and Storage Technologies; (1995) https://doi.org/10.1117/12.201201
Event: Advanced Networks and Services, 1995, Amsterdam, Netherlands

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.

Citation Download Citation

Anna Tatsaki, Thanos Stouraitis, and Costas E. Goutis "Progressive image compression algorithm based on lattice vector quantization", Proc. SPIE 2451, Advanced Image and Video Communications and Storage Technologies, (17 February 1995); https://doi.org/10.1117/12.201201

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available