Kethepalli Mallikarjuna, Kodati Satya Prasad, M. V. Subramanyam, Journal of Information Processing Systems Vol. 12, No. 4, pp. 754-764, Dec. 2016  

https://doi.org/10.3745/JIPS.02.0049
Keywords: Degree of Sparsity, Discrete Rajan Transform, Sparsification
Fulltext: PDF Full Text PubReader

Abstract

The exhaustive list of sparsification methods for a digital image suffers from achieving an adequate number of zero and near-zero coefficients. The method proposed in this paper, which is known as the Discrete Rajan Transform Sparsification, overcomes this inadequacy. An attempt has been made to compare the simulation results for benchmark images by various popular, existing techniques and analyzing from different aspects. With the help of Discrete Rajan Transform algorithm, both lossless and lossy sparse representations are obtained. We divided an image into 8×8-sized blocks and applied the Discrete Rajan Transform algorithm to it to get a more sparsified spectrum. The image was reconstructed from the transformed output of the Discrete Rajan Transform algorithm with an acceptable peak signal-to-noise ratio. The performance of the Discrete Rajan Transform in providing sparsity was compared with the results provided by the Discrete Fourier Transform, Discrete Cosine Transform, and the Discrete Wavelet Transform by means of the Degree of Sparsity. The simulation results proved that the Discrete Rajan Transform provides better sparsification when compared to other methods

Statistics
Cite this article