{"title":"Automatic Multilevel Thresholding Using Binary Particle Swarm Optimization for Image Segmentation","authors":"L. Djerou, N. Khelil, H. Dehimi, M. Batouche","doi":"10.1109/SoCPaR.2009.25","DOIUrl":null,"url":null,"abstract":"In this paper an automatic multilevel thresholding approach, based on Binary Particle Swarm Optimization, is proposed. The proposed approach automatically determines the \"optimum\" number of the thresholds and simultaneously searches the optimal thresholds, by optimizing a function which uses the gray level thresholds as parameters. The algorithm starts with large number initial thresholds, then, these thresholds are dynamically refined to improve the value of the objective function. The proposed method is validated by illustrative examples; comparison with the exhaustive search Otsu’s and Kapur’s methods shows its efficiency.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoCPaR.2009.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
In this paper an automatic multilevel thresholding approach, based on Binary Particle Swarm Optimization, is proposed. The proposed approach automatically determines the "optimum" number of the thresholds and simultaneously searches the optimal thresholds, by optimizing a function which uses the gray level thresholds as parameters. The algorithm starts with large number initial thresholds, then, these thresholds are dynamically refined to improve the value of the objective function. The proposed method is validated by illustrative examples; comparison with the exhaustive search Otsu’s and Kapur’s methods shows its efficiency.