Deep Spectrum Cartography: Completing Radio Map Tensors Using Learned Neural Models
arXiv:2105.00177 · doi:10.1109/TSP.2022.3145190
Abstract
The spectrum cartography (SC) technique constructs multi-domain (e.g., frequency, space, and time) radio frequency (RF) maps from limited measurements, which can be viewed as an ill-posed tensor completion problem. Model-based cartography techniques often rely on handcrafted priors (e.g., sparsity, smoothness and low-rank structures) for the completion task. Such priors may be inadequate to capture the essence of complex wireless environments -- especially when severe shadowing happens. To circumvent such challenges, offline-trained deep neural models of radio maps were considered for SC, as deep neural networks (DNNs) are able to "learn" intricate underlying structures from data. However, such deep learning (DL)-based SC approaches encounter serious challenges in both off-line model learning (training) and completion (generalization), possibly because the latent state space for generating the radio maps is prohibitively large. In this work, an emitter radio map disaggregation-based approach is proposed, under which only individual emitters' radio maps are modeled by DNNs. This way, the learning and generalization challenges can both be substantially alleviated. Using the learned DNNs, a fast nonnegative matrix factorization-based two-stage SC method and a performance-enhanced iterative optimization algorithm are proposed. Theoretical aspects -- such as recoverability of the radio tensor, sample complexity, and noise robustness -- under the proposed framework are characterized, and such theoretical properties have been elusive in the context of DL-based radio tensor completion. Experiments using synthetic and real-data from indoor and heavily shadowed environments are employed to showcase the effectiveness of the proposed methods.
References in corpus (14)
- Adam: A Method for Stochastic Optimization
- Auto-Encoding Variational Bayes
- Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
- Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
- Group-Lasso on Splines for Spectrum Cartography
- Learning Power Spectrum Maps from Quantized Power Measurements
- Spectrum Cartography via Coupled Block-Term Tensor Decomposition
- On Identifiability of Nonnegative Matrix Factorization
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
- Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related
- Tensor Completion from Regular Sub-Nyquist Samples
- Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspective
- Stability of matrix factorization for collaborative filtering
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization