Skip to main content

A Low-complexity Tensor Completion Scheme Combining Matrix Factorization and Smoothness

  • Conference paper
  • First Online:
Wireless Technology, Intelligent Network Technologies, Smart Services and Applications

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 258))

  • 431 Accesses

Abstract

In this paper, the low-complexity tensor completion (LTC) scheme is proposed to improve the efficiency of low-rank tensor completion with competitive performance, which consists of the smooth matrix factorization (SMF) model and the corresponding alternating direction method of multiples (ADMM)-based solution. As for the SMF model, on one hand, we adopt the matrix factorization into the model of low-rank tensor completion for complexity reduction. On the other hand, we introduce the smoothness by total variation regularization and framelet regularization to guarantee the completion performance. To solve the SMF model, an ADMM-based solution is further proposed to realize the efficient and effective low-rank tensor completion. Finally, simulation results are presented to confirm the system gain of the proposed LTC scheme in both efficiency and effectiveness.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 208–220 (2012)

    Google Scholar 

  2. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation. Based noise removal algorithms. Phys. D Nonlin. Phenomena 60(1–4), 259–268 (1992)

    Google Scholar 

  3. Yokota, T., Hontani, H.: Simultaneous tensor completion and denoising by noise inequality constrained convex optimization. IEEE Access 7, 15669–15682 (2019)

    Article  Google Scholar 

  4. Dobson, D.C., Santosa, F.: Recovery of blocky images from noisy and blurred data. SIAM J. Appl. Math. 56(4), 1181–1198 (1996)

    Article  MathSciNet  Google Scholar 

  5. Liu, Y., Shang, F.: An efficient matrix factorization method for tensor completion. IEEE Signal Process. Lett. 20(4), 307–310 (2013)

    Article  Google Scholar 

  6. Yokota, T., Zhao, Q., Cichocki, A.: Smooth PARAFAC decomposition for tensor completion. IEEE Trans. Signal Process. 64(20), 5423–5436 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zheng Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tang, L., Yang, C., Wang, Z., Zhang, X. (2022). A Low-complexity Tensor Completion Scheme Combining Matrix Factorization and Smoothness. In: Jain, L.C., Kountchev, R., Hu, B., Kountcheva, R. (eds) Wireless Technology, Intelligent Network Technologies, Smart Services and Applications. Smart Innovation, Systems and Technologies, vol 258. Springer, Singapore. https://doi.org/10.1007/978-981-16-5168-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-5168-7_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-5167-0

  • Online ISBN: 978-981-16-5168-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics