|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| S. Kundu, "On a Class of Linear Maps for Data Compression," IEEE Transactions on Software Engineering, vol. 8, no. 5, pp. 530-532, September, 1982. | |||
| BibTex | x | ||
| @article{ 10.1109/TSE.1982.235877, author = {S. Kundu}, title = {On a Class of Linear Maps for Data Compression}, journal ={IEEE Transactions on Software Engineering}, volume = {8}, number = {5}, issn = {0098-5589}, year = {1982}, pages = {530-532}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1982.235877}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - On a Class of Linear Maps for Data Compression IS - 5 SN - 0098-5589 SP530 EP532 EPD - 530-532 A1 - S. Kundu, PY - 1982 KW - redundancy reduction KW - Cluster analysis KW - computer algebra KW - data compression KW - dimensionality reduction KW - linear transformation KW - overhead storage VL - 8 JA - IEEE Transactions on Software Engineering ER - | |||
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.

