Robust Deep Kernel-Based Fuzzy Clustering With Spatial Information for Image Segmentation

preprint OA: closed
View at publisher

Abstract

Abstract Clustering algorithms with deep neural network have attracted wide attention of scholars. A deep fuzzy K-means clustering algorithm model with adaptive loss function and entropy regularization (DFKM) is proposed by combining automatic encoder and clustering algorithm. Although it introduces adaptive loss function and entropy regularization to improve the robustness of the model, its segmentation effect is not ideal for high noise; At the same time, its model does not use a convolutional auto-encoder, which is not suitable for high-dimensional images.Therefore, on the basis of DFKM, this paper focus on image segmentation, combine neighborhood median and mean information of current pixel, introduce neighborhood information of membership degree, and extend Euclidean distance to kernel space by using kernel function, propose a dual-neighborhood information constrained deep fuzzy clustering based on kernel function (KDFKMS). A large number of experimental results show that compared with DFKM and classical image segmentation algorithms, this algorithm has stronger anti-noise robustness.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00