DocumentCode :
3756617
Title :
Comparison of SVD and FFT in Image Compression
Author :
Vinita Cheepurupalli;Sierra Tubbs;Khadijah Boykin;Naima Naheed
Author_Institution :
Spring Valley High Sch., Columbia, SC, USA
fYear :
2015
Firstpage :
526
Lastpage :
530
Abstract :
Two image compression methods are compared: Singular Value Decomposition (SVD) and Fast Fourier Transform (FFT). SVD is the factorization of a real or complex matrix, while FFT is an algorithm which allows low pass and high pass filtering with a great degree of accuracy. FFT is also a process that vastly reduces the time needed to compute large matrices. Distortion and compression ratios for each method were calculated at different parameters. Images were compressed without sacrificing significant image quality. Comparing the compression ratio, distortion, and visual quality of the images, FFT was determined to be the better of the two compression methods.
Keywords :
"Image coding","Distortion","Discrete Fourier transforms","Visualization","MATLAB","Symmetric matrices","Linear algebra"
Publisher :
ieee
Conference_Titel :
Computational Science and Computational Intelligence (CSCI), 2015 International Conference on
Type :
conf
DOI :
10.1109/CSCI.2015.56
Filename :
7424148
Link To Document :
بازگشت