Share Email Print

Proceedings Paper

Modified metropolis annealing algorithm for QM-AYA arithmetic coder design optimization
Author(s): Joe-Ming Cheng; Glen G. Langdon
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The QM-Coder is an adaptive binary arithmetic coder for the JPEG and JBIG image compression standards. This coder employs a probability estimation state table (finite state machine). The present state corresponds to the current probability estimate. The estimate takes the form of the augend value that (on encode) is added to the code string if the less probable symbol occurs. The state changes only if the arithmetic coder experiences a renormalization. The QM-AYA coder is derived from the Q-Coder and the QM-Coder. A modified Metropolis method was used to fine-tune the QM-AYA augend values for improved compression performance. Heuristics in the search strategy to determine the next change in augend values reduce the estimated 54 year run time of the generalized annealing algorithm to 4 weeks.

Paper Details

Date Published: 20 October 1993
PDF: 11 pages
Proc. SPIE 2028, Applications of Digital Image Processing XVI, (20 October 1993); doi: 10.1117/12.158619
Show Author Affiliations
Joe-Ming Cheng, IBM AdStar (United States)
Glen G. Langdon, Univ. of California/Santa Cruz and IBM Almaden Research Ctr. (United States)

Published in SPIE Proceedings Vol. 2028:
Applications of Digital Image Processing XVI
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top