Multiarray signal processing: tensor decomposition meets compressed sensing
From MaRDI portal
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.
Recommendations
- Tensor Decomposition for Signal Processing and Machine Learning
- Compressive Sensing of Sparse Tensors
- Tensor approximation and signal processing applications
- Multitask Compressive Sensing
- Two algorithms for compressed sensing of sparse tensors
- A review of tensors and tensor signal processing
- Sequential Unfolding SVD for Tensors With Applications in Array Signal Processing
- Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor Compressive Sensing
- Rapid compressed sensing reconstruction: a semi-tensor product approach
- Compressive sensing and structured random matrices
Cited in
(30)- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- A general theory of singular values with applications to signal denoising
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Finding the limit of diverging components in three-way Candecomp/Parafac -- a demonstration of its practical merits
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Grassmann secants, identifiability, and linear systems of tensors
- Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank)
- Tensor polyadic decomposition for antenna array processing
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- On the nuclear norm and the singular value decomposition of tensors
- Tensor factorisation for narrowband single channel source decomposition
- Completely positive tensor recovery with minimal nuclear value
- On identifiability of higher order block term tensor decompositions of rank \(L_r \otimes\) rank-1
- Nested Vector-Sensor Array Processing via Tensor Modeling
- Union of low-rank tensor spaces: clustering and completion
- An upper bound for the tensor rank
- Spectrum Cartography via Coupled Block-Term Tensor Decomposition
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Identifiability of complete dictionary learning
- Image reconstruction based on improved block compressed sensing
- A variational approach of the rank function
- Nuclear norm of higher-order tensors
- Symmetric tensor nuclear norms
- Coherent signal parameter estimation by exploiting decomposition of tensors
- On best rank-\(2\) and rank-\((2,2,2)\) approximations of order-\(3\) tensors
- Rank determination for low-rank data completion
- High order singular value decomposition for plant diversity estimation
- Characterization of sampling patterns for low-tt-rank tensor retrieval
- Hankel Tensor Decompositions and Ranks
This page was built for publication: Multiarray signal processing: tensor decomposition meets compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554104)
