The Generation of a Sort of Fractal Graphs

摘要

We present an approach for generating a sort of fractal graphs by a simple probabilistic logic neuron network and show that the graphs can be represented by a set of compressed codings. An algorithm for quickly finding the codings, i.e., recognizing the corresponding graphs, is given. The codings are shown to be optimal. The results above possibly give us the clue for studying image compression and pattern recognition.