A computationally efficient algorithm for image compression and progressive transmission is presented. A prime-factor discrete cosine transform (DCT) is applied, where the coefficients are computed in three groups and are residue represented by a different bit allocation. A novel lattice vector quantiser is used for the quantisation of each group.
References
-
-
1)
-
N.I. Cho ,
S.U. Lee
.
Fast algorithm and implementation of 2-D discrete cosine transform.
IEEE Trans.
,
297 -
305
-
2)
-
J.D. Gibson ,
K. Sayood ,
P. Hawkes
.
(1988)
Lattice quantization, Advances in electronics and electron physics.
-
3)
-
A. Tatsaki ,
C. Dre ,
T. Stouraitis ,
C. Goutis
.
Prime factor DCT algorithms.
IEEE Trans. Signal Process.
-
4)
-
T. Fischer
.
A pyramid vector quantizer.
IEEE Trans.
,
568 -
583
-
5)
-
Y. Huang ,
H.M. Driezen ,
N.P. Galatsanos
.
Prioritized DCT for compression and progressive transmission of images.
IEEE Trans.
,
477 -
487
-
6)
-
Vetterli, M.: `Fast 2-D discrete cosine transform', IEEE ICASSP'85, 1985, p. 1538–1541.
-
7)
-
N.S. Szabo ,
R.I. Tanaka
.
(1967)
Residue arithmetic and its applications to computer technology.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19950338
Related content
content/journals/10.1049/el_19950338
pub_keyword,iet_inspecKeyword,pub_concept
6
6