Feng, Hanying and Effros, Michelle (1999) Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm. In: IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '99), Phoenix, AZ, 15-19 March 1999. IEEE , Piscataway, NJ, pp. 2435-2438. ISBN 0-7803-5041-3 http://resolver.caltech.edu/CaltechAUTHORS:FENicassp99
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:FENicassp99
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.
|Item Type:||Book Section|
|Additional Information:||© Copyright 1999 IEEE. Reprinted with permission. This material is based upon work supported by NSF CAREER Award No. MIP-9501977, the Intel 2000 program, and the Powell Foundation.|
|Subject Keywords:||Karhunen-Loeve transforms, computational complexity, image coding, transform coding, WUTC, separable coding, KLT, source code design, universal source coding, transforms for source coding|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||07 Feb 2007|
|Last Modified:||26 Dec 2012 09:31|
Repository Staff Only: item control page