Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Pierre Comon <>
Submitted on : Sunday, August 29, 2010 - 5:14:11 PM
Last modification on : Tuesday, March 30, 2021 - 9:24:34 AM
Long-term archiving on: : Tuesday, October 23, 2012 - 3:15:57 PM


Files produced by the author(s)




Lek-Heng Lim, Pierre Comon. Multiarray Signal Processing: Tensor decomposition meets compressed sensing. Comptes rendus de l’Académie des sciences. Série IIb, Mécanique, Elsevier, 2010, 338 (6), pp.311--320. ⟨10.1016/j.crme.2010.06.005⟩. ⟨hal-00512271⟩



Record views


Files downloads