亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Semi-supervised medical image segmentation via hard positives oriented contrastive learning

计算机科学 人工智能 嵌入 分割 特征向量 模式识别(心理学) 编码器 特征(语言学) 边距(机器学习) 图像分割 特征学习 判别式 机器学习 哲学 语言学 操作系统
作者
Cheng Tang,Xinyi Zeng,Luping Zhou,Qizheng Zhou,Peng Wang,Xi Wu,Hongping Ren,Jiliu Zhou,Yan Wang
出处
期刊:Pattern Recognition [Elsevier BV]
卷期号:146: 110020-110020 被引量:23
标识
DOI:10.1016/j.patcog.2023.110020
摘要

Semi-supervised learning (SSL) has been a popular technique to resolve the annotation scarcity problem in pattern recognition and medical image segmentation, which usually focuses on two critical issues: 1) learning a well-structured categorizable embedding space, and 2) establishing a robust mapping from the embedding space to the pixel space. In this paper, to resolve the first issue, we propose a hard positives oriented contrastive (HPC) learning strategy to pre-train an encoder-decoder-based segmentation model. Different from vanilla contrastive learning tending to focus only on hard negatives, our HPC learning strategy additionally concentrates on hard positives (i.e., samples with the same category but dissimilar feature representations to the anchor), which are considered to play an even more crucial role in delivering discriminative knowledge for semi-supervised medical image segmentation. Specifically, the HPC is constructed from two levels, including an unsupervised image-level HPC (IHPC) and a supervised pixel-level HPC (PHPC), empowering the embedding space learned by the encoder with both local and global senses. Particularly, the PHPC learning strategy is implemented in a region-based manner, saving memory usage while delivering more multi-granularity information. In response to the second issue, we insert several feature swap (FS) modules into the pre-trained decoder. These FS modules aim to perturb the mapping from the intermediate embedding space towards the pixel space, trying to encourage more robust segmentation predictions. Experiments on two public clinical datasets demonstrate that our proposed framework surpasses the state-of-the-art methods by a large margin. Source codes are available at https://github.com/PerPerZXY/BHPC.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
滕皓轩完成签到 ,获得积分20
14秒前
17秒前
孙孙发布了新的文献求助10
22秒前
彭于晏应助蒙豆儿采纳,获得30
52秒前
1分钟前
蒙豆儿发布了新的文献求助30
1分钟前
依然灬聆听完成签到,获得积分10
1分钟前
Z可完成签到,获得积分10
1分钟前
科研通AI2S应助pxy采纳,获得10
1分钟前
orixero应助袁青寒采纳,获得10
2分钟前
2分钟前
3分钟前
英姑应助科研通管家采纳,获得10
3分钟前
5分钟前
嘻嘻完成签到,获得积分10
5分钟前
abc完成签到 ,获得积分10
5分钟前
lixuebin完成签到 ,获得积分10
7分钟前
NexusExplorer应助狂奔弟弟采纳,获得10
7分钟前
7分钟前
狂奔弟弟发布了新的文献求助10
7分钟前
狂奔弟弟完成签到,获得积分10
7分钟前
a61完成签到,获得积分10
7分钟前
8分钟前
zsc发布了新的文献求助10
8分钟前
HYQ完成签到 ,获得积分10
8分钟前
MchemG完成签到,获得积分0
9分钟前
科研通AI2S应助科研通管家采纳,获得10
9分钟前
Ava应助科研通管家采纳,获得10
9分钟前
沐雨微寒完成签到,获得积分10
9分钟前
科研通AI6应助马良采纳,获得10
10分钟前
科研通AI2S应助hairgod采纳,获得10
10分钟前
hairgod完成签到,获得积分10
11分钟前
Jasper应助科研通管家采纳,获得10
11分钟前
12分钟前
马良发布了新的文献求助10
12分钟前
科研通AI5应助马良采纳,获得10
13分钟前
bkagyin应助狂奔弟弟采纳,获得10
13分钟前
13分钟前
13分钟前
狂奔弟弟发布了新的文献求助10
13分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Manipulating the Mouse Embryo: A Laboratory Manual, Fourth Edition 1000
Comparison of spinal anesthesia and general anesthesia in total hip and total knee arthroplasty: a meta-analysis and systematic review 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
Writing to the Rhythm of Labor Cultural Politics of the Chinese Revolution, 1942–1976 300
Lightning Wires: The Telegraph and China's Technological Modernization, 1860-1890 250
On the Validity of the Independent-Particle Model and the Sum-rule Approach to the Deeply Bound States in Nuclei 220
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4582292
求助须知:如何正确求助?哪些是违规求助? 4000077
关于积分的说明 12382091
捐赠科研通 3674945
什么是DOI,文献DOI怎么找? 2025541
邀请新用户注册赠送积分活动 1059261
科研通“疑难数据库(出版商)”最低求助积分说明 945875