Improvement of image processing speed of the 2D Fast Complex Hadamard Transform

  • Fujita, Yasuhito (Department of Electronic and Bioinformatics, School of Science and Technology Meiji University) ;
  • Tanaka, Ken-Ichi (Department of Electronic and Bioinformatics, School of Science and Technology Meiji University)
  • 발행 : 2009.01.12

초록

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

키워드