Fast image segmentation based on boosted random forests, integral images, and features on demand

U. Knauer, U. Seiffert
{"title":"Fast image segmentation based on boosted random forests, integral images, and features on demand","authors":"U. Knauer, U. Seiffert","doi":"10.1109/CIEL.2014.7015737","DOIUrl":null,"url":null,"abstract":"The paper addresses the tradeoff between speed and quality of image segmentation typically found in real-time or high-throughput image analysis tasks. We propose a novel approach for high-quality image segmentation based on a rich and high-dimensional feature space and strong classifiers. To enable fast feature extraction in color images, multiple integral images are used. A decision tree based approach based on twostage Random Forest classifiers is utilized to solve several binary as well as multiclass segmentation problems. It is an intrinsic property of the tree based approach, that any decision is based on a small subset of input features only. Hence, analysis of the tree structures enables a sequential feature extraction. Runtime measurements with several real-world datasets show that the approach enables fast high-quality segmentation. Moreover, the approach can be easily used in parallel computation frameworks because calculation of integral images as well as computation of individual decisions can be done separately. Also, the number of base classifiers can be easily adapted to meet a certain time constraint.","PeriodicalId":229765,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Ensemble Learning (CIEL)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence in Ensemble Learning (CIEL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIEL.2014.7015737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The paper addresses the tradeoff between speed and quality of image segmentation typically found in real-time or high-throughput image analysis tasks. We propose a novel approach for high-quality image segmentation based on a rich and high-dimensional feature space and strong classifiers. To enable fast feature extraction in color images, multiple integral images are used. A decision tree based approach based on twostage Random Forest classifiers is utilized to solve several binary as well as multiclass segmentation problems. It is an intrinsic property of the tree based approach, that any decision is based on a small subset of input features only. Hence, analysis of the tree structures enables a sequential feature extraction. Runtime measurements with several real-world datasets show that the approach enables fast high-quality segmentation. Moreover, the approach can be easily used in parallel computation frameworks because calculation of integral images as well as computation of individual decisions can be done separately. Also, the number of base classifiers can be easily adapted to meet a certain time constraint.
基于增强随机森林、积分图像和按需特征的快速图像分割
本文解决了在实时或高通量图像分析任务中通常发现的图像分割速度和质量之间的权衡。提出了一种基于丰富高维特征空间和强分类器的高质量图像分割方法。为了实现彩色图像的快速特征提取,需要使用多个积分图像。采用一种基于两阶段随机森林分类器的决策树方法来解决若干二分类和多分类分割问题。这是基于树的方法的固有属性,即任何决策都仅基于输入特征的一小部分。因此,对树结构的分析可以实现顺序特征提取。对几个真实数据集的运行时测量表明,该方法可以实现快速高质量的分割。此外,由于积分图像的计算和单个决策的计算可以分开进行,因此该方法可以很容易地用于并行计算框架。此外,基分类器的数量可以很容易地适应一定的时间限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信