Research on 2-D DCT Algorithm and Performance Based on Transform Basic Matrix

2011 ◽  
Vol 58-60 ◽  
pp. 2570-2575
Author(s):  
Wen Bang Sun ◽  
He Xin Chen ◽  
Wen Bing Sun ◽  
Mai Yu Zhou

With the development of information processing technology, 2-D DCT has been used more and more widely. But the 2-D DCT is accomplished by computing twice 1-D DCT successively, and cannot embody the total space characteristic of 2-D transform well. To overcome such drawbacks, the paper has broken the traditional thinking of DCT operation, and proposed 2-D SDCT operation method. First, some new 2-D matrix operation principles are defined. Then, the transform basic matrix used for 2-D SDCT operation was build and the operation principle of 2-D SDCT is described in detail. Finally, the performance of 2-D SDCT was described systematically. The theoretical analysis shows that the proposed method makes 2-D DCT succinct to express, easy to comprehend and convenient to operate.

2011 ◽  
Vol 63-64 ◽  
pp. 987-990
Author(s):  
Wen Bang Sun ◽  
He Xin Chen ◽  
Wen Bing Sun ◽  
Hai Yan Tang

With the development of information processing technology, DCT has been used more and more widely. But multidimensional DCT hasn’t unified matrix expressions, and operates using 1-D DCT to each dimension successively, which cannot embody the overall space character of multidimensional transform well. So, a new SDCT method was proposed in the paper. First, several matrix operation methods were defined. Then, the operation principle of 1-D DCT, 2-D DCT and 3-D SDCT was described in detail. The theoretical analysis shows that the SDCT makes DCT unified and succinct to express, easy to comprehend and convenient to operate.


2011 ◽  
Vol 63-64 ◽  
pp. 523-527
Author(s):  
Wen Bang Sun ◽  
He Xin Chen ◽  
Hong Chen ◽  
Wen Bing Sun

Now, 2-D DCT has been used widely. But the 2-D DCT is operated by two-time1-D DCT successively, which can’t embody the space characteristic of 2-D transform well. To overcome such drawbacks, the paper proposed 2-D SDCT operation method. Firstly, some matrix operation principles are defined. Then, the transform basic matrix used for SDCT operation was build and the operation principle of SDCT is described in detail. Finally, the performance of 2-D SDCT was described systematically. The theoretical analysis shows that the proposed method makes 2-D DCT succinct to express, easy to comprehend and convenient to operate.


2013 ◽  
Vol 756-759 ◽  
pp. 1571-1575
Author(s):  
Hai Yan Tang ◽  
Wen Bang Sun ◽  
De Bao Zhang ◽  
Yan Chang

Nowadays, 2-D DCT is applied widely. But the transform matrix of DCT is expressed with floating-point numbers, so the computational complexity is high and more system resources are occupied. In addition, the 2-D DCT is accomplished by operating 1-D DCT to the rows and columns of 2-D data successively, which cannt embody the total space characteristic of 2-D transform well. To overcome these drawbacks, 2-D integer SDCT (Sub-matrix Discrete Cosine Transform) was proposed in the paper. First, several matrix operation methods were defined. Then, the basic principle of 2-D integer SDCT was deduced in detail. The theoretic analysis show that 2-D integer SDCT is easy to comprehend, convenient to operate, and simplifies the calculation of 2-D DCT.


2014 ◽  
Vol 701-702 ◽  
pp. 413-417
Author(s):  
Jie Ran ◽  
Ji Ya Huang ◽  
Zu Xiao

Word similarity computing is a crucial question in information processing technology. In this paper, an integrated word similarity computing method is proposed by analyzed morpheme's similarity, word order's similarity and word length's similarity, and parameters of the method are decided by experiments. The experiments show that this method has high efficiency.


Cryogenics ◽  
1991 ◽  
Vol 31 (12) ◽  
pp. 1044-1052 ◽  
Author(s):  
M.D. Atrey ◽  
S.L. Bapat ◽  
K.G. Narayankhedkar

Sign in / Sign up

Export Citation Format

Share Document