A neural network approach to adaptive pattern analysis - the deformable feature map
暂无分享,去创建一个
In this paper, we presen t an algorithm that provides adaptive plasticit y in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach reduces a class of similar function approximation problems to the explicit supervised one-shot training of a single data set. This is followed by asubsequen t, appropriate similarity transformation whic his based on a self-organized deformation of the underlying multidimensional probability distributions. After discussing the theory of the DM algorithm, w e use a computer sim ulation to visualize its e ects on a t w o-dimensional toy example. Finally, we presen t results of its application to the real-world problem of fully automatic voxel-based multispectral image segmentation, employing magnetic resonance data sets of the human brain.
[1] Dominik R. Dersch,et al. Eigenschaften neuronaler Vektorquantisierer und ihre Anwendung in der Sprachverarbeitung , 1996 .
[2] John Moody,et al. Fast Learning in Networks of Locally-Tuned Processing Units , 1989, Neural Computation.
[3] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .
[4] K. Pawelzikzy,et al. Improving Short-term Prediction with Competing Experts , 1995 .