Adaptive spatial information-theoretic clustering for image segmentation.

*(English)*Zbl 1177.68176Summary: The incorporation of spatial context into clustering algorithms for image segmentation has recently received a significant amount of attention. Many modified clustering algorithms have been proposed and proven to be effective for image segmentation. In this paper, we propose a different framework for incorporating spatial information with the aim of achieving robust and accurate segmentation in case of mixed noise without using experimentally set parameters based on the original robust information clustering algorithm, called Adaptive Spatial Information-theoretic Clustering (ASIC) algorithm. The proposed objective function has a new dissimilarity measure, and the weighting factor for neighborhood effect is fully adaptive to the image content. It enhances the smoothness towards piecewise-homogeneous segmentation and reduces the edge blurring effect. Furthermore, a unique characteristic of the new information segmentation algorithm is that it has the capabilities to eliminate outliers at different stages of the ASIC algorithm. These result in improved segmentation result by identifying and relabeling the outliers in a relatively stronger noisy environment. Comprehensive experiments and a new information-theoretic proof are carried out to illustrate that our new algorithm can consistently improve the segmentation result while effectively handles the edge blurring effect. The experimental results with both synthetic and real images demonstrate that the proposed method is effective and robust to mixed noise and the algorithm outperforms other popular spatial clustering variants.

##### MSC:

68T10 | Pattern recognition, speech recognition |

68U10 | Computing methodologies for image processing |

94A08 | Image processing (compression, reconstruction, etc.) in information and communication theory |

PDF
BibTeX
XML
Cite

\textit{Z. M. Wang} et al., Pattern Recognition 42, No. 9, 2029--2044 (2009; Zbl 1177.68176)

Full Text:
DOI

**OpenURL**

##### References:

[1] | Pal, N.R.; Pal, S.K., A review on image segmentation techniques, Pattern recognition, 40, 1277-1294, (1993) |

[2] | Bezdek, J.C.; Hall, L.O.; Clarke, L.P., Review of MR image segmentation techniques using pattern recognition, Med. phys., 20, 1033-1048, (1993) |

[3] | Pappas, T., An adaptive clustering algorithm for image segmentation, IEEE trans. signal process., 40, 4, 901-914, (1992) |

[4] | Blekas, K.; Likas, A.; Galatsanos, N.P.; Lagaris, I.E., A spatially constrained mixture model for image segmentation, IEEE trans. neural networks, 16, 2, 494-498, (2005) |

[5] | Caillol, H.; Pieczynski, W.; Hillion, A., Estimation of fuzzy Gaussian mixture and unsupervised statistical image segmentation, IEEE trans. image process., 6, 3, 425-440, (1997) |

[6] | Bouman, C.; Sauer, K., A generalized Gaussian image model for edge-preserving MAP estimation, IEEE trans. image process., 2, 3, (1993) |

[7] | Li, S.Z., On discontinuity-adaptive smoothness priors in computer vision, IEEE trans. pattern anal. Mach. intell., 17, 6, 576-586, (1995) |

[8] | Liew, A.W.C.; Hong, Y., An adaptive spatial fuzzy clustering algorithm for 3D MR image segmentation, IEEE trans. med. imag., 22, 1063-1075, (2003) |

[9] | Ahmed, M.N.; Yamany, S.M.; Mohamed, N.; Farag, A.A.; Moriarty, T., A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data, IEEE trans. med. imag., 21, 193-199, (2002) |

[10] | Szilágyi, L.; Benyó, Z.; Sizlágyi, S.M.; Adam, H.S., MR brain image segmentation using an enhanced fuzzy C-means algorithm, (), 724-726 |

[11] | Lee, S.H.; Crawford, M.M., Unsupervised multistage image classification using hierarchical clustering with a Bayesian similarity measure, IEEE trans. image process., 14, 3, (2005) · Zbl 1296.94035 |

[12] | Makrogiannis, S.; Economou, G.; Fotopoulos, S., A region dissimilarity relation that combines feature-space and spatial information for color image segmentation, IEEE trans. syst. man cybern. B, 35, 1, (2005) |

[13] | N.A. Mohamed, M.N. Ahmed, A.A. Farag, Modified fuzzy c-mean in medical image segmentation, in: Proceedings of IEEE-EMBS, vol. 20, 1998, pp. 1377-1380. |

[14] | Dave, R.N.; Krishnapuram, R., Robust clustering methods: a unified view, IEEE trans. fuzzy syst., 5, 2, 270-293, (1997) |

[15] | Ahmed, M.N.; Yamany, S.M.; Farag, A.A.; Moriaty, T., Bias field estimation and adaptive segmentation of MRI data using a modified fuzzy c-means algorithm, (), 1004 |

[16] | Tolias, Y.A.; Panas, S.M., Image segmentation by a fuzzy clustering algorithm using adaptive spatially constrained membership functions, IEEE trans. syst. man cybern. A, 28, 3, 359-369, (1998) |

[17] | A.W.C. Liew, S.H. Leung, W.H. Lau, Fuzzy image clustering incorporating spatial continuity, in: IEE Proceedings of Vision, Image and Signal Processing, vol. 147 (2), 2000, pp. 185-192. |

[18] | Pham, D.L., Spatial models for fuzzy clustering, Comput. vision image understanding, 84, 285-297, (2001) · Zbl 1033.68612 |

[19] | Cai, W.; Chen, S.; Zhang, D., Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation, Pattern recognition, 40, 835-838, (2007) · Zbl 1118.68133 |

[20] | Song, Q., A robust information clustering algorithm, Neural comput., 17, 12, (2005) · Zbl 1138.93043 |

[21] | Blahut, R.E., Principle and practice of information theory, (1988), Addison-Wesley Reading, MA |

[22] | Rose, K., Deterministic annealing for clustering, compression, classification, regression, and related optimization problems, Proc. IEEE, 86, 11, 2210-2239, (1998) |

[23] | Cao, A.Z.; Song, Q., Robust information clustering for automatic breast mass detection in digitized mammograms, Comput. vision image understanding, 109, 1, 87-96, (2008) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.