Low-rank tensor completion based on non-convex logDet function and Tucker decomposition
- 23 February 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Signal, Image and Video Processing
- Vol. 15 (6), 1169-1177
- https://doi.org/10.1007/s11760-020-01845-7
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (51475186, 51775202)
This publication has 27 references indexed in Scilit:
- Tucker factorization with missing data with application to low- $$n$$ n -rank tensor completionMultidimensional Systems and Signal Processing, 2013
- Applications of tensor (multiway array) factorizations and decompositions in data miningWIREs Data Mining and Knowledge Discovery, 2010
- Tensor completion for on-board compression of hyperspectral imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- Video Inpainting Under Constrained Camera MotionIEEE Transactions on Image Processing, 2007
- Face transfer with multilinear modelsACM Transactions on Graphics, 2005
- Dimensionality reduction in higher-order signal processing and rank-(R1,R2,…,RN) reduction in multilinear algebraLinear Algebra and its Applications, 2004
- Numerical operator calculus in higher dimensionsProceedings of the National Academy of Sciences of the United States of America, 2002
- Tensor rank is NP-completeLecture Notes in Computer Science, 1989