Earticle

초록

영어

The performance of image coding can be improved upon by using a special class of multiplierless discrete cosine transform using Ramanujan numbers termed as Ramanujan DCT (RDCT). Ramanujan ordered numbers are those which approximate 2π/N by 2 2 −l + −m , where l and m are integers. The cosine angles can then be computed using Chebyshev type of recursion using only shifters and adders. Fast forward and backward transformation may be achieved. Analysis and simulations show that the proposed RDCT maintains good de-correlation and energy compaction properties of the DCT and the error due to approximation is almost zero at lower spectral components and relatively low at higher spectral components. Simulation experiments are provided to justify that the proposed algorithm is best suited for image compression.

목차

Abstract
 1. Introduction
 2. Ramanujan ordered numbers
 3. Ramanujan discrete cosine transforms (RDCT)
  3.1 Evaluation of transform coefficients using Chebyshev Recursion [30]
  3.2 Properties of the Ramanujan ordered Number DCT:
 4. Performance of the proposed RDCT
  4.1 Computational Complexity
  4.2 Image compression employing RDCT.
 5. Conclusion
 References

키워드

저자

• Geetha.K.S. [ Dept. Of E&CE R.V.College of Engineering ]
• Uttara Kumari.M [ Dept. Of E&CE R.V.College of Engineering ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605