Pattern matching and lossy data compression on random fields

DOI10.1109/TIT.2003.809491zbMath1063.94006MaRDI QIDQ4680072

Ioannis Kontoyiannis

Publication date: 1 June 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Rate-distortion theory in information and communication theory (94A34)

Related Items (2)

ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES ⋮ On approximate pattern matching for a class of Gibbs random fields

This page was built for publication: Pattern matching and lossy data compression on random fields