Improving image segmentation by chaotic neurodynamics
We propose a novel segmentation algorithm which combines an image segmentation method into small regions with chaotic neurodynamics that has already been clarified to be effective for solving some combinatorial optimization problems. The basic algorithm of an image segmentation is the variable-shape-block-segmentation (VB) which searches an optimal state of the segmentation by moving the vertices of quadrangular regions. However, since the algorithm for moving vertices is based upon steepest descent dynamics, this segmentation method has a local minimum problem that the algorithm gets stuck at undesirable local minima. In order to treat such a problem of the VB and improve its performance, we introduce chaotic neurodynamics for optimization. The results of our novel method are compared with those of conventional stochastic dynamics for escaping from undesirable local minima. As a result, the better results are obtained with the chaotic neurodynamical image segmentation.
image segmentation combinatorial optimization problems variable-shape-block-segmentation chaos