Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm

The weighted universal transform code (WUTC) is a two-stage transform code that replaces JPEG's single, non-optimal transform code with a jointly designed collection of transform codes to achieve good performance across a broader class of possible sources. Unfortunately, the performance gains of WUTC are achieved at the expense of significant increases in computational complexity and larger codes. We here present a faster, more space-efficient WUTC algorithm. The new algorithm uses separable coding instead of direct KLT. While separable coding gives performance comparable to that of WUTC, it uses only 1/8 of the floating-point multiplications and 1/32 of storage of direct KLT. Experimental results included in this work compare the performance of new separable WUTC with both the WUTC and other fast variations of that algorithm.

[1]  Michelle Effros,et al.  Fast weighted universal transform coding: toward optimal, low complexity bases for image compression , 1997, Proceedings DCC '97. Data Compression Conference.

[2]  Michelle Effros,et al.  Weighted universal bit allocation: optimal multiple quantization matrix coding , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[3]  Shmuel Winograd,et al.  A New Algorithm for Inner Product , 1968, IEEE Transactions on Computers.