1 January 1996 Image coding using finite state automata
Author Affiliations +
Optical Engineering, 35(1), (1996). doi:10.1117/1.600881
Abstract
Image coding using quadtrees is useful in many applications and is well known in computer vision and graphics. We draw a parallel between quadtrees and rational languages that are recognizable by finite state automata (FSA), also known as automata. The FSA are shown to be an interesting alternative to the corresponding quadtrees. Binary image (O= black, 1 = white) coding using a FSA follows these two steps: (1) automaton construction based on the image quadtree, (2) automaton minimization. The display of the coded image is simply obtained by stepping through the automaton. We demonstrate how simple image operations can be efficiently implemented directly with FSA. Examples are also presented to illustrate the relationship between the FSA complexity and the coded images. Finally, the generalization of this approach to gray-level images, color images, and volume data is discussed. We believe that this automaton coding approach will be useful in developing efficient image and data compression algorithms.
Charles Quenneville, Jean Meunier, "Image coding using finite state automata," Optical Engineering 35(1), (1 January 1996). http://dx.doi.org/10.1117/1.600881
JOURNAL ARTICLE
6 PAGES


SHARE
KEYWORDS
Image compression

Binary data

Image processing

Algorithm development

Image fusion

Data compression

Detection and tracking algorithms

RELATED CONTENT


Back to Top