{"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}
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.