mlsanityData to 14 Oct 2026

Deep Spectrum Cartography: Completing Radio Map Tensors Using Learned Neural Models

arXiv 2105.00177 ↗First posted 1 May 2021eess.SP cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 12 of its 52 references that are in the map. First posted on arXiv 1 May 2021.

Builds on

12 of 52 references.

References · 12

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
  3. 2017On Identifiability of Nonnegative Matrix Factorizationcited by 34
  4. 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
  5. 2019Spectrum Cartography via Coupled Block-Term Tensor Decompositioncited by 18
  6. 2016Learning Power Spectrum Maps from Quantized Power Measurementscited by 14
  7. 2020Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspectivecited by 14
  8. 2013Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimizationcited by 12
  9. 2019Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorizationcited by 12
  10. 2014Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Relatedcited by 10
  11. 2019Tensor Completion from Regular Sub-Nyquist Samplescited by 7
  12. 2019Data-Driven Spectrum Cartography via Deep Completion Autoencoderscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 2; 2025: 5; 2026: 4.

14 papers.

Sort:

By area: