On approximate pattern matching for a class of Gibbs random fields

DOI10.1214/105051605000000827zbMath1131.60046arXivmath/0503008OpenAlexW2886799933MaRDI QIDQ997946

Evgeny Verbitskiy, Jean Rene Chazottes, Frank Redig

Publication date: 8 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0503008

zbMATH Keywords

large deviationshitting timeexponential lawrate distortion

Mathematics Subject Classification ID

Random fields (60G60) Central limit and other weak theorems (60F05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Large deviations (60F10) Rate-distortion theory in information and communication theory (94A34)

Cites Work

• Gibbs measures and phase transitions
• The asymptotics of waiting times between stationary processes, allowing distortion
• Exponential distribution for the occurrence of rare patterns in Gibbsian random fields
• A suboptimal lossy data compression based on approximate pattern matching
• Source coding, large deviations, and approximate pattern matching
• Pattern matching and lossy data compression on random fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On approximate pattern matching for a class of Gibbs random fields