用于解剖标记的软分裂随机森林

Guangkai Ma, Yaozong Gao, Li Wang, Ligang Wu, Dinggang Shen
{"title":"用于解剖标记的软分裂随机森林","authors":"Guangkai Ma, Yaozong Gao, Li Wang, Ligang Wu, Dinggang Shen","doi":"10.1007/978-3-319-24888-2_3","DOIUrl":null,"url":null,"abstract":"<p><p>Random Forest (RF) has been widely used in the learning-based labeling. In RF, each sample is directed from the root to each leaf based on the decisions made in the interior nodes, also called splitting nodes. The splitting nodes assign a testing sample to <i>either</i> left <i>or</i> right child based on the learned splitting function. The final prediction is determined as the average of label probability distributions stored in all arrived leaf nodes. For ambiguous testing samples, which often lie near the splitting boundaries, the conventional splitting function, also referred to as <i>hard split</i> function, tends to make wrong assignments, hence leading to wrong predictions. To overcome this limitation, we propose a novel <i>soft-split</i> random forest (SSRF) framework to improve the reliability of node splitting and finally the accuracy of classification. Specifically, a <i>soft split</i> function is employed to assign a testing sample into <i>both</i> left <i>and</i> right child nodes with their certain probabilities, which can effectively reduce influence of the wrong node assignment on the prediction accuracy. As a result, each testing sample can arrive at multiple leaf nodes, and their respective results can be fused to obtain the final prediction according to the weights accumulated along the path from the root node to each leaf node. Besides, considering the importance of context information, we also adopt a Haar-features based context model to iteratively refine the classification map. We have comprehensively evaluated our method on two public datasets, respectively, for labeling hippocampus in MR images and also labeling three organs in Head & Neck CT images. Compared with the <i>hard-split</i> RF (HSRF), our method achieved a notable improvement in labeling accuracy.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"9352 ","pages":"17-25"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6261352/pdf/nihms963645.pdf","citationCount":"0","resultStr":"{\"title\":\"Soft-Split Random Forest for Anatomy Labeling.\",\"authors\":\"Guangkai Ma, Yaozong Gao, Li Wang, Ligang Wu, Dinggang Shen\",\"doi\":\"10.1007/978-3-319-24888-2_3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Random Forest (RF) has been widely used in the learning-based labeling. In RF, each sample is directed from the root to each leaf based on the decisions made in the interior nodes, also called splitting nodes. The splitting nodes assign a testing sample to <i>either</i> left <i>or</i> right child based on the learned splitting function. The final prediction is determined as the average of label probability distributions stored in all arrived leaf nodes. For ambiguous testing samples, which often lie near the splitting boundaries, the conventional splitting function, also referred to as <i>hard split</i> function, tends to make wrong assignments, hence leading to wrong predictions. To overcome this limitation, we propose a novel <i>soft-split</i> random forest (SSRF) framework to improve the reliability of node splitting and finally the accuracy of classification. Specifically, a <i>soft split</i> function is employed to assign a testing sample into <i>both</i> left <i>and</i> right child nodes with their certain probabilities, which can effectively reduce influence of the wrong node assignment on the prediction accuracy. As a result, each testing sample can arrive at multiple leaf nodes, and their respective results can be fused to obtain the final prediction according to the weights accumulated along the path from the root node to each leaf node. Besides, considering the importance of context information, we also adopt a Haar-features based context model to iteratively refine the classification map. We have comprehensively evaluated our method on two public datasets, respectively, for labeling hippocampus in MR images and also labeling three organs in Head & Neck CT images. Compared with the <i>hard-split</i> RF (HSRF), our method achieved a notable improvement in labeling accuracy.</p>\",\"PeriodicalId\":74092,\"journal\":{\"name\":\"Machine learning in medical imaging. MLMI (Workshop)\",\"volume\":\"9352 \",\"pages\":\"17-25\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6261352/pdf/nihms963645.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Machine learning in medical imaging. MLMI (Workshop)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-24888-2_3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2015/10/2 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Machine learning in medical imaging. MLMI (Workshop)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-24888-2_3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2015/10/2 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随机森林(RF)已广泛应用于基于学习的标注。在 RF 中,每个样本都是根据内部节点(也称为分割节点)的决定从根指向每片叶子的。分割节点根据学习到的分割函数将测试样本分配给左侧或右侧子节点。最终的预测结果是存储在所有到达的叶节点中的标签概率分布的平均值。对于模棱两可的测试样本(通常位于拆分边界附近),传统的拆分函数(也称为硬拆分函数)往往会做出错误的分配,从而导致错误的预测。为了克服这一局限,我们提出了一种新颖的软拆分随机森林(SSRF)框架,以提高节点拆分的可靠性和分类的准确性。具体来说,采用软拆分函数将测试样本以一定的概率分配到左右两个子节点中,从而有效降低错误节点分配对预测准确性的影响。因此,每个测试样本可以到达多个叶子节点,并根据从根节点到每个叶子节点的路径所积累的权重,将它们各自的结果进行融合,从而得到最终的预测结果。此外,考虑到上下文信息的重要性,我们还采用了基于 Haar 特征的上下文模型来迭代完善分类图。我们在两个公开数据集上对我们的方法进行了全面评估,这两个数据集分别用于标记 MR 图像中的海马和头颈部 CT 图像中的三个器官。与硬分割射频(HSRF)相比,我们的方法显著提高了标注准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

摘要图片

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Soft-Split Random Forest for Anatomy Labeling.

Random Forest (RF) has been widely used in the learning-based labeling. In RF, each sample is directed from the root to each leaf based on the decisions made in the interior nodes, also called splitting nodes. The splitting nodes assign a testing sample to either left or right child based on the learned splitting function. The final prediction is determined as the average of label probability distributions stored in all arrived leaf nodes. For ambiguous testing samples, which often lie near the splitting boundaries, the conventional splitting function, also referred to as hard split function, tends to make wrong assignments, hence leading to wrong predictions. To overcome this limitation, we propose a novel soft-split random forest (SSRF) framework to improve the reliability of node splitting and finally the accuracy of classification. Specifically, a soft split function is employed to assign a testing sample into both left and right child nodes with their certain probabilities, which can effectively reduce influence of the wrong node assignment on the prediction accuracy. As a result, each testing sample can arrive at multiple leaf nodes, and their respective results can be fused to obtain the final prediction according to the weights accumulated along the path from the root node to each leaf node. Besides, considering the importance of context information, we also adopt a Haar-features based context model to iteratively refine the classification map. We have comprehensively evaluated our method on two public datasets, respectively, for labeling hippocampus in MR images and also labeling three organs in Head & Neck CT images. Compared with the hard-split RF (HSRF), our method achieved a notable improvement in labeling accuracy.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Probabilistic 3D Correspondence Prediction from Sparse Unsegmented Images. Class-Balanced Deep Learning with Adaptive Vector Scaling Loss for Dementia Stage Detection. MoViT: Memorizing Vision Transformers for Medical Image Analysis. Robust Unsupervised Super-Resolution of Infant MRI via Dual-Modal Deep Image Prior. IA-GCN: Interpretable Attention based Graph Convolutional Network for Disease Prediction.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1