Skip to main content

Similarity Enrichment in Image Compression through Weighted Finite Automata

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

Abstract

We propose and study in details a similarity enrichment scheme for the application to the image compression through the extension of the weighted finite automata (WFA). We then develop a mechanism with which rich families of legitimate similarity images can be systematically created so as to reduce the overall WFA size, leading to an eventual better WFA-based compression performance. A number of desirable properties, including WFA of minimum states, have been established for a class of packed WFA. Moreover, a codec based on a special extended WFA is implemented to exemplify explicitly the performance gain due to extended WFA under otherwise the same conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jiang Z, Wavelet based image compression under minimum norms and vanishing moments, in Yan H, Eades P, Feng D D and Jin J (edrs), Proceedings of PSA Workshop on Visual Information Processing, (1999)1–5.

    Google Scholar 

  2. Culik II K and Kari J, Image compression using weighted finite state automata, Computer Graphics 17 (1993)305–313.

    Article  Google Scholar 

  3. Hafner U, Refining image compression with weighted finite automata, Proceedings of Data Compression Conference, edrs. Storer J and Cohn M, (1996)359–368.

    Google Scholar 

  4. Hafner U, Weighted finite automata for video compression, IEEE Journal on Selected Areas in Communications, edrs. Enami K, Krikelis A and Reed T R, (1998)108–119.

    Google Scholar 

  5. Culik II K and Kari J, Inference algorithm for WFA and image compression, in Fisher Y (edr), Fractal Image Compression: theory and application, Springer, New York 1995.

    Google Scholar 

  6. Litow B and De Vel O, A recursive GSA acquisition algorithm for image compression, TR 97/2, Department of Computer Science, James Cook University 1997.

    Google Scholar 

  7. Culik II K and Karhumaki, Finite automata computing real functions, SIAM Journal of Computations 23 (1994)789–814.

    Article  MATH  MathSciNet  Google Scholar 

  8. Culik II K, Dube S and Rajcani P, Effective compression of wavelet coefficients for smooth and fractal-like data, Proceedings of Data Compression Conference, edrs. Storer J and Cohn M, (1993)234–243.

    Google Scholar 

  9. Culik II K and Fris I, Weighted finite transducers in image processing, Discrete Applied Mathematics 58 (1995)223–237.

    Article  MATH  MathSciNet  Google Scholar 

  10. Pereira F C and Riley M D, Speech recognition by composition of weighted finite automata, At&T Labs, Murray Hill 1996.

    Google Scholar 

  11. Culik II K and Valenta V, Finite automata based compression of bi-level and simple color images, presented at the Data Compression Conference, Snowbird, Utah 1996.

    Google Scholar 

  12. Jiang Z, Litow B and De Vel O, Theory of packed finite state automata, Technical Report 99-173, University of New England, June 1999.

    Google Scholar 

  13. Laine A (edr), Wavelet Theory and Application: A Special Issue of the Journal of Mathematical Imaging and Vision, Kluwer, Boston 1993.

    Google Scholar 

  14. Lenz R, Group Theoretical Methods in Image Processing, Lecture Notes in Computer Science 413, Springer, Berlin 1990.

    Google Scholar 

  15. Jiang Z, Lie symmetries and their local determinancy for a class of differential-difference euqations, Physics Letters A 240 (1998)137–143.

    Article  MATH  MathSciNet  Google Scholar 

  16. Jiang Z, The intrinsicality of Lie symmetries of \( u_n^{(k)} (t) = F_n (t,u_{n + a} ,...,u_{n + b} ) \) , Journal of Mathematical Analysis and Applications 227 (1998)396–419.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, Z., Litow, B., de Vel, O. (2000). Similarity Enrichment in Image Compression through Weighted Finite Automata. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics