快速马尔可夫图像分割

M. Ameur, C. Daoui, N. Idrissi
{"title":"快速马尔可夫图像分割","authors":"M. Ameur, C. Daoui, N. Idrissi","doi":"10.1109/ICOA49421.2020.9094479","DOIUrl":null,"url":null,"abstract":"This paper presents a solution to speed up the execution time of Hidden Markov Chain with Independent Noise model used in images segmentation. This solution is a traditional solution that divides the input image into a number of data blocks. Each block is treated independently to another following the same steps of estimation than the standard approach before dividing follows. The treatement of these blocks is sequentially. After the treatement of all blocks, we combine the result blocks to build the image result of segmentation. We compare our approach with the initial approach in term of complexity, segmentation quality and execution time. From the values of evaluated measures, we can confirm that our proposition provides the same results of segmentation than the initial approach but, our solution reduces the real execution time before dividing approximately by 40%.","PeriodicalId":253361,"journal":{"name":"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast Markovian Images Segmentation\",\"authors\":\"M. Ameur, C. Daoui, N. Idrissi\",\"doi\":\"10.1109/ICOA49421.2020.9094479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a solution to speed up the execution time of Hidden Markov Chain with Independent Noise model used in images segmentation. This solution is a traditional solution that divides the input image into a number of data blocks. Each block is treated independently to another following the same steps of estimation than the standard approach before dividing follows. The treatement of these blocks is sequentially. After the treatement of all blocks, we combine the result blocks to build the image result of segmentation. We compare our approach with the initial approach in term of complexity, segmentation quality and execution time. From the values of evaluated measures, we can confirm that our proposition provides the same results of segmentation than the initial approach but, our solution reduces the real execution time before dividing approximately by 40%.\",\"PeriodicalId\":253361,\"journal\":{\"name\":\"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOA49421.2020.9094479\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOA49421.2020.9094479","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种利用独立噪声模型加快隐马尔可夫链在图像分割中的执行速度的方法。该解决方案是将输入图像划分为多个数据块的传统解决方案。每个块独立于另一个块,按照与标准方法相同的估计步骤进行划分。这些块的处理是顺序的。在对所有块进行处理后,将结果块进行组合,构建图像分割结果。我们在复杂度、分割质量和执行时间方面与初始方法进行了比较。从评估的度量值来看,我们可以确认我们的提议提供了与初始方法相同的分割结果,但是,我们的解决方案在分割之前减少了大约40%的实际执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast Markovian Images Segmentation
This paper presents a solution to speed up the execution time of Hidden Markov Chain with Independent Noise model used in images segmentation. This solution is a traditional solution that divides the input image into a number of data blocks. Each block is treated independently to another following the same steps of estimation than the standard approach before dividing follows. The treatement of these blocks is sequentially. After the treatement of all blocks, we combine the result blocks to build the image result of segmentation. We compare our approach with the initial approach in term of complexity, segmentation quality and execution time. From the values of evaluated measures, we can confirm that our proposition provides the same results of segmentation than the initial approach but, our solution reduces the real execution time before dividing approximately by 40%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信