This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple “bottlenecks”, and on “swamps”. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the ELS enhancement in these algorithms is discussed. Computer simulations feed this discussion.

Since the nineties, tensors are increasingly used in Signal Processing and Data Analysis. There exist striking differences between tensors and matrices, some being advantages, and others raising difficulties. These differences are pointed out in this paper while briefly surveying the state of the art. The conclusion is that tensors are omnipresent in real life, implicitly or explicitly, and must be used even if we still know quite little about their properties.

Matrix factorization is an important and unifying topic in signal processing and linear algebra, which has found numerous applications in many other areas. This chapter introduces basic linear and multi-linear 1 models for matrix and tensor factorizations and decompositions, and formulates the analysis framework for

This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple “bottlenecks”, and on “swamps”. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the ELS enhancement in these algorithms is discussed. Computer simulations feed this discussion. 1

Deterministic approaches for source localization and extraction are desirable for short or nonstationary data, as opposed to techniques based on second or higher order statistics. Techniques based on tensor decompositions are recognized to be efficient in this framework, provided some diversity is available, in addition to time and space. With this goal, some authors have proposed to decompose a Space-Time-Frequency data tensor. In this paper, we propose a new multiway approach based on Space-Time-Wave-Vector (STWV) data which is obtained by a 3D local Fourier transform over space accomplished on the measured data. This method does not only permit to accurately localize sources even in a noisy environment, but simultaneously extracts the temporal behaviour associated with each source. The performance of this STWV analysis is investigated by means of computer simulations in the context of ElectroEncephalo-Graphic (EEG) data analysis. 1 1.

We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a measure of separation between radiating sources called coherence, one could always guarantee the existence and uniqueness of a best rank-r approximation of the tensor representing the signal. We also deduce a computationally feasible variant of Kruskal’s uniqueness condition, where the coherence appears as a proxy for k-rank. Problems of sparsest recovery with an infinite continuous dictionary, lowest-rank tensor representation, and blind source separation are treated in a uniform fashion. The decomposition of the measurement tensor leads to simultaneous localization and extraction of radiating sources, in an entirely deterministic manner. Résumé Traitement du signal multi-antenne: les décompositions tensorielles rejoignent l’échantillonnage compressé. Nous décrivons comment les techniques et outils d’échantillonnage compressé récemment découverts peuvent être utilisés dans les décompositions tensorielles, avec pour illustration une modélisation des signaux provenant de plusieurs antennes multicapteurs. Nous montrons qu’en posant des bornes appropriées sur une certaine mesure de séparation entre les sources rayonnantes (appelée cohérence dans le jargon de l’échantillonnage compressé), on pouvait toujours

Computing the polyadic decomposition of nonnegative third order tensors Jean-Philip Royer a,b, Nadège Thirion-Moreau a, ∗ , Pierre Comon b

Abstract not found