5,401 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
Improving compressed sensing with the diamond norm
In low-rank matrix recovery, one aims to reconstruct a low-rank matrix from a
minimal number of linear measurements. Within the paradigm of compressed
sensing, this is made computationally efficient by minimizing the nuclear norm
as a convex surrogate for rank.
In this work, we identify an improved regularizer based on the so-called
diamond norm, a concept imported from quantum information theory. We show that
-for a class of matrices saturating a certain norm inequality- the descent cone
of the diamond norm is contained in that of the nuclear norm. This suggests
superior reconstruction properties for these matrices. We explicitly
characterize this set of matrices. Moreover, we demonstrate numerically that
the diamond norm indeed outperforms the nuclear norm in a number of relevant
applications: These include signal analysis tasks such as blind matrix
deconvolution or the retrieval of certain unitary basis changes, as well as the
quantum information problem of process tomography with random measurements.
The diamond norm is defined for matrices that can be interpreted as order-4
tensors and it turns out that the above condition depends crucially on that
tensorial structure. In this sense, this work touches on an aspect of the
notoriously difficult tensor completion problem.Comment: 25 pages + Appendix, 7 Figures, published versio
Cornerstones of Sampling of Operator Theory
This paper reviews some results on the identifiability of classes of
operators whose Kohn-Nirenberg symbols are band-limited (called band-limited
operators), which we refer to as sampling of operators. We trace the motivation
and history of the subject back to the original work of the third-named author
in the late 1950s and early 1960s, and to the innovations in spread-spectrum
communications that preceded that work. We give a brief overview of the NOMAC
(Noise Modulation and Correlation) and Rake receivers, which were early
implementations of spread-spectrum multi-path wireless communication systems.
We examine in detail the original proof of the third-named author
characterizing identifiability of channels in terms of the maximum time and
Doppler spread of the channel, and do the same for the subsequent
generalization of that work by Bello.
The mathematical limitations inherent in the proofs of Bello and the third
author are removed by using mathematical tools unavailable at the time. We
survey more recent advances in sampling of operators and discuss the
implications of the use of periodically-weighted delta-trains as identifiers
for operator classes that satisfy Bello's criterion for identifiability,
leading to new insights into the theory of finite-dimensional Gabor systems. We
present novel results on operator sampling in higher dimensions, and review
implications and generalizations of the results to stochastic operators, MIMO
systems, and operators with unknown spreading domains
- …