Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery
We present a novel method for lossless data compression that aims to get a different performance to those proposed in the last decades to tackle the underlying volume of data of the Information and Multimedia Ages. These latter methods are called entropic or classic because they are based on the Cla...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | México |
| Institución: | Universidad Autónoma Metropolitana |
| Repositorio: | Redalyc-UAM |
| OAI Identifier: | oai:redalyc.org:61513250005 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=61513250005 |
| Access Level: | acceso abierto |
| Palabra clave: | Computación Clustering Data Compression Incompressibility Pattern Discovery Information Theory |
| Sumario: | We present a novel method for lossless data compression that aims to get a different performance to those proposed in the last decades to tackle the underlying volume of data of the Information and Multimedia Ages. These latter methods are called entropic or classic because they are based on the Classic Information Theory of Claude E. Shannon and include Huffman [8], Arithmetic [14], Lempel-Ziv [15], Burrows Wheeler (BWT) [4], Move To Front (MTF) [3] and Prediction by Partial Matching (PPM) [5] techniques. We review the Incompressibility Theorem and its relation with classic methods and our method based on discovering symbol patterns called metasymbols. Experimental results allow us to propose metasymbolic compression as a tool for multimedia compression, sequence analysis and unsupervised clustering. |
|---|