We propose a new algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pattern matching and is modelled after the Lempel-Ziv (LZ78) algorithm. As the key new idea, we introduce a codeword selection principle, Codelet Parsing, to choose from various approximately matching codewords of possibly different lengths. To implement this selection, the algorithm examines the "empirical mutual information" between the source and the distorted sequences,. The algorithm is sequential, adaptive, and can be implemented in quadratic-time in the length of the source sequence. For several memoryless Bernoulli sources with Hamming distortion, we experimentally demonstrate the surprising result that the empirical distributions o f the distorted sequences are close to their respective "optimal reproduction distributions."
By: Dharmendra S. Modha
Published in: RJ10286 in 2003
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .