An inference implementation based on extended weighted finite automata [for image compression]

Z. Jiang, B. Litow, O. De Vel

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

1 Citation (Scopus)

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 languageEnglish
Title of host publicationProceedings - 24th Australasian Computer Science Conference, ACSC 2001
EditorsMichael Oudshoom
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages100-108
Number of pages9
ISBN (Electronic)0769509630, 9780769509631
DOIs
Publication statusPublished - 2001
Externally publishedYes
Event24th Australasian Computer Science Conference, ACSC 2001 - Gold Coast, Australia
Duration: 29 Jan 20012 Feb 2001

Publication series

NameProceedings - 24th Australasian Computer Science Conference, ACSC 2001

Conference

Conference24th Australasian Computer Science Conference, ACSC 2001
Country/TerritoryAustralia
CityGold Coast
Period29/01/012/02/01

Bibliographical note

Publisher Copyright:
© 2001 IEEE.

Keywords

  • image compression
  • inference algorithm
  • self-similarity
  • Weighted finite automata

Fingerprint

Dive into the research topics of 'An inference implementation based on extended weighted finite automata [for image compression]'. Together they form a unique fingerprint.

Cite this