Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Fast DCT-domain filtering using frequency division processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li, D. ; Philips Res., Briarcliff Manor, NY, USA ; Sethi, I.K. ; Dimitrova, N.

This paper presents a new scheme for the development of efficient DCT-domain algorithms based on frequency division processing (FDP). In this scheme, a manipulation in the DCT domain is decomposed into multiple simple operations, each of which is performed independently on certain sets of DCT coefficients. Using FDP we designed a fast DCT-domain algorithm for two-dimensional convolution. The algorithm, according to both theoretical analysis of computational complexity and experimental results, is more efficient than traditional spatial-domain convolution algorithms as well as other compressed-domain convolution algorithms. The performance is several times higher for kernel size beyond 5 and comparable for smaller kernel size. In addition, convolution performed directly in the compressed domain can achieve a slightly higher precision due to the removal of decompression artifacts.

Published in:

Multimedia Signal Processing, 2002 IEEE Workshop on

Date of Conference:

9-11 Dec. 2002