Low-rank tensor completion based on non-convex logDet function and Tucker decomposition
| Autor: | Zhengdong Huang, Chengfei Shi, Tifan Xiong, Li Wan |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Rank (linear algebra)
Computation Regular polygon Matrix norm 020206 networking & telecommunications 02 engineering and technology Function (mathematics) Mixture model Tensor (intrinsic definition) Signal Processing 0202 electrical engineering electronic engineering information engineering Applied mathematics 020201 artificial intelligence & image processing Electrical and Electronic Engineering Tucker decomposition Mathematics |
| Zdroj: | Signal, Image and Video Processing. 15:1169-1177 |
| ISSN: | 1863-1711 1863-1703 |
| DOI: | 10.1007/s11760-020-01845-7 |
| Popis: | For the problem of low-rank tensor completion, rank estimation plays an extremely important role. And among some outstanding researches, nuclear norm is often used as a substitute of rank in the optimization due to its convex property. However, recent advances show that some non-convex functions could approximate the rank better, which can significantly improve the precision of the algorithm. While, the complexity of non-convex functions also leads to much higher computation cost, especially when the data are on a large scale. This paper proposes a mixture model for tensor completion by combining logDet function with Tucker decomposition, in which the logDet function is utilized as a much tighter rank approximation than the nuclear norm and the Tucker decomposition can significantly reduce the size of tensor that needs to be evaluated. In the implementation of the method, alternating direction method of multipliers is employed to obtain the optimal tensor completion. Several experiments are carried out to validate the effectiveness and efficiency of the method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink