By Topic

Bi-level image compression using adaptive tree model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Nguyen-Phi ; Wien Univ., Austria ; H. Weinrichter

Summary form only given. State-of-the-art methods for bi-level image compression rely on two processes of modelling and coding. The modelling process determines the context of the coded pixel based on its adjacent pixels and using the information of the context to predict the probability of the coded pixel being 0 or 1. The coding process will actually code the pixel based on the prediction. Because the source is finite, a bigger template (more adjacent pixels) doesn't always lead to a better result, which is known as “context dilution” phenomenon. The authors present a new method called adaptive tree modelling for preventing the context dilution. They discussed this method by considering a pruned binary tree. They have implemented the proposed method in software

Published in:

Data Compression Conference, 1997. DCC '97. Proceedings

Date of Conference:

25-27 Mar 1997