Advertisement

Journal of Computer Science and Technology

, Volume 10, Issue 2, pp 104–111 | Cite as

The generation of a sort of fractal graphs

  • Zhang Bo 
  • Zhang Ling 
  • Chen Gang 
Regular Papers
  • 21 Downloads

Abstract

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.

Keywords

Fractal graph neural network compressed coding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Mandelbrot B B. The Fractal Geometry of Nature. Freeman W H and Company, New York, 1977.Google Scholar
  2. [2]
    Pietronero L, Tosatti E (eds.). Fractal in Physics. Elsevier Science Publishing Company, Inc., 1985.Google Scholar
  3. [3]
    Zhang Bo, Zhang Ling, Zhang Huai. A quantitative analysis of the behaviors of the PLN network.Neural Netorks, 1992, 5: 639–644.CrossRefGoogle Scholar
  4. [4]
    Zhang Bo, Zhang Ling, Zhang Huai. The complexity of learning in PLN networks. Accepted byNeural Networks.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1995

Authors and Affiliations

  • Zhang Bo 
    • 1
  • Zhang Ling 
    • 1
  • Chen Gang 
    • 1
  1. 1.Department of Computer Science, Intelligent Technology & Systems LaboratoryTsinghua UniversityBeijing

Personalised recommendations