用最短路径集算法求模式的最简编码

Obtain Simplest Pattern Codes with Shortest Paths Algorithm

本文将求模式的最简单编码问题转化成求加权有向图的最短路径集的问题来解决。因此,这个算法是有效的。

In the coding theory of pattern perception,it is an important problem to obtain the simplest code. If we generaed all codes of the pattern and then selected the simplest one, this would take a lot of computing time. In this paper,we translate the search for a simplest code to a shortest path problem.In this way, the method is efficient.