神经切片膜检测的局部对比孔填充算法

R. Raju, T. Maul, A. Bargiela
{"title":"神经切片膜检测的局部对比孔填充算法","authors":"R. Raju, T. Maul, A. Bargiela","doi":"10.1109/ISCAIE.2014.7010227","DOIUrl":null,"url":null,"abstract":"Local Contrast Hole Filling Algorithm for Neural Slices Membrane Detection (LCHF) algorithm is non-learning, simple, easily adopted, and undependable on ground-truth; and it can recognize membrane and eliminates organelles, using a very simple algorithm that consist of short sequences of basic processing steps yet can be relatively competitive. Here, we would like to show the simple processing stages, and the effectiveness of the LCHF algorithm, with other similar neuronal datasets. The performance of the algorithm was measured in terms of Precision, Recall and F1 score. Precision (also known as positive predictive value), and Recall (also known as sensitivity). F1 score (also known as F-score or F-measure). The experiments were performed on data provided by the ISBI 2012 (IEEE International Symposium on Biomedical Imaging). LCHF generously allowed to classify pixels into membrane/non-membrane for these datasets, and took 44 seconds for 30 slices to produce the comparable best result, and recorded average F1 score of more than 71% similarity with the benchmark ground-truth image.","PeriodicalId":385258,"journal":{"name":"2014 IEEE Symposium on Computer Applications and Industrial Electronics (ISCAIE)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Local contrast hole filling algorithm for neura slices membrane detection — LCHF\",\"authors\":\"R. Raju, T. Maul, A. Bargiela\",\"doi\":\"10.1109/ISCAIE.2014.7010227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Local Contrast Hole Filling Algorithm for Neural Slices Membrane Detection (LCHF) algorithm is non-learning, simple, easily adopted, and undependable on ground-truth; and it can recognize membrane and eliminates organelles, using a very simple algorithm that consist of short sequences of basic processing steps yet can be relatively competitive. Here, we would like to show the simple processing stages, and the effectiveness of the LCHF algorithm, with other similar neuronal datasets. The performance of the algorithm was measured in terms of Precision, Recall and F1 score. Precision (also known as positive predictive value), and Recall (also known as sensitivity). F1 score (also known as F-score or F-measure). The experiments were performed on data provided by the ISBI 2012 (IEEE International Symposium on Biomedical Imaging). LCHF generously allowed to classify pixels into membrane/non-membrane for these datasets, and took 44 seconds for 30 slices to produce the comparable best result, and recorded average F1 score of more than 71% similarity with the benchmark ground-truth image.\",\"PeriodicalId\":385258,\"journal\":{\"name\":\"2014 IEEE Symposium on Computer Applications and Industrial Electronics (ISCAIE)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Symposium on Computer Applications and Industrial Electronics (ISCAIE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAIE.2014.7010227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computer Applications and Industrial Electronics (ISCAIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAIE.2014.7010227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

神经切片膜检测(LCHF)算法具有非学习、简单、易采用、对真值不可靠等特点;它可以识别膜并消除细胞器,使用一个非常简单的算法,由短序列的基本处理步骤组成,但相对具有竞争力。在这里,我们想用其他类似的神经元数据集展示简单的处理阶段,以及LCHF算法的有效性。该算法的性能是衡量精度,召回率和F1得分。精密度(也称为正预测值)和召回率(也称为灵敏度)。F1分数(也称为f分数或f测量)。实验数据由ISBI 2012 (IEEE国际生物医学成像研讨会)提供。LCHF慷慨地允许将这些数据集的像素分为膜/非膜,并在44秒内对30个切片产生可比较的最佳结果,并记录了与基准真实图像相似度超过71%的平均F1分数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Local contrast hole filling algorithm for neura slices membrane detection — LCHF
Local Contrast Hole Filling Algorithm for Neural Slices Membrane Detection (LCHF) algorithm is non-learning, simple, easily adopted, and undependable on ground-truth; and it can recognize membrane and eliminates organelles, using a very simple algorithm that consist of short sequences of basic processing steps yet can be relatively competitive. Here, we would like to show the simple processing stages, and the effectiveness of the LCHF algorithm, with other similar neuronal datasets. The performance of the algorithm was measured in terms of Precision, Recall and F1 score. Precision (also known as positive predictive value), and Recall (also known as sensitivity). F1 score (also known as F-score or F-measure). The experiments were performed on data provided by the ISBI 2012 (IEEE International Symposium on Biomedical Imaging). LCHF generously allowed to classify pixels into membrane/non-membrane for these datasets, and took 44 seconds for 30 slices to produce the comparable best result, and recorded average F1 score of more than 71% similarity with the benchmark ground-truth image.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信