{"title":"利用等数据聚类算法辅助直方图分析脑提取","authors":"H. Khastavaneh, H. Ebrahimpour-Komleh","doi":"10.1109/KBEI.2015.7436154","DOIUrl":null,"url":null,"abstract":"Magnetic resonance (MR) imaging has a broad application in diagnosis and detection process of different brain related diseases. Manual analysis of MR images is a cumbersome and time consuming task. In order to automatically analyze the brain tissue accurately, non-brain compartments must be removed from magnetic resonance images. This task is known as brain extraction or skull stripping. In this study a brain extraction method is proposed. The proposed method formulates segmentation problem as a clustering problem and its core component is isodata clustering algorithm. Application of isodata algorithm reveals five distinct clusters. Two of these clusters contain voxels belonging to tissues of interest and three of them belongs to non-brain compartments. In order to produce an accurate brain mask, isodata cluster representatives are initialized by histogram analysis of MR volume of the brain. These representatives are mods of histogram of MR volume. The second stage of the proposed method leads to produce more accurate brain mask by somehow removing outliers. In this case, isodata algorithm performs better. Performance of the proposed method is measured by popular performance measures such as Dice similarity coefficient (Dice), Jaccard similarity index (J), sensitivity, and specificity. The proposed method outperforms BET, BSE, and HWA as popular methods by Dice = 0.959 (0.008) and J = 0.921 (0.168). These results are obtained based on BrainWeb dataset.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Brain extraction using isodata clustering algorithm aided by histogram analysis\",\"authors\":\"H. Khastavaneh, H. Ebrahimpour-Komleh\",\"doi\":\"10.1109/KBEI.2015.7436154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Magnetic resonance (MR) imaging has a broad application in diagnosis and detection process of different brain related diseases. Manual analysis of MR images is a cumbersome and time consuming task. In order to automatically analyze the brain tissue accurately, non-brain compartments must be removed from magnetic resonance images. This task is known as brain extraction or skull stripping. In this study a brain extraction method is proposed. The proposed method formulates segmentation problem as a clustering problem and its core component is isodata clustering algorithm. Application of isodata algorithm reveals five distinct clusters. Two of these clusters contain voxels belonging to tissues of interest and three of them belongs to non-brain compartments. In order to produce an accurate brain mask, isodata cluster representatives are initialized by histogram analysis of MR volume of the brain. These representatives are mods of histogram of MR volume. The second stage of the proposed method leads to produce more accurate brain mask by somehow removing outliers. In this case, isodata algorithm performs better. Performance of the proposed method is measured by popular performance measures such as Dice similarity coefficient (Dice), Jaccard similarity index (J), sensitivity, and specificity. The proposed method outperforms BET, BSE, and HWA as popular methods by Dice = 0.959 (0.008) and J = 0.921 (0.168). These results are obtained based on BrainWeb dataset.\",\"PeriodicalId\":168295,\"journal\":{\"name\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"volume\":\"167 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KBEI.2015.7436154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBEI.2015.7436154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Brain extraction using isodata clustering algorithm aided by histogram analysis
Magnetic resonance (MR) imaging has a broad application in diagnosis and detection process of different brain related diseases. Manual analysis of MR images is a cumbersome and time consuming task. In order to automatically analyze the brain tissue accurately, non-brain compartments must be removed from magnetic resonance images. This task is known as brain extraction or skull stripping. In this study a brain extraction method is proposed. The proposed method formulates segmentation problem as a clustering problem and its core component is isodata clustering algorithm. Application of isodata algorithm reveals five distinct clusters. Two of these clusters contain voxels belonging to tissues of interest and three of them belongs to non-brain compartments. In order to produce an accurate brain mask, isodata cluster representatives are initialized by histogram analysis of MR volume of the brain. These representatives are mods of histogram of MR volume. The second stage of the proposed method leads to produce more accurate brain mask by somehow removing outliers. In this case, isodata algorithm performs better. Performance of the proposed method is measured by popular performance measures such as Dice similarity coefficient (Dice), Jaccard similarity index (J), sensitivity, and specificity. The proposed method outperforms BET, BSE, and HWA as popular methods by Dice = 0.959 (0.008) and J = 0.921 (0.168). These results are obtained based on BrainWeb dataset.