Unification and extension of weighted finite automata applicable to image compression
Jiang, Zhuhan, de Vel, Olivier, and Litow, Bruce (2003) Unification and extension of weighted finite automata applicable to image compression. Theoretical Computer Science, 302 (1-3). pp. 275-294.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://dx.doi.org/10.1016/S0304-3975(02)...
Weighted finite automata (WFA), including the linear WFA due to Culik and Kari and the acyclic WFA due to Hafner, have been under investigation over the years for their applications to image compression. We shall in this work first examine in great details the underlying WFA structure and propose the most systematic extension, along with its full legitimacy analysis, to the WFA that are applicable to image compression. A new mechanism based on the concept of resolution-wise and resolution-driven image mappings is developed to create rich families of legitimate similarity images so as to reduce the overall WFA size, a property that is critically related the performance of WFA-based compression codecs. Moreover, we shall also unify the relevant WFA by showing an acyclic WFA can always be merged into a linear WFA but not vice versa.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||image compression; self-similarity; weighted finite automata|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Deposited On:||22 Mar 2010 13:27|
|Last Modified:||18 Oct 2013 00:53|
Last 12 Months: 0
|Citation Counts with External Providers:|
Repository Staff Only: item control page