.png){kind=icon}
.png){kind=icon}
Return
A Binary Structured Sparsity Approach for Multi-Anchor Direct Localization
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2024.3439099.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Structured sparsity improves on traditional sparse modeling by suggesting that only a limited number of input variables is needed to describe the output variable. These methods go a step further by incorporating structured patterns in variable selection, such as groups or networks of input variables. This paper introduces a novel binary approximation method leveraging structured sparsity to enhance multi-anchor direct localization performance. By reformulating the sparse recovery as a quadratic unconstrained binary optimization (QUBO) problem, we address the significant computational complexity inherent in NP-hard problems. Employing compressed sensing and binary programming, our method reduces approximation errors and ensures that the line-of-sight component is consistently identified from a coherent grid point among anchors, thus enhancing localization accuracy. Our findings demonstrate a significant improvement in the accuracy of direct localization methods, underscoring the potential of structured sparsity and QUBO formulation to advance localization technologies in multipath environments.
Keywords:
Location awareness
Accuracy
Wireless fidelity
Computational modeling
OFDM
Wireless networks
Programming
Binary programming
direct localization
group LASSO
sparse modeling
structured sparsity
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W