Fast and robust L0-tracker using compressive sensing

M. Javanmardi, M. Yazdi, M. Shirazi
{"title":"Fast and robust L0-tracker using compressive sensing","authors":"M. Javanmardi, M. Yazdi, M. Shirazi","doi":"10.1109/PRIA.2015.7161614","DOIUrl":null,"url":null,"abstract":"In recent years, Compressive Sensing (CS) or sparse representation has been considered as one of the most favorite topics in the areas of Computer Vision. In particular this theory can be widely applied in Visual Tracking applications. Addressing the problem of sparse representation through minimizations methods can play a dominant role in the CS trackers (trackers based on CS theory). In contrast to the previous algorithms which usually solve the problem of minimization by using L1-norm, L0-norm minimization is used directly to achieve sparseness in our proposed method. Simulations and results demonstrate that the proposed method can achieve the same or better accuracy with many less complexity than traditional algorithms which used interior-point method.","PeriodicalId":163817,"journal":{"name":"2015 2nd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Pattern Recognition and Image Analysis (IPRIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRIA.2015.7161614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, Compressive Sensing (CS) or sparse representation has been considered as one of the most favorite topics in the areas of Computer Vision. In particular this theory can be widely applied in Visual Tracking applications. Addressing the problem of sparse representation through minimizations methods can play a dominant role in the CS trackers (trackers based on CS theory). In contrast to the previous algorithms which usually solve the problem of minimization by using L1-norm, L0-norm minimization is used directly to achieve sparseness in our proposed method. Simulations and results demonstrate that the proposed method can achieve the same or better accuracy with many less complexity than traditional algorithms which used interior-point method.
使用压缩感知的快速鲁棒l0跟踪器
近年来,压缩感知(CS)或稀疏表示被认为是计算机视觉领域最受欢迎的主题之一。特别是该理论可以广泛应用于视觉跟踪的应用。通过最小化方法解决稀疏表示问题可以在CS跟踪器(基于CS理论的跟踪器)中发挥主导作用。与以往算法通常使用l1范数来解决最小化问题不同,我们提出的方法直接使用l0范数最小化来实现稀疏性。仿真和结果表明,该方法与传统的内点法相比,具有相同或更高的精度,且复杂度大大降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信