Block-Based connected component labeling algorithm with block prediction

Yunseok Jang, J. Mun, Kyoungmook Oh, Jaeseok Kim
{"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}
引用次数: 4

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有块预测的基于块的连通分量标注算法
本文提出了一种基于块的连接组件标记算法,该算法利用从前块中获得的信息来预测当前块的标签,以减少内存访问。通过根据当前块的标签决策所需的前块像素生成决策树森林,我们可以减少树的深度和检查像素数。实验结果表明,对于不同大小和像素密度的图像数据集,我们的方法比最新的标记算法更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Energy efficient CM2M communications in healthcare systems An efficient FPGA-Based architecture for convolutional neural networks Usability study of ITU-T P.1201 Amd.2 standard for video quality estimation in HTTP-Based online streaming services A high speed middle accuracy 9-bit SAR-ADC in 0.35-μm CMOS for sensor application in automotive industry High impedance monopole antenna for indoor terahertz wireless communication systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1