{"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}
引用次数: 0
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%.