Abstract
A similarity enrichment scheme for the application to image compression through the extension of weighted finite automata (WFA) has been recently proposed (2000) by the authors. In this paper, they first establish additional theoretical results on the extended WFA of minimum states. They then devise an effective inference algorithm and its concrete implementation through the consideration of WFA of minimum states, image approximation in least-squares, state image intensity generation via the Gauss-Seidel method, as well as the improvement of the decoding efficiency. The codec implemented in this way explicitly exemplifies the performance gain due to extended WFA under otherwise the same conditions.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 24th Australasian Computer Science Conference, ACSC 2001 |
| Editors | Michael Oudshoom |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 100-108 |
| Number of pages | 9 |
| ISBN (Electronic) | 0769509630, 9780769509631 |
| DOIs | |
| Publication status | Published - 2001 |
| Externally published | Yes |
| Event | 24th Australasian Computer Science Conference, ACSC 2001 - Gold Coast, Australia Duration: 29 Jan 2001 → 2 Feb 2001 |
Publication series
| Name | Proceedings - 24th Australasian Computer Science Conference, ACSC 2001 |
|---|
Conference
| Conference | 24th Australasian Computer Science Conference, ACSC 2001 |
|---|---|
| Country/Territory | Australia |
| City | Gold Coast |
| Period | 29/01/01 → 2/02/01 |
Bibliographical note
Publisher Copyright:© 2001 IEEE.
Keywords
- image compression
- inference algorithm
- self-similarity
- Weighted finite automata