SciELO - Scientific Electronic Library Online

 
vol.13 número1Usando Aprendizaje Automático para Extraer Información de Noticias de Desastres NaturalesReconocimiento de Patrones para la Fabricación de Microobjetos índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Computación y Sistemas

versão On-line ISSN 2007-9737versão impressa ISSN 1405-5546

Resumo

HERRERA ALCANTARA, Oscar  e  ZARAGOZA MARTINEZ, Francisco Javier. Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery. Comp. y Sist. [online]. 2009, vol.13, n.1, pp.45-60. ISSN 2007-9737.

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.

Palavras-chave : Incompressibility; Data Compression; Information Theory; Pattern Discovery; Clustering.

        · resumo em Espanhol     · texto em Inglês

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons