1 / 44

Polynomial Discrete Time Cellular Neural Networks

Polynomial Discrete Time Cellular Neural Networks. Eduardo Gomez-Ramirez † Giovanni Egidio Pazienza‡ † LIDETEA, POSGRADO E INVESTIGACION Universidad La Salle – México, D.F. ‡ Department d’Electronica, EALS Universitat “Ramon Llull” – Barcelona, Spain. Outline.

corin
Télécharger la présentation

Polynomial Discrete Time Cellular Neural Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Polynomial Discrete Time Cellular Neural Networks Eduardo Gomez-Ramirez † Giovanni Egidio Pazienza‡ † LIDETEA, POSGRADO E INVESTIGACION Universidad La Salle –México, D.F. ‡ Department d’Electronica, EALS Universitat “Ramon Llull” – Barcelona, Spain

  2. Outline • Cellular Neural Networks (CNN) • Introduction and Objective • Genetic Algorithms (GA) • Polynomial Discrete Time CNNs (PDTCNNs) • XOR Problem • Game of Life • Learning vs Design • Conclusions and future work

  3. CNN: Introduction • CNN for complex task (linearly nonseparable data) • Multilayer CNNs • Include more degrees of freedom for the output state of each layer • Search in a finite set of templates • Single layer: Polynomial CNNs

  4. Objective • Improve the representation power of a single layer CNN including a simple nonlinear term to solve problems with linearly nonseparable data (XOR)

  5. CNN: mathematical model • The simplified mathematical model is: where xc is the state of the cell, uc the input and yc the output

  6. CNN: Activation Function

  7. CNN: Block Diagram

  8. CNN: Discrete Model • Computing x(∞), the model can be represented as using the following activation function

  9. GA: main steps proposed • Steps: • Crossover C(Fg) • Mutation M(*) • Adding random parent Ag()

  10. GA: Crossover

  11. a1 I=0 b1 c1 a2 I=0 b2 c2 GA: Crossover • Individual 1 • Individual 2

  12. GA: Mutation where rU(0,1) is a random variable with uniform distribution defined on a probability space (,,P), 

  13. a1 I=0 b1 c1 a2 I=0 b2 c2 GA: Mutation (resolution) • Individual 1 • Individual 2

  14. GA: Selecting Parents

  15. GA: Adding Random Parent

  16. Polynomial Discrete Time Cellular Neural Network THEOREM 1: (Weierstrass’s Approximation Theorem) Let g be a continuous real valued function defined on a closed interval [a,b]. Then, given any  positive, there exists a polynomial y (which may depend on ) with real coefficients such that: For every x  [a,b].

  17. Polynomial Discrete Time Cellular Neural Network • THEOREM 2 *: Any Boolean Function of n-variables can be realized using a Polynomial Threshold gates of order sn. The quadratic threshold gate can be defined: And s is the number of inputs and T is the threshold constant. * N. J. Nilsson. The Mathematical Foundations of Learning Machines. McGraw Hill, New York, 1990.

  18. PDTCNN: the model (I)

  19. PDTCNN: the model (II)

  20. PDTCNN: Solving XOR problem Some papers: • Z. Yang, Y. Nishio, A. Ushida, Templates and algorithms for two-layer cellular neural networks. IJCNN’02, 2002. • F. Chen, G. He, G. Chen & X. Xu, Implementation of Arbitrary Boolean Functions via CNN. CNNA’06, 2006.

  21. PDTCNN:Solving XOR problem • M. Balsi, Generalized CNN: Potentials of a CNN with Non-Uniform Weights. CNNA-92, 2002 . • E. Bilgili, I. C. Göknar and O. N. Ucan, Cellular neural network with trapezoidal activation function. Int. J. Circ. Theor. Appl., 2005

  22. Learning parameters • Initialpop=20000 • Number of fathers=7 • Maximum number of random parents to be add = 3 • Kpro=0.8 • Increment=1 • Mutation Probability=0.15

  23. PDTCNN:First Scheme U:uij=xijxij+1

  24. PDTCNN:Second Scheme U:uij=xijyij b) c)

  25. The Game of Life (I) • The Game of Life (GoL) is a totalistic cellular automaton consisting in a two-dimensional grid cells, that may be either alive (black) or dead (white).

  26. The Game of Life (II) • The state of each cell varies according to the following rules: • Birth: a cell that is dead at time t becomes alive at time t + 1 only if exactly 3 of its neighbors were alive at time t; • Survival: a cell that was living at time t will remain alive at t + 1 if and only if it had exactly 2 or 3 alive neighbors at time t.

  27. The Game of Life (III) • Every sufficient well-stated mathematical problem can be reduced to a question about Life; • It is possible to make a life computer (logic gates, storage etc.); • Life is universal: it can be programmed to perform any desired calculation; • Given a large enough Life space and enough time, self-reproducing animals will emerge... • The whole universe is a CA! (E.Fredkin, MIT).

  28. A The Game of Life – NOT gate

  29. CNN & GoL • Multilayer CNN (Chua, Roska) – 1990 • Activation function (Chua, Roska) – 1990 • CNN-UM (Roska,Chua) -1990 • CNN Universal Cells (Dogaru, Chua) – 1999 Simplicity vs. Computational power

  30. Polynomial CNN (I) What’s g(ud,yd)?

  31. Polynomial CNN (II) • In the simplest case g(ud, yd) is a second degree polynomial, whose general form is

  32. Polynomial CNN (III) Thanks to some considerations we find that

  33. uc and appear in the state equation direct link with totalistic Cellular Automata Polynomial CNN (IV)

  34. GoL: Rules (I)

  35. Black pixel= +1 White pixel= -1 GoL: Rules (II) • Rule 1: a cell will be alive at least 3 of the 9 cells in its 3 × 3 neigh. are alive pixel centr. = 1 (black) Σ neigh. = -2 (5 w, 2 b) next state = -1 (white)

  36. Black pixel= +1 White pixel= -1 GoL: Rules (III) • Rule 2: a cell will be alive if at most 3 of its 8 neighbors are alive pixel centr. = 1 (black) Σ neigh. = -2 (5 w, 2 b) next state = 1 (black)

  37. Design algorithm (I) • First iteration: we try to perform the first rule (a cell will be alive at least 3 of the 9 cells in its 3 × 3 neigh. are alive) • If Y(0)=0 bc=1 bp=1 i=3

  38. Design algorithm (II) • Second iteration: we try to accomplish the second rule (a cell will be alive if at most 3 of its 8 neighbors are alive)

  39. Design algorithm (III) • Hyp: pc=0

  40. Templates found using learning • Coming soon...

  41. Conclusions (I) • In general: • In some cases it is possible to reduce a multilayer DTCNN to a single layer PDTCNN • Thanks to the GoL we can explore the capacity of PDTCNNs for Universal Machine

  42. Conclusions (II) • About learning: • The resolution used reduces the search space • The step “Add random parent” improves the behavior to avoid local minimas • About design • We give a simple algorithm to design templates for the Polynomial CNN

  43. Future Work • Implementations of mathematical morphology functions with PDTCNNs

  44. Polynomial Discrete Time Cellular Neural Networks Eduardo Gomez-Ramirez Giovanni Egidio Pazienza egr@ci.ulsa.mx gpazienza@salle.url.edu

More Related