{"title":"An efficient watershed algorithm for preprocessed binary image","authors":"Qingyi Gu, Jun Chen, T. Aoyama, I. Ishii","doi":"10.1109/ICINFA.2016.7832106","DOIUrl":null,"url":null,"abstract":"Over-segmentation of a grayscale image is a typical problem in existing watershed algorithms. To overcome this problem, preprocessing is mainly applied to the grayscale image before performing the watershed transformation to generate a gradient or binary image. In this paper, a novel watershed algorithm based on the concept of connected-component labeling and chain code is proposed, which generates a final label map in just four scans of a preprocessed binary image. The low memory consumption, low complexity, and simple data structure of the algorithm make it highly suitable for hardware implementation. Evaluation results showed that the proposed algorithm decreases the average running time by more than 39% without loss of accuracy.","PeriodicalId":389619,"journal":{"name":"2016 IEEE International Conference on Information and Automation (ICIA)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Information and Automation (ICIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINFA.2016.7832106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Over-segmentation of a grayscale image is a typical problem in existing watershed algorithms. To overcome this problem, preprocessing is mainly applied to the grayscale image before performing the watershed transformation to generate a gradient or binary image. In this paper, a novel watershed algorithm based on the concept of connected-component labeling and chain code is proposed, which generates a final label map in just four scans of a preprocessed binary image. The low memory consumption, low complexity, and simple data structure of the algorithm make it highly suitable for hardware implementation. Evaluation results showed that the proposed algorithm decreases the average running time by more than 39% without loss of accuracy.