Por favor, use este identificador para citar o enlazar este ítem:
http://repositoriodigital.ipn.mx/handle/123456789/15426
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Herrera Alcántara, Oscar | - |
dc.contributor.author | Zaragoza Martínez, Francisco Javier | - |
dc.date.accessioned | 2013-04-25T18:39:16Z | - |
dc.date.available | 2013-04-25T18:39:16Z | - |
dc.date.issued | 2009-08-15 | - |
dc.identifier.citation | Revista Computación y Sistemas; Vol. 13 No.1 | es |
dc.identifier.issn | 1405-5546 | - |
dc.identifier.uri | http://www.repositoriodigital.ipn.mx/handle/123456789/15426 | - |
dc.description.abstract | Abstract. 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. | es |
dc.description.sponsorship | Instituto Politécnico Nacional - Centro de Investigación en Computación (CIC). | es |
dc.language.iso | en_US | es |
dc.publisher | Revista Computación y Sistemas; Vol. 13 No.1 | es |
dc.relation.ispartofseries | Revista Computación y Sistemas;Vol. 13 No.1 | - |
dc.subject | Keywords. Incompressibility, Data Compression, Information Theory, Pattern Discovery, Clustering. | es |
dc.title | Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery | es |
dc.title.alternative | Incompresibilidad y compresión de datos sin pérdidas: Un acercamiento con descubrimiento de patrones | es |
dc.type | Article | es |
dc.description.especialidad | Investigación en Computación | es |
dc.description.tipo | es | |
Aparece en las colecciones: | Revistas |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
v13no1_Art04.pdf | 372.9 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.