Pattern matching and lossy data compression on random fields
From MaRDI portal
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Rate-distortion theory in information and communication theory (94A34)
Recommendations
- A suboptimal lossy data compression based on approximate pattern matching
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- On the performance of data compression algorithms based upon string matching
- On the role of pattern matching in information theory
- Source coding, large deviations, and approximate pattern matching
Cited in
(11)- Context-dependent multilevel pattern matching for lossless image compression
- Rate–Distortion Approach to Databases: Storage and Content-Based Retrieval
- A suboptimal lossy data compression based on approximate pattern matching
- Source coding, large deviations, and approximate pattern matching
- On the role of pattern matching in information theory
- scientific article; zbMATH DE number 1440100 (Why is no real title available?)
- Entropy of some models of sparse random graphs with vertex-names
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- scientific article; zbMATH DE number 2226643 (Why is no real title available?)
- Lossy Compression of General Random Variables
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680072)
