250
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Low tubal rank tensor completion based on singular value factors

, , &
Pages 342-360 | Received 24 Sep 2021, Accepted 08 Aug 2022, Published online: 19 Sep 2022

References

  • J.A. Bengua, H.N. Phien, H.D. Tuan, and M.N. Do, Efficient tensor completion for color image and video recovery: low-rank tensor train, IEEE Trans. Image. Process. 26(5) (2017), pp. 2466–2479.
  • K. Braman, Third-order tensors as linear operators on a space of matrices, Linear Algebra Appl. 433 (2010), pp. 1241–1253.
  • J.-F. Cai, E.J. Candès, and Z. Shen, A singular value thresholding algorithm for matrix completion, SIAM J. Optim. 20(4) (2010), pp. 1956–1982.
  • E.J. Candès and B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math. 9(6) (2009), pp. 717–772.
  • M. Ding, T.-Z. Huang, T.-Y. Ji, X.-L. Zhao, and J.-H. Yang, Low-rank tensor completion using matrix factorization based on tensor train rank and total variation, J. Sci. Comput. 81(2) (2019), pp. 941–964.
  • P. Drineas and M.W. Mahoney, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Linear Algebra. Appl. 420(2–3) (2007), pp. 553–571.
  • J. Gentle, Matrix analysis and applied linear algebra, numerical linear algebra, and applied numerical linear algebra, J. Am. Stat. Assoc. 96(455) (2001), pp. 1136–1137.
  • N. Halko, P.G. Martinsson, and J.A. Tropp, Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev. 53(2) (2011), pp. 217–288.
  • C.J. Hillar and L.-H. Lim, Most tensor problems are NP-hard, J. ACM 60(6) (2013), pp. 1–39.
  • T.-Y. Ji, T.-Z. Huang, X.-L. Zhao, T.-H. Ma, and L.-J. Deng, A non-convex tensor rank approximation for tensor completion, Appl. Math. Model. 48 (2017), pp. 410–422.
  • T.-Y. Ji, T.-Z. Huang, X.-L. Zhao, T.-H. Ma, and G. Liu, Tensor completion using total variation and low-rank matrix factorization, Inf. Sci. (Ny) 326 (2016), pp. 243–257.
  • T.-Y. Ji, N. Yokoya, X.X. Zhu, and T.-Z. Huang, Nonlocal tensor completion for multitemporal remotely sensed images' inpainting, IEEE Trans. Geosci. Remote. Sens. 56(6) (2018), pp. 3047–3061.
  • H. Kasai and B. Mishra, Low-rank tensor completion: a Riemannian manifold preconditioning approach, M. Balcan, K. Q. Weinberger, eds, Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19–24, 2016, JMLR.org, JMLR Workshop and Conference Proceedings, Vol. 48, 2016. pp. 1012–1021.
  • H. Kiers, Towards a standardized notation and terminology in multiway analysis, J. Chemom. 14 (2000), pp. 105–122.
  • M.E. Kilmer, K. Braman, N. Hao, and R.C. Hoover, Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging, SIAM J. Matrix. Anal. Appl.34(1) (2013), pp. 148–172.
  • M.E. Kilmer and C.D. Martin, Factorization strategies for third-order tensors, Linear Algebra. Appl.435(3) (2011), pp. 641–658. special Issue: Dedication to Pete Stewart on the occasion of his 70th birthday..
  • M. Kilmer, C. Martin, and L. Perrone, A third-order generalization of the matrix svd as a product of third-order tensors, Tech. Rep., Tufts University, Computer Science Department, 2008.
  • T.G. Kolda and B.W. Bader, Tensor decompositions and applications, SIAM Rev. 51(3) (2009), pp. 455–500.
  • J. Landsberg, Tensors: Geometry and Applications, American Mathematical Society, Providence, 2011.
  • J. Liu, P. Musialski, P. Wonka, and J. Ye, Tensor completion for estimating missing values in visual data, 2009 IEEE 12th International Conference on Computer Vision, IEEE, 2009.
  • B. Liu, Z. Xu, S. Wu, and F. Wang, Manifold regularized matrix completion for multilabel classification, Pattern Recognit. Lett. 80 (2016), pp. 58–63.
  • C.D. Martin, R. Shafer, and B. LaRue, An order-$p$ tensor factorization with applications in imaging, SIAM J. Sci. Comput. 35(1) (2013), pp. A474–A490.
  • R. Minster, A.K. Saibaba, and M.E. Kilmer, Randomized algorithms for low-rank tensor decompositions in the Tucker format, SIAM J. Math. Data Sci. 2(1) (2020), pp. 189–215.
  • B. Recht, A simpler approach to matrix completion, J. Mach. Learn. Res. 12(104) (2011), pp. 3413–3430.
  • L.E. Richards and I.T. Jolliffe, Principal component analysis, J. Mark. Res. 25(4) (1988), pp. 410.
  • O. Semerci, N. Hao, M.E. Kilmer, and E.L. Miller, Tensor-based formulation and nuclear norm regularization for multienergy computed tomography, IEEE Trans. Image. Process. 23(4) (2014), pp. 1678–1693.
  • L.R. Tucker, Some mathematical notes on three-mode factor analysis, Psychometrika 31(3) (1966), pp. 279–311.
  • X.-Q. Wang and T.-Y. Ji, NSTMR: super resolution of sentinel-2 images using nonlocal nonconvex surrogate of tensor multirank, IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 14 (2021), pp. 5694–5706.
  • Y. Xu, R. Hao, W. Yin, and Z. Su, parallel matrix factorization for low-rank tensor completion, Inverse Probl Imaging 9(2) (2015), pp. 601–624.
  • A.-B. Xu and D. Xie, Low-rank approximation pursuit for matrix completion, Mech. Syst. Signal. Process. 95 (2017), pp. 77–89.
  • W.-H. Xu, X.-L. Zhao, T.-Y. Ji, J.-Q. Miao, T.-H. Ma, S. Wang, and T.-Z. Huang, Laplace function based nonconvex surrogate for low-rank tensor completion, Signal Process.: Image Commun. 73 (2019), pp. 62–69.
  • Z. Zhang and S. Aeron, Exact tensor completion using t-SVD, IEEE Trans. Signal. Process. 65(6) (2017), pp. 1511–1526.
  • M. Zhang and C. Desrosiers, Image completion with global structure and weighted nuclear norm regularization, 2017 International Joint Conference on Neural Networks (IJCNN), IEEE, 2017.
  • Z. Zhang, G. Ely, S. Aeron, N. Hao, and M. Kilmer, Novel methods for multilinear data completion and de-noising based on tensor-SVD, 2014 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2014.
  • P. Zhou, C. Lu, Z. Lin, and C. Zhang, Tensor factorization for low-rank tensor completion, IEEE Trans. Image. Process. 27(3) (2018), pp. 1152–1163.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.