Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/120072
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computingen_US
dc.contributorDepartment of Land Surveying and Geospatial Scienceen_US
dc.creatorWang, Men_US
dc.creatorSu, Hen_US
dc.creatorLi, Jen_US
dc.creatorLi, Cen_US
dc.creatorYin, Nen_US
dc.creatorShen, Len_US
dc.creatorGuo, Jen_US
dc.date.accessioned2026-07-22T03:54:18Z-
dc.date.available2026-07-22T03:54:18Z-
dc.identifier.issn2640-3498en_US
dc.identifier.urihttp://hdl.handle.net/10397/120072-
dc.descriptionForty-second International Conference on Machine Learning, ICML 2025, Vancouver, Canada, Jul 13-19 2025en_US
dc.language.isoenen_US
dc.publisherPMLR web siteen_US
dc.rightsCopyright 2025 by the author(s).en_US
dc.rightsCC BY 4.0 (https://creativecommons.org/licenses/by/4.0/)en_US
dc.rightsThe following publication Wang, M., Su, H., Li, J., Li, C., Yin, N., & Guo, J. (2025). GraphCL: Graph-based Clustering for Semi-Supervised Medical Image Segmentation. Proceedings of Machine Learning Research, 2025, v. 267, p. 1-10 is available at https://proceedings.mlr.press/v267/wang25cq.html.en_US
dc.subjectClustered featuresen_US
dc.subjectGraphCLen_US
dc.subjectMedical image segmentationen_US
dc.subjectSemi-supervised learningen_US
dc.titleGraphCL : graph-based clustering for semi-supervised medical image segmentationen_US
dc.typeConference Paperen_US
dc.identifier.spage64367en_US
dc.identifier.epage64376en_US
dc.identifier.volume267en_US
dcterms.abstractSemi-supervised learning (SSL) has made notable advancements in medical image segmentation (MIS), particularly in scenarios with limited labeled data, significantly enhancing data utilization efficiency. Previous methods primarily focus on complex training strategies to utilize unlabeled data but neglect the importance of graph structural information. Different from existing methods, we propose a graph-based clustering for semi-supervised medical image segmentation (GraphCL) by jointly modeling graph data structure in a unified deep model. The proposed GraphCL model enjoys several advantages. Firstly, to the best of our knowledge, this is the first work to model the data structure information for semi-supervised medical image segmentation (SSMIS). Secondly, to obtain clustered features across different graphs, we integrate both pairwise affinities between local image features and raw features as inputs. Extensive experimental results on three standard benchmarks show that the proposed GraphCL algorithm outperforms state-of-the-art semi-supervised medical image segmentation methods. The source code is available at https://github.com/dreamkily/GraphCL.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationProceedings of Machine Learning Research, 2025, v. 267, p. 64367-64376en_US
dcterms.isPartOfProceedings of Machine Learning Researchen_US
dcterms.issued2025-
dc.relation.conferenceConference on Machine Learning [ICML]en_US
dc.description.validate202607 bcwcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumbera4666-
dc.identifier.SubFormID53530-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis work is supported by the National Natural Science Foundation of China under Grants No. 62406100, Tianjin Natural Science Foundation under Grants No. 24JCQNJC00320, Beijing Postdoctoral Research Foundation. This work is also supported by funding from the Hong Kong RGC General Research Fund (No. 152211/23E, 15216424/24E, and 152115/25E), the PolyU Internal Fund (No. P0056171), and the Huawei Gifted Fund.en_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
wang25cq.pdf2.43 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.