Notice of Violation of IEEE Publication PrinciplesA DCT approximation with low complexity for image compression

Notice of Violation of IEEE Publication Principles

"A DCT Approximation with Low Complexity for Image Compression"
by K. Saraswathy, D. Vaithiyanathan, and R. Seshasayanan
in the Proceedings of the International Conference on Communication and Signal Processing, April 2013, pp. 465-468

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.

This paper contains portions of text from the paper(s) cited below. A credit notice is used, but due to the absence of quotation marks or offset text, copied material is not clearly referenced or specifically identified.

"A DCT Approximation for Image Compression"
Renato J. Cintra and Fabio M. Bayer
in IEEE Signal Processing Letters, Vol 18, No 10, October 2011, pp. 579-582

This paper introduces an orthogonal approximation for the 8 point Discrete Cosine Transform (DCT). The proposed transformation matrix contains only ones and zeros. Bit shift operations and multiplication operations are absent. The approximate transform of DCT is obtained to meet the low complexity requirements. The implied transformation and approximation are orthogonal and are based on polar decomposition methods. The low complexity introduced in DCT reduces power consumption. The proposed image compression algorithm is comprehended using Matlab code. The proposed algorithm is less complex than Signed Discrete Cosine Transform (SDCT) and it requires two additional operations when compared to Bouguezel-Ahmed-Swamy (BAS) series of algorithms.