Fast orthogonalization algorithms for segmented image coding

Signal Processing - Tập 61 - Trang 265-274 - 1997
Wilfried Philips1
1Department of Electronics and Information Systems, University of Gent, St-Pietersnieuwstraat 41, B9000 Gent, Belgium

Tài liệu tham khảo

Biggar, 1988, Segmented-image coding: Performance comparison with the discrete cosine transform, 135, 121 Chang, 1994, Comparison of transform coding techniques for two-dimensional arbitrarily-shaped images, ACM/Springer-Verlag Multimedia Systems Journal, 1, 234 Cermelli, 1994, A fast algorithm for region-oriented texture coding, Vol. 5, 289 Christopoulos, 1997, Segmented image coding: Techniques and experimental results, Signal Processing: Image Communication, 11, 63, 10.1016/S0923-5965(96)00040-9 Gilge, 1989, Coding of arbitrarily shaped image segments based on a generalized orthogonal transform, Signal Processing: Image Communication, 1, 153, 10.1016/0923-5965(89)90007-6 Golub, 1991, Matrix Computations, 224 Jackson, 1936, Formal properties of orthogonal polynomials in two variables, Duke Mathematical Journal, 2, 423, 10.1215/S0012-7094-36-00233-8 Kaup, 1992, A new approach towards description of arbitrarily shaped image segments, 543 Kaup, 1994, Segment-oriented coding of textured images based on successive approximation, Vol. 1, 197 Kunt, 1985, Second-generation image-coding techniques, 73, 549 Philips, 1996, A comparison of four hybrid block/object image coders, Signal Processing, 54, 103, 10.1016/0165-1684(96)00145-4 Philips, 1996, Fast coding of arbitrarily shaped image segments using weakly separable bases, 35, 177 Philips, 1996, Fast orthogonalization algorithms for segmented image coding W. Philips, A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region, Multidimensional Systems and Signal Processing (forthcoming). Sikora, 1995, Shape-adaptive DCT for generic coding of video, IEEE Trans. on Circuits and Systems for Video Technology, 5, 59, 10.1109/76.350781 Wallace, 1991, The JPEG still picture compression standard, Communications of the ACM, 34, 30, 10.1145/103085.103089