4,394 research outputs found
Total Variation Regularized Tensor RPCA for Background Subtraction from Compressive Measurements
Background subtraction has been a fundamental and widely studied task in
video analysis, with a wide range of applications in video surveillance,
teleconferencing and 3D modeling. Recently, motivated by compressive imaging,
background subtraction from compressive measurements (BSCM) is becoming an
active research task in video surveillance. In this paper, we propose a novel
tensor-based robust PCA (TenRPCA) approach for BSCM by decomposing video frames
into backgrounds with spatial-temporal correlations and foregrounds with
spatio-temporal continuity in a tensor framework. In this approach, we use 3D
total variation (TV) to enhance the spatio-temporal continuity of foregrounds,
and Tucker decomposition to model the spatio-temporal correlations of video
background. Based on this idea, we design a basic tensor RPCA model over the
video frames, dubbed as the holistic TenRPCA model (H-TenRPCA). To characterize
the correlations among the groups of similar 3D patches of video background, we
further design a patch-group-based tensor RPCA model (PG-TenRPCA) by joint
tensor Tucker decompositions of 3D patch groups for modeling the video
background. Efficient algorithms using alternating direction method of
multipliers (ADMM) are developed to solve the proposed models. Extensive
experiments on simulated and real-world videos demonstrate the superiority of
the proposed approaches over the existing state-of-the-art approaches.Comment: To appear in IEEE TI
CVABS: Moving Object Segmentation with Common Vector Approach for Videos
Background modelling is a fundamental step for several real-time computer
vision applications that requires security systems and monitoring. An accurate
background model helps detecting activity of moving objects in the video. In
this work, we have developed a new subspace based background modelling
algorithm using the concept of Common Vector Approach with Gram-Schmidt
orthogonalization. Once the background model that involves the common
characteristic of different views corresponding to the same scene is acquired,
a smart foreground detection and background updating procedure is applied based
on dynamic control parameters. A variety of experiments is conducted on
different problem types related to dynamic backgrounds. Several types of
metrics are utilized as objective measures and the obtained visual results are
judged subjectively. It was observed that the proposed method stands
successfully for all problem types reported on CDNet2014 dataset by updating
the background frames with a self-learning feedback mechanism.Comment: 12 Pages, 4 Figures, 1 Tabl
Towards Benchmarking Scene Background Initialization
Given a set of images of a scene taken at different times, the availability
of an initial background model that describes the scene without foreground
objects is the prerequisite for a wide range of applications, ranging from
video surveillance to computational photography. Even though several methods
have been proposed for scene background initialization, the lack of a common
groundtruthed dataset and of a common set of metrics makes it difficult to
compare their performance. To move first steps towards an easy and fair
comparison of these methods, we assembled a dataset of sequences frequently
adopted for background initialization, selected or created ground truths for
quantitative evaluation through a selected suite of metrics, and compared
results obtained by some existing methods, making all the material publicly
available.Comment: 6 pages, SBI dataset, SBMI2015 Worksho
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
PCA is one of the most widely used dimension reduction techniques. A related
easier problem is "subspace learning" or "subspace estimation". Given
relatively clean data, both are easily solved via singular value decomposition
(SVD). The problem of subspace learning or PCA in the presence of outliers is
called robust subspace learning or robust PCA (RPCA). For long data sequences,
if one tries to use a single lower dimensional subspace to represent the data,
the required subspace dimension may end up being quite large. For such data, a
better model is to assume that it lies in a low-dimensional subspace that can
change over time, albeit gradually. The problem of tracking such data (and the
subspaces) while being robust to outliers is called robust subspace tracking
(RST). This article provides a magazine-style overview of the entire field of
robust subspace learning and tracking. In particular solutions for three
problems are discussed in detail: RPCA via sparse+low-rank matrix decomposition
(S+LR), RST via S+LR, and "robust subspace recovery (RSR)". RSR assumes that an
entire data vector is either an outlier or an inlier. The S+LR formulation
instead assumes that outliers occur on only a few data vector indices and hence
are well modeled as sparse corruptions.Comment: To appear, IEEE Signal Processing Magazine, July 201
- …