A TBD Fuzzy C-Means Clustering Algorithm Based on Quadratic Polynomial for Cardiac Image Segmentation

In this study, we propose a TBD fuzzy C-means clustering algorithm based on quadratic polynomial for segment cardiac images. Our approach utilizes Ruban's total bregman divergence (TBD) to capture global information effectively, reduce noise and differences in values, and exhibit higher flexibility and applicability across various models. By employing the fuzzy C-means clustering algorithm with a quadratic polynomial surface as the clustering center, our method achieves efficient segmentation of weak edges in images affected by weak noise. Furthermore, we leverage spatial information from neighboring pixels for local processing to enhance the anti-noise robustness of our algorithm. The convergence of our proposed algorithm is verified using Zangwill's theorem and boundary-based Hessian theorem. Experimental results demonstrate that our approach not only effectively segments images but also exhibits high accuracy even in the presence of certain levels of noise or non-uniformity.

Authors

Institutions

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1109/iccea65460.2025.11103350
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A TBD Fuzzy C-Means Clustering Algorithm Based on Quadratic Polynomial for Cardiac Image Segmentation

Pengyao Xu, Hongkuan Zhang, Shuaishuai Zhang, Ruixia Liu
Advanced Algorithms and Applications
article

A TBD Fuzzy C-Means Clustering Algorithm Based on Quadratic Polynomial for Cardiac Image Segmentation

Pengyao Xu, Hongkuan Zhang, Shuaishuai Zhang, Ruixia Liu
article en

Abstract

In this study, we propose a TBD fuzzy C-means clustering algorithm based on quadratic polynomial for segment cardiac images. Our approach utilizes Ruban's total bregman divergence (TBD) to capture global information effectively, reduce noise and differences in values, and exhibit higher flexibility and applicability across various models. By employing the fuzzy C-means clustering algorithm with a quadratic polynomial surface as the clustering center, our method achieves efficient segmentation of weak edges in images affected by weak noise. Furthermore, we leverage spatial information from neighboring pixels for local processing to enhance the anti-noise robustness of our algorithm. The convergence of our proposed algorithm is verified using Zangwill's theorem and boundary-based Hessian theorem. Experimental results demonstrate that our approach not only effectively segments images but also exhibits high accuracy even in the presence of certain levels of noise or non-uniformity.

Qilu University of Technology (CN), Shandong Academy of Sciences (CN)
Shandong Academy of Sciences
Openalex Percentile: Top 76%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.