Tree Encoding of Images in the Presence of Channel Errors

James W. Modestino, Vasudev Bhaskaran, John B. Anderson

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


The performance and complexity of tree encoding of images in the presence of channel errors is considered. The authors demonstrate that a variation of (M, L) algorithm yields performance close to the rate-distortion bound in the absence of channel errors for synthetic images modeled as two-dimensional autoregressive random fields. Trade-offs in optimizing the choice of tree search parameters are described, and experimental results on real-world images are presented. Simple tree search procedures are shown to provide signal-to-noise improvements in excess of 5 db over conventional two-dimensional DPCM at the important rate of one bit/pixel; the effect is clear and striking to the eye. Channel error effects are treated by computer simulation and demonstrate signal-to-noise ratio improvement as high as 8 db using tree encoding.

Original languageEnglish (US)
Pages (from-to)677-697
Number of pages21
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Nov 1981

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Tree Encoding of Images in the Presence of Channel Errors'. Together they form a unique fingerprint.

Cite this