Mathematics – Numerical Analysis
Scientific paper
2010-02-26
Mathematics
Numerical Analysis
10 pages, 1 figure
Scientific paper
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.
Comon Pierre
Lim Lek-Heng
No associations
LandOfFree
Multiarray Signal Processing: Tensor decomposition meets compressed sensing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multiarray Signal Processing: Tensor decomposition meets compressed sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiarray Signal Processing: Tensor decomposition meets compressed sensing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-289283