17 February 1995 Progressive image compression algorithm based on lattice vector quantization
Author Affiliations +
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Anna Tatsaki, Thanos Stouraitis, 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); doi: 10.1117/12.201201; https://doi.org/10.1117/12.201201
PROCEEDINGS
9 PAGES


SHARE
Back to Top