Pub Date : 2016-01-01Epub Date: 2016-10-01DOI: 10.1007/978-3-319-47157-0_30
Xi Yang, Yan Jin, Xiaobo Chen, Han Zhang, Gang Li, Dinggang Shen
The resting-state functional MRI (rs-fMRI) has been demonstrated as a valuable neuroimaging tool to identify mild cognitive impairment (MCI) patients. Previous studies showed network breakdown in MCI patients with thresholded rs-fMRI connectivity networks. Recently, machine learning techniques have assisted MCI diagnosis by integrating information from multiple networks constructed with a range of thresholds. However, due to the difficulty of searching optimal thresholds, they are often predetermined and uniformly applied to the entire network. Here, we propose an element-wise thresholding strategy to dynamically construct multiple functional networks, i.e., using possibly different thresholds for different elements in the connectivity matrix. These dynamically generated networks are then integrated with a network fusion scheme to capture their common and complementary information. Finally, the features extracted from the fused network are fed into support vector machine (SVM) for MCI diagnosis. Compared to the previous methods, our proposed framework can greatly improve MCI classification performance.
{"title":"Functional Connectivity Network Fusion with Dynamic Thresholding for MCI Diagnosis.","authors":"Xi Yang, Yan Jin, Xiaobo Chen, Han Zhang, Gang Li, Dinggang Shen","doi":"10.1007/978-3-319-47157-0_30","DOIUrl":"10.1007/978-3-319-47157-0_30","url":null,"abstract":"<p><p>The resting-state functional MRI (rs-fMRI) has been demonstrated as a valuable neuroimaging tool to identify mild cognitive impairment (MCI) patients. Previous studies showed network breakdown in MCI patients with thresholded rs-fMRI connectivity networks. Recently, machine learning techniques have assisted MCI diagnosis by integrating information from multiple networks constructed with a range of thresholds. However, due to the difficulty of searching optimal thresholds, they are often predetermined and uniformly applied to the entire network. Here, we propose an element-wise thresholding strategy to dynamically construct multiple functional networks, i.e., using possibly different thresholds for different elements in the connectivity matrix. These dynamically generated networks are then integrated with a network fusion scheme to capture their common and complementary information. Finally, the features extracted from the fused network are fed into support vector machine (SVM) for MCI diagnosis. Compared to the previous methods, our proposed framework can greatly improve MCI classification performance.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":" ","pages":"246-253"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5609704/pdf/nihms851226.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35542412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-01Epub Date: 2016-10-01DOI: 10.1007/978-3-319-47157-0_38
Xiaofeng Zhu, Kim-Han Thung, Jun Zhang, Dinggang She
This paper proposes a framework of fast neuroimaging-based retrieval and AD analysis, by three key steps: (1) landmark detection, which efficiently extracts landmark-based neuroimaging features without the need of nonlinear registration in testing stage; (2) landmark selection, which removes redundant/noisy landmarks via proposing a feature selection method that considers structural information among landmarks; and (3) hashing, which converts high-dimensional features of subjects into binary codes, for efficiently conducting approximate nearest neighbor search and diagnosis of AD. We have conducted experiments on Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset, and demonstrated that our framework could achieve higher performance than the comparison methods, in terms of accuracy and speed (at least 100 times faster).
本文通过三个关键步骤提出了基于神经影像的快速检索和 AD 分析框架:(1) 地标检测:无需在测试阶段进行非线性配准,即可高效提取基于地标的神经影像特征;(2) 地标选择:通过提出一种考虑地标间结构信息的特征选择方法,去除冗余/噪声地标;(3) 散列:将受试者的高维特征转换为二进制代码,以高效进行近似近邻搜索和 AD 诊断。我们在阿尔茨海默病神经影像计划(ADNI)数据集上进行了实验,结果表明,我们的框架在准确性和速度方面(至少快 100 倍)都能达到比对比方法更高的性能。
{"title":"Fast Neuroimaging-Based Retrieval for Alzheimer's Disease Analysis.","authors":"Xiaofeng Zhu, Kim-Han Thung, Jun Zhang, Dinggang She","doi":"10.1007/978-3-319-47157-0_38","DOIUrl":"10.1007/978-3-319-47157-0_38","url":null,"abstract":"<p><p>This paper proposes a framework of fast neuroimaging-based retrieval and AD analysis, by three key steps: (1) <i>landmark detection</i>, which efficiently extracts landmark-based neuroimaging features without the need of nonlinear registration in testing stage; (2) <i>landmark selection</i>, which removes redundant/noisy landmarks via proposing a feature selection method that considers structural information among landmarks; and (3) <i>hashing</i>, which converts high-dimensional features of subjects into binary codes, for efficiently conducting approximate nearest neighbor search and diagnosis of AD. We have conducted experiments on Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset, and demonstrated that our framework could achieve higher performance than the comparison methods, in terms of accuracy and speed (at least 100 times faster).</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"10019 ","pages":"313-321"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5614455/pdf/nihms851222.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10001173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Neuroimaging data have been widely used to derive possible biomarkers for Alzheimer's Disease (AD) diagnosis. As only certain brain regions are related to AD progression, many feature selection methods have been proposed to identify informative features (i.e., brain regions) to build an accurate prediction model. These methods mostly only focus on the feature-target relationship to select features which are discriminative to the targets (e.g., diagnosis labels). However, since the brain regions are anatomically and functionally connected, there could be useful intrinsic relationships among features. In this paper, by utilizing both the feature-target and feature-feature relationships, we propose a novel sparse regression model to select informative features which are discriminative to the targets and also representative to the features. We argue that the features which are representative (i.e., can be used to represent many other features) are important, as they signify strong "connection" with other ROIs, and could be related to the disease progression. We use our model to select features for both binary and multi-class classification tasks, and the experimental results on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset show that the proposed method outperforms other comparison methods considered in this work.
神经影像数据已被广泛用于提取阿尔茨海默病(AD)诊断的可能生物标记物。由于只有某些脑区与阿兹海默症的进展相关,人们提出了许多特征选择方法来识别信息特征(即脑区),以建立准确的预测模型。这些方法大多只关注特征与目标的关系,以选择对目标(如诊断标签)具有区分性的特征。然而,由于脑区在解剖学和功能上相互关联,特征之间可能存在有用的内在关系。在本文中,通过利用特征-目标和特征-特征之间的关系,我们提出了一种新颖的稀疏回归模型,以选择对目标具有鉴别性且对特征具有代表性的信息特征。我们认为,具有代表性(即可用于代表许多其他特征)的特征非常重要,因为它们标志着与其他 ROI 的紧密 "联系",并可能与疾病进展相关。我们使用我们的模型为二元分类和多类分类任务选择特征,在阿尔茨海默病神经影像计划(ADNI)数据集上的实验结果表明,所提出的方法优于本研究中考虑的其他比较方法。
{"title":"Joint Discriminative and Representative Feature Selection for Alzheimer's Disease Diagnosis.","authors":"Xiaofeng Zhu, Heung-Il Suk, Kim-Han Thung, Yingying Zhu, Guorong Wu, Dinggang Shen","doi":"10.1007/978-3-319-47157-0_10","DOIUrl":"10.1007/978-3-319-47157-0_10","url":null,"abstract":"<p><p>Neuroimaging data have been widely used to derive possible biomarkers for Alzheimer's Disease (AD) diagnosis. As only certain brain regions are related to AD progression, many feature selection methods have been proposed to identify informative features (<i>i.e.</i>, brain regions) to build an accurate prediction model. These methods mostly only focus on the feature-target relationship to select features which are discriminative to the targets (<i>e.g.</i>, diagnosis labels). However, since the brain regions are anatomically and functionally connected, there could be useful intrinsic relationships among features. In this paper, by utilizing both the feature-target and feature-feature relationships, we propose a novel sparse regression model to select informative features which are discriminative to the targets and also representative to the features. We argue that the features which are representative (<i>i.e.</i>, can be used to represent many other features) are important, as they signify strong \"connection\" with other ROIs, and could be related to the disease progression. We use our model to select features for both binary and multi-class classification tasks, and the experimental results on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset show that the proposed method outperforms other comparison methods considered in this work.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":" ","pages":"77-85"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5612439/pdf/nihms851223.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35552562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-05DOI: 10.1007/978-3-319-24888-2_25
Hong-Yu Ge, Guorong Wu, Li Wang, Yaozong Gao, D. Shen
{"title":"Hierarchical Multi-modal Image Registration by Learning Common Feature Representations","authors":"Hong-Yu Ge, Guorong Wu, Li Wang, Yaozong Gao, D. Shen","doi":"10.1007/978-3-319-24888-2_25","DOIUrl":"https://doi.org/10.1007/978-3-319-24888-2_25","url":null,"abstract":"","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"5 1","pages":"203-211"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72909296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-05DOI: 10.1007/978-3-319-24888-2_21
Yan Jin, Chong-Yaw Wee, F. Shi, Kim-Han Thung, P. Yap, D. Shen
{"title":"Identification of Infants at Risk for Autism Using Multi-parameter Hierarchical White Matter Connectomes","authors":"Yan Jin, Chong-Yaw Wee, F. Shi, Kim-Han Thung, P. Yap, D. Shen","doi":"10.1007/978-3-319-24888-2_21","DOIUrl":"https://doi.org/10.1007/978-3-319-24888-2_21","url":null,"abstract":"","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"88 1","pages":"170-177"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84328435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01Epub Date: 2015-10-02DOI: 10.1007/978-3-319-24888-2_36
Mingxia Liu, Daoqiang Zhang, Dinggang Shen
Multi-atlas based morphometric pattern analysis has been recently proposed for the automatic diagnosis of Alzheimer's disease (AD) and its early stage, i.e., mild cognitive impairment (MCI), where multi-view feature representations for subjects are generated by using multiple atlases. However, existing multi-atlas based methods usually assume that each class is represented by a specific type of data distribution (i.e., a single cluster), while the underlying distribution of data is actually a prior unknown. In this paper, we propose an inherent structure-guided multi-view leaning (ISML) method for AD/MCI classification. Specifically, we first extract multi-view features for subjects using multiple selected atlases, and then cluster subjects in the original classes into several sub-classes (i.e., clusters) in each atlas space. Then, we encode each subject with a new label vector, by considering both the original class labels and the coding vectors for those sub-classes, followed by a multi-task feature selection model in each of multi-atlas spaces. Finally, we learn multiple SVM classifiers based on the selected features, and fuse them together by an ensemble classification method. Experimental results on the Alzheimer's Disease Neuroimaging Initiative (ADNI) database demonstrate that our method achieves better performance than several state-of-the-art methods in AD/MCI classification.
{"title":"Inherent Structure-Guided Multi-view Learning for Alzheimer's Disease and Mild Cognitive Impairment Classification.","authors":"Mingxia Liu, Daoqiang Zhang, Dinggang Shen","doi":"10.1007/978-3-319-24888-2_36","DOIUrl":"https://doi.org/10.1007/978-3-319-24888-2_36","url":null,"abstract":"<p><p>Multi-atlas based morphometric pattern analysis has been recently proposed for the automatic diagnosis of Alzheimer's disease (AD) and its early stage, i.e., mild cognitive impairment (MCI), where multi-view feature representations for subjects are generated by using multiple atlases. However, existing multi-atlas based methods usually assume that each class is represented by a specific type of data distribution (i.e., a single cluster), while the underlying distribution of data is actually a prior unknown. In this paper, we propose an inherent structure-guided multi-view leaning (ISML) method for AD/MCI classification. Specifically, we first extract multi-view features for subjects using multiple selected atlases, and then cluster subjects in the original classes into several sub-classes (i.e., clusters) in each atlas space. Then, we encode each subject with a new label vector, by considering both the original class labels and the coding vectors for those sub-classes, followed by a multi-task feature selection model in each of multi-atlas spaces. Finally, we learn multiple SVM classifiers based on the selected features, and fuse them together by an ensemble classification method. Experimental results on the Alzheimer's Disease Neuroimaging Initiative (ADNI) database demonstrate that our method achieves better performance than several state-of-the-art methods in AD/MCI classification.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"9352 ","pages":"296-303"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-319-24888-2_36","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34323845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01Epub Date: 2015-10-02DOI: 10.1007/978-3-319-24888-2_24
Snehashis Roy, Aaron Carass, Jerry L Prince, Dzung L Pham
Segmenting T2-hyperintense white matter lesions from longitudinal MR images is essential in understanding progression of multiple sclerosis. Most lesion segmentation techniques find lesions independently at each time point, even though there are different noise and image contrast variations at each point in the time series. In this paper, we present a patch based 4D lesion segmentation method that takes advantage of the temporal component of longitudinal data. For each subject with multiple time-points, 4D patches are constructed from the T1-w and FLAIR scans of all time-points. For every 4D patch from a subject, a few relevant matching 4D patches are found from a reference, such that their convex combination reconstructs the subject's 4D patch. Then corresponding manual segmentation patches of the reference are combined in a similar manner to generate a 4D membership of lesions of the subject patch. We compare our 4D patch-based segmentation with independent 3D voxel-based and patch-based lesion segmentation algorithms. Based on ground truth segmentations from 30 data sets, we show that the mean Dice coefficients between manual and automated segmentations improve after using the 4D approach compared to two state-of-the-art 3D segmentation algorithms.
{"title":"Longitudinal Patch-Based Segmentation of Multiple Sclerosis White Matter Lesions.","authors":"Snehashis Roy, Aaron Carass, Jerry L Prince, Dzung L Pham","doi":"10.1007/978-3-319-24888-2_24","DOIUrl":"https://doi.org/10.1007/978-3-319-24888-2_24","url":null,"abstract":"<p><p>Segmenting T2-hyperintense white matter lesions from longitudinal MR images is essential in understanding progression of multiple sclerosis. Most lesion segmentation techniques find lesions independently at each time point, even though there are different noise and image contrast variations at each point in the time series. In this paper, we present a patch based 4D lesion segmentation method that takes advantage of the temporal component of longitudinal data. For each subject with multiple time-points, 4D patches are constructed from the <i>T</i><sub>1</sub>-w and FLAIR scans of all time-points. For every 4D patch from a subject, a few relevant matching 4D patches are found from a reference, such that their convex combination reconstructs the subject's 4D patch. Then corresponding manual segmentation patches of the reference are combined in a similar manner to generate a 4D membership of lesions of the subject patch. We compare our 4D patch-based segmentation with independent 3D voxel-based and patch-based lesion segmentation algorithms. Based on ground truth segmentations from 30 data sets, we show that the mean Dice coefficients between manual and automated segmentations improve after using the 4D approach compared to two state-of-the-art 3D segmentation algorithms.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"9352 ","pages":"194-202"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-319-24888-2_24","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34701960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01Epub Date: 2015-10-02DOI: 10.1007/978-3-319-24888-2_39
Tri Huynh, Yaozong Gao, Jiayin Kang, Li Wang, Pei Zhang, Dinggang Shen
Random forest has been widely recognized as one of the most powerful learning-based predictors in literature, with a broad range of applications in medical imaging. Notable efforts have been focused on enhancing the algorithm in multiple facets. In this paper, we present an original concept of multi-source information gain that escapes from the conventional notion inherent to random forest. We propose the idea of characterizing information gain in the training process by utilizing multiple beneficial sources of information, instead of the sole governing of prediction targets as conventionally known. We suggest the use of location and input image patches as the secondary sources of information for guiding the splitting process in random forest, and experiment on the challenging task of predicting CT images from MRI data. The experimentation is thoroughly analyzed in two datasets, i.e., human brain and prostate, with its performance further validated with the integration of auto-context model. Results prove that the multi-source information gain concept effectively helps better guide the training process with consistent improvement in prediction accuracy.
{"title":"Multi-source Information Gain for Random Forest: An Application to CT Image Prediction from MRI Data.","authors":"Tri Huynh, Yaozong Gao, Jiayin Kang, Li Wang, Pei Zhang, Dinggang Shen","doi":"10.1007/978-3-319-24888-2_39","DOIUrl":"10.1007/978-3-319-24888-2_39","url":null,"abstract":"<p><p>Random forest has been widely recognized as one of the most powerful learning-based predictors in literature, with a broad range of applications in medical imaging. Notable efforts have been focused on enhancing the algorithm in multiple facets. In this paper, we present an original concept of <i>multi-source information gain</i> that escapes from the conventional notion inherent to random forest. We propose the idea of characterizing information gain in the training process by utilizing <i>multiple beneficial sources of information</i>, instead of the <i>sole governing of prediction targets</i> as conventionally known. We suggest the use of location and input image patches as the secondary sources of information for guiding the splitting process in random forest, and experiment on the challenging task of predicting CT images from MRI data. The experimentation is thoroughly analyzed in two datasets, i.e., human brain and prostate, with its performance further validated with the integration of auto-context model. Results prove that the <i>multi-source information gain</i> concept effectively helps better guide the training process with consistent improvement in prediction accuracy.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"9352 ","pages":"321-329"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-319-24888-2_39","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36789069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01Epub Date: 2015-10-02DOI: 10.1007/978-3-319-24888-2_3
Guangkai Ma, Yaozong Gao, Li Wang, Ligang Wu, Dinggang Shen
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.
随机森林(RF)已广泛应用于基于学习的标注。在 RF 中,每个样本都是根据内部节点(也称为分割节点)的决定从根指向每片叶子的。分割节点根据学习到的分割函数将测试样本分配给左侧或右侧子节点。最终的预测结果是存储在所有到达的叶节点中的标签概率分布的平均值。对于模棱两可的测试样本(通常位于拆分边界附近),传统的拆分函数(也称为硬拆分函数)往往会做出错误的分配,从而导致错误的预测。为了克服这一局限,我们提出了一种新颖的软拆分随机森林(SSRF)框架,以提高节点拆分的可靠性和分类的准确性。具体来说,采用软拆分函数将测试样本以一定的概率分配到左右两个子节点中,从而有效降低错误节点分配对预测准确性的影响。因此,每个测试样本可以到达多个叶子节点,并根据从根节点到每个叶子节点的路径所积累的权重,将它们各自的结果进行融合,从而得到最终的预测结果。此外,考虑到上下文信息的重要性,我们还采用了基于 Haar 特征的上下文模型来迭代完善分类图。我们在两个公开数据集上对我们的方法进行了全面评估,这两个数据集分别用于标记 MR 图像中的海马和头颈部 CT 图像中的三个器官。与硬分割射频(HSRF)相比,我们的方法显著提高了标注准确率。
{"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":"10.1007/978-3-319-24888-2_3","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.0,"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":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36789068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a multi-view learning method using Magnetic Resonance Imaging (MRI) data for Alzheimer's Disease (AD) diagnosis. Specifically, we extract both Region-Of-Interest (ROI) features and Histograms of Oriented Gradient (HOG) features from each MRI image, and then propose mapping HOG features onto the space of ROI features to make them comparable and to impose high intra-class similarity with low inter-class similarity. Finally, both mapped HOG features and original ROI features are input to the support vector machine for AD diagnosis. The purpose of mapping HOG features onto the space of ROI features is to provide complementary information so that features from different views can not only be comparable (i.e., homogeneous) but also be interpretable. For example, ROI features are robust to noise, but lack of reflecting small or subtle changes, while HOG features are diverse but less robust to noise. The proposed multi-view learning method is designed to learn the transformation between two spaces and to separate the classes under the supervision of class labels. The experimental results on the MRI images from the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset show that the proposed multi-view method helps enhance disease status identification performance, outperforming both baseline methods and state-of-the-art methods.
本文提出了一种利用磁共振成像(MRI)数据进行阿尔茨海默病(AD)诊断的多视图学习方法。具体来说,我们从每张核磁共振成像图像中提取感兴趣区域(ROI)特征和定向梯度直方图(HOG)特征,然后提出将 HOG 特征映射到 ROI 特征空间,使它们具有可比性,并使类内相似性高而类间相似性低。最后,将映射的 HOG 特征和原始 ROI 特征输入支持向量机,用于 AD 诊断。将 HOG 特征映射到 ROI 特征空间的目的是提供互补信息,使来自不同视图的特征不仅具有可比性(即同质性),而且具有可解释性。例如,ROI 特征对噪声具有鲁棒性,但不能反映微小或细微的变化,而 HOG 特征具有多样性,但对噪声的鲁棒性较差。所提出的多视图学习方法旨在学习两个空间之间的转换,并在类标签的监督下进行类分离。在阿尔茨海默病神经成像计划(ADNI)数据集的核磁共振图像上的实验结果表明,所提出的多视图方法有助于提高疾病状态识别性能,其性能优于基线方法和最先进的方法。
{"title":"Multi-view Classification for Identification of Alzheimer's Disease.","authors":"Xiaofeng Zhu, Heung-Il Suk, Yonghua Zhu, Kim-Han Thung, Guorong Wu, Dinggang Shen","doi":"10.1007/978-3-319-24888-2_31","DOIUrl":"10.1007/978-3-319-24888-2_31","url":null,"abstract":"<p><p>In this paper, we propose a multi-view learning method using Magnetic Resonance Imaging (MRI) data for Alzheimer's Disease (AD) diagnosis. Specifically, we extract both Region-Of-Interest (ROI) features and Histograms of Oriented Gradient (HOG) features from each MRI image, and then propose mapping HOG features onto the space of ROI features to make them comparable and to impose high intra-class similarity with low inter-class similarity. Finally, both mapped HOG features and original ROI features are input to the support vector machine for AD diagnosis. The purpose of mapping HOG features onto the space of ROI features is to provide complementary information so that features from different views can <i>not only</i> be comparable (<i>i.e.,</i> homogeneous) <i>but also</i> be interpretable. For example, ROI features are robust to noise, but lack of reflecting small or subtle changes, while HOG features are diverse but less robust to noise. The proposed multi-view learning method is designed to learn the transformation between two spaces and to separate the classes under the supervision of class labels. The experimental results on the MRI images from the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset show that the proposed multi-view method helps enhance disease status identification performance, outperforming both baseline methods and state-of-the-art methods.</p>","PeriodicalId":74092,"journal":{"name":"Machine learning in medical imaging. MLMI (Workshop)","volume":"9352 1","pages":"255-262"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4758364/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82496986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}