Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, IL 60616; Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 152.
IEEE Trans Pattern Anal Mach Intell. 1987 Mar;9(3):413-28. doi: 10.1109/tpami.1987.4767923.
In this paper, we describe a new way of representing a symbolic picture by a two-dimensional string. A picture query can also be specified as a 2-D string. The problem of pictorial information retrieval then becomes a problem of 2-D subsequence matching. We present algorithms for encoding a symbolic picture into its 2-D string representation, reconstructing a picture from its 2-D string representation, and matching a 2-D string with another 2-D string. We also prove the necessary and sufficient conditions to characterize ambiguous pictures for reduced 2-D strings as well as normal 2-D strings. This approach thus allows an efficient and natural way to construct iconic indexes for pictures.
在本文中，我们描述了一种通过二维字符串来表示符号图像的新方法。图像查询也可以指定为二维字符串。图像信息检索问题则变成了二维子序列匹配问题。我们提出了将符号图像编码为其二维字符串表示、从二维字符串表示重建图像以及将二维字符串与另一个二维字符串进行匹配的算法。我们还证明了用于对简化二维字符串和正常二维字符串进行特征化的有歧义图像的必要和充分条件。因此，这种方法允许以有效和自然的方式为图像构建标志性索引。
