Statistics – Applications
Scientific paper
Dec 1991
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1991spie.1567..402h&link_type=abstract
Proc. SPIE Vol. 1567, p. 402-412, Applications of Digital Image Processing XIV, Andrew G. Tescher; Ed.
Statistics
Applications
Scientific paper
Among the various image data compression methods, the discrete cosine transform (DCT) has become the most popular in performing gray-scale image compression and decomposition. However, the computational burden in performing a DCT is heavy. For example, in a regular DCT, at least 11 multiplications are required for processing an 8 X 1 image block. The idea of the scaled-DCT is that more than half the multiplications in a regular DCT are unnecessary, because they can be formulated as scaling factors of the DCT coefficients, and these coefficients may be scaled back in the quantization process. A fast recursive algorithm for computing the scaled-DCT is presented in this paper. The formulations are derived based on practical considerations of applying the scaled-DCT algorithm to image data compression and decompression. These include the considerations of flexibility of processing different sizes of DCT blocks and the actual savings of the required number of arithmetic operations. Due to the recursive nature of this algorithm, a higher-order scaled-DCT can be obtained from two lower-order scaled DCTs. Thus, a scaled-DCT VLSI chip designed according to this algorithm may process different sizes of DCT under software control. To illustrate the unique properties of this recursive scaled-DCT algorithm, the one-dimensional formulations are presented with several examples exhibited in signal flow-graph forms.
No associations
LandOfFree
Recursive scaled DCT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Recursive scaled DCT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursive scaled DCT will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1269006