Multiarray Signal Processing: Tensor decomposition meets compressed sensing

Abstract

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.

10 pages, 1 figure

References in corpus (3)

• Sparsity and Incoherence in Compressive Sampling
• Most tensor problems are NP-hard
• Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit

Cited by in corpus (22)

• On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part I: Basic Results and Uniqueness of One Factor Matrix
• Compressive Sensing of Sparse Tensors
• Fourth-order Tensors with Multidimensional Discrete Transforms
• How hard is the tensor rank?
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
• Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entries
• Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions Suffice
• Grassmann secants, identifiability, and linear systems of tensors
• Tensor decompositions and tensor equations over quaternion algebra
• Identifiability of Complete Dictionary Learning
• Characterization of Deterministic and Probabilistic Sampling Patterns for Finite Completability of Low Tensor-Train Rank Tensor
• Fundamental Conditions for Low-CP-Rank Tensor Completion
• Scaled Nuclear Norm Minimization for Low-Rank Tensor Completion
• On best rank-2 and rank-(2,2,2) approximations of order-3 tensors
• Partial stratification of secant varieties of Veronese varieties via curvilinear subschemes
• Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor
• Blind Multilinear Identification
• Hankel tensor decompositions and ranks
• Multi-Tensor Network Representation for High-Order Tensor Completion
• Symmetric Tensor Decompositions On Varieties
• Sparse tensor recovery via N-mode FISTA with support augmentation
• High Order Singular Value Decomposition for Plant Biodiversity Estimation