A NEURAL-NETWORK APPROACH TO THE CONSTRUCTION OF DELAUNAY TESSELLATION OF POINTS IN R(D)

被引:9
作者
GARGA, AK
BOSE, NK
机构
[1] Spatial and Temporal Signal Processing Center, The Pennsylvania State University, University Park
来源
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS | 1994年 / 41卷 / 09期
基金
美国国家科学基金会;
关键词
D O I
10.1109/81.317962
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Since a neural network may be designed directly from either the Delaunay tessellation (DT) or its abstract dual, the Voronoi diagram, the procedure advanced here for training a dynamic feedforward neural network to generate the DT of specified points representing exemplars in multidimensional feature space, contributes toward the goal of an all-neural approach to the synthesis of neural networks. As the expected number of simplexes in the DT over n points is linear in n, the procedure is convenient for real-time implementation of pattern classifiers.
引用
收藏
页码:611 / 613
页数:3
相关论文
共 9 条
[1]  
Akl S.G., 1992, PARALLEL COMPUTATION
[2]  
BOSE NK, 1993, IEEE T NEURAL NETWOR, V5, P778
[3]   AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION [J].
CHAZELLE, B .
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 10 (04) :377-409
[4]   HIGHER-DIMENSIONAL VORONOI DIAGRAMS IN LINEAR EXPECTED TIME [J].
DWYER, RA .
DISCRETE & COMPUTATIONAL GEOMETRY, 1991, 6 (04) :343-367
[5]  
GARGA AK, 1994, THESIS PENNSYLVANIA
[6]  
GARGA AK, 1994, 3RD INT S ART INT MA
[7]  
Okabe A., 1992, SPATIAL TESSELLATION
[8]   FINDING THE CONVEX-HULL FACET BY FACET [J].
SWART, G .
JOURNAL OF ALGORITHMS, 1985, 6 (01) :17-48
[9]   A CONVEX-HULL ALGORITHM FOR NEURAL NETWORKS [J].
WENNMYR, E .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (11) :1478-1484