Classification of run-length encoded binary data

DOI10.1016/J.PATCOG.2006.05.002zbMath1103.68744OpenAlexW2068667717MaRDI QIDQ853145

N. E. Zubov

Publication date: 15 November 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.05.002

zbMATH Keywords

run-lengthclassification of compressed datanon-lossy compression

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING

Cites Work

• Approximate matching of run-length compressed strings

This page was built for publication: Classification of run-length encoded binary data