New algorithms for multidimensional discrete Hartley transform
Signal Processing
Combined Polynomial Transform and Radix-q Algorithm for Multi-dimensional DCT-III
Multidimensional Systems and Signal Processing
A Neural Approach to Compression of Hyperspectral Remote Sensing Imagery
Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
An adaptive three-dimensional DCT compression based on motion analysis
Proceedings of the 2003 ACM symposium on Applied computing
Scalable video coding based on three-dimensional discrete pseudo cosine transform
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Journal of Real-Time Image Processing
| Hi-index | 0.01 |
Three-dimensional discrete cosine transform (3-D DCT) coding has the advantage of reducing the interframe redundancy among a number of consecutive frames, while the motion compensation technique can only reduce the redundancy of at most two frames. However, the performance of the 3-D DCT coding will be degraded for complex scenes with a greater amount of motion. This paper presents a 3-D DCT coding with a variable temporal length that is determined by the scene change detector. Our idea is to let the motion activity in each block be very low, while the efficiency of the 3-D DCT coding could be increased. Experimental results show that this technique is indeed very efficient. The present approach has substantial improvement over the conventional fixed-length 3-D DCT coding and is also better than that of the Moving Picture Expert Group (MPEG) coding