基于顺序重要性采样/重采样算法的视觉轮廓跟踪

P. Li, Tianwen Zhang
{"title":"基于顺序重要性采样/重采样算法的视觉轮廓跟踪","authors":"P. Li, Tianwen Zhang","doi":"10.1109/ICPR.2002.1048366","DOIUrl":null,"url":null,"abstract":"The condensation algorithm can deal with non-Gaussian, nonlinear visual contour tracking in a unified way. Despite its simple implementation and generality, it has two main limitations. The first limitation is that in sampling stage the algorithm does not take advantage of the new measurements. As a result of the inefficient sampling strategy, the algorithm needs a large number of samples to represent the posterior distribution of state. The next is in the selection step, resampling may introduce the problem of sample impoverishment. To address these two problems, we present an improved visual tracker based on an importance sampling/resampling algorithm. Gaussian density of each sample is adopted as the sub-optimal importance proposal distribution, which can steer the samples towards the high likelihood by considering the latest observations. We also adopt a criterion of effective sample size to determine whether the resampling is necessary or not. Experiments with real image sequences show that the performance of new algorithm improves considerably for tracking in visual clutter.","PeriodicalId":159502,"journal":{"name":"Object recognition supported by user interaction for service robots","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Visual contour tracking based on sequential importance sampling/resampling algorithm\",\"authors\":\"P. Li, Tianwen Zhang\",\"doi\":\"10.1109/ICPR.2002.1048366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The condensation algorithm can deal with non-Gaussian, nonlinear visual contour tracking in a unified way. Despite its simple implementation and generality, it has two main limitations. The first limitation is that in sampling stage the algorithm does not take advantage of the new measurements. As a result of the inefficient sampling strategy, the algorithm needs a large number of samples to represent the posterior distribution of state. The next is in the selection step, resampling may introduce the problem of sample impoverishment. To address these two problems, we present an improved visual tracker based on an importance sampling/resampling algorithm. Gaussian density of each sample is adopted as the sub-optimal importance proposal distribution, which can steer the samples towards the high likelihood by considering the latest observations. We also adopt a criterion of effective sample size to determine whether the resampling is necessary or not. Experiments with real image sequences show that the performance of new algorithm improves considerably for tracking in visual clutter.\",\"PeriodicalId\":159502,\"journal\":{\"name\":\"Object recognition supported by user interaction for service robots\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Object recognition supported by user interaction for service robots\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2002.1048366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Object recognition supported by user interaction for service robots","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2002.1048366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

该算法可以统一处理非高斯、非线性的视觉轮廓跟踪问题。尽管它的实现简单且具有通用性,但它有两个主要限制。第一个限制是,在采样阶段,算法没有利用新的测量。由于采样策略的低效,该算法需要大量的样本来表示状态的后验分布。其次,在选择步骤中,重采样可能会引入样本贫化问题。为了解决这两个问题,我们提出了一种改进的基于重要性采样/重采样算法的视觉跟踪器。采用每个样本的高斯密度作为次优重要建议分布,通过考虑最新的观测值,使样本向高似然方向倾斜。我们还采用有效样本量标准来确定是否需要重新采样。对真实图像序列的实验表明,该算法在视觉杂波情况下的跟踪性能有较大提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Visual contour tracking based on sequential importance sampling/resampling algorithm
The condensation algorithm can deal with non-Gaussian, nonlinear visual contour tracking in a unified way. Despite its simple implementation and generality, it has two main limitations. The first limitation is that in sampling stage the algorithm does not take advantage of the new measurements. As a result of the inefficient sampling strategy, the algorithm needs a large number of samples to represent the posterior distribution of state. The next is in the selection step, resampling may introduce the problem of sample impoverishment. To address these two problems, we present an improved visual tracker based on an importance sampling/resampling algorithm. Gaussian density of each sample is adopted as the sub-optimal importance proposal distribution, which can steer the samples towards the high likelihood by considering the latest observations. We also adopt a criterion of effective sample size to determine whether the resampling is necessary or not. Experiments with real image sequences show that the performance of new algorithm improves considerably for tracking in visual clutter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Pattern recognition for humanitarian de-mining Data clustering using evidence accumulation Facial expression recognition using pseudo 3-D hidden Markov models Speeding up SVM decision based on mirror points Real-time tracking and estimation of plane pose
×
引用
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