Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Near-lossless image compression schemes based on weighted finite automata encoding and adaptive context modelling

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
$31 $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)
Bao, P. ; Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, Hong Kong ; Xiaolin Wu

We study high-fidelity image compression with a given tight bound on the maximum error magnitude. We propose a weighted finite automata (WFA) recursive encoding scheme on the adaptive context modelling based quantizing prediction residue images. By incorporating the proposed recursive WFA encoding techniques into the context modelling based nearly-lossless CALIC (context based adaptive lossless image codec), we were able to increase its PSNR by 1.5 dB or more and get compression rates 15 per cent or better than the original CALIC. By combining wavelet methods and WFA encoding, we were able to obtain competitive PSNR results against the best wavelet coders in both L2 and L∞ metrics, while obtaining much smaller maximum error magnitude than the latter

Published in:

Compression and Complexity of Sequences 1997. Proceedings

Date of Conference:

11-13 Jun 1997