By Topic

Scaling the discrete cosine transformation for fault-tolerant real-time execution

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
$33 $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

1 Author(s)
Mario Schölzel ; Department of Computer Science, Brandenburg University of Technology, P.O. 101344, 03013 Cottbus, Germany

In this paper we examine the scalability of several implementations of the 2-dimensional discrete cosine transformation in the context of image processing. By scaling down the quality of the transformation the required computational complexity also decreases. Using several benchmark images we can show that no significant loss of image quality results from downscaling the computational complexity by up to 60%. This property can be used to switch between different quality levels during the execution of the DCT. A low quality level is used if only few time remains to finish the computation; otherwise a higher quality level can be used. For a certain execution model we show that this switching between quality levels can be used to meet the real-time demands of the executed image processing application even in the presence of a permanent fault in the execution units.

Published in:

Signal Processing Algorithms, Architectures, Arrangements, and Applications SPA 2009

Date of Conference:

24-26 Sept. 2009