Issue No. 05 - September (1982 vol. 8)
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.
redundancy reduction, Cluster analysis, computer algebra, data compression, dimensionality reduction, linear transformation, overhead storage
S. Kundu, "On a Class of Linear Maps for Data Compression," in IEEE Transactions on Software Engineering, vol. 8, no. , pp. 530-532, 1982.