String tightening as a self-organizing phenomenon

IEEE Transactions on Neural Networks

Volumn 18, Issue 5, 2007, Pages 1463-1471

  Banerjee, Bonny ^a  

^a Ohio State University   (United States)

Author keywords

Convex hull; Homotopy; Neural network; Self organization; Shortest path; Smooth path; Tighten string

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; NEURAL NETWORKS; ROBOTICS; VLSI CIRCUITS;

CONVEX HULL; HOMOTOPY; SHORTEST PATH; SMOOTH PATH; STRING TIGHTENING SELF-ORGANIZING NEURAL NETWORK;

SELF ORGANIZING MAPS;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; COMPUTER SIMULATION; METHODOLOGY; NERVE CELL NETWORK; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; THEORETICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; MODELS, THEORETICAL; NERVE NET; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 34548616810     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2007.891192     Document Type: Article

References (25)

1. T. Kohonen, Self-Organizing Maps. Berlin, Germany: Springer-Verlag, 2001.
2. J. A. Kangas, T. Kohonen, and J. Laaksonen, "Variants of self-organizing maps," IEEE Trans. Neural Netw., vol. 1, no. 1, pp. 93-99, Jan. 1990.
3. B. Fritzke, "Growing cell structures - a self-organizing network for unsupervised and supervised learning," Neural Netw., vol. 7, no. 9, pp. 1441-1460, 1994.
4. D. Choi and S. Park, "Self-creating and organizing neural networks," IEEE Trans. Neural Netw., vol. 5, no. 4, pp. 561-575, Jul. 1994.
5. L. Schweizer, G. Parladori, L. Sicuranza, and S. Marsi, "A fully neural approach to image compression," in Artificial Neural Networks, T. Kohonen, K. Makisara, O. Simula, and J. Kangas, Eds. Amsterdam, The Netherlands: North-Holland, 1991, pp. 815-820.
6. K. Obermayer, H. Ritter, and K. Schulten, "Large-scale simulations of self-organizing neural networks on parallel computers: Application to biological modeling," Parallel Comput., vol. 14, pp. 381-404, 1990.
7. F. Favata and R. Walker, "A study of the application of Kohonen-type neural networks to the traveling salesman problem," Biol. Cybern. vol. 64, pp. 463-468, 1991.
8. H. J. Ritter and T. Kohonen, "Self-organizing semantic maps," Biol. Cybern., vol. 61, pp. 241-254, 1989.
9. 2-M) self-organizing map algorithm without learning of neighborhood vectors," IEEE Trans. Neural Netw., vol. 17, no. 6, pp. 1656-1661, Nov. 2006.
10. B. Fritzke, "A self-organizing network that can follow non-stationary distributions," in Proc. Int. Conf. Artif. Neural Netw., 1997, pp. 613-618.
11. J. S. B. Mitchell, "Geometric shortest paths and network optimization," in Handbook on Computational Geometry, J. R. Sack and J. Urrutia, Eds. New York: Elsevier, 2000, pp. 633-702.
12. H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki, and S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementation. Cambridge, MA: MIT Press, 2005.
13. B. Chandrasekaran, U. Kurup, B. Banerjee, J. R. Josephson, and R. Winkler, "An architecture for problem solving with diagrams," in Diagrammatic Representation and Inference, Lecture Notes in Artificial Intelligence, A. Blackwell, K. Marriott, and A. Shimojima, Eds. Berlin, Germany: Springer-Verlag, 2004, vol. 2980, pp. 151-165.
14. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, and W. Rlling, "On continuous homotopic one layer routing," in Proc. Symp. Comput. Geometry, 1988, pp. 392-402.
15. S. Quinlan and O. Khatib, "Elastic bands: Connecting path planning and robot control," in Proc. IEEE Int. Conf. Robot. Autom., Atlanta, GA, 1993, vol. 2, pp. 802-807.
16. D. Grigoriev and A. Slissenko, "Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane," in Proc. Int. Symp. Symbolic Algebraic Comput., Rostock, Germany, 1998, pp. 17-24.
17. F. Rosenblatt, "The perceptron: A probabilistic model for information storage and organization in the brain," Psychol. Rev., vol. 65, no. 6, pp. 386-408, 1958.
18. E. Berglund and J. Sitte, "The parameterless self-organizing map algorithm," IEEE Trans. Neural Netw., vol. 17, no. 2, pp. 305-316, Mar. 2006.
19. T. DeWolf and T. Holvoet, "Emergence versus self-organisation: Different concepts but promising when combined," in Engineering Self Organising Systems: Methodologies and Applications, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2005, vol. 3464, pp. 1-15.
20. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry. New York: Springer-Verlag, 1997.
21. S. Pal, A. Datta, and N. R. Pal, "A multilayer self-organizing model for convex-hull computation," IEEE Trans. Neural Netw., vol. 12, no. 6, pp. 1341-1347, Nov. 2001.
22. A. Efrat, S. G. Kobourov, and A. Lubiw, "Computing homotopic shortest paths efficiently," in Proc. 10th Ann. Eur. Symp. Comput. Geometry 2002, pp. 411-423.
23. S. Bespamyatnikh, "Computing homotopic shortest paths in the plane," J. Algorithms, vol. 49, no. 2, pp. 284-303, 2003.
24. D. Richards, "Complexity of single-layer routing," IEEE Trans. Comput., vol. C-33, no. 3, pp. 286-288, Mar. 1984.
25. M. Kass, A. Witkin, and D. Terzopoulos, "Snakes active contour models," Int. J. Comput. Vis., pp. 321-331, 1988.