Group-Lasso on Splines for Spectrum Cartography

Abstract

The unceasing demand for continuous situational awareness calls for innovative and large-scale signal processing algorithms, complemented by collaborative and adaptive sensing platforms to accomplish the objectives of layered sensing and control. Towards this goal, the present paper develops a spline-based approach to field estimation, which relies on a basis expansion model of the field of interest. The model entails known bases, weighted by generic functions estimated from the field's noisy samples. A novel field estimator is developed based on a regularized variational least-squares (LS) criterion that yields finitely-parameterized (function) estimates spanned by thin-plate splines. Robustness considerations motivate well the adoption of an overcomplete set of (possibly overlapping) basis functions, while a sparsifying regularizer augmenting the LS cost endows the estimator with the ability to select a few of these bases that ``better'' explain the data. This parsimonious field representation becomes possible, because the sparsity-aware spline-based method of this paper induces a group-Lasso estimator for the coefficients of the thin-plate spline expansions per basis. A distributed algorithm is also developed to obtain the group-Lasso estimator using a network of wireless sensors, or, using multiple processors to balance the load of a single computational unit. The novel spline-based approach is motivated by a spectrum cartography application, in which a set of sensing cognitive radios collaborate to estimate the distribution of RF power in space and frequency. Simulated tests corroborate that the estimated power spectrum density atlas yields the desired RF state awareness, since the maps reveal spatial locations where idle frequency bands can be reused for transmission, even when fading and shadowing effects are pronounced.

Submitted to IEEE Transactions on Signal Processing

References in corpus (2)

• One-step sparse estimates in nonconcave penalized likelihood models
• Component selection and smoothing in multivariate nonparametric regression

Cited by in corpus (25)

• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
• Kernel-based Reconstruction of Graph Signals
• Radio Map Estimation: A Data-Driven Approach to Spectrum Cartography
• Learning Power Spectrum Maps from Quantized Power Measurements
• Deep Spectrum Cartography: Completing Radio Map Tensors Using Learned Neural Models
• Spectrum Cartography via Coupled Block-Term Tensor Decomposition
• On the Convergence of Decentralized Gradient Descent
• Propagation Map Reconstruction via Interpolation Assisted Matrix Completion
• RadioGAT: A Joint Model-based and Data-driven Framework for Multi-band Radiomap Reconstruction via Graph Attention Networks
• Dynamic Network Cartography
• Location-free Spectrum Cartography
• Learning Dynamical Systems and Bifurcation via Group Sparsity
• Nonparametric Basis Pursuit via Sparse Kernel-based Learning
• SLANTS: Sequential Adaptive Nonlinear Modeling of Vector Time Series
• Joint Base Station Clustering and Beamformer Design for Partial Coordinated Transmission in Heterogenous Networks
• EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
• Primary User Localization and Online Radio Cartography via Structured Tensor Decomposition
• Fast Decentralized Optimization over Networks
• Engineering Radio Map for Wireless Resource Management
• Recoverability of Group Sparse Signals from Corrupted Measurements via Robust Group Lasso
• On Regularized Square-root Regression Problems: Distributionally Robust Interpretation and Fast Computations
• Robust Group LASSO Over Decentralized Networks
• Stability Selection for Structured Variable Selection
• Variable Grouping Based Bayesian Additive Regression Tree