A novel way to learn and track simultaneously the appearance of a previously non-seen face without intrusive techniques can be found in this article. The presented approach has a causal behaviour: no future frames are needed to process the current ones. The model used in the tracking process is refined with each input frame thanks to a new algorithm for the simultaneous and incremental computat...

We study the Pareto frontier for two competing norms ‖ · ‖X and ‖ · ‖Y on a vector space. For a given vector c, the Pareto frontier describes the possible values of (‖a‖X , ‖b‖Y ) for a decomposition c = a + b. The singular value decomposition of a matrix is closely related to the Pareto frontier for the spectral and nuclear norm. We will develop a general theory that extends the notion of sing...

We present some new results on largesystem CDMA obtained through the replica method developed in statistical physics. We find the spectral efficiency of randomly spread CDMA subject to Gaussian noise and flat fading in the large-system limit under arbitrary input distributions. Both joint decoding and single-user decoding are considered. In the latter case, a conditional mean estimator is first...

Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD to approximate a matrix that is rank 3 in a noiseless situation. In this paper we reformulate the problem using the fact that the x and y coordinates of each feature are known from their projection onto the image plane...

We develop a hierarchical matrix construction algorithm using matrix–vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses OðlognÞ applications of the matrix on structured random test vectors and Oðn lognÞ extra computational cost, where n is the dimension of the unknown matrix. Numerical examples on constructing Green’s functions ...

Recently, the multiple-input multiple-output (MIMO) schemes have been proposed as efficient solution for future wireless system. MIMO schemes can achieve a significant increase in the bandwidth efficiency as well as an improvement of the transmission reliability. In this paper, switching for the detection schemes based on channel condition is proposed in MIMO system. The QRD-M detection scheme ...

Most existing low-n-rank minimization algorithms for tensor completion suffer from high computational cost due to involving multiple singular value decompositions (SVDs) at each iteration. To address this issue, we propose a novel factor matrix trace norm minimization method for tensor completion problems. Based on the CANDECOMP/PARAFAC (CP) decomposition, we first formulate a factor matrix ran...

The availability of a good hydraulic model increases the reliability of the results of methodologies using it. Thus, the calibration of the model is a previous step that has to be done. The most uncertain parameters of the model are demands due to their constant variability. However, calibrating these demands requires a high computational cost that can be reduced by redefining the unknown param...

A new algorithm for the incremental learning and non-intrusive tracking of the appearance of a previously non-seen face is presented. The computation is done in a causal fashion: the information for a given frame to be processed is combined only with the one of previous frames. To achieve this aim, a novel way for simultaneous and incremental computation of the Singular Value Decomposition (SVD...

This paper presents and analyzes a new algorithm for computing eigenvectors of symmetric tridiagonal matrices factored as LDLt, with D diagonal and L unit bidiagonal. If an eigenpair is well behaved in a certain sense with respect to the factorization, the algorithm is shown to compute an approximate eigenvector which is accurate to working precision. As a consequence, all the eigenvectors comp...