A modified fuzzy dual-local information c-mean clustering algorithm using quadratic surface as prototype for image segmentation

Single-valued point can not effectively describe the gray characteristic of the image region, which makes existing fuzzy clustering algorithms difficult to segment image with uneven illumination, weak edges and strong noise. Hence, fuzzy c-means clustering with quadratic polynomial surface as clustering center has become a new method to solve complex image segmentation. Aiming at the shortcoming of current latest spatial fuzzy c-means clustering algorithm with quadratic surface as clustering center, quadratic polynomial surface is firstly introduced into existing widely used fuzzy local information c-means clustering algorithm, and further modify the membership degree of fuzzy local information c-means clustering by means of local membership of neighborhood pixels, a novel fuzzy dual-local information c-means clustering with quadratic polynomial-center clusters is proposed to solve the segmentation problem of complex image in the presence of high noise. Then the convergence of the proposed algorithm is strictly proved by Zangwill theorem and bordered Hessian matrix. Experimental results show that the proposed algorithm has better segmentation performance and anti-noise robustness than existing quadratic polynomial-related QPFCM, widely used FLICM, and multiple state-of-the-art algorithms, meanwhile, it also promotes the development of robust fuzzy clustering-related image segmentation theory.

Automated summary

This paper introduces a novel fuzzy dual-local information c-means clustering algorithm based on quadratic polynomial surface, aiming to solve the segmentation problem of images with uneven illumination, weak edges, and high noise. By introducing the quadratic polynomial surface and adjusting the local membership, the proposed algorithm demonstrates better segmentation performance and noise robustness.