Record Details

A variation on SVD based image compression

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A variation on SVD based image compression
 
Creator RANADE, ABHIRAM
MAHABALARAO, SRIKANTH S
KALE, SATYEN
 
Subject discrete cosine transforms
heuristic methods
learning algorithms
support vector machines
 
Description We present a variation to the well studied SVD based image compression technique. Our variation can be viewed as a preprocessing step in which the input image is permuted as per a fixed, data independent permutation, after which it is fed to the standard SVD algorithm. Likewise, our decompression algorithm can be viewed as the standard SVD algorithm followed by a postprocessing step which applies the inverse permutation.
On experimenting with standard images we show that our method performs substantially better than the standard method. Typically, for any given compression quality, our method needs about 30% fewer singular values and vectors to be retained. We also present a bit allocation scheme and show that our method also performs better than the more familiar discrete cosine transform (DCT).
We show that the original SVD algorithm as well as our variation, can be viewed as instances of the Karhunen–Loeve transform (KLT). In fact, we observe that there is a whole family of variations possible by choosing different parameter values while applying the KLT. We present heuristic arguments to show that our variation is likely to yield the best compression of all these. We also present experimental evidence, which appears to justify our analysis.
 
Publisher Elsevier
 
Date 2009-05-10T09:18:05Z
2011-12-08T07:08:04Z
2011-12-26T13:01:59Z
2011-12-27T05:47:48Z
2009-05-10T09:18:05Z
2011-12-08T07:08:04Z
2011-12-26T13:01:59Z
2011-12-27T05:47:48Z
2007
 
Type Article
 
Identifier Image and Vision Computing 25(6), 771-777
0262-8856
10.1016/j.imavis.2006.07.004
http://hdl.handle.net/10054/1338
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1338
 
Language en