Results 1  10
of
40
Growing Cell Structures  A Selforganizing Network for Unsupervised and Supervised Learning
 Neural Networks
, 1993
"... We present a new selforganizing neural network model having two variants. The first variant performs unsupervised learning and can be used for data visualization, clustering, and vector quantization. The main advantage over existing approaches, e.g., the Kohonen feature map, is the ability of the m ..."
Abstract

Cited by 275 (11 self)
 Add to MetaCart
We present a new selforganizing neural network model having two variants. The first variant performs unsupervised learning and can be used for data visualization, clustering, and vector quantization. The main advantage over existing approaches, e.g., the Kohonen feature map, is the ability of the model to automatically find a suitable network structure and size. This is achieved through a controlled growth process which also includes occasional removal of units. The second variant of the model is a supervised learning method which results from the combination of the abovementioned selforganizing network with the radial basis function (RBF) approach. In this model it is possible  in contrast to earlier approaches  to perform the positioning of the RBF units and the supervised training of the weights in parallel. Therefore, the current classification error can be used to determine where to insert new RBF units. This leads to small networks which generalize very well. Results on the t...
SelfOrganizing Maps: Generalizations and New Optimization Techniques
 Neurocomputing
, 1998
"... We offer three algorithms for the generation of topographic mappings to the practitioner of unsupervised data analysis. The algorithms are each based on the minimization of a cost function which is performed using an EM algorithm and deterministic annealing. The soft topographic vector quantization ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
(Show Context)
We offer three algorithms for the generation of topographic mappings to the practitioner of unsupervised data analysis. The algorithms are each based on the minimization of a cost function which is performed using an EM algorithm and deterministic annealing. The soft topographic vector quantization algorithm (STVQ)  like the original SelfOrganizing Map (SOM)  provides a tool for the creation of selforganizing maps of Euclidean data. Its optimization scheme, however, offers an alternative to the heuristic stepwise shrinking of the neighborhood width in the SOM and makes it possible to use a fixed neighborhood function solely to encode desired neighborhood relations between nodes. The kernelbased soft topographic mapping (STMK) is a generalization of STVQ and introduces new distance measures in data space based on kernel functions. Using the new distance measures corresponds to performing the STVQ in a highdimensional feature space, which is related to data space by a nonlinear ma...
Visualizing HighDimensional Structure with the Incremental Grid Growing Neural Network
 In Proc Int'l Conference on Machine Learning, Lake Tahoe, NV
, 1995
"... Understanding highdimensional real world data usually requires learning the structure of the data space. The structure may contain highdimensional clusters that are related in complex ways. Methods such as merge clustering and selforganizing maps are designed to aid the visualization and interpre ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
(Show Context)
Understanding highdimensional real world data usually requires learning the structure of the data space. The structure may contain highdimensional clusters that are related in complex ways. Methods such as merge clustering and selforganizing maps are designed to aid the visualization and interpretation of such data. However, these methods often fail to capture critical structural properties of the input. Although selforganizing maps capture highdimensional topology, they do not represent cluster boundaries or discontinuities. Merge clustering extracts clusters, but it does not capture local or global topology. This paper proposes an algorithm that combines the topologypreserving characteristics of selforganizing maps with a flexible, adaptive structure that learns the cluster boundaries in the data. 1 INTRODUCTION Real world data is often very highdimensional, and often has a structure that is difficult both to recognize and describe. For instance, human blood can be tested fo...
Local Dynamic Modeling with SelfOrganizing Maps and Applications to Nonlinear System Identification and Control
 Proceedings of the IEEE
, 1998
"... The technique of local linear models is appealing for modeling complex time series due to the weak assumptions required and its intrinsic simplicity. Here, instead of deriving the local models from the data, we propose to estimate them directly from the weights of a self organizing map (SOM), which ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
(Show Context)
The technique of local linear models is appealing for modeling complex time series due to the weak assumptions required and its intrinsic simplicity. Here, instead of deriving the local models from the data, we propose to estimate them directly from the weights of a self organizing map (SOM), which functions as a dynamicpreserving model of the dynamics. We introduce one modification to the Kohonen learning to ensure good representation of the dynamics and use weighted least squares to ensure continuity among the local models. The proposed scheme is tested using synthetic chaotic time series and real world data. The practicality of the method is illustrated in the identification and control of the NASA Langley wind tunnel during aerodynamic tests of model aircrafts. Modeling the dynamics with a SOM leads to a predictive multiple model control strategy (PMMC). Comparison of the new controller against the existing controller in test runs shows the superiority of our method. 1. Introducti...
Generalization Abilities of Cascade Network Architectures
 L (Eds.), Advances in Neural Information Processing Systems
