This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On a Class of Linear Maps for Data Compression
September 1982 (vol. 8 no. 5)
pp. 530-532
S. Kundu, Electronics and Communication Science Unit, Indian Statistical Institute
A method for data compression with linear maps has been developed which is found to produce further reduction in overhead storage requirement, compression/decompression time, and clustering overhead as compared to the affine map method in certain cases. Algorithms have been developed for cluster minimization, cluster identification, and compression matrix calculation that may be applied with advantage in both the methods.
Index Terms:
redundancy reduction, Cluster analysis, computer algebra, data compression, dimensionality reduction, linear transformation, overhead storage
Citation:
S. Kundu, "On a Class of Linear Maps for Data Compression," IEEE Transactions on Software Engineering, vol. 8, no. 5, pp. 530-532, Sept. 1982, doi:10.1109/TSE.1982.235877
Usage of this product signifies your acceptance of the Terms of Use.