Skip to main content

Noise-Immune Localization for Mobile Targets in Tunnels via Low-Rank Matrix Decomposition

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 902))

  • 1722 Accesses

Abstract

Accurate and robust mobile targets localization is one of the important prerequisites for tunnel safety construction in complex environments. Currently, the mainstream localization methods for tunnel mobile targets are almost range-based, which usually suffer from low accuracy and instability due to the complex natural conditions and geographical environment. The reason for the low accuracy and instability is the existing methods mostly assume that the sampled partial Euclidean distance matrices are corrupted by Gaussian noise or/and outlier noise. However, in real applications, the noise is more likely to be unpredictable compound noise. Therefore, in this paper, we propose a noise-immune LoCalization algorithm via low-rank Matrix Decomposition (LoCMD) to address this challenge. Specifically, we adopt the Mixture of Gaussians to model the unpredictable compound noise and employ the popular Expectation Maximization technique to solve the constructed low-rank matrix decomposition model, and thus a complete and denoised Euclidean distance matrix can be obtained. Finally, the extensive experimental results show that the proposed LoCMD achieves better positioning performance than the existing algorithms in the complex environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Patwari, N.: Locating the nodes: cooperative localization in wireless sensor networks. IEEE Signal Process. Mag. 22(4), 54–69 (2005)

    Article  Google Scholar 

  2. Meng, D., De La Torre, F.: Robust matrix factorization with unknown noise. In: IEEE International Conference on Computer Vision (ICCV). IEEE (2013)

    Google Scholar 

  3. Xiao, F.: Noise-tolerant localization from incomplete range measurements for wireless sensor networks. In: IEEE Conference on Computer Communications (INFOCOM). IEEE (2015)

    Google Scholar 

  4. Han, G.: Localization algorithms of wireless sensor networks: a survey. Telecommun. Syst. 52(4), 2419–2436 (2013)

    Article  Google Scholar 

  5. Girod, L.: Locating tiny sensors in time and space: a case study. In: IEEE International Conference on Computer Design: VLSI in Computers and Processors. IEEE (2002)

    Google Scholar 

  6. Girod, L., Estrin, D.: Robust range estimation using acoustic and multimodal sensing. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 3. IEEE (2001)

    Google Scholar 

  7. Yang, Z.: Beyond triangle inequality: sifting noisy and outlier distance measurements for localization. ACM Trans. Sens. Netw. (TOSN) 9(2), 26 (2013)

    MathSciNet  Google Scholar 

  8. McLachlan, G.J., Basford, K.E.: Mixture models: Inference and applications to clustering, vol. 84. Marcel Dekker, New York City (1988)

    MATH  Google Scholar 

  9. Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956–1982 (2010)

    Article  MathSciNet  Google Scholar 

  10. Dai, W., Milenkovic, O.: SET: an algorithm for consistent matrix completion. In: IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP). IEEE (2010)

    Google Scholar 

  11. Dempster, A.P., Laird, N.M., Rubin, D.B.: “Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. Ser. B (Methodol.), 1–38 (1977)

    Google Scholar 

  12. Shang, Y.: Localization from mere connectivity. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. ACM (2003)

    Google Scholar 

  13. Wang, X.: Robust component-based localization in sparse networks. IEEE Trans. Parallel Distrib. Syst. 25(5), 1317–1327 (2014)

    Article  Google Scholar 

  14. Candes, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925–936 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pengfei Xu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ji, H., Xu, P., Ling, J., Xie, H., Ding, J., Dai, Q. (2018). Noise-Immune Localization for Mobile Targets in Tunnels via Low-Rank Matrix Decomposition. In: Zhou, Q., Miao, Q., Wang, H., Xie, W., Wang, Y., Lu, Z. (eds) Data Science. ICPCSEE 2018. Communications in Computer and Information Science, vol 902. Springer, Singapore. https://doi.org/10.1007/978-981-13-2206-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2206-8_35

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2205-1

  • Online ISBN: 978-981-13-2206-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics