loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '95)
Finite state methods for compression and manipulation of images
Snowbird, Utah
March 28-March 30
ISBN: 0-8186-7012-6
ASCII Text
x 
 
K. Culik, II, J. Kari, "Finite state methods for compression and manipulation of images," Data Compression Conference, pp. 142, Data Compression Conference (DCC '95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/DCC.1995.515504,
author = {K. Culik, II and J. Kari},
title = {Finite state methods for compression and manipulation of images},
journal ={Data Compression Conference},
volume = {0},
year = {1995},
isbn = {0-8186-7012-6},
pages = {142},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.1995.515504},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Finite state methods for compression and manipulation of images
SN - 0-8186-7012-6
SP
EP
A1 - K. Culik, II,
A1 - J. Kari,
PY - 1995
KW - finite state machines; finite automata; data compression; image coding; finite state methods; color images; image manipulation; weighted finite automata; gray-scale images; image compression software; weighted finite transducers; image transformations
VL - 0
JA - Data Compression Conference
ER -
 
K. Culik, II, Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA
J. Kari, Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA
Weighted finite automata (WFA) is a tool for specifying real functions and in particular grayscale images. The image compression software based on this algorithm is competitive with other methods in compression of typical grayscale images. It performs particularly well for high compression rates, for color images, and compared to other methods it has several additional advantages. This paper mainly deals with image manipulation. Weighted finite transducers (WFT) can be used to specify the widest variety of image transformations (linear operators on grayness functions). The authors briefly introduce WFA and WFT and give some examples of image transformations specified by WFT.
Index Terms:
finite state machines; finite automata; data compression; image coding; finite state methods; color images; image manipulation; weighted finite automata; gray-scale images; image compression software; weighted finite transducers; image transformations
Citation:
K. Culik, II, J. Kari, "Finite state methods for compression and manipulation of images," dcc, pp.142, Data Compression Conference (DCC '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.