Abstract
In this paper, we propose a matrix completion algorithm for Internet of Things (IoT) localization. In the proposed algorithm, we recast Euclidean distance matrix completion problem as an unconstrained optimization in smooth Riemannian manifold and then propose a nonlinear conjugate gradient method on this manifold to reconstruct Euclidean distance matrix. The empirical results show that the proposed algorithm is effective and also outperforms state-of-the-art matrix completion algorithms both in noise and noiseless scenarios.
| Original language | English |
|---|---|
| Title of host publication | 2016 Information Theory and Applications Workshop, ITA 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781509025299 |
| DOIs | |
| Publication status | Published - 2017 Mar 27 |
| Externally published | Yes |
| Event | 2016 Information Theory and Applications Workshop, ITA 2016 - La Jolla, United States Duration: 2016 Jan 31 → 2016 Feb 5 |
Publication series
| Name | 2016 Information Theory and Applications Workshop, ITA 2016 |
|---|
Other
| Other | 2016 Information Theory and Applications Workshop, ITA 2016 |
|---|---|
| Country/Territory | United States |
| City | La Jolla |
| Period | 16/1/31 → 16/2/5 |
Bibliographical note
Funding Information:This work was partly supported by the Brain Korea 21 Plus Project in 2015, the ICT R&D program of MSIP/IITP [B0126-15-1017, Spectrum Sensing and Future Radio Communication Platforms] and the National Research Foundation of Korea (NRF) grant funded by the Korean government (MSIP) (2014R1A5A1011478).
Publisher Copyright:
© 2016 IEEE.
ASJC Scopus subject areas
- Computer Networks and Communications
- Computer Science Applications
- Artificial Intelligence
- Information Systems
- Signal Processing