没有合适的资源?快使用搜索试试~ 我知道了~
首页ViBe:一种高效的视频背景建模算法
ViBe:一种高效的视频背景建模算法
4星 · 超过85%的资源 需积分: 9 9 下载量 17 浏览量
更新于2024-07-27
1
收藏 2.51MB PDF 举报
"很好的背景建模算法"这篇论文介绍了一种名为ViBe的创新背景建模技术,它发表在2011年IEEE Transactions on Image Processing第20卷第6期。该算法在视频序列背景检测领域具有显著优势,特别体现在处理噪声、光照变化和场景突变等复杂情况时的高效性和准确性。 ViBe算法的核心思想在于存储每个像素在过去特定位置或邻域内的值集合,而非仅仅依赖最旧的值来更新背景模型。这种机制使得算法能够适应实时变化的场景,不拘泥于传统的“先替换旧值”的策略。对于运动检测,算法会对比当前像素值与背景模型中的值,判断其是否属于背景,并动态选择合适的价值进行替换。这提高了算法对动态环境的敏感性。 此外,当一个像素被识别为背景时,其值会被传播到相邻像素的背景模型中,进一步增强整体模型的鲁棒性。论文详尽地介绍了ViBe算法的实现细节,包括伪代码和使用的参数设置,使其具备了较高的可操作性和可扩展性。 与现有的背景减除技术相比,如最近和已证实的最先进的方法,ViBe在效率指标上表现出明显的优势。这意味着它不仅能在保持准确性的前提下,提供更快的处理速度,对于实时视频监控和计算机视觉应用具有重要的实用价值。通过本文的研究,ViBe算法为背景建模领域的研究者和开发者提供了一个新的、值得深入探讨和优化的框架。"
资源详情
资源推荐
1712 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 6, JUNE 2011
fading in the background, two additional mechanisms (one at
the pixel level, a second at the blob level) are added to the con-
sensus algorithm to handle entire objects.
The method proposed in this paper operates differently in
handling new or fading objects in the background, without the
need to take account of them explicitly. In addition to being
faster, our method exhibits an interesting asymmetry in that a
ghost (a region of the background discovered once a static object
starts moving) is added to the background model more quickly
than an object that stops moving. Another major contribution of
this paper resides in the proposed update policy. The underlying
idea is to gather samples from the past and to update the sample
values by ignoring when they were added to the models. This
policy ensures a smooth exponential decaying lifespan for the
sample values of the pixel models and allows our technique to
deal with concomitant events evolving at various speeds with a
unique model of a reasonable size for each pixel.
III. D
ESCRIPTION OF A
UNIVERSAL
BACKGROUND
SUBTRACTION TECHNIQUE:V
IBE
Background subtraction techniques have to deal with at least
three considerations in order to be successful in real applica-
tions: 1) what is the model and how does it behave? 2) how is the
model initialized? and 3) how is the model updated over time?
Answers to these questions are given in the three subsections of
this section. Most papers describe the intrinsic model and the
updating mechanism. Only a minority of papers discuss initial-
ization, which is critical when a fast response is expected, as in
the case inside a digital camera. In addition, there is often a lack
of coherence between the model and the update mechanism. For
example, some techniques compare the current value of a pixel
to that of a model with a given tolerance . They consider
that there is a good match if the absolute difference between
and is lower than . To be adaptive over time, is adjusted
with respect to the statistical variance of
. But the statistical
variance is estimated by a temporal average. Therefore, the ad-
justment speed is dependent upon the acquisition framerate and
on the number of background pixels. This is inappropriate in
some cases, as in the case of remote IP cameras whose fram-
erate is determined by the available bandwidth.
We detail in the following a background subtraction tech-
nique, called visual background extractor (ViBe). For conve-
nience, we present a complete version of our algorithm in a
C-like code in Appendix A.
A. Pixel Model and Classification Process
To some extent, there is no way around the determination,
for a given color space, of a probability density function (pdf)
for every background pixel or at least the determination of sta-
tistical parameters, such as the mean or the variance. Note that
with a Gaussian model, there is no distinction to be made as the
knowledge of the mean and variance is sufficient to determine
the pdf. While the classical approaches to background subtrac-
tion and most mainstream techniques rely on pdfs or statistical
parameters, the question of their statistical significance is rarely
discussed, if not simply ignored. In fact, there is no imperative
to compute the pdf as long as the goal of reaching a relevant
background segmentation is achieved. An alternative is to con-
sider that one should enhance statistical significance over time,
and one way to proceed is to build a model with real observed
pixel values. The underlying assumption is that this makes more
sense from a stochastic point of view, as already observed values
should have a higher probability of being observed again than
would values not yet encountered.
Like the authors of [65], we do not opt for a particular form
for the pdf, as deviations from the assumed pdf model are ubiq-
uitous. Furthermore, the evaluation of the pdf is a global process
and the shape of a pdf is sensitive to outliers. In addition, the es-
timation of the pdf raises the nonobvious question regarding the
number of samples to be considered; the problem of selecting a
representative number of samples is intrinsic to all the estima-
tion processes.
If we see the problem of background subtraction as a classi-
fication problem, we want to classify a new pixel value with re-
spect to its immediate neighborhood in the chosen color space,
so as to avoid the effect of any outliers. This motivates us to
model each background pixel with a set of samples instead of
with an explicit pixel model. Consequently no estimation of
the pdf of the background pixel is performed, and so the cur-
rent value of the pixel is compared to its closest samples within
the collection of samples. This is an important difference in
comparison with existing algorithms, in particular with those
of consensus-based techniques. A new value is compared to
background samples and should be close to some of the sample
values instead of the majority of all values. The underlying idea
is that it is more reliable to estimate the statistical distribution
of a background pixel with a small number of close values than
with a large number of samples. This is somewhat similar to ig-
noring the extremities of the pdf, or to considering only the cen-
tral part of the underlying pdf by thresholding it. On the other
hand, if one trusts the values of the model, it is crucial to se-
lect background pixel samples carefully. The classification of
pixels in the background, therefore, needs to be conservative, in
the sense that only background pixels should populate the back-
ground models.
Formally, let us denote by
the value in a given Euclidean
color space taken by the pixel located at
in the image, and by
a background sample value with an index . Each background
pixel
is modeled by a collection of background sample
values
(1)
taken in previous frames. For now, we ignore the notion of time;
this is discussed later.
To classify a pixel value
according to its corresponding
model
, we compare it to the closest values within the
set of samples by defining a sphere
of radius cen-
tered on
. The pixel value is then classified as back-
ground if the cardinality, denoted
, of the set intersection of this
sphere and the collection of model samples
is larger than
or equal to a given threshold
. More formally, we compare
to
(2)
剩余15页未读,继续阅读
madmale_wzr
- 粉丝: 2
- 资源: 19
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- AirKiss技术详解:无线传递信息与智能家居连接
- Hibernate主键生成策略详解
- 操作系统实验:位示图法管理磁盘空闲空间
- JSON详解:数据交换的主流格式
- Win7安装Ubuntu双系统详细指南
- FPGA内部结构与工作原理探索
- 信用评分模型解析:WOE、IV与ROC
- 使用LVS+Keepalived构建高可用负载均衡集群
- 微信小程序驱动餐饮与服装业创新转型:便捷管理与低成本优势
- 机器学习入门指南:从基础到进阶
- 解决Win7 IIS配置错误500.22与0x80070032
- SQL-DFS:优化HDFS小文件存储的解决方案
- Hadoop、Hbase、Spark环境部署与主机配置详解
- Kisso:加密会话Cookie实现的单点登录SSO
- OpenCV读取与拼接多幅图像教程
- QT实战:轻松生成与解析JSON数据
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功