Share Email Print

Proceedings Paper

Treelike neural network for brain magnetic resonance image segmentation
Author(s): Iren Valova; Yukio Kosugi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper we report the application of neural trees for image segmentation of magnetic resonance (MR) images. The network, built up during training, effectively partitions the feature space into subregions and each final subregion is assigned a class label according to the data routed to it. As the tree grows, the number of training data for each node decreases, which results in less weight update epochs and decreases the time consumption. The growing algorithm is based on depth-first search, which is guaranteed to find deep solutions, i.e. linearly non-separable classes. We also introduce a measure for estimation of the best-fit neuron to split the feature space at each tree node. This eliminates the necessity for postponing perturbance of the hyperplanes and proves essential for solving linearly non-separable difficult tasks. The network performance is compared to the multilayered perceptron (MLP) over the white/gray matter MRI segmentation problem.

Paper Details

Date Published: 30 October 1997
PDF: 12 pages
Proc. SPIE 3164, Applications of Digital Image Processing XX, (30 October 1997); doi: 10.1117/12.279578
Show Author Affiliations
Iren Valova, Tokyo Institute of Technology (Japan)
Yukio Kosugi, Tokyo Institute of Technology (Japan)

Published in SPIE Proceedings Vol. 3164:
Applications of Digital Image Processing XX
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top