Neurocomputing model for computation of an approximate convex hull of a set of points and spheres

被引:3
|
作者
Pal, Srimanta [1 ]
Bhattacharya, Sabyasachi
机构
[1] Indian Stat Inst, Elect & Commun Sci Unit, Kolkata 700108, W Bengal, India
[2] TATA Consultancy Serv Ltd, Comp Consultant Dept, Kolkata 700091, W Bengal, India
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2007年 / 18卷 / 02期
关键词
convex hull; energy function; neural networks;
D O I
10.1109/TNN.2007.891201
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this letter, a two-layer neural network is proposed for computation of an approximate convex hull of a set of given points in 3-D or a set of spheres of different sizes. The algorithm is designed based on an elegant concept-shrinking of a spherical rubber balloon surrounding the set of objects in 3-D. Logically, a set of neurons is orderly placed on a spherical mesh i.e., on a rubber balloon surrounding the objects. Each neuron has a parameter vector associated with its current position. The resultant force of attraction, between a neuron and each of the given points/objects, determines the direction of a movement of the neuron lying on the rubber balloon. As the network evolves, the neurons (parameter vectors) approximate the convex hull more and more accurately.
引用
收藏
页码:600 / 605
页数:6
相关论文
共 50 条
  • [21] CLOSURE OF CONVEX HULL OF A SET
    LIN, CS
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1975, 18 (01): : 147 - 148
  • [23] ON CONVEX HULL OF A FINITE SET
    WITZGALL, C
    OPERATIONS RESEARCH, 1966, S 14 : B130 - &
  • [24] THE CONVEX-HULL OF A SET OF CONVEX POLYGONS
    CHEN, H
    ROKNE, J
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1992, 42 (3-4) : 163 - 172
  • [25] GPU accelerated convex hull computation
    Tang, Min
    Zhao, Jie-yi
    Tong, Ruo-feng
    Manocha, Dinesh
    COMPUTERS & GRAPHICS-UK, 2012, 36 (05): : 498 - 506
  • [26] Neural networks for convex hull computation
    Leung, Y
    Zhang, JS
    Xu, JS
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 1997, 8 (03): : 601 - 611
  • [27] A gird-aided algorithm for determining the minimum convex hull of planar points set
    Wang, Jiechen
    Chen, Yanming
    Wuhan Daxue Xuebao (Xinxi Kexue Ban)/ Geomatics and Information Science of Wuhan University, 2010, 35 (04): : 403 - 406
  • [28] Marching squares-based approach to finding the convex hull of a planar set of points
    Yue, Y
    Maple, C
    PROCEEDINGS OF THE 8TH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1-3, 2005, : 1700 - 1703
  • [29] THE IMPLEMENTATION OF AN ALGORITHM TO FIND THE CONVEX-HULL OF A SET OF 3-DIMENSIONAL POINTS
    DAY, AM
    ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (01): : 105 - 132
  • [30] A multilayer self-organizing model for convex-hull computation
    Pal, S
    Datta, A
    Pal, NR
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (06): : 1341 - 1347