一种新的血细胞图像自动循环分解算法

Leticia V. Guimaraes, A. Suzim, J. Maeda
{"title":"一种新的血细胞图像自动循环分解算法","authors":"Leticia V. Guimaraes, A. Suzim, J. Maeda","doi":"10.1109/BIBE.2000.889618","DOIUrl":null,"url":null,"abstract":"Presents a new automatic circular decomposition algorithm, which proceeds the separation of connected circular particles, in order to locate their center coordinates and estimate their radii. This new algorithm is based on the following supposition \"if you are looking for circles you must assume that all objects in an image are circles, until you can prove they are not\". In this work the authors compare this heuristic algorithm with the polygonal approximation based algorithm proposed by Kubo (1988) in their methods and results. Both of them are able to decompose connected blood cells with some differences: the proposed algorithm is implemented in 2 steps, while the polygonal approximation based method is divided in 4 steps and its input parameters present high sensitivity to noise.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A new automatic circular decomposition algorithm applied to blood cells image\",\"authors\":\"Leticia V. Guimaraes, A. Suzim, J. Maeda\",\"doi\":\"10.1109/BIBE.2000.889618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a new automatic circular decomposition algorithm, which proceeds the separation of connected circular particles, in order to locate their center coordinates and estimate their radii. This new algorithm is based on the following supposition \\\"if you are looking for circles you must assume that all objects in an image are circles, until you can prove they are not\\\". In this work the authors compare this heuristic algorithm with the polygonal approximation based algorithm proposed by Kubo (1988) in their methods and results. Both of them are able to decompose connected blood cells with some differences: the proposed algorithm is implemented in 2 steps, while the polygonal approximation based method is divided in 4 steps and its input parameters present high sensitivity to noise.\",\"PeriodicalId\":196846,\"journal\":{\"name\":\"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBE.2000.889618\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBE.2000.889618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

提出了一种新的自动圆分解算法,对连通的圆粒子进行分离,确定其中心坐标并估计其半径。这个新算法基于以下假设:“如果你在寻找圆,你必须假设图像中的所有物体都是圆,直到你能证明它们不是”。在这项工作中,作者将这种启发式算法与Kubo(1988)提出的基于多边形近似的算法在方法和结果上进行了比较。两者都能分解连通的血细胞,但存在一定的差异:本文算法分为2步实现,而基于多边形近似的方法分为4步,其输入参数对噪声具有较高的敏感性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new automatic circular decomposition algorithm applied to blood cells image
Presents a new automatic circular decomposition algorithm, which proceeds the separation of connected circular particles, in order to locate their center coordinates and estimate their radii. This new algorithm is based on the following supposition "if you are looking for circles you must assume that all objects in an image are circles, until you can prove they are not". In this work the authors compare this heuristic algorithm with the polygonal approximation based algorithm proposed by Kubo (1988) in their methods and results. Both of them are able to decompose connected blood cells with some differences: the proposed algorithm is implemented in 2 steps, while the polygonal approximation based method is divided in 4 steps and its input parameters present high sensitivity to noise.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Classification and estimation of ultrasound speckle noise with neural networks A digital retina-like low level vision processor Achieving interoperability of genome databases through intelligent Web mediators Reconstructing specimens using DIC microscope images Gene mapping by haplotype pattern mining
×
引用
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