background image
ISO/IEC 10918-1 : 1993(E)
Annex M
Bibliography
(This annex does not form an integral part of this Recommendation | International Standard)
M.1
General references
LEGER (A.), OMACHI (T.), and WALLACE (G.K.): JPEG Still Picture Compression Algorithm, Optical Engineering,
Vol. 30, No. 7, pp. 947-954, 1991.
RABBANI (M.) and JONES (P.): Digital Image Compression Techniques, Tutorial Texts in Optical Engineering,
Vol. TT7, SPIE Press, 1991.
HUDSON (G.), YASUDA (H.) and SEBESTYEN (I.): The International Standardization of a Still Picture Compression
Technique, Proc. of IEEE Global Telecommunications Conference, pp. 1016-1021, 1988.
LEGER (A.), MITCHELL (J.) and YAMAZAKI (Y.): Still Picture Compression Algorithm Evaluated for International
Standardization, Proc. of the IEEE Global Telecommunications Conference, pp. 1028-1032, 1988.
WALLACE (G.), VIVIAN (R.) and POULSEN (H.): Subjective Testing Results for Still Picture Compression Algorithms
for International Standardization, Proc. of the IEEE Global Telecommunications Conference, pp. 1022-1027, 1988.
MITCHELL (J.L.) and PENNEBAKER (W.B.): Evolving JPEG Colour Data Compression Standard, Standards for
Electronic Imaging Systems
, M. Nier, M.E. Courtot, Editors, SPIE, Vol. CR37, pp. 68-97, 1991.
WALLACE (G.K.): The JPEG Still Picture Compression Standard, Communications of the ACM, Vol. 34, No. 4, pp. 31-
44, 1991.
NETRAVALI (A.N.) and HASKELL (B.G.): Digital Pictures: Representation and Compression, Plenum Press,
New York 1988.
PENNEBAKER (W.B.) and MITCHELL (J.L.): JPEG: Still Image Data Compression Standard, Van Nostrand
Reinhold, New York 1993.
M.2
DCT references
CHEN (W.), SMITH (C.H.) and FRALICK (S.C.): A Fast Computational Algorithm for the Discrete Cosine Transform,
IEEE Trans. on Communications, Vol. COM-25, pp. 1004-1009, 1977.
AHMED (N.), NATARAJAN (T.) and RAO (K.R.): Discrete Cosine Transform, IEEE Trans. on Computers, Vol. C-23,
pp. 90-93, 1974.
NARASINHA (N.J.) and PETERSON (A.M.): On the Computation of the Discrete Cosine Transform, IEEE Trans. on
Communications
, Vol. COM-26, No. 6, pp. 966-968, 1978.
DUHAMEL (P.) and GUILLEMOT (C.): Polynomial Transform Computation of the 2-D DCT, Proc. IEEE ICASSP-90,
pp. 1515-1518, Albuquerque, New Mexico 1990.
FEIG (E.): A Fast Scaled DCT Algorithm, in Image Processing Algorithms and Techniques, Proc. SPIE, Vol. 1244, K.S.
Pennington and R. J. Moorhead II, Editors, pp. 2-13, Santa Clara, California, 1990.
HOU (H.S.): A Fast Recursive Algorithm for Computing the Discrete Cosine Transform, IEEE Trans. Acoust. Speech and
Signal Processing
, Vol. ASSP-35, No. 10, pp. 1455-1461.
LEE (B.G.): A New Algorithm to Compute the Discrete Cosine Transform, IEEE Trans. on Acoust., Speech and Signal
Processing
, Vol. ASSP-32, No. 6, pp. 1243-1245, 1984.
LINZER (E.N.) and FEIG (E.): New DCT and Scaled DCT Algorithms for Fused Multiply/Add Architectures, Proc.
IEEE ICASSP-91
, pp. 2201-2204, Toronto, Canada, 1991.
VETTERLI (M.) and NUSSBAUMER (H.J.): Simple FFT and DCT Algorithms with Reduced Number of Operations,
Signal Processing, 1984.
CCITT Rec. T.81 (1992 E)
181
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93] [94] [95] [96] [97] [98] [99] [100] [101] [102] [103] [104] [105] [106] [107] [108] [109] [110] [111] [112] [113] [114] [115] [116] [117] [118] [119] [120] [121] [122] [123] [124] [125] [126] [127] [128] [129] [130] [131] [132] [133] [134] [135] [136] [137] [138] [139] [140] [141] [142] [143] [144] [145] [146] [147] [148] [149] [150] [151] [152] [153] [154] [155] [156] [157] [158] [159] [160] [161] [162] [163] [164] [165] [166] [167] [168] [169] [170] [171] [172] [173] [174] [175] [176] [177] [178] [179] [180] [181] [182] [183] [184] [185] [186]