pith. sign in

arxiv: cs/0509086 · v1 · submitted 2005-09-28 · 💻 cs.IT · math.IT

Statistical Mechanical Approach to Lossy Data Compression:Theory and Practice

classification 💻 cs.IT math.IT
keywords algorithmcompressionachievablecasescomputationallydatalimitlossy
0
0 comments X
read the original abstract

The encoder and decoder for lossy data compression of binary memoryless sources are developed on the basis of a specific-type nonmonotonic perceptron. Statistical mechanical analysis indicates that the potential ability of the perceptron-based code saturates the theoretically achievable limit in most cases although exactly performing the compression is computationally difficult. To resolve this difficulty, we provide a computationally tractable approximation algorithm using belief propagation (BP), which is a current standard algorithm of probabilistic inference. Introducing several approximations and heuristics, the BP-based algorithm exhibits performance that is close to the achievable limit in a practical time scale in optimal cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.