{"title":"具有块预测的基于块的连通分量标注算法","authors":"Yunseok Jang, J. Mun, Kyoungmook Oh, Jaeseok Kim","doi":"10.1109/TSP.2017.8076053","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a block-based connected component labeling algorithm, which predicts current block's label by exploiting the information obtained from previous block to reduce memory access. By generating a forest of decision trees according to some of previous block's pixels, which are also needed for current block's label decision, we can reduce trees' depth and number of pixels to check. Experimental results show that our method is faster than the most recent labeling algorithms with image datasets which have various size and pixel density.","PeriodicalId":256818,"journal":{"name":"2017 40th International Conference on Telecommunications and Signal Processing (TSP)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Block-Based connected component labeling algorithm with block prediction\",\"authors\":\"Yunseok Jang, J. Mun, Kyoungmook Oh, Jaeseok Kim\",\"doi\":\"10.1109/TSP.2017.8076053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a block-based connected component labeling algorithm, which predicts current block's label by exploiting the information obtained from previous block to reduce memory access. By generating a forest of decision trees according to some of previous block's pixels, which are also needed for current block's label decision, we can reduce trees' depth and number of pixels to check. Experimental results show that our method is faster than the most recent labeling algorithms with image datasets which have various size and pixel density.\",\"PeriodicalId\":256818,\"journal\":{\"name\":\"2017 40th International Conference on Telecommunications and Signal Processing (TSP)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 40th International Conference on Telecommunications and Signal Processing (TSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSP.2017.8076053\",\"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 40th International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2017.8076053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Block-Based connected component labeling algorithm with block prediction
In this paper, we propose a block-based connected component labeling algorithm, which predicts current block's label by exploiting the information obtained from previous block to reduce memory access. By generating a forest of decision trees according to some of previous block's pixels, which are also needed for current block's label decision, we can reduce trees' depth and number of pixels to check. Experimental results show that our method is faster than the most recent labeling algorithms with image datasets which have various size and pixel density.