Avoiding explosive search in automatic selection of simplest pattern codes

摘要

According to the coding theory of pattern perception, the preferred organization of a pattern is reflected by the simplest code that represents this pattern. The number of codes, out of which the simplest one has to be selected, grows exponentially with the complexity of the pattern. So in computer simulation it would not be wise to generate all codes and then select the simplest one. This would take a lot of computing time. The present study proposes a procedure which avoids this explosion of code generation and yet obtains the simplest code. The central part of this procedure consists of translating the search for a simplest code to a shortest route problem.