Research Article

Statistical Image Compression using Fast Fourier Coefficients

by  M. Kanaka Reddy, V. V. Haragopal, S. A. Jyothi Rani
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 155 - Issue 3
Published: Dec 2016
Authors: M. Kanaka Reddy, V. V. Haragopal, S. A. Jyothi Rani
10.5120/ijca2016912282
PDF

M. Kanaka Reddy, V. V. Haragopal, S. A. Jyothi Rani . Statistical Image Compression using Fast Fourier Coefficients. International Journal of Computer Applications. 155, 3 (Dec 2016), 31-36. DOI=10.5120/ijca2016912282

                        @article{ 10.5120/ijca2016912282,
                        author  = { M. Kanaka Reddy,V. V. Haragopal,S. A. Jyothi Rani },
                        title   = { Statistical Image Compression using Fast Fourier Coefficients },
                        journal = { International Journal of Computer Applications },
                        year    = { 2016 },
                        volume  = { 155 },
                        number  = { 3 },
                        pages   = { 31-36 },
                        doi     = { 10.5120/ijca2016912282 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2016
                        %A M. Kanaka Reddy
                        %A V. V. Haragopal
                        %A S. A. Jyothi Rani
                        %T Statistical Image Compression using Fast Fourier Coefficients%T 
                        %J International Journal of Computer Applications
                        %V 155
                        %N 3
                        %P 31-36
                        %R 10.5120/ijca2016912282
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Uncompressed images occupy more memory and it contains redundant data. For storage and transmission efficiency compression is required. The purpose of image compression is to reduce the number of bits to represent in image while maintaining visual quality of images. In this paper we implement the Fast Fourier co efficient Transform with non overlapping 3 x 3, 9 x 9 and 27x 27 block sizes of the images. The purpose of the study is to reduce the original image into asmall set of pixels by using the Fourier coefficients with this idea the compression is successfully implemented on various images, computed the Peak Signal Noise Ratio (PSNR) and Compression Ratio (CR) for the various images.

References
  • Ghafourian, M., and Huang.1995 Comparison between several adaptive search vector quantization schemes and JPEG standard for image compression, IEEE
  • Donoho, D. L., and I. Johnstone, M. 1998 Minimax estimation viawavelet shrinkage, Annals of Statistics 26, 879–921.
  • Shapiro J. 1993 Embedded image coding using zero trees of wavele Coefficients, IEEE Trans. on Signal Processing, pp: 3445-3462
  • Rafael C Gonzalez, Richard E Woods (2008), “Digital Image Processing” Low price edition, Pearson education, ISBN – 978-81-317-1934-3.
  • Chanda, Majumder Dutta B (2004),“Digital Image Processing and Analysis” Prentice –Hall of India.
  • Padmaja.N (2012), “A statistical Approach to Feature Extraction & Image Compression”, Ph.D thesis.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Fast Fourier Transform (FFT) Root Mean Square Error (RMSE) Compression Ratio (CR) Peak Signal Noise Ratio (PSNR) Image.

Powered by PhDFocusTM