Multi-Scale Spatially Weighted Local Histograms in O(1)

M. Poostchi, A. Shafiekhani, K. Palaniappan, G. Seetharaman
{"title":"Multi-Scale Spatially Weighted Local Histograms in O(1)","authors":"M. Poostchi, A. Shafiekhani, K. Palaniappan, G. Seetharaman","doi":"10.1109/AIPR.2017.8457944","DOIUrl":null,"url":null,"abstract":"Histograms are commonly used to characterize and analyze the region of interest within an image. Weighting the contributions of the pixels to the histogram is a key feature to handle noise and occlusion and increase object localization accuracy of many histogram-based search problems including object detection, tracking and recognition. The integral histogram method provides an optimum and complete solution to compute the plain histogram of any rectangular region in constant time. However, the matter of how accurately extract the weighted histogram of any arbitrary region within an image using integral histogram has not been addressed. This paper presents a novel fast algorithm to evaluate spatially weighted local histograms at different scale accurately and in constant time using an extension of integral histogram. Utilizing the integral histogram makes it to be fast, multi-scale and flexible to different weighting functions. The pixel-level weighting problem is addressed by decomposing the Manhattan spatial filter and fragmenting the region of interest. We evaluated and compared the computational complexity and accuracy of our proposed approach with brute-force implementation and approximation scheme. The proposed method can be integrated into any detection and tracking framework to provide an efficient exhaustive search, improve target localization accuracy and meet the demand of real-time processing.","PeriodicalId":128779,"journal":{"name":"2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIPR.2017.8457944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Histograms are commonly used to characterize and analyze the region of interest within an image. Weighting the contributions of the pixels to the histogram is a key feature to handle noise and occlusion and increase object localization accuracy of many histogram-based search problems including object detection, tracking and recognition. The integral histogram method provides an optimum and complete solution to compute the plain histogram of any rectangular region in constant time. However, the matter of how accurately extract the weighted histogram of any arbitrary region within an image using integral histogram has not been addressed. This paper presents a novel fast algorithm to evaluate spatially weighted local histograms at different scale accurately and in constant time using an extension of integral histogram. Utilizing the integral histogram makes it to be fast, multi-scale and flexible to different weighting functions. The pixel-level weighting problem is addressed by decomposing the Manhattan spatial filter and fragmenting the region of interest. We evaluated and compared the computational complexity and accuracy of our proposed approach with brute-force implementation and approximation scheme. The proposed method can be integrated into any detection and tracking framework to provide an efficient exhaustive search, improve target localization accuracy and meet the demand of real-time processing.
O(1)的多尺度空间加权局部直方图
直方图通常用于描述和分析图像中感兴趣的区域。在许多基于直方图的搜索问题(包括目标检测、跟踪和识别)中,加权像素对直方图的贡献是处理噪声和遮挡以及提高目标定位精度的关键特征。积分直方图法为计算任意矩形区域在恒定时间内的平面直方图提供了一种最优的、完整的解决方案。然而,如何使用积分直方图准确地提取图像中任意区域的加权直方图的问题尚未得到解决。本文提出了一种利用积分直方图的扩展,在常数时间内准确地快速评估不同尺度下的空间加权局部直方图的算法。利用积分直方图使其具有快速、多尺度和对不同权重函数灵活的特点。像素级加权问题是通过分解曼哈顿空间过滤器和分割感兴趣的区域来解决的。我们评估和比较了我们提出的方法的计算复杂性和精度与暴力执行和近似方案。该方法可以集成到任何检测和跟踪框架中,提供高效的穷穷搜索,提高目标定位精度,满足实时处理的需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信