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-bloch-segmentation (VB) which searches an opti-mal state of the segmentation by moving the vertices of quadran-gular 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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Mikio HASEGAWA, Tohru IKEGUCHI, Takeshi MATOZAKI, Kazuyuki AIHARA, "Improving Image Segmentation by Chaotic Neurodynamics" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 10, pp. 1630-1637, October 1996, doi: .
Abstract: 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-bloch-segmentation (VB) which searches an opti-mal state of the segmentation by moving the vertices of quadran-gular 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_10_1630/_p
Copy
@ARTICLE{e79-a_10_1630,
author={Mikio HASEGAWA, Tohru IKEGUCHI, Takeshi MATOZAKI, Kazuyuki AIHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improving Image Segmentation by Chaotic Neurodynamics},
year={1996},
volume={E79-A},
number={10},
pages={1630-1637},
abstract={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-bloch-segmentation (VB) which searches an opti-mal state of the segmentation by moving the vertices of quadran-gular 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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Improving Image Segmentation by Chaotic Neurodynamics
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1630
EP - 1637
AU - Mikio HASEGAWA
AU - Tohru IKEGUCHI
AU - Takeshi MATOZAKI
AU - Kazuyuki AIHARA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1996
AB - 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-bloch-segmentation (VB) which searches an opti-mal state of the segmentation by moving the vertices of quadran-gular 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.
ER -