no code implementations • 29 Jul 2022 • D. F. G. Coelho, R. J. Cintra, F. M. Bayer, S. Kulasekera, A. Madanayake, P. A. C. Martinez, T. L. T. Silveira, R. S. Oliveira, V. S. Dimitrov
This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm.
no code implementations • 24 Sep 2016 • P. A. M. Oliveira, R. J. Cintra, F. M. Bayer, S. Kulasekera, A. Madanayake, V. A. Coutinho
Image and video compression simulations in popular standards shows good performance of the proposed transform.
no code implementations • 28 Jan 2015 • P. A. M. Oliveira, R. J. Cintra, F. M. Bayer, S. Kulasekera, A. Madanayake
In this paper, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT).
no code implementations • 13 Jan 2015 • U. S. Potluri, A. Madanayake, R. J. Cintra, F. M. Bayer, S. Kulasekera, A. Edirisuriya
The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio.
no code implementations • 24 Feb 2014 • V. A. Coutinho, R. J. Cintra, F. M. Bayer, S. Kulasekera, A. Madanayake
A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced.