Better Scheme for Multimedia Compression using Random Discrete Fractional Fourier Transform for Jpeg 2000 Standard

Deepak Sharma*, Udita Arora**, Prakram Suri***, Rishabh Tripathi****
* Research Scholar and Assistant Professor, Department of Electronics and Communication Engineering, Jaypee University of Engineering & Technology
**-**** Student, Department of Electronics and Communication Engineering, Jaypee University of Engineering & Technology.
Periodicity:January - March'2015
DOI : https://doi.org/10.26634/jip.2.1.3265

Abstract

Rapid growth of high quality multimedia (HD) and exchange of data over internet with less storage space and fast processing attracted researchers in the area of compression. Compression is the technique of reducing the image size without degrading the quality of the image. In this work, a commuting matrix with random discrete Fourier transform (DFT) eigenvectors is first constructed. A Random Discrete Fractional Fourier Transform (RDFRFT) kernel matrix with random DFT eigenvectors and eigenvalues is then utilized in image compression. The RDFRFT has an important feature that the magnitude and phase of its transform output are both random. Later, a compression scheme based on random discrete fractional Fourier transform is compared with Discrete Cosine Transform (DCT) and discrete wavelet transform (DWT) based image compression schemes. The given image is subdivided and RDFRFT is applied for each subdivided image to transformed coefficients and reverse order of RDFRFT is applied for reconstruction of original images. The performance of compression scheme based on RDFRFT shows better performance over DFRFT, DCT and DWT based scheme for any multimedia contents. The performance of the proposed scheme is observed on JPEG standard image for prime evaluation parameters such as Peak Signal-to-Noise Ratio (PSNR), Mean Square Error (MSE) and Compression Ratio (CR) for RDFRFT, DCT and DWT based scheme on MATLAB software platform. In addition, the proposed scheme has following advantages: it shows the same computation complexity as DFRFT based system and the feature of additional security can also be incorporated with RDFRFT which is not very significant in case of FRFT and DFRFT based system.

Keywords

Compression Ratio (CR), Discrete Fractional Fourier Transform (DFRFT), Fractional Fourier Transform (FRFT), Mean square error (MSE), Random Discrete Fractional Fourier Transform (RDFRFT), Peak Signal to Noise Ratio (PSNR).

How to Cite this Article?

Sharma, D., Arora, U., Suri, P., and Tripathi, R. (2015). Better Scheme for Multimedia Compression using Random Discrete Fractional Fourier Transform for Jpeg 2000 Standard. i-manager’s Journal on Image Processing, 2(1), 28-35. https://doi.org/10.26634/jip.2.1.3265

References

[1]. J. S. Lim, (1990). Two-Dimensional Signal and Image Processing, Englewood Cliffs, NJ, Prentice Hall.
[2]. K. R. Rao and P. C. Yip, (2001). “The Transform and Data Compression Handbook”, CRC Press, New York.
[3]. Satish K. Singh and Shishir Kumar, (2010). “Mathematical transforms and image compression: A review” Maejo International Journal of Science and Technology Maejo Int. J. Sci. Technol., Vol. 4, No. 2, pp. 235-249.
[4]. V. Namias, (1980). “The fractional order Fourier transform and its application to quantum mechanics,” J. Inst. Math. Appl., Vol. 25, No. 3, pp. 241–265.
[5]. L. B. Almeida, (1994). “The fractional Fourier transform and time-frequency representations,” IEEE Trans. Signal Processing, Vol. 42, No. 11, pp. 3084–3091.
[6]. S. C. Pei and M. H. Yeh, (1997). “Improved discrete fractional Fourier transform,” Opt. Lett., Vol. 22, No. 14, pp. 1047–1049.
[7]. C. Candan, M. A. Kutay, and H. M. Ozaktas, (2000). “The discrete fractional Fourier transform,” IEEE Trans. Signal Process., Vol. 48, No. 5, pp. 1329–1337.
[8]. S. C. Pei and W. L. Hsue, (2006). “The multipleparameter discrete fractional Fourier transform,” IEEE Signal Process. Lette., Vol. 13, No. 6, pp. 329–332.
[9]. B. W. Dickinson and K. Steiglitz, (1982). “Eigenvectors and functions of the discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Process., Vol. ASSP-30, pp. 25–31.
[10]. Z. Liu and S. Liu, (2007). “Randomization of the Fourier transform,” Opt. Lett., Vol. 32, pp. 478–480.
[11]. S. C. Pei, M. H. Yeh, and C. C. Tseng, (1999). “Discrete fractional Fourier transform based on orthogonal projection,” IEEE Trans. Signal Processing, Vol. 47, No. 5, pp. 1335–1348.
[12]. Soo-Chang Pei and Wen-Liang Hsue, (2009). “Random Discrete Fractional Fourier Transform”, IEEE Signal Processing Letters, Vol. 16, No. 12, pp. 1015-1018.
[13]. Prabhakar.Telagarapu, V.Jagan Naveen, A.Lakshmi..Prasanthi, G.Vijaya Santhi, (2011). “Image Compression Using DCT and Wavelet Transformations” International Journal of Signal Processing, Image Processing and Pattern Recognition, Vol. 4, No. 3, pp. 61- 74.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.