基于有限状态自动机的黑白数字图像表示方法

Bi-level Digital Image Representation Based on Finite State Automata

提出了一种用有限状态自动机(FA)来描述黑白数字图像的方法。对一幅给定的黑白数字图像,可以用正则语言来表示它的像素地址,反之,任一正则语言也可以表示为一幅黑白数字图像,即正则语言与黑白数字图像可以相互转化。而由自动机理论原理知,正则语言可以用有限状态自动机等价描述,从而得到用有限状态自动机来描述黑白数字图像的方法。这样就建立了图像与自动机理论这两门学科之间的联系,也为用自动机进行图像压缩奠定了基础。

This paper introduces an approach to describe bi-level digital image using finite Automata （FA）. For a given bi-level digital image picture, the addresses of pixels can be denoted by the regular language. On the contrary, any regular language can be expressed by a bi-level digital image. We can be know from the principles of automata theory that a regular language can be described equivalently by a finite automata, so a method can be got to describe the bi-level digital image, which will build a relationship between the image and finite state automata.