, 1993
"... In [5], a new incremental cascade network architecture has been presented. This paper discusses the properties of such cascade networks and investigates their generalization abilities under the particular constraint of small data sets. The evaluation is done for cascade networks consisting of local ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
In [5], a new incremental cascade network architecture has been presented. This paper discusses the properties of such cascade networks and investigates their generalization abilities under the particular constraint of small data sets. The evaluation is done for cascade networks consisting of local linear maps using the MackeyGlass time series prediction task as a benchmark. Our results indicate that to bring the potential of large networks to bear on the problem of extracting information from small data sets without running the risk of overfitting , deeply cascaded network architectures are more favorable than shallow broad architectures that contain the same number of nodes. 1 Introduction For many realworld applications, a major constraint for the successful learning from examples is the limited number of examples available. Thus, methods are required, that can learn from small data sets. This constraint makes the problem of generalization particularly hard. If the number of adjus...
Cascade Network Architectures
 in Proc. IEEEINNS Int. J. Conf. Neural Networks
, 1992
"... ..."
(Show Context)
A Neural Network Architecture for Automatic Segmentation of Fluorescence Micrographs
, 2000
"... . A system for the automatic segmentation of fluorescence micrographs is presented. In a first step positions of fluorescent cells are detected by a fast learning neural network, which acquires the visual knowledge from a set of training cellimage patches selected by the user. Guided by the dete ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
. A system for the automatic segmentation of fluorescence micrographs is presented. In a first step positions of fluorescent cells are detected by a fast learning neural network, which acquires the visual knowledge from a set of training cellimage patches selected by the user. Guided by the detected cell positions the system extracts in the second step the contours of the cells. For contour extraction a recurrent neural network model is used to approximate the cell shapes. Even though the micrographs are noisy and the fluorescent cells vary in shape and size, the system detects at minimum 95% of the cells. 1 Introduction In the last decades experimental research in biomedicine was influenced by automation of sample preparation and digital microscopy imaging. Research groups in related fields are now enabled to produce large sets of digitized micrographs. Hence the problem of efficient evaluation of large datasets arises, for example in the case of highthroughput analysis of ...
RealTime Pose Estimation of 3D Objects from Camera Images Using Neural Networks
, 1997
"... This paper deals with the problem of obtaining a rough estimate of three dimensional object position and orientation from a single two dimensional camera image. Such an estimate is required by most 3D to 2D registration and tracking methods that can efficiently refine an initial value by numerical ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
This paper deals with the problem of obtaining a rough estimate of three dimensional object position and orientation from a single two dimensional camera image. Such an estimate is required by most 3D to 2D registration and tracking methods that can efficiently refine an initial value by numerical optimization to precisely recover 3D pose. However, the analytic computation of an initial pose guess requires the solution of an extremely complex correspondence problem that is due to the large number of topologically distinct aspects that arise when a three dimensional opaque object is imaged by a camera. Hence general analytic methods fail to achieve realtime performance and most tracking and registration systems are initialized interactively or by ad hoc heuristics. To overcome these limitations we present a novel method for approximate object pose estimation that is based on a neural net and that can easily be implemented in realtime. A modification of Kohonen's selforganizing fe...
Image Based Recognition of Gaze Direction Using Adaptive Methods
, 1997
"... Humanmachine interfaces based on gaze recognition can greatly simplify the handling of computer applications. However, most of the existing systems have problems with changing environments and different users. As a solution we use (i) adaptive components which can be trained online and (ii) detect ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Humanmachine interfaces based on gaze recognition can greatly simplify the handling of computer applications. However, most of the existing systems have problems with changing environments and different users. As a solution we use (i) adaptive components which can be trained online and (ii) detect common facial features, i.e. eyes, nose and mouth, for gaze recognition. In a first step an adaptive color histogram segmentation method roughly determines the region of interest including the user's face. Within this region we then use a hierarchical recognition approach to detect the facial features. In the last stage of our system these feature positions are used to estimate gaze direction by detailed analysis of the eye region. We achieve an average precision of 1:5 ffi for the gaze pan and 2:5 ffi for the tilt angle while the user looks on a computer screen. The system runs at a rate of one frame per second on a common workstation.