{"title":"一维实际信号的线性分水岭算法","authors":"R. Marik, L. Bohác","doi":"10.1109/ICSAI.2017.8248450","DOIUrl":null,"url":null,"abstract":"The watershed transformation is widely used, a powerful tool for the segmentation of 2D and 3D images. In this paper we propose a fast linear one sweep algorithm generating all possible extreme weighted connected components in 1D real value signal. We also show how such a post-order list of connected components can be converted into a component tree in linear time. Furthermore, we demonstrate how some features of the connected components can be computed again in linear time.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Linear watershed algorithm for 1D real signals\",\"authors\":\"R. Marik, L. Bohác\",\"doi\":\"10.1109/ICSAI.2017.8248450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The watershed transformation is widely used, a powerful tool for the segmentation of 2D and 3D images. In this paper we propose a fast linear one sweep algorithm generating all possible extreme weighted connected components in 1D real value signal. We also show how such a post-order list of connected components can be converted into a component tree in linear time. Furthermore, we demonstrate how some features of the connected components can be computed again in linear time.\",\"PeriodicalId\":285726,\"journal\":{\"name\":\"2017 4th International Conference on Systems and Informatics (ICSAI)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 4th International Conference on Systems and Informatics (ICSAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2017.8248450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Systems and Informatics (ICSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2017.8248450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The watershed transformation is widely used, a powerful tool for the segmentation of 2D and 3D images. In this paper we propose a fast linear one sweep algorithm generating all possible extreme weighted connected components in 1D real value signal. We also show how such a post-order list of connected components can be converted into a component tree in linear time. Furthermore, we demonstrate how some features of the connected components can be computed again in linear time.