Accurate and Computational Efficient Joint Multiple Kronecker Pursuit for Tensor Data Recovery
Source abstract
Abstract
This paper addresses the problem of tensor completion from limited samplings. Generally speaking, in order to achieve good recovery result, many tensor completion methods employ alternative optimization or minimization with S... | Find, read and cite all the research you need on Tech Science Press
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Tensor decomposition and applications · Sparse and Compressive Sensing Techniques · Advanced Adaptive Filtering Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (28)
Show source-provided references
1. An entity-association-based matrix factorization recommendation algorithm10.32604/cmc.2019.03898 ↗
2. Recommendation algorithm based on probabilistic matrix factorization with adaboost10.32604/cmc.2020.09981 ↗
3. Tensor completion for on-board compression of hyper-spectral images
4. Efficient tensor completion for color image and video recovery: Low-Rank tensor train10.1109/TIP.2017.2672439 ↗
5. Tensor completion and low-n-rank tensor recovery via convex optimization10.1088/0266-5611/27/2/025010 ↗
6. Robust image hashing scheme based on low-rank decomposition and path integral LBP10.1109/ACCESS.2019.2911207 ↗
7. Based on compressed sensing of orthogonal matching pursuit algorithm image recovery10.32604/jiot.2020.09116 ↗
8. Semidefinite programming10.1137/1038003 ↗
9. A rank minimization heuristic with application to minimum order system approximation
10. M. Fazel, “Matrix rank minimization with applications,” Stanford University: Department of Electrical Engineering, Ph.D. thesis, 2002.
11. A singular value thresholding algorithm for matrix completion10.1137/080738970 ↗
12. Guaranteed rank minimization via singular value projection
13. Tensor decompositions and applications10.1137/07070111X ↗
14. Tensor rank and the ill-posedness of the best low-rank approximation problem10.1137/06066518X ↗
15. Accurate and computationally efficient tensor-based subspace approach for multi-dimensional harmonic retrieval10.1109/TSP.2012.2205571 ↗
16. Recovering incompelte data using tucker model for tensor with low-n-rank
17. Factorization strategies for third-order tensors10.1016/j.laa.2010.09.020 ↗
18. Exact tensor completion using t-SVD10.1109/TSP.2016.2639466 ↗
19. On revealing replicating structures in multiway data: A novel tensor decomposition approach
20. Operator norm inequalities between tensor unfoldings on the partition lattice10.1016/j.laa.2017.01.017 ↗
21. Orthogonal tubal rank-1 tensor pursuit for tensor completion10.1016/j.sigpro.2018.11.015 ↗
22. Orthogonal rank one matrix pursuit for low rank matrix completion10.1137/130934271 ↗
23. A simple algorithm for nuclear norm regularized problems
24. Lifted coordinate descent for learning with trace-norm regularization
25. “Pistol shot recorded at 73,000 frames per second,” Published by Discovery, 2015. [Online]. Available: https://youtu.be/7y9apnbI6GA.
26. Efficient low rank tensor ring completion
27. SAR imaging with undersampled data via matrix completion
28. Matrix completion for downward-looking 3-D SAR imaging with a random sparse linear array10.1109/TGRS.2017.2771826 ↗