PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 1, 1990Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE55 citations

Fast scaled-DCT algorithm

View Full Paper
EFEphraim Feig

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ephraim Feig (1990) studied this question.

synapsesocial.com/papers/6a0cd2283557111c3d34cd18https://doi.org/10.1117/12.19490
Ask AI
Helpful
Bookmark
Share
View Full Paper