Fast algorithm for the 3-D DCT-II

@article{Boussakta2004FastAF,
  title={Fast algorithm for the 3-D DCT-II},
  author={Said Boussakta and Hamoud O. Alshibami},
  journal={IEEE Transactions on Signal Processing},
  year={2004},
  volume={52},
  pages={992-1001}
}
Recently, many applications for three-dimensional (3-D) image and video compression have been proposed using 3-D discrete cosine transforms (3-D DCTs). Among different types of DCTs, the type-II DCT (DCT-II) is the most used. In order to use the 3-D DCTs in practical applications, fast 3-D algorithms are essential. Therefore, in this paper, the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm that calculates the 3-D DCT-II directly is introduced. The mathematical analysis and the… 

Figures and Tables from this paper

On the computation of the 3-D DCT
  • T. Mekky, S. Boussakta, M. Darnell
  • Computer Science, Engineering
    10th IEEE International Conference on Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003
  • 2003
TLDR
The row-column-frame (RCF) and the 3-D vector radix (3-D VR) algorithms are investigated and compared based on their arithmetic operations and computer-run times and show that the 3.D VR algorithm is clearly faster and more efficient than the RCF approach.
New fast and area-efficient pipeline 3-D DCT architectures
FPGA Implementation of Low Complexity Video Encoder using Optimized 3 D-DCT
TLDR
The three-dimensional DCT circuit can be realized using few additions and subtractions, thus increasing the area efficiency with low complexity, and the proposed architecture is coded in Verilog HDL, synthesized inXilinx ISE design suite 14.2 and physically realized as a digital prototype circuit using Xilinx Virtex-5 FPGA.
Enlargement and reduction of image/video via discrete cosine transform pair, part 1: novel three-dimensional discrete cosine transform and enlargement
TLDR
Novel matrix-form representations of the conventional forward three-dimensional (3-D) discrete cosine trans- form (DCT) and the inverse 3-D DCT pair are proposed that enable good performance for scaling algo- rithms of sequences, images, and videos, as expected.
Fast 8 8 8 RCF 3 D _ DCT / IDCT transform for real time video compression and its FPGA Implementation
TLDR
An efficient fast Row Column Frame (RCF) 3D_DCT algorithm recently introduced in video compression that makes important savings on arithmetic operations, even if there is a little decrease on the quality of the videos but it respects the video standards.
FAST 888 RCF 3D_DCT/IDCT TRANSFORM FOR REAL TIME VIDEO COMPRESSION AND ITS FPGA IMPLEMENTATION
TLDR
An efficient fast Row Column Frame (RCF) 3D_DCT algorithm recently introduced in video compression that makes important savings on arithmetic operations, even if there is a little decrease on the quality of the videos but it respects the video standards.
An approach to adaptive 3D-DCT based motion level prediction algorithm for improved 3D-DCT video coding
TLDR
Experimental results reveals that without any motion compensation technique, the proposed 3D-DCT algorithm which adaptively selects the cube size relative to the motion content of video sequence gives better performance in terms of reduction in the data rate and speed up the encoding process compared to the existing 3D -DCT based video compression algorithm.
Novel Method for Fast 3D DCT for Video Compression
TLDR
An adaptive coding method based on the algorithm of fast three-dimensional Cosine transform, invariant to the properties of moving objects in video sequences such as dynamics of movement, size and accessory to foreground and significantly reduces the computational cost while increasing the quality of the final video sequences.
Compression of a 2D Image Using 3D-DCT
TLDR
It is shown that images that are transformed using 3D DCT have quality close to that of 2D D CT transformed images and it results in higher compression ratios.
3D-DCT video watermarking using quantization-Based methods
TLDR
Video watermarking methods operating in the 3D-DCT domain using quantization-based embedding techniques are presented and robustness of the proposed method against a variety of both intentional and unintentional video attacks has been observed through experimental results.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
New algorithm for multidimensional type-III DCT
TLDR
The polynomial transform is used to convert the type- III MD-DCT into a series of one-dimensional type-III discrete cosine transforms (1-D-D CT-III), which achieves considerable savings on the number of operations compared to the row column method.
On the computation of two-dimensional DCT
TLDR
A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented and achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output indexing process.
COMPARATIVE PERFORMANCE EVALUATION OF ALGORITHMS FOR FAST COMPUTATION OF THE TWO-DIMENSIONAL DCT
TLDR
It is observed that the execution time of the 2D fast cosine transforms (FCT's) as a function of sequence length, when implemented on different computer architectures vary significantly although some of the examined algorithms have the same computational complexity (additions and multiplications).
A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding
TLDR
The proposed generalized fast computational algorithm for the n-dimensional discrete cosine transform of length N=2/sup m/ (m/spl ges/2) is proved and its efficiency is evaluated theoretically.
Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform
TLDR
The proposed algorithm is based on the principles of the divide-and-conquer approach applied directly in 3-D and has been found to offer significant savings in arithmetic operations compared with the row-column approach based on similar algorithms.
Variable temporal-length 3-D discrete cosine transform coding
TLDR
The 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, and experimental results show that this technique is indeed very efficient.
An adaptive 3-D discrete cosine transform coder for medical image compression
TLDR
A new three-dimensional (3-D) discrete cosine transform (DCT) coder for medical images is presented and it is found that the proposed method achieves better qualities of decoded images.
New polynomial transform algorithm for multidimensional DCT
TLDR
A new algorithm for the type-II multidimensional discrete cosine transform (MD-DCT) is proposed, based on the polynomial transform, which achieves considerable savings on the number of operations compared with the row-column method.
A new two-dimensional fast cosine transform algorithm
TLDR
Derivation based on both the sequence splitting and Kronecker matrix product method are discussed, which has the advantage that all the underlying operations are shown clearly, while the matrix product representations are more compact and readily generalized to higher dimensions.
Trade-off's in the computation of mono- and multi-dimensional DCT's
TLDR
The result is that a 3-D DCT can be obtained from a 3,D DFT (discrete Fourier transform) of the same size on reals at the cost of permutations and O(3/2N/sup 3/) multiplications.
...
...