Fast scaled-DCT algorithm

Ephraim Feig

doi:10.1117/12.19490

1 June 1990 Fast scaled-DCT algorithm

Ephraim Feig

Proceedings Volume 1244, Image Processing Algorithms and Techniques; (1990) https://doi.org/10.1117/12.19490
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States

Abstract

The Discrete Cosine Transform (DCT) followed by scaling and quantiza.tion is an mlportant operation in image processing. Because of the scaling, the DCT itself need not he computed, but rather a scalar mu]tiple of the DCT might do, with appropriate compensation incorporated into the scaling. We present a fast method for computing such scaled output of the 2-dimensional DCT on 8 x 8 points. We also present a similar algorithm for the inverse scaled DCT.

Citation Download Citation

Ephraim Feig "Fast scaled-DCT algorithm", Proc. SPIE 1244, Image Processing Algorithms and Techniques, (1 June 1990); https://doi.org/10.1117/12.19490

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available