Showing papers on "Modified discrete cosine transform published in 1985"
TL;DR: A two-dimensional fast cosine transform algorithm (2-D FCT) is developed for 2m× 2ndata points, an extended version of the 1- D FCT algorithm introduced in a recent paper, but with significantly reduced computations for a 2-D field.
Abstract: A two-dimensional fast cosine transform algorithm (2-D FCT) is developed for 2m× 2ndata points. This algorithm is an extended version of the 1-D FCT algorithm introduced in a recent paper, but with significantly reduced computations for a 2-D field. The rationale for this 2-D FCT is a 2-D decomposition of data sequences into 2- D subblocks with reduced dimension (halves), rather than serial, one-dimensional, separable treatment for the columns and rows of the data sets. Computer simulation for the 2-D FCT algorithms, using a smaller block of data and finite word precision, proves to be excellent in comparison with the direct 2-D discrete cosine transform (2-D DCT). An example of a 4 × 4 2-D inverse fast cosine transform (2-D IFCT) algorithm development is presented in this paper, together with a signal flow graph.
146 citations
TL;DR: Quantitative and qualitative results are presented for evaluating the various alternatives for the application of the Disscrete Cosine Transform and it is shown that a convenient choice is the threshold sampling method applied to transformed blocks of size.
5 citations
06 Nov 1985
4 citations
01 Jan 1985
2 citations
TL;DR: An efficient encoding technique using discrete cosine transform (DCT) for bandwidth compression is described and excellent performance is demonstrated in terms of subjective quality.
Abstract: An efficient encoding technique using discrete cosine transform (DCT) for bandwidth compression is described. Real-time one-dimensional DCT has been developed by maintaining a balance between complexity of implementation and performance. Excellent performance is demonstrated in terms of subjective quality.
1 citations