SBMI-LTD: stationary background model initialization based on low-rank tensor decomposition

S. Javed, T. Bouwmans, Soon Ki Jung
{"title":"SBMI-LTD: stationary background model initialization based on low-rank tensor decomposition","authors":"S. Javed, T. Bouwmans, Soon Ki Jung","doi":"10.1145/3019612.3019687","DOIUrl":null,"url":null,"abstract":"Initialization of background model also known as foreground-free image against outliers or noise is a very important task for various computer vision applications. Tensor deomposition using Higher Order Robust Principal Component Analysis has been shown to be a very efficient framework for exact recovery of low-rank (corresponds to the background model) component. Recent study shows that tensor decomposition based on online optimization into low- rank and sparse component addressed the limitations of memory and computational issues as compared to the earlier approaches. However, it is based on the iterative optimization of nuclear norm which is not always robust when the large entries of an input observation tensor are corrupted against outliers. Therefore, the task of background modeling shows a weak performance in the presence of an increasing number of outliers. To address this issue, this paper presents an extension of an online tensor decomposition into low-rank and sparse components using a maximum norm constraint. Since, maximum norm regularizer is more robust than nuclear norm against large number of outliers, therefore the proposed extended tensor based decomposition framework with maximum norm provides an accurate estimation of background scene. Experimental evaluations on synthetic data as well as real dataset such as Scene Background Modeling Initialization (SBMI) show encouraging performance for the task of background modeling as compared to the state of the art approaches.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"21 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3019687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Initialization of background model also known as foreground-free image against outliers or noise is a very important task for various computer vision applications. Tensor deomposition using Higher Order Robust Principal Component Analysis has been shown to be a very efficient framework for exact recovery of low-rank (corresponds to the background model) component. Recent study shows that tensor decomposition based on online optimization into low- rank and sparse component addressed the limitations of memory and computational issues as compared to the earlier approaches. However, it is based on the iterative optimization of nuclear norm which is not always robust when the large entries of an input observation tensor are corrupted against outliers. Therefore, the task of background modeling shows a weak performance in the presence of an increasing number of outliers. To address this issue, this paper presents an extension of an online tensor decomposition into low-rank and sparse components using a maximum norm constraint. Since, maximum norm regularizer is more robust than nuclear norm against large number of outliers, therefore the proposed extended tensor based decomposition framework with maximum norm provides an accurate estimation of background scene. Experimental evaluations on synthetic data as well as real dataset such as Scene Background Modeling Initialization (SBMI) show encouraging performance for the task of background modeling as compared to the state of the art approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于低秩张量分解的平稳背景模型初始化
背景模型(也称为无前景图像)对异常点或噪声的初始化是各种计算机视觉应用的一项非常重要的任务。使用高阶鲁棒主成分分析的张量分解已被证明是精确恢复低秩(对应于背景模型)成分的非常有效的框架。最近的研究表明,基于在线优化的张量分解为低秩和稀疏分量的方法解决了先前方法的内存限制和计算问题。然而,它是基于核范数的迭代优化,当输入观测张量的大条目被异常值破坏时,核范数并不总是鲁棒的。因此,背景建模任务在异常值数量增加的情况下表现出较弱的性能。为了解决这个问题,本文使用最大范数约束将在线张量分解扩展为低秩和稀疏分量。由于最大范数正则化器比核范数对大量离群值具有更强的鲁棒性,因此所提出的基于扩展张量的最大范数分解框架提供了对背景场景的准确估计。对合成数据以及真实数据集(如场景背景建模初始化(SBMI))的实验评估显示,与目前的方法相比,背景建模任务的性能令人鼓舞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tarski Handling bitcoin conflicts through a glimpse of structure Multi-CNN and decision tree based driving behavior evaluation Session details: WT - web technologies track Improving OR-PCA via smoothed spatially-consistent low-rank modeling for background subtraction
×
引用
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