Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Australasian Computer Science Conference (ACSC '01)   p. 100
An Inference Implementation Based on Extended Weighted Finite Automata

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSC.2001.906629
Send link to a friend

Abstract
A similarity enrichment scheme for the application to image compression through the extension of weighted finite automata (WFA) has been recently proposed [1 ] by the authors. We shall here first establish additional theoretical results on the extended WFA of minimum states. We 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 Gauss-Seidel method, as well as the improvement on the decoding efficiency. The codec implemented this way will exemplify explicitly the performance gain due to extended WFA under otherwise the same conditions.
Additional Information
Index Terms- Weighted finite automata, inference algorithm, self-similarity, image compression.

Citation:  Zhuhan Jiang, Bruce Litow, Olivier de Vel, "An Inference Implementation Based on Extended Weighted Finite Automata," acsc, p. 100,  Australasian Computer Science Conference (ACSC '01),  2001

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback